DECODING PERFORMANCE OF LINEAR BLOCK-CODES USING A TRELLIS IN DIGITAL MOBILE RADIO

被引:3
|
作者
MATSUMOTO, T
机构
[1] NTT Radio Communication Systems Laboratories, Kanagawa-ken, 238, 1-2346, Take, Yokosuka-shi
关键词
D O I
10.1109/25.54957
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Decoding performance of linear block codes using a trellis is investigated in a Rayleigh fading channel. Two methods to calculate metric values for each bit in a received block are considered: the values are calculated from the received signal envelope sample and demodulator output. Bit error rate (BER) performances between hard decision and trellis decoding are compared using Hamming (7, 4) and Golay (24, 12) codes in computer simulations and laboratory experiments. A simplified trellis decoding algorithm, in which the hard decision output of a bit with the envelope sample greater than the threshold value is accepted as correct, is presented for complexity reduction. Laboratory experimental results for the trellis decoding in combination with Gaussian minimum shift keying (GMSK) modulation and frequency detection are shown. The effect of n-bit A/D-conversion in signal envelope sampling is investigated experimentally. © 1990 IEEE
引用
收藏
页码:68 / 74
页数:7
相关论文
共 50 条
  • [41] Fast soft-decision decoding for block codes using a trellis
    Peng, XH
    Burr, AG
    Farrell, PG
    Gil-Garcia, JM
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 230 - 230
  • [42] LINEAR BLOCK-CODES FOR ERROR-DETECTION
    KASAMI, T
    KLOVE, T
    LIN, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) : 131 - 136
  • [43] On the BCJR trellis for linear block codes
    McEliece, RJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (04) : 1072 - 1092
  • [44] ON THE PROBABILITY OF UNDETECTED ERROR FOR LINEAR BLOCK-CODES
    WOLF, JK
    MICHELSON, AM
    LEVESQUE, AH
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (02) : 317 - 324
  • [45] ON THE CODING GAIN OF LINEAR BINARY BLOCK-CODES
    JOVANOVIC, VM
    BUDISIN, SZ
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (05) : 635 - 638
  • [46] LINEAR BLOCK-CODES OVER CYCLIC GROUPS
    CAIRE, G
    BIGLIERI, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (05) : 1246 - 1256
  • [47] Bounds on the performance of sphere decoding of linear block codes
    El-Khamy, M
    Vikalo, H
    Hassibi, B
    Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005, : 47 - 51
  • [48] COMPARISON OF DECODING ALGORITHMS OF BINARY LINEAR BLOCK-CODES IN RAYLEIGH FADING CHANNELS WITH DIVERSITY RECEPTION
    YI, CH
    LEE, JH
    ELECTRONICS LETTERS, 1995, 31 (08) : 610 - 611
  • [49] Simplified trellis decoding of block codes by selective pruning
    Bertrand, E
    Labeau, F
    CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2004, : 1115 - 1119
  • [50] NEW RESULTS ON SOFT-DECISION DECODING OF BLOCK-CODES
    TAIPALE, DJ
    PURSLEY, MB
    1989 IEEE MILITARY COMMUNICATIONS CONFERENCE, VOLS 1-3: BRIDGING THE GAP : INTEROPERABILITY, SURVIVABILITY, SECURITY, 1989, : 546 - 550