Near-Optimal Contraction of Voronoi Regions for Pruning of Blind Decoding Results

被引:0
|
作者
Bai, Dongwoon [1 ]
Lee, Jungwon [1 ]
Kim, Sungsoo [2 ]
Kim, Hanju [2 ]
Kang, Inyup [2 ]
机构
[1] Samsung Modem R&D, San Diego, CA 92121 USA
[2] Samsung Elect, Seoul 100742, South Korea
关键词
Bayes procedures; blind decoding; decision-making; error correction coding; error detection coding; LTE downlink control channel; PDCCH false alarm; signal detection; CODES; CHANNEL;
D O I
10.1109/TCOMM.2015.2427356
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In Long-Term Evolution (LTE) downlink control channel, a large number of blind decoding attempts are made, while the number of valid codewords is limited. The blind decoding results are then verified using a 16-bit cyclic redundancy check (CRC). However, even with the 16-bit CRC, the false alarm (FA) rate of such blind decoding is inevitably high. This paper investigates the problem of pruning of blind decoding results for reduction of the FA rate. To the best of our knowledge, the approach using a soft correlation metric (SCM) shows the best FA reduction performance among existing schemes. However, following the Bayes principle, we propose novel likelihood-based pruning that provides systematic balancing between the FA rate and the miss (MS) rate. Moreover, the simulation results show that the signal-to-noise ratio (SNR) gain of our proposed scheme is unbounded, with respect to the SCM-based scheme, in the independent and identically distributed (i.i.d.) Rayleigh fading channel. Moreover, the proposed scheme is shown to be less complex than the existing scheme. Finally, it is proved that, as SNR increases, the proposed approach has the decision error probability that approaches the minimum value yielding near-optimal contraction of Voronoi regions for pruning of blind decoding results.
引用
收藏
页码:1963 / 1974
页数:12
相关论文
共 33 条
  • [1] NEAR-OPTIMAL DECODING ALGORITHM
    KOROGODI.AM
    TELECOMMUNICATIONS AND RADIO ENGINEERING, 1972, 26 (09) : 130 - 132
  • [2] Systematic Pruning of Blind Decoding Results
    Bai, Dongwoon
    Lee, Jungwon
    Kim, Sungsoo
    Kim, Hanju
    Kang, Inyup
    2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 153 - 157
  • [3] Blind Demixing and Deconvolution at Near-Optimal Rate
    Jung, Peter
    Krahmer, Felix
    Stoeger, Dominik
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 704 - 727
  • [4] On Optimal and Near-Optimal Turbo Decoding Using Generalized max* Operator
    Papaharalabos, Stylianos
    Mathiopoulos, P. Takis
    Masera, Guido
    Martina, Maurizio
    IEEE COMMUNICATIONS LETTERS, 2009, 13 (07) : 522 - 524
  • [5] Near-Optimal Turbo Decoding in Presence of SNR Estimation Error
    El-Khamy, Mostafa
    Wu, Jinhong
    Lee, Jungwon
    Roh, Heejin
    Kang, Inyup
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 3737 - 3742
  • [6] Near-Optimal Noisy Group Testing via Separate Decoding of Items
    Scarlett, Jonathan
    Cevher, Volkan
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2311 - 2315
  • [7] Near-Optimal Noisy Group Testing via Separate Decoding of Items
    Scarlett, Jonathan
    Cevher, Volkan
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2018, 12 (05) : 902 - 915
  • [8] Near-Optimal Decoding of Incremental Delta-Sigma ADC Output
    Wang, Bo
    Law, Man-Kay
    Belhaouari, Samir Brahim
    Bermak, Amine
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2020, 67 (11) : 3670 - 3680
  • [9] Near-Optimal Decoding of Transient Stimuli from Coupled Neuronal Subpopulations
    Trousdale, James
    Carroll, Samuel R.
    Gabbiani, Fabrizio
    Josic, Kresimir
    JOURNAL OF NEUROSCIENCE, 2014, 34 (36): : 12206 - 12222
  • [10] Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms
    Garg, Vikas K.
    Pichkhadze, Tamar
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32