Deep Learning-Based Decoding of Constrained Sequence Codes
University of Alberta(阿尔伯塔大学)
Congzhe Cao, Duanshun Li, Ivan Fair
备注:
12 pages, 9 figures, accepted by IEEE Journal on Selected Areas in Communications (JSAC) - Machine Learning in Wireless Communications. arXiv admin note: substantial text overlap with arXiv:1809.01859
Constrained sequence (CS) codes, including fixed-length CS codes and variable-length CS codes, have been widely used in modern wireless communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel to enable efficient and reliable transmission of coded symbols. In this paper, we propose using deep learning approaches to decode fixed-length and variable-length CS codes. Traditional encoding and decoding of fixed-length CS codes rely on look-up tables (LUTs), which is prone to errors that occur during transmission. We introduce fixed-length constrained sequence decoding based on multiple layer perception (MLP) networks and convolutional neural networks (CNNs), and demonstrate that we are able to achieve low bit error rates that are close to maximum a posteriori probability (MAP) decoding as well as improve the system throughput. Further, implementation of capacity-achieving fixed-length codes, where the complexity is prohibitively high with LUT decoding, becomes practical with deep learning-based decoding. We then consider CNN-aided decoding of variable-length CS codes. Different from conventional decoding where the received sequence is processed bit-by-bit, we propose using CNNs to perform one-shot batch-processing of variable-length CS codes such that an entire batch is decoded at once, which improves the system throughput. Moreover, since the CNNs can exploit global information with batch-processing instead of only making use of local information as in conventional bit-by-bit processing, the error rates can be reduced. We present simulation results that show excellent performance with both fixed-length and variable-length CS codes that are used in the frontiers of wireless communication systems.
Attention Meets Reachability: Structural Equivalence and Efficiency in Grammar-Constrained LLM Decoding
Department of Computer Engineering, Bahçeşehir University, Istanbul, Turkey(计算机工程系,巴切希尔大学,伊斯坦布尔,土耳其);Department of Industrial Engineering, Bahçeşehir University, Istanbul, Turkey(工业工程系,巴切希尔大学,伊斯坦布尔,土耳其)
Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
School of Mathematics, Shandong University(山东大学数学学院);Academy of Mathematics and Systems Science, CAS, University of Chinese Academy of Sciences(中国科学院数学与系统科学研究院,中国科学院大学)