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

Trellis termination for (Recursive Systematic Convolutional) codes #125

Open
xerpi opened this issue Mar 9, 2024 · 0 comments
Open

Trellis termination for (Recursive Systematic Convolutional) codes #125

xerpi opened this issue Mar 9, 2024 · 0 comments

Comments

@xerpi
Copy link

xerpi commented Mar 9, 2024

At https://github.com/veeresht/CommPy/blob/master/commpy/channelcoding/convcode.py#L546, I see that the bits from the RSC FFs are taken individually and utilized as if they were the message input bits to determine the next branch. However, I believe this might not be the correct approach, as it appears to overlook the consideration of the feedback polynomial: when performing the trellis termination, the "switch" ((a), (b) on the picture) that goes into the flip-flops (FFs) of the RSC memory is turned to (b) to force zeros in, achieved by XORing the feedback bit by itself.
image

If I'm not mistaken the calculation of the "input" bit to select the next branch should be something like: parity(current_state & feedback_polynomial).

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