Abstract
The average bit error rate performances of M-ary orthogonal code shift keying (CSK) in Rician fading environments are analyzed in this letter. CSK is a digital modulation scheme that uses a code set as M-ary signals. In CSK, one code is selected from a code set containing M codes according to the information data. A signal is modulated by using this code and the effect of fading can be reduced by applying interleaving to the elements of the codes. In the analysis, the bit error probability is derived in closed form expression by using the Chernoff bound. The analysis results show that the error probability decreases when the code length is increased and that an arbitrarily small error probability is acheved as the code length approaches infinity, provided that Eb/N0 exceeds 1.42dB.
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.
