Packet Error Rates of Terminated and Tailbiting Convolutional Codes
Kapitel i bok, 2002

When a convolutional code is used to provide forward error correction for packet data transmission, the standard performance measures of convolutional codes, i.e., bit error rate and first-event error rate, become less useful. Instead we are interested in the average probability of block (or packet) error. In this chapter a modified transfer function approach is used to obtain a union bound on the block error rate of terminated and tailbiting convolutional codes. The performance of these block codes obtained from termination and tailbiting is compared to the performance of some standard block codes for various information block lengths and also compared to the sphere packing lower bound for optimal block codes. The conclusion is that block codes derived from convolutional codes form a competitive class of short block length block codes.

terminated convolutional code

packet error probability

convolutional code

block code

union bound

tailbiting convolutional code

sphere packing bound

block error probability

Författare

Johan Lassing

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Erik Ström

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Tony Ottosson Gadd

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Advanced Signal Processing for Communication Systems, chapter 12, The Kluwer International Series in Engineering and Computer Science, editor T Wysocki and M Darnell and B Honary, edition 1

Vol. 703

Ämneskategorier

Data- och informationsvetenskap