Searched for: department%3A%22Telecommunications%22
(1 - 4 of 4)
document
Weber, J.H. (author), Schouhamer Immink, K.A. (author), Ferreira, H.C. (author)
Knuth's celebrated balancing method consists of inverting the first z bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index z to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is extended with error-correcting capabilities, where it is...
conference paper 2011
document
Goseling, J. (author), Matsumoto, R. (author), Uyematsu, T. (author), Weber, J.H. (author)
We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all...
journal article 2010
document
Rizvi, U.H. (author), Janssen, G.J.M. (author), Weber, J.H. (author)
In this letter, closed-form expressions for the bit error rate of M-ary pulse amplitude modulated signal constellations as a function of the analog-to-digital converter word length, the signal-to-noise ratio and the fading distribution, are derived. These results allow for a rapid and accurate evaluation of the system performance when the analog...
journal article 2009
document
Weber, J.H. (author), Abdel-Ghaffar, K.A.S. (author)
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix representing the code. In this correspondence, we introduce the notion of dead-end sets to explicitly demonstrate...
journal article 2008
Searched for: department%3A%22Telecommunications%22
(1 - 4 of 4)