The authors consider the performance of short constraint-length convolutional codes in conjunction with coherent binary PSK modulation in impulsive or burst noise channels when an imperfect erasure mechanism is used to exorcise symbols contaminated by noise hits. The erasure mechanism is a simple hole puncher operating on the sampled matched filter outputs and is characterized by a fixed false alarm probability, P//F, and a miss probability, P//M. This scheme is representative of a large number of erasure declaration strategies. Some general conclusions are drawn on the basis of cutoff rate arguments under an idealized channel modeling assumption. For short constraint-length convolutional codes, tight upper bounds are provided on bit-error probability performance under the same idealized channel modeling assumptions. These bounds compare favorably with simulation results for randomly occuring an periodic noise hits. Departures from idealized channel modeling assumptions are investigated through simulation. Results indicate an important distinction between the case of random and periodic noise hits and has implications for the use of interleaving of an impulsive or burst noise channels.
|Title of host publication||Proceedings - IEEE Military Communications Conference|
|Place of Publication||New York, NY, USA|
|State||Published - Dec 1 1986|
ASJC Scopus subject areas