Sequence design for symbol-asynchronous CDMA with power or rate constraints

Kasturi, Jyothiram and Sundaresan, Rajesh (2007) Sequence design for symbol-asynchronous CDMA with power or rate constraints. In: 2nd International Conference on Communication Systems Software and Middleware, JAN 07-12, 2007, Bangalore, INDIA.

PDF sequence.pdf - Published Version Restricted to Registered users only Download (697kB) | Request a copy

Abstract

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	asynchronous;code division multiple access;resource allocation;sum capacity;uplink.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	28 Apr 2010 06:17
Last Modified:	19 Sep 2010 06:00
URI:	http://eprints.iisc.ac.in/id/eprint/27325

Actions (login required)

View Item