Abstract
Punctured convolutional codes of rates k/sub 1//n and k/sub 2//n are applied to mod u mod u+v construction, and then a superimposed code of rate (k/sub 1/+k/sub 2/)/(2n) is constructed. A suboptimal decoding procedure is presented for the superimposed codes, and it reduces the decoding complexity as compared with maximum likelihood decoding for the known convolutional codes.
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.
