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

Implement maximum likelyhood for PPM == SF #5

Open
guruofquality opened this issue Mar 15, 2017 · 0 comments
Open

Implement maximum likelyhood for PPM == SF #5

guruofquality opened this issue Mar 15, 2017 · 0 comments

Comments

@guruofquality
Copy link
Member

In the case where the symbol set is equal to (and not greater) than spread factor, we are guaranteed +/-1 decoding errors. When the symbol set is greater, the detector error is simply shifted out. To correctly decode this, we need to take into account all of the symbol possibilities that go into one set of interleaved symbols and use the hamming errors to select the best decode option.

Two major complications to implement this:

  • Because of interleaving, errors are spread across every N symbols. The maximum likely hood path is as long as 1 group of interleaved symbols. But not as long as the entire payload, the process just repeats for every group
  • The header options support their own code rate separate from the payload (usually 4/8). So doing this requires its once in a generic way for the payload, and somewhat specifically for the header decode.
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

1 participant