DocumentCode
979369
Title
Low-complexity trellis decoding of linear block codes
Author
Honary, B. ; Markarian, G. ; Darnell, M.
Author_Institution
Commun. Res. Centre, Lancaster Univ., UK
Volume
142
Issue
4
fYear
1995
fDate
8/1/1995 12:00:00 AM
Firstpage
201
Lastpage
209
Abstract
The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to the trellises of coset codes and allow low complexity soft maximum likelihood decoding
Keywords
Golay codes; Hamming codes; Reed-Muller codes; block codes; computational complexity; linear codes; maximum likelihood decoding; trellis codes; Golay codes; Hamming codes; Reed-Muller codes; code design; coset codes; encoding technique; linear block codes; low-complexity trellis decoding; optimum codes; soft maximum likelihood decoding;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:19952037
Filename
466765
Link To Document