The Application of Programmable DSPs in Mobile Communications 2001
DOI: 10.1002/0470845902.ch5
|View full text |Cite
|
Sign up to set email alerts
|

The Use of Programmable DSPs in Antenna Array Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2005
2005
2005
2005

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…It is convenient to vectorize the notation in equation (16) by assuming that we collect M samples from each period of the spreading code. We therefore define the k delayed and f k Dopplershifted spreading vector by (17) where n m ,m ϭ 1..M is a set of arbitrary M samples chosen within a single spreading-code (repetition) period. To avoid edge effects, we assume that the M samples are selected so that the n m T s Ϫ k values do not cross a code boundary.…”
Section: Maximum-likelihood Detection and Estimation Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…It is convenient to vectorize the notation in equation (16) by assuming that we collect M samples from each period of the spreading code. We therefore define the k delayed and f k Dopplershifted spreading vector by (17) where n m ,m ϭ 1..M is a set of arbitrary M samples chosen within a single spreading-code (repetition) period. To avoid edge effects, we assume that the M samples are selected so that the n m T s Ϫ k values do not cross a code boundary.…”
Section: Maximum-likelihood Detection and Estimation Modelmentioning
confidence: 99%
“…and we can write the maximum-likelihood objective function, ML , as a function of (f k , k ), while holding other (f j , j ) fixed, as (41) Only the second term in equation (41) actually depends on (f k , k ); therefore, using the Herimitian symmetry property of the projection operator, we can write the second term in equation (41) as [17,18] (42)…”
Section: ϫ A(f)d ϭ X ϫ A(f)[a(f) H A(f)] ϫ1mentioning
confidence: 99%