Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes

Sina Vafi, Huu-Dung Pham

    Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedings

    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 languageEnglish
    Title of host publicationProceedings of the 2012 IEEE ICCS
    Place of PublicationUSA
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages393-397
    Number of pages5
    ISBN (Print)978-1-4673-2054-2
    DOIs
    Publication statusPublished - 2012
    EventIEEE International Conference on Communication Systems (ICCS 2012) - Singapore, Singapore, Singapore
    Duration: 21 Nov 201223 Nov 2012
    Conference number: 2012

    Conference

    ConferenceIEEE International Conference on Communication Systems (ICCS 2012)
    Abbreviated titleICCS
    CountrySingapore
    CitySingapore
    Period21/11/1223/11/12

    Fingerprint Dive into the research topics of 'Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes'. Together they form a unique fingerprint.

  • Cite this

    Vafi, S., & Pham, H-D. (2012). Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes. In Proceedings of the 2012 IEEE ICCS (pp. 393-397). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICCS.2012.6406177