DocumentCode :
2339978
Title :
WLC45-6: A Family of Low Complexity Adaptive Binary Linear Block Codes
Author :
Loskot, Pavel ; Beaulieu, Norman C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB
fYear :
2006
fDate :
Nov. 27 2006-Dec. 1 2006
Firstpage :
1
Lastpage :
6
Abstract :
A family of linear binary block codes is constructed from ordinary block repetition codes using cyclic shifts of the input information vector which greatly simplifies encoding. These codes have variable block length and variable minimum Hamming distance. Several sets of cyclic shifts are defined to constrain the search for good codes. Codeword enumeration strategies are discussed. The proposed codes are shown to be good candidates for adaptive coding, turbo product coding, retransmission schemes and multihop routing, and block differential encoding. A generic parallel encoder structure well suited to OFDM systems, and a non-recursive block differential encoder capable of arbitrarily increasing the code rate with the block length, for given minimum Hamming distance, are proposed. Numerical examples compare the bit-error rate assuming iterative soft- decision decoding and the union bound.
Keywords :
Hamming codes; OFDM modulation; binary codes; block codes; error statistics; linear codes; turbo codes; OFDM systems; bit-error rate; block differential encoding; codeword enumeration strategy; encoding; low-complexity adaptive binary linear block codes; minimum Hamming distance; multihop routing; turbo product coding; AWGN; Adaptive coding; Additive white noise; Block codes; Fading; Hamming distance; Iterative decoding; Parity check codes; Routing; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
ISSN :
1930-529X
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2006.882
Filename :
4151512
Link To Document :
بازگشت