Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781391
View full text | Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Therefore, in (14) is a function of the input SNR . We express this function as (16) We also define the bit-error rate (BER) performance for the as a function of as (17) Both and can be obtained by the Monte Carlo method similar to [4], [13], [14], and [18]. Fig.…”
Section: Performance Evaluationmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore, in (14) is a function of the input SNR . We express this function as (16) We also define the bit-error rate (BER) performance for the as a function of as (17) Both and can be obtained by the Monte Carlo method similar to [4], [13], [14], and [18]. Fig.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…2 shows two examples of and . One is for a length- 16 repetition code, and the other is for a concatenation of a rate-1/2 convolutional code with generator polynomials followed by a length-8 repetition code. In general, both and are decreasing functions of over with , , , and .…”
Section: Performance Evaluationmentioning
confidence: 99%
See 2 more Smart Citations
“…Different approaches have been investigated. For ideal (or nearly ideal) forward error control (FEC) codes, successive stripping [6] [9] (or "onion peeling" [7]) can be used. For more practical codes, power allocation for iterative multiuser detection has been discussed [8].…”
Section: Introductionmentioning
confidence: 99%