Bibliographic Details
| Title: |
Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset. |
| Authors: |
Schouhamer Immink, Kees1, Skachek, Vitaly2 |
| Source: |
IEEE Journal on Selected Areas in Communications. Sep2016, Vol. 34 Issue 9, p2510-2517. 8p. |
| Subjects: |
Algebraic coding theory, Computer storage device security measures, Flash memory, Euclidean distance, Optical storage systems |
| Abstract: |
We consider the transmission and storage of data that use coded binary symbols over a channel, where a Pearson-distance-based detector is used for achieving resilience against additive noise, unknown channel gain, and varying offset. We study minimum Pearson distance (MPD) detection in conjunction with a set, S , of codewords satisfying a center-of-mass constraint. We investigate the properties of the codewords in S , compute the size of S , and derive its redundancy for asymptotically large values of the codeword length n . The redundancy of S , where \alpha =\log 2 ({\pi /24})^{1/2} = -1.467 .. for n odd and $\alpha =-0.467$ .. for n$ even. We describe a simple encoding algorithm whose redundancy equals 2\log _{2}n+o(\log n) . We also compute the word error rate of the MPD detector when the channel is corrupted with additive Gaussian noise. [ABSTRACT FROM PUBLISHER] |
|
Copyright of IEEE Journal on Selected Areas in Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
