2008 16th IEEE International Conference on Networks 2008
DOI: 10.1109/icon.2008.4772571
|View full text |Cite
|
Sign up to set email alerts
|

RRNS-Convolutional encoded concatenated code for OFDM based wireless communication

Abstract: The modern telecommunication industry demands higher capacity networks with high data rate. Orthogonal frequency division multiplexing (OFDM) is a promising technique for high data rate wireless communications at reasonable complexity in wireless channels. OFDM has been adopted for many types of wireless systems like wireless local area networks such as IEEE 802.11a, and digital audio/video broadcasting (DAB/DVB). The proposed research focuses on a concatenated coding scheme that improve the performance of OFD… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…By using 2r (r ≥ 1) redundant moduli, r errors can be detected and corrected [19]. The residues in RNS serve as multiple data communication channels (fault tolerant; every digit result is completely independent) [22].…”
Section: Redundant Residue Number Systemmentioning
confidence: 99%
“…By using 2r (r ≥ 1) redundant moduli, r errors can be detected and corrected [19]. The residues in RNS serve as multiple data communication channels (fault tolerant; every digit result is completely independent) [22].…”
Section: Redundant Residue Number Systemmentioning
confidence: 99%
“…Codes of RNS have found application in digital signal processing (DSP) systems due to their high speed. The works [11][12][13][14] present mathematical models of special DSP as well as their circuit solutions, use of which allows for orthogonal signal transformations in real time.…”
Section: Introductionmentioning
confidence: 99%
“…Depending on the multiplicity of the error being corrected, developers determine the number of irreducible polynomials that are used to obtain the generating polynomial. For example, we can use the code (15,11) and the generating polynomial g(x) = x 4 + x + 1 in order to correct a single error, which is understood as a distortion of one binary digit in a code combination. This code is defined over the Galois field GF (2 4 ).…”
Section: Introductionmentioning
confidence: 99%
“…The performance of systematic and nonsystematic RRNS codes and near-optimal decoding algorithms for soft decision decoding has been proposed in [37]. The similarities and advantages of RRNS over other non-binary codes like Reed-Solomon (RS) codes has been discussed in detail in [23], [25]- [27], [30]- [38].…”
Section: Rns and Rrns Based Channel Codingmentioning
confidence: 99%
“…But recent advances in computing has enabled the use of RRNS as a channel code to improve error detection and correction [23], [27], [30]- [38].…”
Section: Rns and Rrns Based Channel Codingmentioning
confidence: 99%