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

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 1990年 / 39卷 / 01期

关键词：

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 条

[31] POLYNOMIAL DESCRIPTION OF LINEAR BLOCK-CODES
BATTAIL, G
ANNALS OF TELECOMMUNICATIONS, 1983, 38 (1-2) : 3 - 15
[32] Trellis decoding of block codes: Practical approach
Honary, B
Markarian, G
Marple, S
1996 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLUMES 1 AND 2 - PROCEEDINGS, 1996, : 525 - 527
[33] AN EFFICIENT MAXIMUM-LIKELIHOOD-DECODING ALGORITHM FOR LINEAR BLOCK-CODES WITH ALGEBRAIC DECODER
KANEKO, T
NISHIJIMA, T
INAZUMI, H
HIRASAWA, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) : 320 - 327
[34] ON STRUCTURAL COMPLEXITY OF THE L-SECTION MINIMAL TRELLIS DIAGRAMS FOR BINARY LINEAR BLOCK-CODES
KASAMI, T
TAKATA, T
FUJIWARA, T
LIN, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993, E76A (09) : 1411 - 1421
[35] MAP decoding of linear block codes based on a sectionalized trellis of the dual code
Schreier, Peter J.
Costello Jr., Daniel J.
International Zurich Seminar on Digital Communications, 2000, : 271 - 278
[36] Map algorithms for decoding linear block codes based on sectionalized trellis diagrams
Liu, E
Fossorier, M
Lin, S
GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6: THE BRIDGE TO GLOBAL INTEGRATION, 1998, : 562 - 566
[37] MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
Liu, Y
Lin, S
Fossorier, MPC
IEEE TRANSACTIONS ON COMMUNICATIONS, 2000, 48 (04) : 577 - 587
[38] ON THE COMPUTATION OF THE PERFORMANCE PROBABILITIES FOR BLOCK-CODES WITH A BOUNDED-DISTANCE DECODING RULE
DUR, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (01) : 70 - 78
[39] DECODING OF BLOCK-CODES WITH ERASURE OF THE LEAST RELIABLE SYMBOLS
DOLGOV, VI
KHALIMOV, GZ
TELECOMMUNICATIONS AND RADIO ENGINEERING, 1987, 41-2 (04) : 96 - 99
[40] SOFT DECODING FOR BLOCK-CODES OBTAINED FROM CONVOLUTIONAL-CODES
KUDRYASHOV, BD
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 573 : 113 - 119

← 1 2 3 4 5 →