Sequential decoding of tailbiting convolutional codes for packet data on Rayleigh fading channels
Paper i proceeding, 1999
Sequential decoding of long constraint length convolutional codes is proposed for hybrid automatic repeat request packet data transmission on a Rayleigh fading channel, and computational complexity (the timeout condition) is applied for error detection. In order to improve the throughput, tailbiting codes are used. Furthermore, a method for estimating the initial state of the encoder is described, and for most packet lengths this scheme yields negligible loss compared to the case with a known tail. Although interleaving must be performed over one packet only, high throughput is maintained also for correlated fading. A throughput of 0.90 at a signal to noise ratio per coded bit of 15 dB shows this coding scheme to be competitive for wireless packet data services.