1979
DOI: 10.1109/taes.1979.308816
|View full text |Cite
|
Sign up to set email alerts
|

Optimum Detection of Code Division Multiplexed Signals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
54
0

Year Published

1999
1999
2011
2011

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 149 publications
(54 citation statements)
references
References 1 publication
0
54
0
Order By: Relevance
“…Therefore, it is easily shown that (27) Substituting (25) and (27) into (24) yields the bit error probability of the D-DFD as - (28) The asymptotic effective energy corresponding to each product of -function terms in the double summation in (28) is Since the term corresponding to the slowest exponential rate of decay dominates the error probability as , we have that the asymptotic effective energy of user is - (29) Equations (28) and (29) give exact formulas for the BER and AEE of the D-DFD. Note, however, that the properties of the AEE's of the D-DFD obtained in [43], i.e., the bounds of (21) and the equalities in (22) and (23) may be tedious to derive by using of the exact formula for AEE in (29).…”
Section: Ber and Aee Analysis Of The D-dfdmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, it is easily shown that (27) Substituting (25) and (27) into (24) yields the bit error probability of the D-DFD as - (28) The asymptotic effective energy corresponding to each product of -function terms in the double summation in (28) is Since the term corresponding to the slowest exponential rate of decay dominates the error probability as , we have that the asymptotic effective energy of user is - (29) Equations (28) and (29) give exact formulas for the BER and AEE of the D-DFD. Note, however, that the properties of the AEE's of the D-DFD obtained in [43], i.e., the bounds of (21) and the equalities in (22) and (23) may be tedious to derive by using of the exact formula for AEE in (29).…”
Section: Ber and Aee Analysis Of The D-dfdmentioning
confidence: 99%
“…The conditional error probabilities in (25) and (27) are no longer computable because the conditioning on past decisions alters the distribution of the additive noise in the current decision statistic (from prior to posterior) in a way that is difficult to characterize analytically (see [36]). A different approach is necessary.…”
Section: E Performance Analysis Of Arbitrary Dfd'smentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, CDMA performance can be greatly enhanced by multiuser receivers which compensate for MAI. One of the first investigations into multiuser reception of CDMA signals was presented in [9].…”
Section: Introductionmentioning
confidence: 99%
“…However, unfortunately, these algorithms usually result in a noticeable degradation in the performance. Examples of such polynomial time algorithms include: Zero Forcing Detector (ZFD) [6], [7], Minimum Mean Squared Error Detector (MMSED) [8], [9], Decision Feedback Detector (DFD) and Vertical Bell Laboratories Layered Space-Time Nulling and Cancellation Detector (VBLAST Detector) [10], [11].…”
Section: Introductionmentioning
confidence: 99%