Electrical and Computer Engineering
2332 Main Mall
Vancouver,
BC
Canada
V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:
info@ece.ubc.ca
| Title | Repeated convolutional codes for high error rate channel |
| Publication Type | Conference Paper |
| Year of Publication | 1990 |
| Authors | Li, G., Q. Wang, V. K. Bhargava, and L. J. Mason |
| Conference Name | Military Communications Conference, 1990. MILCOM '90, Conference Record, A New Era. 1990 IEEE |
| Pagination | 135 -140 vol.1 |
| Date Published | sep. |
| Keywords | BER approximation method, binary convolutional code, binary symmetric channel, bit error rate, central limit theorem, channel capacity, code length, coding, decoding, decoding metrics, encoding, error correction code, error correction codes, high error rate channel, jamming environment, M-ary symmetric channel, quantization, repeated convolutional codes, soft-decision decoder, soft-decision metric, telecommunication channels |
| Abstract | An error correction scheme for an M-ary symmetric channel (MSC) characterized by a large error probability (pe) is considered. The value of pe can be near, but smaller than, 1-1/M for which the channel capacity is zero. Such a large pe may occur, for example, in a jamming environment. The coding scheme considered consists of an outer convolutional code and an inner repetition code of length m which is used for each convolutional code symbol. At the receiving end, the m inner code symbols are used to form a soft-decision metric which is subsequently passed to a soft-decision decoder for the convolutional code. Emphasis is placed on using a binary convolutional code. Effect of finite quantization and methods to generate binary metric for M gt;2 are investigated. For the binary symmetric channel a bit error rate (BER) approximation method is proposed for large m based on the central limit theorem. The influence of various decoding metrics is investigated |
| URL | http://dx.doi.org/10.1109/MILCOM.1990.117400 |
| DOI | 10.1109/MILCOM.1990.117400 |