Performance analysis of turbo-equalized partial response channels

Oberg, M.; Siegel, Paul H.

doi:10.1109/26.911451

Cited by 23 publications

(37 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], a method is proposed to upperbound the performance of a serially concatenated turbo-coded system assuming uniform interleaving. This approach has been further extended by several authors and applied to the case of turbo-equalized systems [5], [6] in order to evaluate system performance over ISI channels. In [5], the performance analysis of turbo-equalized system was studied over special type of ISI channels which are the partial response channels.…”

Section: Introductionmentioning

confidence: 99%

“…This approach has been further extended by several authors and applied to the case of turbo-equalized systems [5], [6] in order to evaluate system performance over ISI channels. In [5], the performance analysis of turbo-equalized system was studied over special type of ISI channels which are the partial response channels. In [6], the authors tried 1 This work was supported by the project "Urbanisme des radio Communication" of the program research "Pôle de compétitivité SYSTEM@TIC".…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distance distribution for turbo-equalized systems over static frequency selective channels

Assimi

Poulliat

Fijalkow

2008

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

In this paper we investigate the Euclidean distance distribution in turbo-equalized systems over static frequency-selective (ISI) channels 1 . We propose a novel approach in evaluating the squared Euclidean distance between transmitted sequences at the output of the ISI channel based on the correlogram of error sequences. By inspecting autocorrelation properties of error sequences, we derive the main statistics of the output Euclidean distance. The proposed method provides a more comprehensive tool to predict system behavior with finite or infinite packet length. We exploit obtained results to evaluate the frame error rate (FER) performance of the system under maximum-likelihood sequence estimation.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distance distribution for turbo-equalized systems over static frequency selective channels

Assimi

Poulliat

Fijalkow

2008

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

show abstract

“…Consider the code with the following generator matrix: (17) In Figs. 2-4, the union bound to the word error probability (see (10)) for the code with generator matrix (17) is depicted in three different cases.…”

Section: Examplementioning

confidence: 99%

“…T HE astonishing success of turbo decoding has brought many researchers to apply the so-called turbo principle to channel estimation [13], equalization [17], magnetic recording [18], and other fields of research. An important application is in iterative multiuser receivers for coded code-division multiple-access (CDMA) systems.…”

Section: Introductionmentioning

confidence: 99%

Analysis and Design of Interleavers for Iterative Multiuser Receivers in Coded CDMA Systems

Tarable

Montorsi

Benedetto

2005

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We deal with the design of interleavers in a coded code-division multiple-access (CDMA) scenario, where at the receiver an iterative turbo-like structure to perform multiuser detection is employed. The choice of the interleavers affects both the maximum-likelihood (ML) performance and the impact of the suboptimality of the iterative receiver. First, heuristic criteria of goodness for a set of interleavers, each assigned to a given active user, are introduced and motivated. One of these criteria is based on the intersection between the equivalent codes seen after the interleavers for each user pair. The design rules are valid for any kind of channel code. In particular, when the channel code used by every user is a terminated convolutional code, a very simple design rule, in the subset of congruential interleavers, is specified.The suitability of an interleaver set to iterative decoding is also treated. The analysis leads to a design rule which is shown to have great importance on the performance of a turbo-like receiver. Numerical results assess the validity of the derived design rules by showing that, for iterative multiuser receivers and reasonable block lengths, the suitability to iterative decoding is more important than the performance optimization.Index Terms-Coded code-division multiple access (CDMA), interleaver design, iterative multiuser receivers, permutations.

show abstract

“…Before this, one typically separated channel decoding from error-correcting code decoding [2] [3]. This breakthrough received immediate interest from the magnetic recording community, and TE was applied to magnetic recording channels by a variety of authors (e.g., [4], [5], [6], [7]). TE was later combined with turbo codes and also extended to low-density paritycheck (LDPC) codes (and called joint iterative decoding) by constructing one large graph representing the constraints of both the channel and the code (e.g., [8]).…”

Section: Introductionmentioning

confidence: 99%

An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels

Kim¹,

Pfister²

2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of lowdensity parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding, proposed by Vontobel and Koetter and explored by Burshtein, to this problem. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint LP decoding whose structure is similar to BCJR-based turbo equalization (TE). The result is a joint iterative decoder whose complexity is similar to TE but whose performance is similar to joint LP decoding. The main advantage of this decoder is that it appears to provide the predictability of joint LP decoding and superior performance with the computational complexity of TE.

show abstract

Performance analysis of turbo-equalized partial response channels

Cited by 23 publications

References 13 publications

Distance distribution for turbo-equalized systems over static frequency selective channels

Distance distribution for turbo-equalized systems over static frequency selective channels

Analysis and Design of Interleavers for Iterative Multiuser Receivers in Coded CDMA Systems

An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels

Contact Info

Product

Resources

About