Complexity Reduction for RS Coded SFH/MFSK System under PBNJ
Proceeding: The Fourth International Conference on Digital Information Processing and Communications (ICDIPC)Publication Date: 2014-03-18
Authors : Li-Der Jeng; Shing-Hung Chen;
Page : 93-100
Keywords : soft-decision decoding; RS code; order statistic decoding algorithm; SFH/MFSK; partial band noise jamming;
Abstract
Although soft-decision decoding of Reed-Solomon (RS) code can improve the decoding performance significantly, the complexity of the system is still very high. Therefore, to reduce the complexity of the decoder is an important issue for hardware implementation. In previous research [16], order statistic decoding algorithm (OSD) can be applied to nonbinary RS coded slow frequency hopping (SFH)/ M-ary frequency shift keying (MFSK) system. In this paper, based on nonbinary OSD algorithm, we propose two methods to reduce the complexity of RS decoder. The principle of proposed methods is to reduce the number of the candidate codewords. Numerical results show the performance and complexity of the algorithms under partial band noise jamming (PBNJ) and additive white Gaussian noise (AWGN). Form the results, we find the proposed two methods can achieve the effect of reducing the complexity with reasonable performance.
Other Latest Articles
- A Study of Diversity Combining Methods for Wireless Image Transmission System
- CUCB-MAC: Channel Usage and Collision Based Medium Access Control Protocol for Cognitive Radio Networks
- The Large-Scale Information Technology Project for Police Stations in Thailand
- Discipline-free and standard-based requirements for IT top management
- Different Notions Lead Difficulties of Making Information System Modernization Decisions
Last modified: 2014-03-24 23:06:32