IEEE Transactions on Communications · 1989 · 279 citations · 23 references
EngineeringComputer ScienceData StructuresMemoryMessage PassingChannel CapacityChannel CodingCoding TheoryData CodingError Control CodingError-correcting CodesBit Error RateBounds On CodesCode BoundsConvolutional CodesError BoundsSequential DecodingUpper BoundsViterbi Decoding
The study investigates high‑rate punctured convolutional codes suitable for Viterbi and sequential decoding. Weight spectra and upper bounds on bit‑error probability for the best known punctured codes with memory 2 to 8 and rates 2/3 to 7/8 are provided. Results extend known short‑memory codes (M≤8) and present newly discovered rate‑2/3 and 3/4 long‑memory punctured convolutional codes with memory 9–23, including their leading weight‑spectra terms, bit‑error performance bounds, and some sequential‑decoding simulation results.
An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M<or=8 discovered by others are extended. Weight spectra and upper bounds on the bit error probability of the best known punctured codes having memory 2<or=M<or=8, and coding rates 2/3<or=R<or=7/8 are provided. Newly discovered rate-2/3 and -3/4 long-memory punctured convolutional codes with 9<or=M<or=23 are provided together with the leading terms of their weight spectra and their bit error performance bounds. Some results of simulation with sequential decoding are given.<<ETX>>
23