CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Packet Error Rates of Terminated and Tailbiting Convolutional Codes

Johan Lassing (Institutionen för signaler och system, Kommunikationssystem) ; Erik G. Ström (Institutionen för signaler och system, Kommunikationssystem) ; Tony Ottosson (Institutionen för signaler och system, 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 (2002),
[Kapitel]

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.

Nyckelord: convolutional code; block code; block error probability; packet error probability; union bound; terminated convolutional code; tailbiting convolutional code; sphere packing bound



Denna post skapades 2006-09-12. Senast ändrad 2013-06-07.
CPL Pubid: 15064

 

Institutioner (Chalmers)

Institutionen för signaler och system, Kommunikationssystem (1900-2017)

Ämnesområden

Information Technology

Chalmers infrastruktur