BLOCK-PARALLEL DECODING OF CONVOLUTIONAL-CODES USING NEURAL-NETWORK DECODERS

被引:5
|
作者
SAGAR, V
JACYNA, GM
SZU, H
机构
[1] CATHOLIC UNIV AMER,DEPT ELECT ENGN,HYATTSVILLE,MD 20783
[2] CATHOLIC UNIV AMER,DEPT ELECT ENGN,RESTON,VA 22091
[3] NSWC,SILVER SPRING,MD 20903
[4] UNIV MARYLAND,UNIV COLL,COLLEGE PK,MD 20742
[5] AMERICAN UNIV,DEPT COMP SCI & INFORMAT SCI,WASHINGTON,DC 20016
[6] GEORGE WASHINGTON UNIV,DEPT ECS,WASHINGTON,DC 20052
关键词
BLOCK CODES; CONVOLUTIONAL CODES; CONSTRAINT LENGTH; ENCODER MEMORY; FREE DISTANCE; HAMMING NEURAL NETWORK; MAXIMUM LIKELIHOOD DECODING; MARKOV PROCESS; STATE DIAGRAM; TRELLIS GRAPH; WINNER-TAKE-ALL CIRCUIT;
D O I
10.1016/0925-2312(94)90022-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An off-line trained and supervised neural network is proposed to decode convolutional codes one block at a time. A convolutional encoder is a linear finite-state machine and Viterbi decoder performs maximum likelihood decoding. In the neural network model a set of neurons equal to the number of encoder states forms an input stage, and a block of B stages are linked together with fully forward and backward links among adjacent stages, which span m - 1 stages on both sides, where m is the convolutional encoder memory. A Hamming neural network is used together with a winner-take-all circuit at each stage to select the decoded sequence. The performance is calibrated against noisy channel corrupted encoder inputs (constraint length K = 3, and m = 2) to be similar to the maximum likelihood Viterbi decoder.
引用
收藏
页码:455 / 471
页数:17
相关论文
共 50 条