DocumentCode :
1505480
Title :
Partial-prefix synchronizable codes
Author :
Van Wijngaarden, Adriaan J. ; Morita, Hiroyoshi
Author_Institution :
Inst. for Exp. Math., Essen Univ., Germany
Volume :
47
Issue :
5
fYear :
2001
fDate :
7/1/2001 12:00:00 AM
Firstpage :
1839
Lastpage :
1848
Abstract :
A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of codewords in any position other than the first position. The new codes, termed partial-prefix synchronizable codes (PPS-codes), use a fixed sequence of symbols that is interspersed with symbols that carry information. The contiguous sequence from the first fixed symbol to the last fixed symbol is called a “partial-prefix.” Consequently, not one but a set of possible prefixes is used, and none of these prefixes is allowed to occur at any other than the first position of a codeword. The cardinality of PPS-codes is determined, and coding algorithms are proposed which have a computational complexity proportional to the length of the codewords. It is demonstrated that in comparison with PS-codes, PPS-codes have similar coding and prefix detection complexity, but they have a larger code size and have better error control capabilities
Keywords :
computational complexity; decoding; error correction codes; synchronisation; variable length codes; code cardinality; codeword; codeword length; coding algorithms; coding complexity; computational complexity; contiguous sequence; error control; fixed-length frame; frame synchronization; large code size; partial-prefix synchronizable codes; prefix detection complexity; variable-length frame; Combinatorial mathematics; Computational complexity; Decoding; Digital communication; Encoding; Error correction; Information systems; Information theory; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.930922
Filename :
930922
Link To Document :
بازگشت