Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada === A radiolocation problem using DS-CDMA waveforms with array-based receivers is considered. It is assumed that M snapshots of N(s) Nyquist sample long data are availabl...
Main Authors: | , |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
International Foundation for Telemetering
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/10150/605362 http://arizona.openrepository.com/arizona/handle/10150/605362 |
id |
ndltd-arizona.edu-oai-arizona.openrepository.com-10150-605362 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-arizona.edu-oai-arizona.openrepository.com-10150-6053622016-04-16T03:01:18Z Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry Iltis, Ronald A. Kim, Sunwoo University of California Code-division multiple access radiolocation channel estimation International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada A radiolocation problem using DS-CDMA waveforms with array-based receivers is considered. It is assumed that M snapshots of N(s) Nyquist sample long data are available, with a P element antenna array. In the handshaking radiolocation protocol assumed here, data training sequences are available for all K users. As a result, the received spatial-temporal matrix R ∈ C^(MN(s)x P) is approximated by a sum of deterministic signal matrices S(k)^b ∈ C^(MN(s) N(s)) multiplied by unconstrained array response matrices A(k) ∈ C^(N(s)x P). The unknown delays are not estimated directly. Rather, the delays are implicitly approximated as part of the symbol-length long channel, and solutions sparse in the rows of A are thus sought. The resulting ML cost function is J = ||R - ∑(k=1)^K S(k)^bA(k)||(F). The Generalized Successive Interference Cancellation (GSIC) algorithm is employed to iteratively estimate and cancel multiuser interference. Thus, at the k-th GSIC iteration, the index p(k) = arg min(l ≠ p(1),...,p(k-1)) {min(A(l)) ||R^k-S(l)^bA(l)||(F)} is computed, where R^k = ∑(l=1)^(k-1) S(pl)^bÂ(pl). Matching pursuits is embedded in the GSIC iterations to compute sparse channel/steering vector solutions Â(l). Simulations are presented for DS-CDMA signals received over channels computed using a ray-tracing propagation model. 2003-10 text Proceedings 0884-5123 0074-9079 http://hdl.handle.net/10150/605362 http://arizona.openrepository.com/arizona/handle/10150/605362 International Telemetering Conference Proceedings en_US http://www.telemetry.org/ Copyright © International Foundation for Telemetering International Foundation for Telemetering |
collection |
NDLTD |
language |
en_US |
sources |
NDLTD |
topic |
Code-division multiple access radiolocation channel estimation |
spellingShingle |
Code-division multiple access radiolocation channel estimation Iltis, Ronald A. Kim, Sunwoo Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
description |
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada === A radiolocation problem using DS-CDMA waveforms with array-based receivers is considered. It is
assumed that M snapshots of N(s) Nyquist sample long data are available, with a P element antenna
array. In the handshaking radiolocation protocol assumed here, data training sequences are available for
all K users. As a result, the received spatial-temporal matrix R ∈ C^(MN(s)x P) is approximated by a sum
of deterministic signal matrices S(k)^b ∈ C^(MN(s) N(s)) multiplied by unconstrained array response matrices
A(k) ∈ C^(N(s)x P). The unknown delays are not estimated directly. Rather, the delays are implicitly
approximated as part of the symbol-length long channel, and solutions sparse in the rows of A are
thus sought. The resulting ML cost function is J = ||R - ∑(k=1)^K S(k)^bA(k)||(F). The Generalized Successive
Interference Cancellation (GSIC) algorithm is employed to iteratively estimate and cancel multiuser
interference. Thus, at the k-th GSIC iteration, the index p(k) = arg min(l ≠ p(1),...,p(k-1)) {min(A(l)) ||R^k-S(l)^bA(l)||(F)} is computed, where R^k = ∑(l=1)^(k-1) S(pl)^bÂ(pl). Matching pursuits is embedded in the GSIC iterations to
compute sparse channel/steering vector solutions Â(l). Simulations are presented for DS-CDMA signals
received over channels computed using a ray-tracing propagation model. |
author2 |
University of California |
author_facet |
University of California Iltis, Ronald A. Kim, Sunwoo |
author |
Iltis, Ronald A. Kim, Sunwoo |
author_sort |
Iltis, Ronald A. |
title |
Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
title_short |
Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
title_full |
Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
title_fullStr |
Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
title_full_unstemmed |
Generalized Successive Interference Cancellation/Matching Pursuits Algorithm for DS-CDMA Array-Based Radiolocation and Telemetry |
title_sort |
generalized successive interference cancellation/matching pursuits algorithm for ds-cdma array-based radiolocation and telemetry |
publisher |
International Foundation for Telemetering |
publishDate |
2003 |
url |
http://hdl.handle.net/10150/605362 http://arizona.openrepository.com/arizona/handle/10150/605362 |
work_keys_str_mv |
AT iltisronalda generalizedsuccessiveinterferencecancellationmatchingpursuitsalgorithmfordscdmaarraybasedradiolocationandtelemetry AT kimsunwoo generalizedsuccessiveinterferencecancellationmatchingpursuitsalgorithmfordscdmaarraybasedradiolocationandtelemetry |
_version_ |
1718223365374738432 |