Non-binary adaptive LDPC codes for frequency selective channels: code construction and iterative decoding

被引：10

作者：

Boutros, Joseph J. ^{[1
]}

Ghaith, Alaa ^{[1
]}

Yi Yuan-Wu ^{[2
]}

机构：

[1] Ecole Natl Super Telecommun Bretagne, F-75013 Paris, France

[2] France Telecom R & D, F-92734 Issy Les Moulineaux, France

来源：

PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP | 2006年

关键词：

D O I：

10.1109/ITW2.2006.323784

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We propose a new type of non-binary LDPC codes defined over multiple Galois fields. The so called multi-Galois LDPC code can adapt to the profile of a frequency selective channel and is suitable for multi-carrier transmissions with quadrature amplitude modulations.

引用

页码：184 / +

页数：2

共 30 条

[11]

Declercq D, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P464

[12] Codes on graphs: Normal realizations [J].

Forney, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :520-548

[13]

Gallager RG, 1963, LOW DENSITY PARITY C

[14] Matching Q-ary Reed-Solomon codes with M-ary modulation [J].

Gulliver, TA .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (11) :1349-1353

[15] OPTIMUM SYMBOL-BY-SYMBOL DECODING RULE FOR LINEAR CODES [J].

HARTMANN, CRP ;

RUDOLPH, LD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (05) :514-517

[16] Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes [J].

Hou, JL ;

Siegel, PH ;

Milstein, LB ;

Pfister, HD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (09) :2141-2155

[17] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[18]

KELLEY CA, 2006, UNPUB IEEE T INF MAY

[19]

LI G, 2003, IEEE INT S INF THEOR

[20]

LIN S, 2006, IN WORKSH CTR INF TH

← 1 2 3 →