View in EDS

Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 118850988
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Schouhamer+Immink%2C+Kees%22">Schouhamer Immink, Kees</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Skachek%2C+Vitaly%22">Skachek, Vitaly</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Journal+on+Selected+Areas+in+Communications%22">IEEE Journal on Selected Areas in Communications</searchLink>. Sep2016, Vol. 34 Issue 9, p2510-2517. 8p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algebraic+coding+theory%22">Algebraic coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+device+security+measures%22">Computer storage device security measures</searchLink><br /><searchLink fieldCode="DE" term="%22Flash+memory%22">Flash memory</searchLink><br /><searchLink fieldCode="DE" term="%22Euclidean+distance%22">Euclidean distance</searchLink><br /><searchLink fieldCode="DE" term="%22Optical+storage+systems%22">Optical storage systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=118850988
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/JSAC.2016.2603618
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 2510
    Subjects:
      – SubjectFull: Algebraic coding theory
        Type: general
      – SubjectFull: Computer storage device security measures
        Type: general
      – SubjectFull: Flash memory
        Type: general
      – SubjectFull: Euclidean distance
        Type: general
      – SubjectFull: Optical storage systems
        Type: general
    Titles:
      – TitleFull: Minimum Pearson Distance Detection Using Mass-Centered Codewords in the Presence of Unknown Varying Offset.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Schouhamer Immink, Kees
      – PersonEntity:
          Name:
            NameFull: Skachek, Vitaly
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 07338716
          Numbering:
            – Type: volume
              Value: 34
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: IEEE Journal on Selected Areas in Communications
              Type: main
ResultId 1