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

Journal Article (2019)
Author(s)

Renfei Bu (TU Delft - Discrete Mathematics and Optimization)

J.H. Weber (TU Delft - Discrete Mathematics and Optimization)

Research Group
Discrete Mathematics and Optimization
Copyright
© 2019 R. Bu, J.H. Weber
DOI related publication
https://doi.org/10.1109/LCOMM.2019.2917677
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 R. Bu, J.H. Weber
Research Group
Discrete Mathematics and Optimization
Issue number
7
Volume number
23
Pages (from-to)
1115-1118
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

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.

Files

FINAL_VERSION.pdf
(pdf | 0.319 Mb)
License info not available