6533b873fe1ef96bd12d4c95
RESEARCH PRODUCT
Design of efficient codes for the AWGN channel based on decomposable binary lattices
G. GarboMatteo CampanellaStefano Calabròsubject
Block codeTheoretical computer scienceApplied MathematicsConcatenated error correction codeBinary numberLinear codeCoding gainComputer Science Applicationssymbols.namesakeAdditive white Gaussian noiseComputational Theory and MathematicssymbolsBinary codeElectrical and Electronic EngineeringAlgorithmDecoding methodsMathematicsdescription
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1998-12-01 |