Complexity Reduction of Direct Sequence Code Division Multiple Access Receivers
1994 (English)In: IEEE International Conference on Communications, 1994. SUPERCOMM/ICC ’94, Conference Record, ’Serving Humanity Through Communications.’, IEEE , 1994, 1643-1647 p.Conference paper (Refereed)
Considers an asynchronous direct-sequence code division multiple access (DS-CDMA) communication system over an AWGN channel. The authors are interested in reducing the computational complexity of a receiver by lowering the dimensionality of the received vector. Dimension reduction has previously been done in an ad hoc manner by several researchers. The present authors derive an optimum form of dimension reduction. The optimality criteria is that the Cramer-Rao bound on estimators of propagation delay, received phase and power are invariant to the reduction transform.
Place, publisher, year, edition, pages
IEEE , 1994. 1643-1647 p.
AWGN channels, Computational complexity, Delay estimation, Electrical resistance measurement, Matched filters, Multiaccess communication, Phase estimation, Propagation delay, Sensor systems, Telephony
IdentifiersURN: urn:nbn:se:kth:diva-92600DOI: 10.1109/ICC.1994.368754OAI: oai:DiVA.org:kth-92600DiVA: diva2:513877
IEEE International Conference on Communications, 1994. SUPERCOMM/ICC ’94, Conference Record, ’Serving Humanity Through Communications.’, 1-5 May 1994, New Orleans, LA
NR 201408052012-04-032012-04-032012-04-03Bibliographically approved