Abstract

This paper presents an exact analysis of the performance of binary cyclic codes in communication systems. Previous expressions for the performance of this type of codes have used simplified assumptions which limited its use to few communication systems. This paper significantly extend previous work by providing more general expressions for the performance of cyclic codes applicable to most communication channels and systems. Applications are demonstrated for type-I hybrid ARQ systems by deriving equations for the packet error probability and throughput for frequency-hop spread spectrum multiple-access (FHSS-MA) networks. Numerical results show that the approximation by using the old techniques can result in an error in the order of 14%.

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 call

Disclaimer: 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.