Skip to main content
Article thumbnail
Location of Repository

2010 17th International Conference on Telecommunications Kd-Tree Codebook for Limited Feedback CDMA

By Kritsada Mamat and Wiroonsak Santipach

Abstract

Abstract—We propose a quantization scheme based on a Kd (K dimensional)-tree algorithm for signature sequence in a reverselink direct sequence (DS)- code division multiple access (CDMA). With a few feedback bits, a receiver quantizes the optimal signature that minimizes interference for a desired user, and relays it to the user via an error-free feedback channel. A user performance depends on the quantization codebook and a number of feedback bits. We show the performance of the proposed Kd-tree codebook with a nearest neighbor criterion and derive the performance approximation. Also we modify the Kd-tree scheme to search for the entry in the codebook, which gives the least interference. Numerical examples show that the Kd-tree codebook performs close to the optimal codebook with only fraction of computational complexity. I

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.8535
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://pirun.ku.ac.th/%7Efengw... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.