Sciweavers

ICC
2008
IEEE

Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels

13 years 10 months ago
Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels
— This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual inter-symbol interference (ISI). The codes are systematic, require no decoding and allow for simple encoding. They operate by prohibiting the occurrence of harmful symbol patterns. On some discrete-time communication channels, the (n, n − 1) PEC can prohibit all occurrences of symbol patterns causing worstcase ISI. The effectiveness of a PEC is shown to be uniquely determined by the sign-signature of the channel response, and a simple criterion is given for identifying channels for which the (n, n−1) code is effective. It is also shown that for most channel signatures, the (n, n − 1) PEC can be augmented by a (0, n − 1) runlength-limiting (RLL) code at no additional coding overhead.
Natasa Blitvic, Lizhong Zheng, Vladimir Stojanovic
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICC
Authors Natasa Blitvic, Lizhong Zheng, Vladimir Stojanovic
Comments (0)