Asymptotic analysis and design of iterative receivers for non linear ISI channels

Benammar, Bouchra; Thomas, Nathalie; Poulliat, Charly; Boucheret, Marie‐Laure; Dervin, Mathieu

doi:10.1109/istc.2014.6955108

Cited by 4 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When considering sparse graph based binary coding schemes such as binary LDPC codes, these methods are generally derived from some multi-edge type extensions of the original approach proposed by [18]. A recent example is given by [19]. The remaining question is how to design good codes that can perform fairly well in both regimes (coherent and non coherent).…”

Section: B Exit Charts and Code Designmentioning

confidence: 99%

On sparse graph coding for coherent and noncoherent demodulation

Piat-Durozoi¹,

Poulliat

Thomas

et al. 2017

2017 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

In this paper, we consider a bit-interleaved coded modulation scheme (BICM) composed of an error correcting code serially concatenated with a M-ary non linear modulation with memory. We first compare demodulation strategies for both the coherent and the non coherent cases. Then, we perform an asymptotic analysis and try to show that the design of coding schemes performing well for both the coherent and the non coherent regimes should be done carefully when considering sparse graph based codes such as low-density parity-check (LDPC) codes. It will be shown that optimized coding schemes for the non coherent setting can perform fairly well when using coherent demodulation, while on the contrary, optimized coding schemes for the coherent setting may lead to "non stable" coding schemes in the non coherent setting.

show abstract

Section: B Exit Charts and Code Designmentioning

confidence: 99%

On sparse graph coding for coherent and noncoherent demodulation

Piat-Durozoi¹,

Poulliat

Thomas

et al. 2017

2017 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to mitigate the limitations of the full interleaving approach of the previous paragraph, we replace the single interleaver Π [diff] by multiple partial interleavers, as described in [60] and inspired by the analysis for BICM-ID with convolutional codes in [61]. In the partial interleaving case, we group all Λ i variable nodes of degree i, assign an interleaver of size Λ i to these nodes and employ a separate differential decoder/encoder for this group of variable nodes.…”

Section: Design Of Ldpc Codes -Partial Interleavingmentioning

confidence: 99%

Enabling Technologies for High Spectral‐Efficiency Coherent Optical Communication Networks

Zhou¹,

Xie²

2016

View full text Add to dashboard Cite

Forward error correction (FEC) in optical communications has been first demonstrated in 1988 [1]. Since then, coding technology has evolved significantly. This pertains not only to the codes but also to encoder and decoder architectures. Modern high-speed optical communication systems require high-performing FEC engines that support throughputs of 100 GBit/s or multiples thereof, that have low power consumption, that realize net coding gains (NCGs) close to the theoretical limits at a target bit error rate (BER) of below 10 −15 , and that are preferably adapted to the peculiarities of the optical channel.Forward error correction coding is based on deterministically adding redundant bits to a source information bit sequence. After transmission over a noisy channel, a decoding system tries to exploit the redundant information for fully recovering the source information. Several methods for generating the redundant bit sequence from the source information bits are known. Transmission systems with 100 GBit/s and 400 GBit/s today typically use one of two coding schemes to generate the redundant information: Block-Turbo Codes (BTCs) or Low-Density Parity-Check (LDPC) codes. In coherent systems, so-called soft information is usually ready available and can be used in high performing systems within a soft-decision decoder architecture. Soft-decision information means that no binary 0/1 decision is made before entering the forward error correction decoder. Instead, the (quantized) samples are used together with their statistics to get improved estimates of the original bit sequence. This chapter will focus on soft-decision decoding of LDPC codes and the evolving spatially coupled LDPC codes.

show abstract

“…In order to further reduce the complexity of the turbo equalizer for the non linear satellite channel, block-wise frequency domain processing has been investigated in [7]. To do so, a CP of length at least equal to channel length (M − 1) is appended to each block of L transmitted symbols.…”

Section: Frequency Domain (Fd)-mmsementioning

confidence: 99%

“…To do so, a CP of length at least equal to channel length (M − 1) is appended to each block of L transmitted symbols. At the receiver, after removing the CP, each block of symbols is transformed to the frequency domain by a Fast Fourier Transform (FFT) of size L. A frequency domain representation of the non linear channel has been presented in [10] as follows: p,q,r is the (p, q, r)-th three dimensional L-FFT (3D-L-FFT) of the kernels [h i,j,k ] and where the delta-function modulo L is defined as δ L (m) = 1 if m = 0 modulo [L] (the reader is referred to [7] for more detailed derivations). The FD-MMSE estimated symbols write as follows:…”

Section: Frequency Domain (Fd)-mmsementioning

confidence: 99%

“…In [5], a factor graph based equalizer is derived for a specific simplified structure of the linear satellite channel with complexity increasing only linearly with channel memory. As far as linear equalizers are concerned, we have derived in [6], [7] linear time and frequency domain iterative equalizers for general Volterra channels pointing out the complexity challenges inherent to the complexity of the Volterra model itself. The motivation behind this paper lies in the lack of a general comparison between the numerous instances of iterative receivers proposed for the non linear channel.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A comparison of iterative receivers for the non linear satellite channel

Benammar¹,

Thomas

Poulliat

et al. 2015

2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Self Cite

View full text Add to dashboard Cite

This paper presents a comparison of different instances of advanced iterative receivers for the non linear satellite channel. A comparison of the performance and complexity of each of the selected receivers is drawn. It is shown that the frequency domain implementation of the linear equalizer achieves good performance complexity trade-off. The cost to pay for the frequency domain processing is the addition of a Cyclic Prefix (CP) to ensure the blocks orthogonality. The consequence is a channel dependent spectral efficiency loss. We thus investigate on the efficiency gain related to the CP omission for frequency domain equalizers for different block sizes and show that for large block sizes, the equalizer's performance is not much sacrificed.

show abstract

Asymptotic analysis and design of iterative receivers for non linear ISI channels

Cited by 4 publications

References 12 publications

On sparse graph coding for coherent and noncoherent demodulation

On sparse graph coding for coherent and noncoherent demodulation

Enabling Technologies for High Spectral‐Efficiency Coherent Optical Communication Networks

A comparison of iterative receivers for the non linear satellite channel

Contact Info

Product

Resources

About