Return to search

Optimization of Code-Constellation for M-ary CDMA Systems

In this thesis, we propose and evaluate quasi-optimal algorithms for solving the code-constellation optimization problem in M-ary CDMA system. The M-ary CDMA system is a new CDMA architecture. The more spreading codes used in each user, and the higher bandwidth efficiency can achieve with more bits packed in each symbol. We use a code, which we refer to as ¡§mapping code¡¨, to help form a multidimensional spherical code-constellation. The M codewords of the mapping code correspond one-to-one to the M points on the code-constellation. Thus, the code-constellation optimization problem is a combinatorial optimization problem. We present that an exhaustive search (ES) algorithm would have compute and check all possible subset, and then this problem becomes a NP-hard. Based on the exhaustive search algorithm, we propose symmetric points search (SPS) algorithm to reduce computation
complexity, but it is not optimal algorithm. In addition, we propose a quasi-optimal algorithm, namely Manhattan distance search (MDS) algorithm. Numerical results and comparisons are provided to illustrate that the computation complexity of the Manhattan distance search algorithm increases linearly with dimension of code-constellation and its performance is better than others.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0902106-171335
Date02 September 2006
CreatorsChen, Yang-Wen
ContributorsChao-Tang Yu, Chin-Der Wann, Hsiao-Hwa Chen
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageCholon
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902106-171335
Rightsnot_available, Copyright information available at source archive

Page generated in 0.0021 seconds