By Topic

Cognitive Code-Division Links with Blind Primary-System Identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Ming Li ; Department of Electrical Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA ; Stella N. Batalama ; Dimitris A. Pados ; Tommaso Melodia
more authors

We consider the problem of cognitive code-division channelization (simultaneous power and code-channel allocation) for secondary transmission links co-existing with an unknown primary code-division multiple-access (CDMA) system. We first develop a blind primary-user identification scheme to detect the binary code sequences (signatures) utilized by primary users. To create a secondary link we propose two alternative procedures -one of moderate and one of low computational complexity- that optimize the secondary transmitting power and binary code-channel assignment in accordance with the detected primary code channels to avoid "harmful" interference. At the same time, the optimization procedures guarantee that the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum SINR linear secondary receiver is no less than a certain threshold to meet secondary transmission quality of service (QoS) requirements. The extension of the channelization problem to multiple secondary links is also investigated. Simulation studies presented herein illustrate the theoretical developments.

Published in:

IEEE Transactions on Wireless Communications  (Volume:10 ,  Issue: 11 )