88 search results - page 14 / 18 » Near-Capacity Iteratively Decoded Space-Time Block Coding |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— For the number of transmit antennas N = 2a the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a 2aâˆ...
TIT
2002
13 years 7 months ago
2002
Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based paralle...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...