Inner Convolutional Codes and Ordered Statistics Decoding in a Multiple Access System Enabling Wireless Coexistence
The problem of wireless coexistence will become crucial in years to come. Future generation communication systems will have to endure interference induced by communication systems operating within the same frequency bands. Coded DHA FH OFDMA using ordered statistics is well suited for the task. This paper addresses the problem of transmission rate increase in a coded DHA FH OFDMA system. It will be demonstrated that using q-ary convolutional codes constructed from punctured Reed-Solomon codes as inner codes in a coded DHA FH OFDMA provides rates sufficiently higher than those ensured by block inner codes ensuring at the same time reasonable decoding complexity, relatively small codeword length and low probability of error.
Keywordsmultiple access wireless coexistence ordered statistics convolutional code
Unable to display preview. Download preview PDF.
- 1.Golmie, N., Chevrollier, N., Rebala, O.: Bluetooth Adaptive Frequency Hopping and Scheduling. In: Proceedings of Military Communications, MILCOM 2003, Boston, MA, pp. 1138–1142 (October 2003)Google Scholar
- 3.Chiasserini, C.F., Rao, R.R.: Coexistence Mechanisms for Interference Mitigation between IEEE 802.11 WLANs and Bluetooth. In: Proceedings of IEEE INFOCOMM 2002, pp. 590–598 (2002)Google Scholar
- 5.Osipov, D., Frolov, A., Zyablov, V.V.: Multitone jamming-proof q-ary code-based signal-code construction. In: Collected Works of the 34th Conference of Young Scientists and Specialists Information Technologies and Systems, Gelendzhik, Russia, October 2-7, pp. 168–173 (2011) (in Russian)Google Scholar
- 6.Kondrashov, K., Afanassiev, V.: Ordered statistics decoding for semi-orthogonal linear block codes over random non-Gaussian channels. In: Proc. of the Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory, Pomorie, Bulgaria, June 15-21, pp. 192–196 (2012)Google Scholar
- 7.Viterbi, A.J.: Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Trans. Information Theory IT-13, 260–269 (1967)Google Scholar