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 条
  • [31] SEPARABLE CONCATENATED CONVOLUTIONAL-CODES - THE STRUCTURE AND PROPERTIES OF A CLASS OF CODES FOR ITERATIVE DECODING
    LODGE, JH
    YOUNG, RJ
    GUINAND, PS
    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1995, 6 (05): : 535 - 542
  • [32] A unified method to construct neural network decoders for arbitrary codes and decoding rules
    Zhang, ZZ
    Ma, XM
    Yang, YX
    DISCRETE MATHEMATICS, 2001, 238 (1-3) : 171 - 181
  • [33] ON THE PERFORMANCE OF SEQUENTIAL AND VITERBI DECODERS FOR HIGH-RATE PUNCTURED CONVOLUTIONAL-CODES
    MUHAMMAD, K
    BENLETAIEF, K
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1995, 43 (11) : 2687 - 2695
  • [34] A NEURAL-NETWORK FOR ERROR-CORRECTING DECODING OF BINARY LINEAR CODES
    ESPOSITO, A
    RAMPONE, S
    TAGLIAFERRI, R
    NEURAL NETWORKS, 1994, 7 (01) : 195 - 202
  • [35] NEW RATE-COMPATIBLE PUNCTURED CONVOLUTIONAL-CODES FOR VITERBI DECODING
    LEE, LHC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1994, 42 (12) : 3073 - 3079
  • [36] BIDIRECTIONAL BREADTH-1ST ALGORITHMS FOR THE DECODING OF CONVOLUTIONAL-CODES
    BELZILE, J
    HACCOUN, D
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (02) : 370 - 380
  • [37] SEQUENTIAL-DECODING OF CONVOLUTIONAL-CODES BY A COMPRESSED MULTIPLE QUEUE ALGORITHM
    KUO, HC
    WEI, CH
    IEE PROCEEDINGS-COMMUNICATIONS, 1994, 141 (04): : 212 - 222
  • [38] Parallel Decoding of LDPC Convolutional Codes Using OpenMP and GPU
    Chan, Chi H.
    Lau, Francis C. M.
    2012 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2012, : 225 - 227
  • [39] NEURAL NET DECODERS FOR LINEAR BLOCK CODES
    Dumachev, V. N.
    Kopylov, A. N.
    Butov, V. V.
    BULLETIN OF THE SOUTH URAL STATE UNIVERSITY SERIES-MATHEMATICAL MODELLING PROGRAMMING & COMPUTER SOFTWARE, 2019, 12 (01): : 129 - 136
  • [40] TABLE BASED DECODING OF RATE ONE-HALF CONVOLUTIONAL-CODES
    DHOLAKIA, A
    VOUK, MA
    BITZER, DL
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1995, 43 (2-4) : 681 - 686