检索结果-内蒙古大学图书馆

Codeword or Noise? Exact Random Coding Exponents for joint detection and decoding

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第9期60卷 5077-5094页

作者： Weinberger, Nir Merhav, Neri Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel Technion Israel Inst Technol IL-32000 Haifa Israel

We consider the problem of coded communication, where in each time frame, the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. We derive the optimum detection/decoding rule in the sense of the best tradeoff among the probabilities of decoding error, false alarm, and misdetection. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these probabilities for the average code in the ensemble. It is shown that previously proposed decoders are in general strictly suboptimal.

关键词： joint detection/decoding error exponent false alarm misdetection random coding synchronization unequal error protection

来源：评论

学校读者我要写书评

暂无评论

Low-Density Parity-Check Coded Direct Sequence Spread Spectrum Receiver Based on Analog Probabilistic Processing

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第7期70卷 6355-6370页

作者： Ding, Xuhui An, Jianping Zhao, Zhe Bu, Xiangyuan Yang, Kai Beijing Inst Technol Dept Informat & Elect Beijing 100081 Peoples R China China Acad Elect & Informat Technol Beijing 100041 Peoples R China

Forward error correction (FEC) coding is an indispensable technique in the direct sequence spread spectrum (DS-SS) systems for satellite communication applications. Both the FEC and DS-SS can be regarded as specific cases of probabilistic computing based on analog circuits, which is expected to be a promising solution for power-limited scenarios. The combination of FEC and DS-SS techniques can provide sufficient link margin and robustness for communication systems. In this paper, a probabilistic receiver chain for the Low-Density Parity-Check (LDPC) coded DS-SS system is proposed. Generically, an m-sequence can be regarded as a codeword of cyclic linear codes. Similar to the decoding procedure of LDPC codes, the joint detection and decoding process of m-sequences can be performed by factor graph-based iterative message-passing algorithms (iMPAs). In terms of the iterative signal processing, we first present an improved approach of iterative stopping criterion which can reduce the average number of iteration by 90% for the LDPC decoding approach. Furthermore, a joint detection and decoding method is developed to provide quick synchronization of the m-sequence. Meanwhile, stopping criterion-based iMPAs are especially suitable for analog implementation with low complexity. Finally, cascading to the analog LDPC decoder, the implementation of the m-sequence detector is designed. The prototyping chip is fully integrated into a 035-mu m CMOS technology, which can achieve higher throughput than 3 Gcps with a core chip area of 2.79 mm(2) and power consumption of 6.99 mW for its core circuit. Experimental results demonstrate the effectiveness of our proposed receiver mechanism.

关键词： Spread-spectrum communication LDPC codes joint detection/decoding factor graphs (FGs) analog probabilistic computing stopping criterion

来源：评论

学校读者我要写书评

暂无评论

Factor Graph Based joint detection/decoding for LDPC Coded Large-MIMO Systems

Factor Graph Based Joint Detection/Decoding for LDPC Coded L...

引用

IEEE 75th Vehicular Technology Conference (VTC Spring)

作者： Narasimhan, T. Lakshmi Chockalingam, A. Rajan, B. Sundar Indian Inst Sci Dept ECE Bangalore 560012 Karnataka India

ISBN: (纸本)9781467309905;9781467309882

In this paper, we employ message passing algorithms over graphical models to jointly detect and decode symbols transmitted over large multiple-input multiple-output (MIMO) channels with low density parity check (LDPC) coded bits. We adopt a factor graph based technique to integrate the detection and decoding operations. A Gaussian approximation of spatial interference is used for detection. This serves as a low complexity joint detection/decoding approach for large dimensional MIMO systems coded with LDPC codes of large block lengths. This joint processing achieves significantly better performance than the individual detection and decoding scheme.

关键词： Large-MIMO LDPC joint detection/decoding factor graphs belief propagation message passing

来源：评论

学校读者我要写书评

暂无评论

On Coding and detection Techniques for Two-Dimensional Magnetic Recording

On Coding and Detection Techniques for Two-Dimensional Magne...

引用

作者： Almustapha, Mohammed Dikko University of Plymouth

学位级别：博士

The areal density growth of magnetic recording systems is fast approaching the superparamagnetic limit for conventional magnetic disks. This is due to the increasing demand for high data storage capacity. Two-dimensional Magnetic Recording (TDMR) is a new technology aimed at increasing the areal density of magnetic recording systems beyond the limit of current disk technology using conventional disk media. However, it relies on advanced coding and signal processing techniques to achieve areal density gains. Current state of the art signal processing for TDMR channel employed iterative decoding with Low Density Parity Check (LDPC) codes, coupled with 2D equalisers and full 2D Maximum Likelihood (ML) detectors. The shortcoming of these algorithms is their computation complexity especially with regards to the ML detectors which is exponential with respect to the number of bits involved. Therefore, robust low-complexity coding, equalisation and detection algorithms are crucial for successful future deployment of the TDMR scheme. This present work is aimed at finding efficient and low-complexity coding, equalisation, detection and decoding techniques for improving the performance of TDMR channel and magnetic recording channel in general. A forward error correction (FEC) scheme of two concatenated single parity bit systems along track separated by an interleaver has been presented for channel with perpendicular magnetic recording (PMR) media. joint detection decoding algorithm using constrained MAP detector for simultaneous detection and decoding of data with single parity bit system has been proposed. It is shown that using the proposed FEC scheme with the constrained MAP detector/decoder can achieve a gain of up to 3dB over un-coded MAP decoder for 1D interference channel. A further gain of 1.5 dB was achieved by concatenating two interleavers with extra parity bit when data density along track is high. The use of single bit parity code as a run length limited code as w

关键词： Coding joint detection/decoding Two-Dimensional Magnetic Recording Single parity check code BCJR-MAP detection

来源：评论

学校读者我要写书评

暂无评论

A Novel jointed detection Scheme for MIMO-LDPC Systems 23

A Novel Jointed Detection Scheme for MIMO-LDPC Systems

引用

23rd IEEE International Conference on Digital Signal Processing (DSP)

作者： Yang, Guiwu Hu, Jianhao Yao, Guoqiang Chen, Jienan Cao, Wei Univ Elect Sci & Technol China Natl Key Lab Commun Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538668122;9781538668115

High performance and high efficiency detection scheme is one of the key issues for MIMO-LDPC system designs. In this paper, we proposed a hybrid jointed detection scheme for MIMO-LDPC detection, in which the expectation propagation (EP) algorithm is used in MIMO detection and the belief propagation (BP) algorithm is adopted for the low density parity check code (LDPC) decoding. In the proposed scheme, we provide a jointed detection algorithm (EP-BP JDD) with the integrated factor graph for MIMO-LDPC systems. Compared with conventional MMSE-PIC IDD and BP-BP JDD, the proposed method can achieve low computational complexity with high performance. The complexity and performance gains become more significant with the number of antennas increasing.

关键词： MIMO-LDPC expectation propagation belief propagation joint detection/decoding

来源：评论

学校读者我要写书评

暂无评论

Channel detection in Coded Communication

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第10期63卷 6364-6392页

作者： Weinberger, Nir Merhav, Neri Technion Israel Inst Technol IL-32000 Haifa Israel Tel Aviv Univ IL-69978 Tel Aviv Israel

The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The simplified case where each of the sets is a singleton is studied first. The decoding error, false alarm, and misdetection probabilities of a given code are defined, and the optimum detection/decoding rule in a generalized Neyman-Pearson sense is derived. Sub-optimal detection/decoding rules are also introduced which are simpler to implement. Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder. The random coding analysis is then extended to general sets of channels, and an asymptotically optimal detector/decoder under a worst case formulation of the error probabilities is derived, as well as its random coding exponents. The case of a pair of binary symmetric channels is discussed in detail.

关键词： detection complexity error exponents expurgated bounds false alarm joint detection/decoding misdetection mismatch detection random coding universal detection

来源：评论

学校读者我要写书评

暂无评论

An Adaptive joint Viterbi Detector Decoder (AJVDD) 10

An Adaptive Joint Viterbi Detector Decoder (AJVDD)

引用

10th International Conference on Signal Processing and Communication Systems (ICSPCS)

作者： Alappat, Vintu Jose Motani, Mehul Sann, Chan Kheong ASTAR Data Storage Inst Singapore Singapore Natl Univ Singapore Dept Elect & Comp Engn Singapore Singapore

ISBN: (纸本)9781509009411

The joint Viterbi Detector Decoder (JVDD) is a novel detection/decoding algorithm that can functionally replace the iterative detector/decoder in the channel. The algorithm performs detection and decoding on a single trellis structure and is conditionally optimal over an ISI/AWGN channel. Preliminary analysis of the algorithm indicates better performance at shorter codeword lengths when compared to an iterative detector, but the latter catches up and surpasses it at longer codeword lengths due to the high complexity the JVDD. The commercial viability of channel decoders for real-time systems is dependent on two important parameters - performance and computational complexity. In this paper, a novel algorithm called the Adaptive joint Viterbi Detector Decoder (AJVDD) is proposed that enhances the performance and reduces the computational complexity of the JVDD algorithm. The proposed algorithm reduces the average number of survivors per frame by applying varying metric threshold values across different states of the trellis at each time index. It improves the chances of the Minimum Metric Legal Codeword (MMLC) surviving until the end of the frame while filtering out survivors with the least chance of being the MMLC. Extensive simulations are used to verify the improved performance and reduced computational requirements of the proposed algorithm.

关键词： AJVDD JVDD Viterbi MMLC CWL ISI Channel ML detector/decoder joint detection/decoding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：