The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity-Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping...
The present paper has considered multithreshold decoders for self-orthogonal codes providing a near-optimal efficiency of the error correction under linear computational complexity. New divergence principle used within construction and decoding convolutional codes has been discussed. The paper has shown that usage of such principle allows significantly approximating an area of the decoder effective...
In this paper, the principle of normalized minimum-sum (NMS) polar decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, performances approach to that of the sum-product (SP) algorithm can be achieved. As well, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results for successive...
Deep learning recently shows strong competitiveness to improve polar code decoding. However, suffering from prohibitive training and computation complexity, the conventional deep neural network (DNN) is only possible for very short code length. In this paper, the main problems of deep learning in decoding are well solved. We first present the multiple scaled belief propagation (BP) algorithm, aiming...
We consider the problem of robust polynomial regression, where one receives samples that are usually within a small additive error of a target polynomial, but have a chance of being arbitrary adversarial outliers. Previously, it was known how to efficiently estimate the target polynomial only when the outlier probability was subconstant in the degree of the target polynomial. We give an algorithm...
In recent years, numbers of non-orthogonal multiple access (NOMA) schemes have been proposed to support the great amounts of wireless connections. However, complex multi-user detection is needed in case that the user power differentiation is not available and simple successive interference cancellation cannot directly apply, which usually incurs unaffordable computational complexity. In this paper,...
Sparse-code multiple-access (SCMA) is a novel multiplexing method to increase the capacity of wireless communication systems. By giving users non-orthogonal codebook with few non-zero entries, the SCMA approach can highly improve the spectral efficiency, compared with traditional orthogonal ones such as CDMA, with tolerable detection complexity. Therefore, it has been considered as an option for 5G...
This paper focuses on low complexity architectures for check node processing in Non-Binary LDPC decoders. To be specific, we focus on Extended Min-Sum decoders and consider the state-of-the-art Forward-Backward and Syndrome-Based approaches. We recall the presorting technique that allows for significant complexity reduction at the Elementary Check Node level. The Extended-Forward architecture is then...
Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to determine which bits transmit information and which parity. Relative reliabilities need to be known by both encoders and decoders: in case of multi-mode systems, where...
Polar codes were recently chosen to protect the control channel information in the next-generation mobile communication standard (5G) defined by the 3GPP. As a result, receivers will have to implement blind detection of polar coded frames in order to keep complexity, latency, and power consumption tractable. As a newly proposed class of block codes, the problem of polar-code blind detection has received...
In this work, we give the first construction of high-rate locally list-recoverable codes. List-recovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving} globally...
Low-density parity-check (LDPC) coded massive multiple-input and multiple-output (MIMO) scheme is getting increasingly popular and sophisticated in today's wireless communication systems, since it can highly improve the spectral efficiency, data rates, and error performance. In this paper, a novel iterative detection and decoding (IDD) method for LDPC-coded massive MIMO systems is proposed. Based...
A simple technique to design MIMO space-time block codes that achieve both diversity and rate gains is to stack spatial multiplexing (V-BLAST) and transmit diversity (Alam-outi) encoders; these are known as hybrid codes. We increase the spectral efficiency of a simple hybrid code with one V-BLAST layer and one Alamouti layer by using spatial modulation. In spatial modulation systems, information is...
In this paper, the principle of density evolution (DE) combined with the normalized minimum-sum (NMS) decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, then almost the same behaviour of sum-product (SP) algorithm is achieved. As well, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation...
In this paper, we propose an advanced polar encoding scheme with successive cancellation list (SCL) decoder for visible light communication (VLC). As much high-profile channel coding methods, polar codes have achieved the symmetric capacity of binary-input discrete memoryless channels (B-DMCs) based on channel polarization. By taking advantages of simple recursive encoding structure and confirmed...
Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds other well-known FEC codes. However, the hardware complexity of LSCD rapidly increases with the list size, which incurs high usage of the resources on...
For practical applications in forward error correction, the importance of a systematic codeword cannot be overemphasized. Thus, this paper proposes the construction of a systematic quasi-cyclic (QC) LDPC code. This systematic structure is achieved by a row reduction technique different from the conventional Gaussian elimination method. This row reduction technique has the advantage of being easier...
In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early...
In this work we present construction of Space Time Block Codes (STBC) from Abelian codes. A well known Eisenstein-Jacobi rank preserving map is applied to map the codeword matrix symbols to symbols in the complex plane. We then propose an NT × NR MIMO (multiple input, multiple output) communication system employing the constructed STBC. An analysis on the receiver (decoder) computational complexity...
This paper proposes a modified bit flipping algorithm and its weighted variants based on reliability derived from intrinsic information. Compared to other existing algorithms where extrinsic information based reliability was used in the flipping function, here intrinsic information based reliability is also equally considered. This algorithm only uses additions and subtractions to modify reliability...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.