Performance on BCH and Convolutional Codes in Direct Sequence Spread Spectrum Packet Radio Networks
The performance of forward error correction codes has been well documented in the open literature when the noise is additive, white, and Gaussian. Little or no work exists on the performance of forward error correction codes when the noise is due primarily to multiple access interference. In this paper, we 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 which overlap in time. The interference between packet transmissions produces dependent symbol errors at the output of the demodulator. In our work, we compute first an upper bound on the symbol error probability. Then we use this upper bound to calculate upper bounds on the packet error probability for both BCH and convolutional codes. Our results enable us to compare the performance of BCH and convolutional codes in the presence of multiple access interference.
This item is only available in print in the UCF Libraries. If this is your thesis or dissertation, you can help us make it available online for use by researchers around the world by downloading and filling out the Internet Distribution Consent Agreement. You may also contact the project coordinator Kerri Bottorff for more information.
Master of Science (M.S.)
College of Engineering
Electrical Engineering and Communication Sciences
Length of Campus-only Access
Masters Thesis (Open Access)
Dissertations, Academic -- Engineering; Engineering -- Dissertations, Academic
Owens, Hugh T., "Performance on BCH and Convolutional Codes in Direct Sequence Spread Spectrum Packet Radio Networks" (1989). Retrospective Theses and Dissertations. 4196.