A low complexity soft decision decoder for linear block codes

Alaoui, My Seddiq El Kasmi; Nouh, Saïd; Marzak, Abdelaziz

doi:10.1016/j.procs.2018.01.124

Cited by 8 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the BCH encoding and decoding process is a matured technology that is being used for decades in real communication systems [35]. In fact, the pursuit of efficient decoding algorithms for BCH codes is still and active research topic [36].…”

Section: Spectrum Sensing Frameworkmentioning

confidence: 99%

“…In the case of the BCH, the ML decoding is chosen because its performance can be closely approximated in practice by well-known and well-established algorithms, such as ordered statistics decoding (OSD) [35,57]. Other recent soft-decision decoding algorithms of BCH codes also closely approximate the ML decoding performance, as the one considered in [36].…”

Section: Coded Report Channel Transmissionsmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Spectrum Sensing with Coded and Uncoded Decision Fusion under Correlated Shadowed Fading Report Channels

Costa

Guimarães

Souza

et al. 2018

Sensors

View full text Add to dashboard Cite

This article addresses the impact of forward error correction when applied to the report channel transmissions of a centralized decision fusion cooperative spectrum sensing scheme designed to detect idle orthogonal frequency division multiple access (OFDMA) subchannels. The OFDMA signal is transmitted over slow frequency-selective multipath Rayleigh fading channels and sensed using the maximum eigenvalue detection test statistic. The decisions on the OFDMA subchannel occupancy are transmitted to a fusion center over report channels represented by a shadowed fading model combining a three-dimensional spatially correlated shadowing with a slow and flat multipath Rayleigh fading. Binary Bose-Chaudhuri-Hochquenghem (BCH) and Repetition codes are used to protect these decisions. Results show that shadowing correlation severely deteriorates the overall spectrum sensing performance and that error correction may not be able to protect the report channel transmissions. It can be even worse with respect to the system performance especially at low signal-to-noise regimes. In the situations in which error correction is effective, the Repetition code is capable of outperforming the BCH, meaning that the diversity gain may be more relevant than the coding gain when the spectrum sensing decisions are subjected to correlated shadowing.

show abstract

Section: Spectrum Sensing Frameworkmentioning

confidence: 99%

Section: Coded Report Channel Transmissionsmentioning

confidence: 99%

Cooperative Spectrum Sensing with Coded and Uncoded Decision Fusion under Correlated Shadowed Fading Report Channels

Costa

Guimarães

Souza

et al. 2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Performance of such decoding is analyzed using complexity, BER, and number of iterations. Chase‐2 decoding schemes in the hard decision decoder increase its complexity in Alaoui et al Using chasing algorithm in the low complexity decoder increases the error correcting capability of the decoder. This is applied to QR and BCH codes.…”

Section: Introductionmentioning

confidence: 99%

Power efficient low latency architecture for decoder: Breaking the ACS bottleneck

Radha

Shylu

Nagabushanam

2019

Circuit Theory & Apps

View full text Add to dashboard Cite

Summary Viterbi decoder (VD) is the majority used decoder for convolutional codes which play a role in WLAN and WSN applications. The trellis in VD needs proper analysis to calculate the metric at each stage to obtain a shortest path from every state to the next state. Existing techniques in VD design are namely (a) pipelined architecture, (b) modular ACS and buffers technique, and (c) quasi cyclic trellis technique. The key challenge of the VD trellis circuit is to attain high throughput and better latency performance with low power consumption without affecting hardware complexity of VD. This paper presents several of conventional methods used in VD. We also proposed a new method for VD with K the constraint length as multiple of M, the radix in trellis to calculate the shortest survival path to travel in trellis. The proposed VD is simulated using Xilinx. Use of a trace back approach in the proposed Viterbi decoder with capacitive and resistive feedback yields better throughput, latency, and power consumption with respect to other techniques. The static power outputs obtained in RE, shift update, and selective update methods using Libero IDE are also compared.

show abstract

High Performance Decoding by Combination of the Hartmann Rudolph Decoder and Soft Decision Decoding by Hash Techniques

Faham

Alaoui

Nouh

et al. 2021

Digital Technologies and Applications

View full text Add to dashboard Cite

A low complexity soft decision decoder for linear block codes

Cited by 8 publications

References 14 publications

Cooperative Spectrum Sensing with Coded and Uncoded Decision Fusion under Correlated Shadowed Fading Report Channels

Cooperative Spectrum Sensing with Coded and Uncoded Decision Fusion under Correlated Shadowed Fading Report Channels

Power efficient low latency architecture for decoder: Breaking the ACS bottleneck

High Performance Decoding by Combination of the Hartmann Rudolph Decoder and Soft Decision Decoding by Hash Techniques

Contact Info

Product

Resources

About