Selective max-min algorithm for low-density parity-check decoding

Date

2013-05-21

Author

Hareedy, Ahmed
Khairy, Mohamed M.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

80
views

0
downloads

With the growing importance of error correction in different communication systems, using an efficient and easily implementable code is always appreciated. One of the most important codes is the low-density parity-check (LDPC) code. Two main iterative decoding algorithms are usually used, namely the sum-product (SP) algorithm (also referred to as belief propagation) and the min-sum (MS). The SP algorithm is more accurate but suffers from very high complexity. On the other hand, the MS algorithm has a much lower complexity at the expense of some performance degradation. To handle this performance degradation, many algorithms were presented in the literature as improvements for the MS, like the scaled MS and the offset MS. However, all those improved algorithms are more complex than the traditional MS. In this study, an efficient and low complexity LDPC decoding algorithm, called selective max-min (SMM), is proposed. The SMM performance is closer to SP than to MS as long as the average number of ones per column in the parity check matrix is around or less than 4 (which is the case for most of the communication systems using LDPC). On the other hand, the SMM exhibits only a minor complexity increase over traditional MS making it suitable for practical implementation.© The Institution of Engineering and Technology 2013.

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84877828378&origin=inward
https://hdl.handle.net/11511/98419

Journal

IET Communications

DOI

https://doi.org/10.1049/iet-com.2011.0722

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Modular Verification of Asynchronous Service Interactions Using Behavioral Interfaces Betin Can, Aysu; Bultan, Tevfik (2013-04-01) A crucial problem in service oriented computing is the specification and analysis of interactions among multiple peers that communicate via messages. We propose a design pattern that enables the specification of behavioral interfaces acting as communication contracts between peers. This “peer controller pattern” provides a modular, assume-guarantee style verification strategy that consists of three phases. 1) Each individual peer is statically verified for conformance to its part of the contract, using soft...
Power Spectra of Constrained Codes with Level-Based Signaling: Overcoming Finite-Length Challenges Centers, Jessica; Tan, Xinyu; Hareedy, Ahmed; Calderbank, Robert (2021-08-01) In various practical systems, certain data patterns are prone to errors if written or transmitted. In magnetic recording and communication over transmission lines, data patterns causing consecutive transitions that are not sufficiently separated are prone to errors. In Flash memory with two levels per cell, data patterns causing high-low-high charge levels on adjacent cells are prone to errors. Constrained codes are used to eliminate error-prone patterns, and they can also achieve other goals. Recently, we ...
Diversity Analysis of Hierarchical Modulation in Wireless Relay Networks Yalcyn, Ahmet Zahid; Yüksel Turgut, Ayşe Melda (2014-07-01) In communication systems, hierarchical modulation is used to increase system robustness and to send different information flows simultaneously. However, when used in cooperative communication systems, hierarchical modulation is prone to error propagation, which is the most important problem that prevents the achievement of full diversity gains. Depending on the signal-to-noise ratio between the source and the relay, threshold digital relaying can be used to mitigate error propagation. Mitigating error propa...
Diversity Analysis of Hierarchical Modulation in Cooperative Communication Yalcin, Ahmet Zahid; Yüksel Turgut, Ayşe Melda (2014-01-01) In cooperative communication systems, hierarchical modulation is used to increase systems robustness and to send different information flows simultaneously. In cooperative communication systems which use hierarchical modulation, error propagation is the most important problem that prevents achieving full diversity gain. Thresholds that depend on the signal to noise ratio (SNR) value between the source and the relay can be used to mitigate error propagation. If the instantaneous SNR between the source and th...
Active learning with uncertainty sampling for large scale activity recognition in smart homes Alemdar, Hande; Ersoy, Cem (2017-01-01) One of the major problems faced by automated human activity recognition systems is the scalability. Since the probabilistic models employed in activity recognition require labeled data sets for adapting themselves to different users and environments, redeploying these systems in different settings becomes a bottleneck. In order to handle this problem in a cost effective and user friendly way, uncertainty sampling based active learning method is proposed. With active learning, it is possible to reduce the an...

Citation Formats

A. Hareedy and M. M. Khairy, “Selective max-min algorithm for low-density parity-check decoding,” IET Communications, vol. 7, no. 1, pp. 65–70, 2013, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84877828378&origin=inward.