Abstract
The authors examine the performance of BCH and convolutional codes in a direct-sequence spread-spectrum packet radio network. Packet errors are caused by a combination of noise at the receiver and interference between packet transmissions that overlap in time. The interference between packet transmissions produces dependent symbol errors at the output of the demodulator. The authors first compute an upper bound on the symbol error probability. Then they use this upper bound to calculate upper bounds on the packet error probability for both BCH and convolutional codes. The results make it possible to compare the performance of BCH and convolutional codes in the presence of multiple-access interference. >
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.
