2007
DOI: 10.1109/tbc.2007.893387
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Convolutional and Turbo Coding for Broadband FWA Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(24 citation statements)
references
References 19 publications
0
24
0
Order By: Relevance
“…At the initial stage, we use the 3-path combining scheme (see (26)) to get a crude symbol estimate. At the following stages, the modified Alamouti algorithm with IC (see (27) and (28)) is employed to cancel ISI using decision feedback from the previous stage. Fig.…”
Section: Analytical Results and Performance Comparisonmentioning
confidence: 99%
See 3 more Smart Citations
“…At the initial stage, we use the 3-path combining scheme (see (26)) to get a crude symbol estimate. At the following stages, the modified Alamouti algorithm with IC (see (27) and (28)) is employed to cancel ISI using decision feedback from the previous stage. Fig.…”
Section: Analytical Results and Performance Comparisonmentioning
confidence: 99%
“…The variance of ε 0 n , ε 1 n will be much smaller than that of 0 n 1 n in (26) and w 0 n w 1 n in (16), consequently, the BER performance will be greatly improved. From (27) and (28), we see that this scheme does not involve any matrix inversion, it only requires linear processing at the receiver.…”
Section: B Interference Cancellation (Ic)mentioning
confidence: 99%
See 2 more Smart Citations
“…Another important aspect of code complexity relies on architectural issues introduced by code design. [29] studies the complexity of decoding algorithms that is measured in terms of computational operations such as multiplications, divisions and additions. In Table 3 is listed the number of operations (i.e.…”
Section: Comparison Complexitymentioning
confidence: 99%