A new approach to upper bounding the decoding error probability of convolutional codes is proposed. Its idea is, instead of evaluating the individual contribution of each fundamental path, to compare it with contribution of another (lighter) fundamental path. This allows us to (1) take into account the dependence between different fundamental paths based on the code tree structure; (2) represent the decoding error probability through the contribution of the first fundamental paths and a correction factor; (3) get much more accurate estimates.
Problems of Information Transmission – Springer Journals
Published: Oct 9, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud