Design of Approximate Polar Maximum-Likelihood Decoder

  • et al.
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Polar codes, presented by Arikan, accomplish the ability to acquire nearly error-less communication for any given noisy channel of symmetry with "low encoding and decoding complexities" on a huge set of fundamental channels. As of late, polar code turned into the best ideal error-correcting code from the perspective of information theory because of its quality of channel achieving capacity. Though the successive cancellation decoder with approximate computing is efficient, the proposed ML-based decoder is more efficient than the former. As it is equipped with the Modified Processing Element which shows the better performance with the properties of Median Filter. The proposed ML-based decoder diminishes the area and power consumed and logic utilization. In the present paper, effective polar decoder architecture is structured and executed on FPGA utilizing Vertex 5. Here we examine the proposed unique construction that is appropriate for decoding lengthy polar codes with less equipment multifaceted nature.

Cite

CITATION STYLE

APA

Divyavani, K. … K, Meenakshi. (2019). Design of Approximate Polar Maximum-Likelihood Decoder. International Journal of Engineering and Advanced Technology, 9(2), 5086–5092. https://doi.org/10.35940/ijeat.b3336.129219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free