Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

you used the values of MAP decoder directly for the BER plot. Which MAP decoder you used for this simulation ? If possible can you share the code #6

Open
shubhamsrivast4u opened this issue Apr 4, 2021 · 3 comments

Comments

@shubhamsrivast4u
Copy link

shubhamsrivast4u commented Apr 4, 2021

Is this BCJR decoding?

@SebastianCa
Copy link
Collaborator

As the codes are extremely short (<16 bits) we can simply implement a brute-force MAP decoder by checking all possible codeword candidates.

For example if k=8 we have 2^8=256 codeword candidates that need to be checked and the decoder selects the one with the smallest distance. This works for Polar and for the random code.

@marcelovca90
Copy link

marcelovca90 commented Jun 15, 2021

@SebastianCa , can you please share the code you used for the MAP decoder (or include BER for bigger values of SNR)?

@shubhamsrivast4u
Copy link
Author

@SebastianCa , can you please share the code you used for the MAP decoder (or include BER values for bigger values of SNR)?

I may need that too, please

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants