Search Results - "Urbanke, R.L."
-
1
The capacity of low-density parity-check codes under message-passing decoding
Published in IEEE transactions on information theory (01-02-2001)“…We present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any…”
Get full text
Journal Article -
2
Design of capacity-approaching irregular low-density parity-check codes
Published in IEEE transactions on information theory (01-02-2001)“…We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular…”
Get full text
Journal Article -
3
Efficient encoding of low-density parity-check codes
Published in IEEE transactions on information theory (01-02-2001)“…Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a…”
Get full text
Journal Article -
4
Finite-length analysis of low-density parity-check codes on the binary erasure channel
Published in IEEE transactions on information theory (01-06-2002)“…In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The…”
Get full text
Journal Article -
5
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
Published in IEEE transactions on information theory (01-02-2001)“…Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under message-passing decoding. For memoryless…”
Get full text
Journal Article -
6
Weight Distribution of Low-Density Parity-Check Codes
Published in IEEE transactions on information theory (01-11-2006)“…We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth…”
Get full text
Journal Article -
7
Rate-splitting multiple access for discrete memoryless channels
Published in IEEE transactions on information theory (01-03-2001)“…It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless multiple-access channel can be reduced to corresponding problems…”
Get full text
Journal Article -
8
Polar Codes are Optimal for Lossy Source Coding
Published in IEEE transactions on information theory (01-04-2010)“…We consider lossy source compression of a binary symmetric source using polar codes and a low-complexity successive encoding algorithm. It was recently shown…”
Get full text
Journal Article -
9
Multiple-antenna signal constellations for fading channels
Published in IEEE transactions on information theory (01-09-2001)“…In this correspondence, we show that the problem of designing efficient multiple-antenna signal constellations for fading channels can be related to the…”
Get full text
Journal Article -
10
Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A
Published in IEEE transactions on information theory (01-09-2004)“…We show that for the case of the binary-symmetric channel and Gallager's decoding algorithm A the threshold can, in many cases, be determined analytically…”
Get full text
Journal Article -
11
Turbo Codes in Binary Erasure Channel
Published in IEEE transactions on information theory (01-04-2008)“…In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities…”
Get full text
Journal Article -
12
Correction to "Multiple-Antenna Signal Constellations for Fading Channels"
Published in IEEE transactions on information theory (01-01-2007)“…The authors correct a mathematical equation contained in the correspondence "Multiple-antenna signal constellations for fading channels," previously published…”
Get full text
Journal Article -
13
Bilinear time-frequency representations of signals: the shift-scale invariant class
Published in IEEE transactions on signal processing (01-02-1994)“…The authors consider the class of bilinear time-frequency representations (BTFR's) that are invariant (or covariant) to time shifts, frequency shifts, and…”
Get full text
Journal Article -
14
Efficient implementation of parallel decision feedback decoders for broadband applications
Published in ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357) (1999)“…Parallel Decision-Feedback Decoders (PDFD) use a joint equalization and channel decoding scheme that performs decision-feedback equalization based on each…”
Get full text
Conference Proceeding