Review on codes for multiple access communications

被引:0
|
作者
Mahalakshmi, I [1 ]
Karunakaran, S [1 ]
机构
[1] Ctr Electromagnet, SAMEER, Madras 600113, Tamil Nadu, India
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The radio spectrum is a finite resource and it is important that it is to be utilized efficiently by all users. Steps are required to be taken to deploy modulation and multiple access techniques that improve spectrum utilization. Code Division Multiple Access (CDMA) is a multiple access technique based on Spread Spectrum (SS) techniques. CDMA users are uniquely identified by a code sequence embedded as an address within the carrier waveform. To recover the signal, the receiver cross correlates the sum of incoming signals against an address sequence. Recovering the desired data, requires the received signal to have properties that minimize the interference resulting from the presence of other signals. CDMA systems are dependent on the design of codes that are orthogonal to one another to minimize interference resulting from the presence of other signals. A goal of SS system designer for multiple access communications is to find a set of spreading codes (or) sequences such that as many users as possible can use a band of frequencies with as little interference as possible. This paper reviews the codes used for CDMA applications. A detailed description have been given on the generation of codes, its properties and its applications based on its properties along with the example system.
引用
收藏
页码:213 / 220
页数:8
相关论文
共 50 条
  • [41] Multiple Access with Distance Preserving Mappings for Permutation Codes
    Shongwe, Thokozani
    Swart, Theo G.
    Ferreira, Hendrik C.
    AFRICON, 2013, 2013, : 392 - 396
  • [42] Some limits on time orthogonal multiple access codes
    Al-Sammak, AJ
    Kirlin, RL
    Driessen, PF
    2003 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS, AND SIGNAL PROCESSING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2003, : 947 - 949
  • [43] Spatially Coupled Codes over the Multiple Access Channel
    Kudekar, Shrinivas
    Kasai, Kenta
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 2816 - 2820
  • [44] COMMENTS ON CONVOLUTIONAL TREE CODES FOR MULTIPLE ACCESS CHANNELS
    PETERSON, RL
    COSTELLO, DJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (05) : 627 - 628
  • [45] Signature Codes for a Noisy Adder Multiple Access Channel
    Erdogan, Gokberk
    Maringer, Georg
    Polyanskii, Nikita
    2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 476 - 481
  • [46] Separable Codes for the Symmetric Multiple-Access Channel
    D'yachkov, Arkadii
    Polyanskii, Nikita
    Shchukin, Vladislav
    Vorobyev, Ilya
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 291 - 295
  • [47] Turbo codes for the multiple access channel with correlated senders
    Zhao, Y
    Garcia-Frias, J
    INTERNET QUALITY OF SERVICE, 2003, 5245 : 77 - 84
  • [48] Signature codes for noisy multiple access adder channel
    Vladimir Gritsenko
    Grigory Kabatiansky
    Vladimir Lebedev
    Alexey Maevskiy
    Designs, Codes and Cryptography, 2017, 82 : 293 - 299
  • [49] Spatially Coupled LDPC Codes and the Multiple Access Channel
    Cammerer, Sebastian
    Wang, Xiaojie
    Ma, Yingyan
    ten Brink, Stephan
    2019 53RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2019,
  • [50] A Functional Construction of Codes for Multiple Access and Broadcast Channels
    Ganguly, Shouvik
    Wang, Lele
    Kim, Young-Han
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1581 - 1586