Combined coding and modulation: theory and applications

Benedetto, S.; Marsan, Marco Giuseppe Ajmone; Albertengo, Guido; Giachin, E.

doi:10.1109/18.2631

Cited by 57 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…GU property of Forney is equivalent to the regularity property of Calderbank and Sloane [31], and the superlinearity property of Benedetto et al [32] as well as to signal set-group matching in the sense of Loeliger [33]. In all of these properties, the bottom result which is important to us and consequential in coding applications is the independency of error probability from the signal point transmitted.…”

mentioning

confidence: 84%

Gallager bounds on the performance of maximum‐likelihood decoded linear binary block codes in AWGN interference

Yousefi

2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYPerformance evaluation of maximum-likelihood (ML) soft-decision-decoded binary block codes is usually carried out using bounding techniques. Many tight upper bounds on the error probability of binary codes are based on the so-called Gallager's first bounding technique (GFBT). In this method, Gallager bisects the error probability to the joint probability of error and noise residing in a region < (here referred to as the Gallager region) plus joint probability of error and noise residing in the complement of < (also referred to as regions of many and few errors, respectively); where < is a volume around the transmitted codeword. In this tutorial review, a comprehensive study of a number of upper bounds on the error probability of ML decoding of binary codes based on GFBT is provided. For some bounds, their applicability to other schemes is also pointed out and argued. We also provide an overview of bounds based on Gallager's second bounding technique (GSBT) and discuss some of their relations and interconnections.

show abstract

mentioning

confidence: 84%

Gallager bounds on the performance of maximum‐likelihood decoded linear binary block codes in AWGN interference

Yousefi

2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…8.4. This gives the encoded symbol s, , which, for any value of i, can take on any 64 of the 128 possible values in Fig. 8.4, the permitted 64 values belonging to one or other of two disjoint sets that together include all 128 values.…”

Section: Model Of 14400 Bitls Systemmentioning

confidence: 99%

“…The important role played by the minimum free distance of the code becomes evident when the error events of the decoder are examined. The probability of an error event is defined as the probability of an error event starting at specific time instant, given that the decoder has correctly identified the encoder state at that time instant [64]. The error event probability of the maximum likelihood decoder, assuming an additive white Gaussian noise channel and a high signaVnoise ratio, can be lower bounded for the case, of the two dimensional signal, by [16] '" 2.4.7…”

Section: General Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Detection of coded and distorted QAM signals

Clark

Kadhim

1988

J. Inst. Electron. Radio Eng. UK

View full text Add to dashboard Cite

“…Geometrical uniformity together with Geometrically Uniform (GU) signal constellation, GU binary labelings and related GU codes were first introduced by Forney [1] as an intelligent generalization and good extension of earlier works of Calderbank and Sloane [2], Benedetto [3]. The linearity of the coding systems and the regularity of the signal constellation in use were combined to provide the so-called uniform error property (UEP).…”

Section: Introductionmentioning

confidence: 99%