NDLI: Probabilistic construction of large constraint length trellis codes for sequential decoding

Content Provider	IEEE Xplore Digital Library
Author	Fu-Quan Wang Costello Jr., D.J.
Copyright Year	1972
Abstract	Probabilistic algorithms are given for constructing good large constraint length trellis codes for use with sequential decoding that can achieve the channel cutoff rate bound at a bit error rate (BER) of 10/sup -5/-10/sup -6/. The algorithms are motivated by the random coding principle that an arbitrary selection of code symbols will produce a good code with high probability. One algorithm begins by choosing a relatively small set of codes randomly. The error performance of each of these codes is evaluated using sequential decoding and the code with the best performance among the chosen set is retained. Another algorithm treats the code construction as a combinatorial optimization problem and uses simulated annealing to direct the code search. Trellis codes for 8 PSK and 16 QAM constellations with constraint lengths v up to 20 are obtained. Simulation results with sequential decoding show that these codes reach the channel cutoff rate bound at a BER of 10/sup -5/-10/sup -6/ and achieve 5.0-6.35 dB real coding gains over uncoded systems with the same spectral efficiency and up to 2.0 dB real coding gains over 64 state trellis codes using Viterbi decoding.<>
Starting Page	2439
Ending Page	2448
Page Count	10
File Size	1040449
File Format	PDF
ISSN	00906778
Volume Number	43
Issue Number	9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Convolutional codes Decoding Bit error rate Phase shift keying Quadrature amplitude modulation Gain Viterbi algorithm Modulation coding Simulated annealing Data communication
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Simulations of Convolutional Coding/Viterbi Decoding with Noncoherent CPFSK

Performance of coded OQPSK and MIL-STD SOQPSK with iterative decoding

Block-coded M-PSK modulation over GF(M)

Bandwidth-efficient noncoherent Trellis-coded MPSK

Exact analysis of bit error probability for trellis coded QPSK

P/sup 2/ codes: pragmatic trellis codes utilizing punctured convolutional codes

On Improving Bit Error Probability of QPSK and 4-Level Amplitude Modulation Systems by Convolutional Coding

A two-stage decoder for pragmatic trellis-coded M-PSK modulation using a symbol transformation

On the performance of rate 1/2 convolutional codes with QPSK on Rician fading channels

Probabilistic construction of large constraint length trellis codes for sequential decoding

Similar Documents

Simulations of Convolutional Coding/Viterbi Decoding with Noncoherent CPFSK

Performance of coded OQPSK and MIL-STD SOQPSK with iterative decoding

Block-coded M-PSK modulation over GF(M)

Bandwidth-efficient noncoherent Trellis-coded MPSK

Exact analysis of bit error probability for trellis coded QPSK

P/sup 2/ codes: pragmatic trellis codes utilizing punctured convolutional codes

On Improving Bit Error Probability of QPSK and 4-Level Amplitude Modulation Systems by Convolutional Coding

A two-stage decoder for pragmatic trellis-coded M-PSK modulation using a symbol transformation

On the performance of rate 1/2 convolutional codes with QPSK on Rician fading channels

Probabilistic construction of large constraint length trellis codes for sequential decoding