CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS.

J. W. Modestino, K. R. Matis, L. K. Bechtel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - IEEE Military Communications Conference
Place of PublicationNew York, NY, USA
PublisherIEEE
StatePublished - Dec 1 1986

Fingerprint

Convolutional codes
Matched filters
Phase shift keying
Modulation
Error probability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Modestino, J. W., Matis, K. R., & Bechtel, L. K. (1986). CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS. In Proceedings - IEEE Military Communications Conference New York, NY, USA: IEEE.

CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS. / Modestino, J. W.; Matis, K. R.; Bechtel, L. K.

Proceedings - IEEE Military Communications Conference. New York, NY, USA : IEEE, 1986.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Modestino, JW, Matis, KR & Bechtel, LK 1986, CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS. in Proceedings - IEEE Military Communications Conference. IEEE, New York, NY, USA.
Modestino JW, Matis KR, Bechtel LK. CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS. In Proceedings - IEEE Military Communications Conference. New York, NY, USA: IEEE. 1986
Modestino, J. W. ; Matis, K. R. ; Bechtel, L. K. / CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS. Proceedings - IEEE Military Communications Conference. New York, NY, USA : IEEE, 1986.
@inproceedings{a8bf34d00a9f4799a74339b3a7375ea6,
title = "CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS.",
abstract = "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.",
author = "Modestino, {J. W.} and Matis, {K. R.} and Bechtel, {L. K.}",
year = "1986",
month = "12",
day = "1",
language = "English",
booktitle = "Proceedings - IEEE Military Communications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - CONVOLUTIONAL CODE PERFORMANCE IN IMPULSIVE OR BURST NOISE CHANNELS.

AU - Modestino, J. W.

AU - Matis, K. R.

AU - Bechtel, L. K.

PY - 1986/12/1

Y1 - 1986/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023012055&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023012055&partnerID=8YFLogxK

M3 - Conference contribution

BT - Proceedings - IEEE Military Communications Conference

PB - IEEE

CY - New York, NY, USA

ER -