Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch

被引：5
|
作者：
Blackburn, Simon R. [1 ]
机构：
[1] Royal Holloway Univ London, Dept Math, Egham TW20 0EX, Surrey, England
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2016年 / 62卷 / 03期
关键词：
Flash memory; Pearson distance; Pearson codes; maximum likelihood decoding; DISTANCE DETECTION; RANK-MODULATION; MINIMUM PEARSON;
D O I：
10.1109/TIT.2016.2521658
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Immink and Weber recently defined and studied a channel with both gain and offset mismatch, modeling the behavior of charge-leakage in flash memory. They proposed a decoding measure for this channel based on minimizing Pearson distance (a notion from cluster analysis). This paper derives a formula for maximum likelihood decoding for this channel, and also defines and justifies a notion of minimum distance of a code in this context.
引用
收藏
页码：1144 / 1149
页数：6
相关论文
共 50 条
  • [21] Maximum-Likelihood Carrier Frequency Offset Estimation for OFDM Systems in Fading Channels
    Zhou, Hao
    Malipatil, Amaresh V.
    Huang, Yih-Fang
    2006 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2006), VOLS 1-4, 2006, : 1461 - 1464
  • [22] FROM MAXIMUM LIKELIHOOD TO ITERATIVE DECODING
    Alberge, F.
    Naja, Z.
    Duhamel, P.
    2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 3052 - 3055
  • [23] A maximum likelihood watermark decoding scheme
    Lu, Wenming
    Li, Wanqing
    Safavi-Naini, Rei
    Ogunbona, Philip
    2007 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-5, 2007, : 1247 - 1250
  • [24] Reduced complexity of maximum likelihood decoding
    Elengical, SM
    Takawira, F
    Xu, H
    2004 IEEE AFRICON: 7TH AFRICON CONFERENCE IN AFRICA, VOLS 1 AND 2: TECHNOLOGY INNOVATION, 2004, : 217 - 220
  • [25] MAXIMUM-LIKELIHOOD SYNTACTIC DECODING
    FUNG, LW
    FU, KS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) : 423 - 430
  • [26] Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels
    Duman, TM
    Kurtas, E
    2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, 2001, : 2194 - 2198
  • [27] Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels
    Helmling, Michael
    Rosnes, Eirik
    Ruzika, Stefan
    Scholl, Stefan
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2589 - 2593
  • [28] Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels
    Duman, TM
    Kurtas, E
    ELECTRONICS LETTERS, 2001, 37 (12) : 771 - 773
  • [29] CODING THEOREM FOR MULTIPLE ACCESS CHANNELS USING A MAXIMUM LIKELIHOOD LIST DECODING SCHEME
    SHARMA, BD
    RAINA, N
    INFORMATION SCIENCES, 1978, 16 (02) : 81 - 87
  • [30] The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels
    Sabary, Omer
    Yaakobi, Eitan
    Yucovich, Alexander
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 763 - 768
12345