Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes

Sina Vafi; Huu-Dung Pham

doi:10.1109/ICCS.2012.6406177

Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes

Sina Vafi, Huu-Dung Pham

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper published in Proceedings › peer-review

1 Citation (Scopus)

11 Downloads (Pure)

Abstract

This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes. This is conducted by recognition of patterns producing low-weights for both LDPC and RSC codes. Simulation results confirm that with similar rates and less decoding complexity, newly designed codes outperform product codes constituted by two cyclic EG codes.

Original language	English
Title of host publication	Proceedings of the 2012 IEEE ICCS
Place of Publication	USA
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	393-397
Number of pages	5
ISBN (Print)	978-1-4673-2054-2
DOIs	https://doi.org/10.1109/ICCS.2012.6406177
Publication status	Published - 2012
Event	IEEE International Conference on Communication Systems (ICCS 2012) - Singapore, Singapore, Singapore Duration: 21 Nov 2012 → 23 Nov 2012 Conference number: 2012

Conference

Conference	IEEE International Conference on Communication Systems (ICCS 2012)
Abbreviated title	ICCS
Country/Territory	Singapore
City	Singapore
Period	21/11/12 → 23/11/12

Access to Document

10.1109/ICCS.2012.6406177

Cite this

@inproceedings{72aacb9a0c25427583191c2e7318820b,

title = "Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes",

abstract = "This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes. This is conducted by recognition of patterns producing low-weights for both LDPC and RSC codes. Simulation results confirm that with similar rates and less decoding complexity, newly designed codes outperform product codes constituted by two cyclic EG codes.",

author = "Sina Vafi and Huu-Dung Pham",

year = "2012",

doi = "10.1109/ICCS.2012.6406177",

language = "English",

isbn = "978-1-4673-2054-2",

pages = "393--397",

booktitle = "Proceedings of the 2012 IEEE ICCS",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States",

note = "IEEE International Conference on Communication Systems (ICCS 2012), ICCS ; Conference date: 21-11-2012 Through 23-11-2012",

}

TY - GEN

T1 - Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes

AU - Vafi, Sina

AU - Pham, Huu-Dung

N1 - Conference code: 2012

PY - 2012

Y1 - 2012

N2 - This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes. This is conducted by recognition of patterns producing low-weights for both LDPC and RSC codes. Simulation results confirm that with similar rates and less decoding complexity, newly designed codes outperform product codes constituted by two cyclic EG codes.

AB - This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes. This is conducted by recognition of patterns producing low-weights for both LDPC and RSC codes. Simulation results confirm that with similar rates and less decoding complexity, newly designed codes outperform product codes constituted by two cyclic EG codes.

U2 - 10.1109/ICCS.2012.6406177

DO - 10.1109/ICCS.2012.6406177

M3 - Conference Paper published in Proceedings

SN - 978-1-4673-2054-2

SP - 393

EP - 397

BT - Proceedings of the 2012 IEEE ICCS

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - USA

T2 - IEEE International Conference on Communication Systems (ICCS 2012)

Y2 - 21 November 2012 through 23 November 2012

ER -

Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes

Abstract

Conference

Access to Document

Fingerprint

Cite this