Free distance computation of turbo BCH codes

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

    Abstract

    The paper presents an algorithm for the free distance determination of turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes constructed by row-column interleavers. The algorithm calculates the minimum weights of turbo BCH codes obtained from input bitstreams having different weights. Among the minimum weights calculated in different cases, the minimum one is being considered as the free distance of turbo BCH codes. This is being achieved applying specifications of the interleaver and constituent BCH codes. Based on the computed free distances, the upper bound of probability of error for different turbo BCH codes is determined. It agrees with simulation results of the code performance in the error floor region. �2009 IEEE.
    Original languageEnglish
    Title of host publication20th IEEE International Symposium
    Subtitle of host publicationOn Personal, Indoor and Mobile Radio Communications Proceedings
    Place of PublicationTokyo, Japan
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages-
    Number of pages5
    ISBN (Print)978-1-4244-5122-7
    Publication statusPublished - 2009
    EventIEEE International Symposium on Personal, Indoor and Mobile Radio Communications 2009 20th - Tokyo, Japan
    Duration: 13 Sep 200916 Sep 2009

    Conference

    ConferenceIEEE International Symposium on Personal, Indoor and Mobile Radio Communications 2009 20th
    Period13/09/0916/09/09

      Fingerprint

    Cite this

    Vafi, S. (2009). Free distance computation of turbo BCH codes. In 20th IEEE International Symposium: On Personal, Indoor and Mobile Radio Communications Proceedings (pp. -). IEEE, Institute of Electrical and Electronics Engineers.