DS-CDMA data and channel estimation with antenna array for radiolocation - GSIC/MP/PSP approach

Research output: Contribution to journalArticle

Abstract

This paper considers a blind DS-CDMA data and channel estimation algorithm using a uniform circular array. The channels are assumed to be sparse and static during a short packet transmission period. The channel estimates for different users yield the explicit estimates of the angle and time of arrivals, which are used for radiolocation. Our algorithm employs three approaches to solve the problem. The generalized successive interference (GSIC) algorithm is used to eliminate the multiple access interference. Matching pursuit (MP) is applied to enforce the channel spar-sity constraint. Per survivor processing (PSP) is then employed to jointly estimate the channel parameters and data symbols. By successfully incorporating them, we present the GSIC/MP/PSP algorithm. Its performance is demonstrated by computer simulations and compared to the GSIC/MP algorithm which requires training sequences.

Original languageEnglish
Pages (from-to)1707-1712
Number of pages6
JournalIEICE Transactions on Communications
VolumeE90-B
Issue number7
DOIs
StatePublished - 2007 Jan 1

Fingerprint

Channel estimation
Antenna arrays
Code division multiple access
Processing
Multiple access interference
Computer simulation

Keywords

  • CDMA
  • Channel estimation
  • Radiolocation

Cite this

@article{d57f7ff2fb3a4a6dbda57331dfade271,
title = "DS-CDMA data and channel estimation with antenna array for radiolocation - GSIC/MP/PSP approach",
abstract = "This paper considers a blind DS-CDMA data and channel estimation algorithm using a uniform circular array. The channels are assumed to be sparse and static during a short packet transmission period. The channel estimates for different users yield the explicit estimates of the angle and time of arrivals, which are used for radiolocation. Our algorithm employs three approaches to solve the problem. The generalized successive interference (GSIC) algorithm is used to eliminate the multiple access interference. Matching pursuit (MP) is applied to enforce the channel spar-sity constraint. Per survivor processing (PSP) is then employed to jointly estimate the channel parameters and data symbols. By successfully incorporating them, we present the GSIC/MP/PSP algorithm. Its performance is demonstrated by computer simulations and compared to the GSIC/MP algorithm which requires training sequences.",
keywords = "CDMA, Channel estimation, Radiolocation",
author = "Sunwoo Kim",
year = "2007",
month = "1",
day = "1",
doi = "10.1093/ietcom/e90-b.7.1707",
language = "English",
volume = "E90-B",
pages = "1707--1712",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
number = "7",

}

DS-CDMA data and channel estimation with antenna array for radiolocation - GSIC/MP/PSP approach. / Kim, Sunwoo.

In: IEICE Transactions on Communications, Vol. E90-B, No. 7, 01.01.2007, p. 1707-1712.

Research output: Contribution to journalArticle

TY - JOUR

T1 - DS-CDMA data and channel estimation with antenna array for radiolocation - GSIC/MP/PSP approach

AU - Kim, Sunwoo

PY - 2007/1/1

Y1 - 2007/1/1

N2 - This paper considers a blind DS-CDMA data and channel estimation algorithm using a uniform circular array. The channels are assumed to be sparse and static during a short packet transmission period. The channel estimates for different users yield the explicit estimates of the angle and time of arrivals, which are used for radiolocation. Our algorithm employs three approaches to solve the problem. The generalized successive interference (GSIC) algorithm is used to eliminate the multiple access interference. Matching pursuit (MP) is applied to enforce the channel spar-sity constraint. Per survivor processing (PSP) is then employed to jointly estimate the channel parameters and data symbols. By successfully incorporating them, we present the GSIC/MP/PSP algorithm. Its performance is demonstrated by computer simulations and compared to the GSIC/MP algorithm which requires training sequences.

AB - This paper considers a blind DS-CDMA data and channel estimation algorithm using a uniform circular array. The channels are assumed to be sparse and static during a short packet transmission period. The channel estimates for different users yield the explicit estimates of the angle and time of arrivals, which are used for radiolocation. Our algorithm employs three approaches to solve the problem. The generalized successive interference (GSIC) algorithm is used to eliminate the multiple access interference. Matching pursuit (MP) is applied to enforce the channel spar-sity constraint. Per survivor processing (PSP) is then employed to jointly estimate the channel parameters and data symbols. By successfully incorporating them, we present the GSIC/MP/PSP algorithm. Its performance is demonstrated by computer simulations and compared to the GSIC/MP algorithm which requires training sequences.

KW - CDMA

KW - Channel estimation

KW - Radiolocation

UR - http://www.scopus.com/inward/record.url?scp=67650832159&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e90-b.7.1707

DO - 10.1093/ietcom/e90-b.7.1707

M3 - Article

AN - SCOPUS:67650832159

VL - E90-B

SP - 1707

EP - 1712

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 7

ER -