Trellis matched codes for partial response channels

Filho, Bartolomeu F. Uchôa; Herro, M.A.

doi:10.1109/isit.1997.613013

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, x 8 ), called the D-codeword (D stands for "decoder"), is passed through the precoder with transfer function 1/(1 ⊕ D 2 ). The last four bits of the D-codeword are given by: 4 . That is, the bit x i , for i = 5, .…”

Section: Transmission Through the Pr Channelmentioning

confidence: 99%

Graph-Matched LDPC Codes for Partial-Response Channels

Legg

Uchôa-Filho

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

In this paper, we propose an LDPC coding scheme based on repeat-accumulate (RA) codes for partial-response (PR) channels. We modify the original RA encoder in such a way that there exists a one-to-one relationship between a sequence called the D-codeword (which is not the transmitted codeword but contains the information bits) and the noiseless received sequence at the output of the PR channel. A consequence of this is that the graph used for decoding the D-codeword, which is different from the encoder graph, is of low complexity. Moreover, with the appropriate modification of the RA encoder, the graph used for decoding is the same of any PR channel, which makes sense calling these codes graph-matched. The simplicity of the decoder, resulting from the "binary" interference removal (precoding) and the linear, as opposed to quadratic, complexity of the encoder make the proposed scheme attractive. For a code rate R = 3641/4096 = 0.89 and for the PR4 channel, an LDPC code has been designed and a simulated coding gain of about 5 dB for a bit error rate less than 10 −5 was obtained.

show abstract

Section: Transmission Through the Pr Channelmentioning

confidence: 99%