A Low-Complexity Multiple Error Correcting Architecture Using Novel Cross Parity Codes Over GF(2m) - 2015


This project presents a unique low-complexity cross parity code, with a big selection of multiple bit error correction capability at a lower overhead, for improving the reliability in circuits over GF(2m). For an m input circuit, the proposed scheme will correct m = Dw = 3m/two -one multiple error mixtures out of all the attainable 2m - 1 errors, which is superior to many existing approaches. From the mathematical and practical evaluations, the best case error correction is m/2 bit errors. Tests on eighty-bit parallel and, for the first time, on 163-bit Federal Data Processing Customary/National Institute of Standards and Technology (FIPS/NIST) standard word-level Galois field (GF) multipliers, suggest that it requires only 106% and a hundred and seventypercent space overheads, respectively, that is not up to the present approaches, whereas error injection-based mostly behavioral analysis demonstrates its wider error correction capability.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Improved Low-Complexity Sphere Decoding for Generalized Spatial Modulation - 2018ABSTRACT:During this letter, two types of improved sphere decoding (SD) algorithms for generalized spatial modulation (GSM), termed
PROJECT TITLE :Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems - 2018ABSTRACT:As a branch of sphere decoding, the K-best method has played an
PROJECT TITLE :Compressive Channel Estimation and Multi-User Detection in C-RAN With Low-Complexity Methods - 2018ABSTRACT:This Project considers the channel estimation (CE) and multi-user detection (MUD) problems in cloud radio
PROJECT TITLE :A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multicarrier Wireless Networks - 2018ABSTRACT:This Project proposes computationally efficient algorithms to maximise the energy efficiency
PROJECT TITLE :Low-Complexity VLSI Design of Large Integer Multipliers for Fully Homomorphic Encryption - 2018ABSTRACT:Giant integer multiplication has been widely employed in fully homomorphic encryption (FHE). Implementing possible

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry