Sell Your Projects | My Account | Careers | This email address is being protected from spambots. You need JavaScript enabled to view it. | Call: +91 9573777164

Stack decoding of polar codes

1 1 1 1 1 Rating 4.89 (71 Votes)


Stack decoding of polar codes


A successive cancellation stack (SCS) decoding algorithm is proposed to boost the performance of polar codes. Unlike the conventional successive cancellation decoder that determines the bits successively with a local optimal strategy, the SCS algorithm stores a range of candidate partial ways in an ordered stack and tries to search out the global optimal estimation by searching along the most effective path in the stack. Simulation leads to the binary-input additive white Gaussian noise channel show that the SCS algorithm has the identical performance because the successive cancellation list (SCL) algorithm and will approach that of the maximum likelihood algorithm. Moreover, the time complexity of the SCS decoder is a lot of lower than that of the SCL and will be very shut to that of the SC within the high SNR regime.

Did you like this research project?

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

Stack decoding of polar codes - 4.9 out of 5 based on 71 votes

Project EnquiryLatest Ready Available Academic Live Projects in affordable prices

Included complete project review wise documentation with project explanation videos and Much More...