Novel scarce-state-transition syndrome-former error-trellis decoding of (n,n-1) convolutional codes

L. H Charles Lee*, David J. Tait, Patrick G. Farrell, Paul S C Leung

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

    2 Citations (Scopus)

    Abstract

    A novel maximum-likelihood hard- and 8-level soft-decision scarce-state-transition (SST) type syndrome-former error-trellis decoding system of (n,n-1) convolutional codes with coherent BPSK signals for additive white Gaussian noise channels is proposed. The proposed system retains the same number of binary comparisons as the syndrome-former trellis decoding method of Yamada et al. [2]. Like the original SST-type register-exchange Viterbi decoding system [4], the proposed system also has the same advantage of drawing less power when implemented on CMOS LSI chips. A combination of the two techniques results a less complex and low power consumption decoding system.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers (IEEE)
    Pages219
    Number of pages1
    Publication statusPublished - 1995
    EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
    Duration: 17 Sept 199522 Sept 1995

    Other

    OtherProceedings of the 1995 IEEE International Symposium on Information Theory
    CityWhistler, BC, Can
    Period17/09/9522/09/95

    Fingerprint

    Dive into the research topics of 'Novel scarce-state-transition syndrome-former error-trellis decoding of (n,n-1) convolutional codes'. Together they form a unique fingerprint.

    Cite this