Abstract
We present a method to evaluate post-decoding bit error probabilities for individual bit positions in a linear unequal error protection (LUEP) code with symbol-by-symbol MAP decoding. A matrix description of the LUEP code trellis is used to formulate the MAP decoding problem analytically in original domain. This can be illustrated by a weighted trellis with joint probabilities being the weights of the trellis. By way of a similarity transformation, the decoding problem is mapped into a spectral domain having a much simpler computational structure. Because the considered LUEP codes are simple to implement, the method may be used in applications where the decoding delay needs to be kept at a minimum.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
