Name
Abstract | ||
|---|---|---|
Multidimensional binary mappings for bit-interleaved coded modulations (BICMs) on ergodic multiple-antenna channels with iterative decoding are presented. After derivation of a closed-form expression for the pairwise error probability under ideal maximum-likelihood (ML) decoding, the design criterion for mapping optimization is established from the ML performance of the ideally interleaved channel. It coincides with the figure of merit derived from the genie condition when the iterative receiver converges to perfect a priori information. Multidimensional mapping constructions that exhibit high signal-to-noise ratio (SNR) gains without increasing the complexity of the a posteriori probability (APP) detection are proposed. They allow for a reduced decoding complexity as they achieve near turbo code performance with a single convolutional code. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TIT.2005.853306 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
single convolutional code,posteriori probability,multidimensional mappings,ml performance,multidimensional mapping construction,reduced decoding complexity,iterative decoding,iteratively decoded bicm,pairwise error probability,multidimensional binary mapping,mapping optimization,multiple-antenna channels,iterative receiver converges,convolutional codes,convolutional code,turbo code,channel coding,turbo codes,maximum likelihood,signal to noise ratio | Pairwise error probability,Discrete mathematics,Ergodicity,Convolutional code,Computer science,Iterative method,Turbo code,Signal-to-noise ratio,Algorithm,Posterior probability,Theoretical computer science,Decoding methods | Journal |
Volume | Issue | ISSN |
51 | 9 | 0018-9448 |
Citations | PageRank | References |
23 | 1.14 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Gresset | 1 | 69 | 4.31 |
| J. J. Boutros | 2 | 52 | 2.84 |
| Loïc Brunel | 3 | 147 | 14.09 |