A system and method for communicating information signals using spread spectrum communication techniques. PN sequences are constructed that provide orthogonality between the users so that mutual interference will be reduced, allowing higher capacity and better link performance. With orthogonal PN codes, the cross-correlation is zero over a predetermined time interval, resulting in no interference between the orthogonal codes, provided only that the code time frames are time aligned with each other. In an exemplary embodiment, signals are communicated between a cell-site and mobile units using direct sequence spread spectrum communication signals. In the cell-to-mobile link, pilot, sync, paging and voice channels are defined. Information communicated on the cell-to-mobile link channels are, in general, encoded, interleaved, bi-phase shift key (BPSK) modulated with orthogonal covering of each BPSK symbol along with quadrature phase shift key (QPSK) spreading of the covered symbols. In the mobile-to-cell link, access and voice channels are defined. Information communicated on the mobile-to-cell link channels are, in general, encoded, interleaved, orthogonal signaling along with QPSK spreading.

System and method for generating signal waveforms in a CDMA cellular telephone system

Written by leading authority Ramjee Prasad, this timely new work offers a complete understanding of OFDM technology and applications in wireless communications systems, placing emphasis on wireless LANs and PANs. OFDM is a key technology for beyond 3G communications, promising robust, high capacity, high speed wireless broadband multimedia networks. In this practical resource, established and new technologies are explained clearly and comprehensively, from OFDM basics to a detailed account of a new technique, hybrid OFDM CDMA slow frequency hopping. The book offers an in-depth treatment of the underlying technologies and applications of PANs and describes and evaluates a practical OFDM system concept. Invaluable for wireless engineers and researchers, this cutting edge new book is a must-have for anyone who needs to understand this critical technology and its implementation in WLANs and WPANs.

OFDM for Wireless Communications Systems

The shadow cluster concept can be used to estimate future resource requirements and to perform call admission decisions in wireless networks. Shadow clusters can be used to decide if a new call can be admitted to a wireless network based on its quality-of-service (QoS) requirements and local traffic conditions. The shadow cluster concept can especially be useful in future wireless networks with microcellular architectures where service will be provided to users with diverse QoS requirements. The framework of a shadow cluster system is completely distributed, and can be viewed as a message system where mobile terminals inform the base stations in their neighborhood about their requirements, position, and movement parameters. With this information, base stations predict future demands, reserve resources accordingly, and admit only those mobile terminals which can be supported adequately. The shadow cluster concept involves some processing and communication overheads. These overheads have no effect on wireless resources, but only on the base stations and the underlying wireline network. It is shown how base stations determine the probabilities that a mobile terminal will be active in other cells at future times, define and maintain shadow clusters by using probabilistic information on the future position of their mobile terminals with active calls, and predict resource demands based on shadow cluster information. In addition, a call admission algorithm is introduced, which uses current traffic and bandwidth utilization conditions, as well as the amount of resources and maximum allowable "dropping probability" being requested. Performance results showing the advantages of the shadow cluster concept are also included.

A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

The emerging massive/large-scale multiple-input multiple-output (LS-MIMO) systems that rely on very large antenna arrays have become a hot topic of wireless communications. Compared to multi-antenna aided systems being built at the time of this writing, such as the long-term evolution (LTE) based fourth generation (4G) mobile communication system which allows for up to eight antenna elements at the base station (BS), the LS-MIMO system entails an unprecedented number of antennas, say 100 or more, at the BS. The huge leap in the number of BS antennas opens the door to a new research field in communication theory, propagation and electronics, where random matrix theory begins to play a dominant role. Interestingly, LS-MIMOs also constitute a perfect example of one of the key philosophical principles of the Hegelian Dialectics, namely, that “quantitative change leads to qualitative change.” In this treatise, we provide a recital on the historic heritages and novel challenges facing LS-MIMOs from a detection perspective. First, we highlight the fundamentals of MIMO detection, including the nature of co-channel interference (CCI), the generality of the MIMO detection problem, the received signal models of both linear memoryless MIMO channels and dispersive MIMO channels exhibiting memory, as well as the complex-valued versus real-valued MIMO system models. Then, an extensive review of the representative MIMO detection methods conceived during the past 50 years (1965–2015) is presented, and relevant insights as well as lessons are inferred for the sake of designing complexity-scalable MIMO detection algorithms that are potentially applicable to LS-MIMO systems. Furthermore, we divide the LS-MIMO systems into two types, and elaborate on the distinct detection strategies suitable for each of them. The type-I LS-MIMO corresponds to the case where the number of active users is much smaller than the number of BS antennas, which is currently the mainstream definition of LS-MIMO. The type-II LS-MIMO corresponds to the case where the number of active users is comparable to the number of BS antennas. Finally, we discuss the applicability of existing MIMO detection algorithms in LS-MIMO systems, and review some of the recent advances in LS-MIMO detection.

/pdf/fifty-years-of-mimo-detection-the-road-to-large-scale-mimos-44ejto9lpw.pdf

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.

An adaptive bandwidth reservation scheme for high-speed multimedia wireless networks

A new iterative receiver for joint detection and decoding of code division multiple access (CDMA) signals is presented. The new scheme is based on a combination of the minimum mean square error (MMSE) criterion and the turbo processing principle by Hagenauer (see Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, p.1-9, 1997). The complexity of the new scheme is of polynomial order in the number of users. The new scheme is applicable to two situations: (a) when the receiver is capable of decoding the signals from all users and (b) when the receiver is only capable of decoding the signals from a subset of users. In the first scenario, we establish that the proposed receiver achieves superior performance to the iterative soft interference cancellation technique under certain conditions. On the other hand, in the second scenario, we argue that the proposed receiver outperforms both the iterative soft interference canceler and the iterative maximum a posteriori (MAP) receiver because of its superior near-far resistance. For operation over fading channels, the estimation of the complex fading parameters for all users becomes an important ingredient in any multiuser detector. In our scheme, the soft information provided by the decoders is used to enhance this estimation process. Two iterative soft-input channel estimation algorithms are presented: the first is based on the MMSE criterion, and the second is a lower-complexity approximation of the first. The proposed multiuser detection algorithm(s) are suitable for both terrestrial and satellite applications of CDMA.

Iterative multiuser detection for coded CDMA signals in AWGN and fading channels

In this paper, we derive optimal admission policies for integrated voice and data traffic in packet radio networks employing code division multiple access (CDMA) with directsequence spread spectrum (DS/SS) signaling. The network performance is measured in terms of the average blocking probability of voice calls and the average delay and packet loss probability of data messages. Our admission scheme determines the number of newly arrived voice users that are accepted in the network so that the long-term blocking probability of voice calls is minimized. In addition, new data arrivals are rejected if the mean delay or the packet loss probability of data exceeds a desirable prespecified level. A semi-Markov decision process (SMDP) is used to model the system operation

Admission policies for integrated voice and data traffic in CDMA packet radio networks

The authors derive optimal admission policies for integrated voice and data traffic in packet radio networks employing code division multiple access (CDMA) with direct-sequence spread spectrum (DS/SS) signaling. The network performance is measured in terms of the average blocking probability of voice calls and the average delay and packet loss probability of data messages. The admission scheme determines the number of newly arrived voice users that are accepted in the network so that the long-term blocking probability of voice calls is minimized. In addition, new data arrivals are rejected if the mean delay or the packet loss probability of data exceeds a desirable prespecified level. A semi-Markov decision process (SMDP) is used to model the system operation. Then, a value iteration algorithm is used to derive the optimal admission control. Two models for the other-user interference of the CDMA system are considered: one based on thresholds and another based on the graceful degradation of the CDMA system performance, and their performance is compared. These admission policies find application in emerging commercial CDMA packet radio networks including cellular networks, personal communication networks, and networks of LEO satellites for global communications. >

/pdf/admission-policies-for-integrated-voice-and-data-traffic-in-ptb9nslwmh.pdf

The performance of noncoherent reception in direct-sequence spread-spectrum multiple-access communications systems is investigated for additive white Gaussian noise channels. Analytical and numerical results on the probability of error are presented for binary and M -ary frequency-shift-keying data modulation with noncoherent demodulation and differential-phase-shift-keying data modulation with differentiallycoherent demodulation. Both synchronous and asynchronous systems are analyzed. Systems which employ deterministic as well as random signature sequences are considered. The multiple access capability of noncoherent DS/SS systems is evaluated and compared to that of coherent DS/SS systems with the same parameters. The comparison shows that the loss in the performance of DS/SSMA systems due to noncoherent reception can be considerably larger than the loss incurred to noncoberent single-user systems operating in additive Gaussian noise.

Performance of Noncoherent Direct-Sequence Spread-Spectrum Multiple-Access Communications

The performance of synchronous and asynchronous hybrid direct-sequence/slow-frequency-hopped spread-spectrum multiple-access communications over additive white Gaussian noise channels is examined. Systems employing binary or quaternary phase-shift-keying modulation with coherent demodulation are investigated. Both deterministic and random signature sequences and frequency-hopping patterns are considered and several possible assignments for them are discussed. It is shown that the multiple-access capability of hybrid spread-spectrum is superior to that of pure frequency-hopped spread-spectrum, and inferior to that of pure direct-sequence spread-spectrum for systems with identical bandwidth expansion which employ the same data modulation and demodulation scheme and random hopping patterns and signature sequences.

E. Geraniotis

Papers

Iterative multiuser detection for coded CDMA signals in AWGN and fading channels

Admission policies for integrated voice and data traffic in CDMA packet radio networks

Admission policies for integrated voice and data traffic in CDMA packet radio networks

Performance of Noncoherent Direct-Sequence Spread-Spectrum Multiple-Access Communications

Coherent Hybrid DS-SFH Spread-Spectrum Multiple-Access Communications