TY - JOUR
T1 - Joint timing and channel estimation for bandlimited long-code-based MC-DS-CDMA
T2 - A low-complexity near-optimal algorithm and the CRLB
AU - Wang, Shuai
AU - Chen, Sheng
AU - Wang, Aihua
AU - An, Jianping
AU - Hanzo, Lajos
PY - 2013
Y1 - 2013
N2 - Joint Timing and Channel Estimation (JTCE) for bandlimited long-code-aided Multi-Carrier Direct-Sequence Code Division Multiple Access (MC-DS-CDMA) systems is investigated. We establish the optimal multiuser timing and channel estimates for the uplink MC-DS-CDMA receiver by minimising a weighted least squares cost function with respect to K independent parameters, where K is the number of active users. A guided random search procedure known as Repeated Weighted Boosting Search (RWBS) is invoked for numerically solving this challenging multivariate optimisation problem, and thereby for producing near-optimal timing and channel estimates. The Cramer-Rao Lower Bound (CRLB) for the JTCE problem of interest is derived to benchmark the performance of the proposed RWBS based estimator. Quantitatively, for the scenario of K=10 users, Eb/N0≥3 dB where Eb is the energy per bit and N0 the single-sided noise power spectral density, and for a near-far ratio of 10 dB, the RWBS based estimator using an observation window of 20 symbols is shown to approach the CRLB at a complexity 10 orders of magnitude lower in comparison to its full maximum likelihood search based counterpart. The proposed algorithm does not require the transmission of known pilots, yet it is capable of handling time-variant channel states.
AB - Joint Timing and Channel Estimation (JTCE) for bandlimited long-code-aided Multi-Carrier Direct-Sequence Code Division Multiple Access (MC-DS-CDMA) systems is investigated. We establish the optimal multiuser timing and channel estimates for the uplink MC-DS-CDMA receiver by minimising a weighted least squares cost function with respect to K independent parameters, where K is the number of active users. A guided random search procedure known as Repeated Weighted Boosting Search (RWBS) is invoked for numerically solving this challenging multivariate optimisation problem, and thereby for producing near-optimal timing and channel estimates. The Cramer-Rao Lower Bound (CRLB) for the JTCE problem of interest is derived to benchmark the performance of the proposed RWBS based estimator. Quantitatively, for the scenario of K=10 users, Eb/N0≥3 dB where Eb is the energy per bit and N0 the single-sided noise power spectral density, and for a near-far ratio of 10 dB, the RWBS based estimator using an observation window of 20 symbols is shown to approach the CRLB at a complexity 10 orders of magnitude lower in comparison to its full maximum likelihood search based counterpart. The proposed algorithm does not require the transmission of known pilots, yet it is capable of handling time-variant channel states.
KW - Cramer-Rao lower bound (CRLB)
KW - Joint timing and channel estimation (JTCE)
KW - multi-carrier direct-sequence code division multiple access (MC-DS-CDMA)
KW - repeated weighted boosting search (RWBS)
UR - http://www.scopus.com/inward/record.url?scp=84878733960&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2013.021913.120858
DO - 10.1109/TCOMM.2013.021913.120858
M3 - Article
AN - SCOPUS:84878733960
SN - 1558-0857
VL - 61
SP - 1998
EP - 2011
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 5
M1 - 6469000
ER -