CFP last date
20 May 2024
Reseach Article

Resource Allocation in Cognitive Radio Network using Dirty Paper Coding

Published on May 2012 by Anuj Kumar Sharma, Shiv Kumar
National Conference on Future Aspects of Artificial intelligence in Industrial Automation 2012
Foundation of Computer Science USA
NCFAAIIA - Number 2
May 2012
Authors: Anuj Kumar Sharma, Shiv Kumar
77d5fc8a-a44c-465a-ab42-088db0769ed4

Anuj Kumar Sharma, Shiv Kumar . Resource Allocation in Cognitive Radio Network using Dirty Paper Coding. National Conference on Future Aspects of Artificial intelligence in Industrial Automation 2012. NCFAAIIA, 2 (May 2012), 28-30.

@article{
author = { Anuj Kumar Sharma, Shiv Kumar },
title = { Resource Allocation in Cognitive Radio Network using Dirty Paper Coding },
journal = { National Conference on Future Aspects of Artificial intelligence in Industrial Automation 2012 },
issue_date = { May 2012 },
volume = { NCFAAIIA },
number = { 2 },
month = { May },
year = { 2012 },
issn = 0975-8887,
pages = { 28-30 },
numpages = 3,
url = { /proceedings/ncfaaiia/number2/6737-1017/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Future Aspects of Artificial intelligence in Industrial Automation 2012
%A Anuj Kumar Sharma
%A Shiv Kumar
%T Resource Allocation in Cognitive Radio Network using Dirty Paper Coding
%J National Conference on Future Aspects of Artificial intelligence in Industrial Automation 2012
%@ 0975-8887
%V NCFAAIIA
%N 2
%P 28-30
%D 2012
%I International Journal of Computer Applications
Abstract

Here performance of different cognitive systems are analyzed in different environments and scenarios. The main scenarios are: one cognitive and one primary user, multiple cognitive users and channels and multiple cognitive and primary users. In all scenarios involving one or more primary users, the performance is evaluated over two phases. In Phase 1 the channel is idle, i. e. the primary users are silent, and in Phase 2 the primary users are active on the channel. One of the questions is how can cognitive users transmit simultaneously with the primary user in Phase 2. Schemes that show that this is possible is presented and evaluated and performance is compared to a standard cognitive system only transmitting when the channel is idle. In scenarios with multiple cognitive users and channels, Dirty paper coding Schemes is reviewed. All implementation and simulations were done in MATLAB.

References
  1. Alister G. Burr. Cognitive channel and power allocation: information theoretic bounds. PROCEEDINGS OF THE 4th INTERNATIONAL CONFERENCE ON CROWNCOM, 2009. .
  2. FCC. Et docket no. 03-237. November 2003. Available at http://fjallfoss. fcc. gov/edocs_public/attachmatch/FCC-03-289A1. pdf.
  3. A. Carleial. A case where interference does not reduce capacity (corresp. ). In- formation Theory, IEEE Transactions on, 21(5):569_570, Sep 1975. .
  4. M. Tomlinson. New automatic equaliser employing modulo arithmetic. Electron- ics Letters, 7(5-6):138_139, 1971
  5. M. B. Shenouda and T. N. Davidson. Tomlinson-harashima precoding for broad-cast channels with uncertainty. Selected Areas in Communications, IEEE Journal on, 25(7):1380_1389, September 2007.
  6. Wei Yu, D. P. Varodayan, and J. M. Cio_. Trellis and convolutional precoding for transmitter-based interference presubtraction. Communications, IEEE Transac-tions on, 53(7):1220 _ 1230, july 2005.
  7. M. Costa. Writing on dirty paper (corresp. ). Information Theory, IEEE Trans- actions on, 29(3):439_441, May 1983. .
  8. A. Carleial. Interference channels. Information Theory, IEEE Transactions on, 24(1):60 _ 70, jan 1978.
Index Terms

Computer Science
Information Sciences

Keywords

Cognitive Radio Resource Allocation Dirty Paper Coding Tomlinson-hiroshima Precoding