Among expectation propagation (EP)-based massive multiple-input–multiple-output (MIMO) detection algorithms, EP with weighted Neumann-series approximation (EPA-wNSA) has the lowest computational complexity while requiring many iterations to guarantee performance, which severely limits throughput of hardware implementations. Through joint optimization algorithm and architecture, we propose an EP-based detector higher area efficiency. First, second-order Richardson iteration (SORI) is employed...

Recently, massive multiple-input multiple-output (MIMO) detection schemes based on message passing (MPD) have attracted extensive attention due to their good performance-complexity tradeoff. In this paper, facilitate a high-throughput detector design, we introduce layered updating schedule and propose an improved MPD (ILMPD) algorithm. the new algorithm, several algorithmic transformations or approximations are derived for lower complexity. For instance, by exploiting property of quadratic...

Quasi-cyclic low-density parity-check (QC-LDPC) codes for modern communication standards usually have multiple code rates and block lengths. Therefore, reconfigurable LDPC decoders received widespread attention, which require circular-shift networks to support various expansion factors. Besides, inputs smaller than the network size, is desired process frames in parallel maximize hardware utilization efficiency. The increasing demands put severe challenges low-complexity implementations of...

Polynomial multiplication leads to a significant computational and spatial burden in cryptographic algorithms, posing challenges optimization endeavors. In this work, we propose hybrid series-parallel polynomial multiplier based on Karatsuba algorithm. The proposed can achieve substantial decrease the area, while slightly increase cycle time, thus Area-Delay Product (ADP) greatly, which significantly outperforms conventional algorithms. We implement architecture FPGA achieves improvement of...

Non-binary low-density parity-check (NB-LDPC) codes outperform their binary counterparts in many cases. However, an NB-LDPC decoder usually requires excessive hardware resources and memory consumption. The trellis-based min-max decoding algorithm (TMMA), a well-known proposed recent years, achieves good tradeoff between performance complexity. Note that the check node processing unit (CNU) occupies most Based on TMMA, simplifications for CNU have been developed with slight loss. current TMMA...

The ultra-reliable low-latency communication (URLLC), one of the three main scenarios in fifth-generation (5G) mobile system, is promising to be used various emerging applications with stringent latency and performance requirements. Recently, guessing random additive noise decoding (GRAND) proposed, which can perform well for URLLC due its excellent error-correction short code length. Compared other variants GRAND, ordered reliability bits GRAND (ORBGRAND) provide a good trade-off between...

Existing bit-flipping algorithms, when used for irregular low-density parity-check (LDPC) codes, often suffer from performance degradation due to the imbalance caused by codeword structure. To alleviate this problem, paper presents a column-weighted probabilistic gradient-descent (CW-PGDBF) decoder LDPC codes. Different weighting factors are allocated variable nodes with different column weights solve imbalance. Furthermore, modified flipping rule is employed reduce hardware complexity while...

Non-binary low-density parity-check (NB-LDPC) codes show larger coding gain and lower error floor than their binary counterparts in many cases. However, the existing soft decoding algorithms of NB-LDPC generally suffer from high computational complexity. Recently, trellis-based extended min-sum (T-EMS) algorithm has attracted much attention since it can achieve good performance with parallelism low In this paper, we propose two new methods to further reduce complexity enhance performance....

Probabilistic gradient descent bit-flipping (PGDBF) is the state-of-the-art hard-decision algorithm for decoding low-density parity-check (LDPC) codes on binary symmetric channel (BSC). However, there still exists a considerable performance gap between PGDBF and soft-decision algorithms, especially in error-floor region. To bridge this gap, tabu-list aided (T-PGDBF) proposed paper. In T-PGDBF algorithm, employed to help escape from trapping sets, which main cause of phenomenon. The bits are...

In this work, a high-throughput belief propagation (BP) decoder of polar codes on graphics processing unit (GPU) is proposed for software-defined communication systems. The jointly optimized from algorithm and architecture aspects. From the aspect, storage pattern computation flow are to reduce complexity. different granularities parallelism extensively exploited achieve high throughput. Equipped with these techniques, high-speed GPU-based BP developed, experimental results show that can...

Location-based services have become an indispensable component of wireless networks, but high-precision positioning is challenging. With the application multiple-input multiple-output (MIMO) in 5G, accurate channel state information (CSI) can be obtained and leveraged for positioning. Solving MIMO problem by deep learning has demonstrated better accuracy than traditional methods. To further improve accuracy, we propose a novel model named ACPNet, which incorporates two types attention...

Non-binary low-density parity-check (NB-LDPC) codes usually exhibit much better performance than their binary counterparts. Among NB-LDPC decoding algorithms, the iterative reliability-based majority-logic (MLGD) algorithms are attractive for low computation complexity, at cost of degradation. In this brief, based on improved soft (IISRB)-MLGD algorithm, we propose a clipped-modified (CM)-IISRB which achieves with lower computational complexity. First, two modifications introduced to IISRB...

With the rapid development of Ethernet, RS (544, 514) (KP4-forward error correction), which was widely used in high-speed Ethernet standards for its good performance-complexity trade-off, may not meet demands next-generation higher data transmission speed and better decoding performance. A concatenated code based on KP4-FEC has become a solution because low complexity excellent compatibility. For codes, aside from selection outer inner an efficient interleaving scheme is also very critical...

Non-binary low-density parity-check (NB-LDPC) codes perform much better than their binary counterparts, when codeword length is moderate or high-order modulation used. However, the implementation of a NB-LDPC decoder usually suffers from excessive hardware complexity and large memory requirement. Many new algorithms decoding schedules have been introduced in recent literatures to reduce further. current for still high. In this paper, two-extra-column trellis min-sum algorithm (TEC-TMSA)...

In massive multiple-input multiple-output (MIMO) detection, the likelihood ascent search (LAS) algorithm is well-known for its near-optimum performance and low complexity. It employs gradient descent to enhance of suboptimal MIMO detectors, specifically minimum mean-square error (MMSE) algorithm. this paper, we introduce several techniques improve MMSE-based LAS (MMSE-LAS) in terms both complexity performance. To reduce complexity, MMSE first replaced with low-complexity optimized coordinate...

This paper delves into recent hardware implementations of the Lempel-Ziv 4 (LZ4) algorithm, highlighting two key factors that limit throughput single-kernel compressors. Firstly, actual parallelism exhibited in designs falls short theoretical potential. Secondly, clock frequency is constrained due to presence feedback loops. To tackle these challenges, we propose a novel scheme restricts each parallelization window single match, thus elevating level parallelism. Furthermore, by restricting...

Non-binary low-density parity-check (NB-LDPC) codes exhibit a much better performance than their binary counterparts, especially for moderate codeword length and high-order modulation. However, decoding algorithms suffer from very high computational complexity. In this paper, low-complexity algorithm is proposed, named erased (PCEA), where an additional parity check bit added to each symbol of the when encoding series simple operations are performed based on these bits during decoding. As...

As one of the candidates evaluated in process National Institute Standards and Technology (NIST) post-quantum cryptography standardization, Classic McEliece, is being widely studied for its strong security. In existing decryption architectures, Goppa decoder logic resource intensive, fast Fourier transform (FFT) unit limits achievable frequency. this paper, a novel folded based on enhanced parallel inversionless Berlekamp-Massey (ePiBM) algorithm proposed complexity reduction,...