A Low-Complexity Hybrid LDPC Code Encoder for IEEE 802.3an (10GBase-T) Ethernet

Cohen, Aaron E.; Parhi, Keshab K.

doi:10.1109/tsp.2009.2022919

Cited by 33 publications

(19 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aaron E. Cohen, Keshab K. Parhi design encoders for a 10-Gigabit Ethernet transceiver which is compliant with the IEEE 802.3an standard using Hybrid (G -Matrix method and RU) method. They apply hybrid method on the RS (2048, 1723) LDPC codes.A new Hybrid LDPC encoder is compared with existing known methods G matrix multiplication and the RU method in terms of area, critical path, and power consumption [9]. Zhuo Ma et al proposes a bidirectional recursion arithmetic method a quasi-parallel LDPC encoder code in IEEE 802.16e.…”

Section: Resultsmentioning

confidence: 99%

Reduced Complexity Quasi-Cyclic LDPC Encoder for IEEE 802.11N

Mankar¹,

Asutkar²,

Dakhole³

2016

VLSICS

View full text Add to dashboard Cite

show abstract

Section: Resultsmentioning

confidence: 99%

Reduced Complexity Quasi-Cyclic LDPC Encoder for IEEE 802.11N

Mankar¹,

Asutkar²,

Dakhole³

2016

VLSICS

View full text Add to dashboard Cite

show abstract

“…It is well known that the encoding complexity of a general linear code is proportional to the square of its code length, while that of a QC code is only linearly proportional to the code length [8]. As a result, the QC representation of RS-LDPC codes can significantly reduce their encoding complexity compared with traditional encoding methods [20], [21].…”

Section: Qc Representation Of Rs-ldpc Codesmentioning

confidence: 99%

“…Theorem 5: The code C(γ, q) is invariant if we perform the column transformationĥ → βĥ +ĥ 0 (21) to its PCMĤ(γ, q), where β ∈ F * q andĥ 0 is a column ofĤ(γ, q). Proof: Letĥ = βĥ +ĥ 0 = [α 0 , α 1 , · · ·, α γ−1 ] T .…”

Section: H(2 4)mentioning

confidence: 99%

Quasi-Cyclic Representation and Vector Representation of RS-LDPC Codes

Liu¹,

Huang

Deng³

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

RS-LDPC codes, constructed based on the codewords of Reed-Solomon (RS) codes with two information symbols, are an important class of LDPC codes. In this paper, we present two representations, namely, quasi-cyclic (QC) representation and vector representation, for RS-LDPC codes. Under the first representation, most part of the parity-check matrix of a full-length RS-LDPC code consists of circulant permutation matrices and zero matrices. As a result, the class of codes can enjoy the advantages in hardware implementation as QC-LDPC codes. In addition, the base matrix under the QC representation of an RS-LDPC code can be explicitly given such that the rank of its parity-check matrix can be analyzed combinatorially. Under the second representation, each permutation matrix in the parity-check matrix of an RS-LDPC code is defined by a nonbinary vector, whose entries are a permutation of entries in the field from which the RS code is constructed. Then, the "affine invariance" property is proved for full-length RS-LDPC codes, which can facilitate the structural analysis of the codes.

show abstract

“…As soon as they were re-invented in 1996 by mackay [2], LDPC codes have received a lot of attention because their error performance is very close to the shannon limit when decoded using iterative methods [3]. They have emerged as a viable option for forward error correction (FEC) systems and have been adopted by many advanced standards, such as 10 gigabit ethernet (10GBASET) [4], [5] and digital video broadcasting (DVB-S2) [6], [7]. In addition, the generations of WiFi and WiMAX are considering LDPC codes as part of their error correction systems [8], [9].…”

Section: Introductionmentioning

confidence: 99%