Information Theory (cs.IT)
Thu, 13 Jul 2023
1.Deep learning based enhancement of ordered statistics decoding of LDPC codes
Authors:Guangwen Li, Xiao Yu
Abstract: Aiming at designing plausible decoders with channel information free, low complexity, high throughput, and approaching maximum likelihood performance, we put forward a streamlined architecture which concatenates sequentially three components. Specifically, to tackle the decoding failures of normalized min-sum, the whole decoding trajectory, not limited to the last iteration information conventionally, is fed into a trained convolutional neural network to yield new reliability metric for each sequence bit, termed decoding information aggregation. Then an adapted order statistics decoding, following the suggested decoding path, is adopted to process the sequence ordered with new metric more efficiently in that many invalid searches contained in conventional methods otherwise are evaded. The role of decoding information aggregation is elaborated via statistics data to reveal that it can arrange more error-prone bits into the fore part of most reliable basis of order statistics decoding, which is vital for the effective decoding enhancement. We argue the superposition of improved bitwise reliability of the most reliable basis and the imposed rigorous code structure by OSD enables the proposed architecture being a competitive rival of the state of the art decoders, which was verified in extensive simulation in terms of performance, complexity and latency for short and moderate LDPC codes.
2.Integer sequences that are generalized weights of a linear code
Authors:Elisa Gorla, Elisa Lorenzo García, Umberto Martínez-Peñas, Flavio Salizzoni
Abstract: Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence assumption for MDS and MSRD codes. We also prove that the same integer sequences appear as sequences of greedy weights of linear block codes, rank-metric codes, and sum-rank metric codes. Finally, we characterize the integer sequences which appear as sequences of relative generalized weights (respectively, relative greedy weights) of linear block codes.
3.On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes
Authors:Yuan Li, Zicheng Ye, Huazi Zhang, Jun Wang, Guiying Yan, Zhiming Ma
Abstract: Pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and polarization-adjusted convolutional (PAC) codes) improves the weight spectrum of Reed-Muller (RM) codes and polar codes significantly. However, a theoretical analysis to quantify the improvement is missing. In this paper, we provide asymptotic analysis on the number of low-weight codewords of the original and pre-transformed RM codes respectively, and prove that pre-transformation significantly reduces low-weight codewords, even in the order sense. For polar codes, we prove that the average number of minimum-weight codewords does not increase after pre-transformation. Both results confirm the advantages of pre-transformation.
4.Downlink Precoding for Cell-free FBMC/OQAM Systems With Asynchronous Reception
Authors:Yuhao Qi, Jian Dang, Zaichen Zhang, Liang Wu, Yongpeng Wu
Abstract: In this work, an efficient precoding design scheme is proposed for downlink cell-free distributed massive multiple-input multiple-output (DM-MIMO) filter bank multi-carrier (FBMC) systems with asynchronous reception and highly frequency selectivity. The proposed scheme includes a multiple interpolation structure to eliminate the impact of response difference we recently discovered, which has better performance in highly frequency-selective channels. Besides, we also consider the phase shift in asynchronous reception and introduce a phase compensation in the design process. The phase compensation also benefits from the multiple interpolation structure and better adapts to asynchronous reception. Based on the proposed scheme, we theoretically analyze its ergodic achievable rate performance and derive a closed-form expression. Simulation results show that the derived expression can accurately characterize the rate performance, and FBMC with the proposed scheme outperforms orthogonal frequency-division multiplexing (OFDM) in the asynchronous scenario.
5.Asymptotic SEP Analysis and Optimization of Linear-Quantized Precoding in Massive MIMO Systems
Authors:Zheyu Wu, Junjie Ma, Ya-Feng Liu, A. Lee Swindlehurst
Abstract: A promising approach to deal with the high hardware cost and energy consumption of massive MIMO transmitters is to use low-resolution digital-to-analog converters (DACs) at each antenna element. This leads to a transmission scheme where the transmitted signals are restricted to a finite set of voltage levels. This paper is concerned with the analysis and optimization of a low-cost quantized precoding strategy, referred to as linear-quantized precoding, for a downlink massive MIMO system under Rayleigh fading. In linear-quantized precoding, the signals are first processed by a linear precoding matrix and subsequently quantized component-wise by the DAC. In this paper, we analyze both the signal-to-interference-plus-noise ratio (SINR) and the symbol error probability (SEP) performances of such linear-quantized precoding schemes in an asymptotic framework where the number of transmit antennas and the number of users grow large with a fixed ratio. Our results provide a rigorous justification for the heuristic arguments based on the Bussgang decomposition that are commonly used in prior works. Based on the asymptotic analysis, we further derive the optimal precoder within a class of linear-quantized precoders that includes several popular precoders as special cases. Our numerical results demonstrate the excellent accuracy of the asymptotic analysis for finite systems and the optimality of the derived precoder.
6.Experimental Demonstration of 3D Reflected Beamforming at sub6GHz thanks to Varactor Based Reconfigurable Intelligent Surface
Authors:Philippe Ratajczak, Eric Séguenot, Dinh-Thuy Phan-Huy
Abstract: Reconfigurable intelligent surface (RIS) is a promising solution to boost coverage sustainably by reflecting waves from a transmitter to a receiver and acting as a low-power and passive relay. In this paper, for the first time, we demonstrate experimentally that a reconfigurable intelligent surface designed for sub6GHz, and using varactor technology, can perform three-dimensional reflective beamforming. This result is achieved with a RIS prototype of 984 unit-cells, thanks to a compact control circuit individually addressing and configuring the voltage of each unit-cell, with a distinct voltage. To our knowledge, this prototype configures 17 to 70 times more distinct voltages than in the state-of-the-art. The experimental results in an indoor environment show a 10 dB gain. They also show, for the first time, that producing such a new prototype is feasible with minimal energy footprint and environmental impact, thanks to refurbishing. Indeed, a reflectarray antenna originally designed for three-dimensional beamforming has been turned into a RIS.