E-IHRB Decoder Architectures for Non-Binary LDPC Codes
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 8
Abstract
In the information theory, the non- binary low density parity check (NB-LDPC) code is a linear error correcting code, a method of transmitting message over a noisy transmission channel. LDPCcodes are capacityapproaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical maximum for a symmetric memory less channel.Using iterative belief propagation techniques, NB-LDPC codes can be decoded in time linear to their block length. Non-binary lowdensity parity-check codes can achieve higher performance than their binary counterparts. Recently, two algorithms were developed for decoding NB-LDPC codes: iterative hard reliability-based majority-logic decoding (IHRB-MLGD) and iterative soft reliability-based majority-logic decoding (ISRB-MLGD has better performance-complexity tradeoffs than previous algorithms. This paper first proposes message-passing in such a way that we can reduce the memory consumption to a greater extent at the same time there should not be performance loss. By using enhanced iterative reliabilitybased majority-logic decoding algorithms we can achieve effective complexity-performance and noise free design. Compared to previous designs, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.
Authors and Affiliations
Kalyani Madamsetti, Suseela M
Keywords
Related Articles
- EP ID EP27974
- DOI -
- Views 262
- Downloads 0
An Application of Integrated Interface Schema (IIS) Over Multiple WDBS to Enhance Data Unit Annotation
The data unit’s revisits from the fundamental database are typically programmed into the result pages vigorously for human browsing. For the preset data units to be appliance process capable which is necessary for ma...
AIDA : Minimizing Communication Overhead And Enhance Privacy of Shared Data
An algorithm for anonymous sharing of private data among parties is developed. Top-down refinement masks a given table to satisfy broad range of anonymity requirements without sacrificing significantly the usefulness...
Access Control And Privacy Preserving Mechanisms On Sensitive Data
The privacy preserving module anonymizes the data to convene privacy requirements and sketchiness constraints on predicates set by the access control device. We make this communication as the problem of k-anonymous....
Design of Modulo 2n-1 based on Radix-8 Algorithm for RNS & MAC Applications
A new architecture, namely, Multiplier-and Accumulator (MAC) based Radix-8 Booth Encoded modulo 2n-1 Multiplication Algorithm for high-speed arithmetic logics have been proposed and implemented on Xilinx FPGA device....
Effective Keyword Search on XML data- Using FMADM
Efficient state of the art query retrieval systems are implemented over RDBMS databases but not for XML based storages. Fuzzy type-ahead search, though not a new concept for RDBMS based systems, it is a new informati...