Minimum Pearson Distance Detection Using a Difference Operator in the Presence of Unknown Varying Offset

Abstract

We consider noisy data transmission channels with unknown scaling and varying offset mismatch. Minimum Pearson distance detection is used in cooperation with a difference operator, which offers immunity to such mismatch. Pair-constrained codes are proposed for unambiguous decoding, where in each codeword certain adjacent symbol pairs must appear at least once. We investigate the cardinality and redundancy of these codes.

A New Detection Method for Noisy Channels With Time-Varying Offset

“…For n ≥ 12, the loss is less than 1.5 dB, (for n ≥ 18 the loss is less than 1 dB). Note that the method advocated by Bu et al [10] that aims to solve the same problem has a 3 dB noise penalty, irrespective of the codeword length. For large n, the minimum distance computation is amenable for analysis.…”

“…They concluded that the redundancy of their scheme is prohibitively large for many applications. Bu and Weber [10] also addressed a channel model where the offset varies within a codeword. They introduced Pearson-distance-based detection in conjunction with a difference operator and a pair-constrained code.…”