University of Southern California Homepage University of Southern California Communication Sciences Institute Electrical Engineering Homepage USC Viterbi School of Engineering
CSI Home People Research Courses&Degrees Industry Affiliates News&Events
Recent Research Highlights

 

 

This page contains brief summaries of recent research conducted by CSI researchers. This content will change each time the page is loaded or you may view all summaries.


Ultra-Wideband Propagation
Evaluation of an Ultra-Wideband Propagation Channel
Dr. Jean-Marc Cramer, Prof. Robert A. Scholtz & Prof. Moe Z. Win

Typical received UWB waveform Ultra-wideband (UWB) radio uses signals with fractional bandwidth (3dB bandwidth divided by center frequency) greater than 25%.

Unlike narrowband signals, the received signal in an UWB system often bears little resemblance to the signal driving the transmitter's antenna.  Waves reflecting off or penetrating through objects in the channel can undergo significant filtering, and the antennas at both the transmit and receive ends cause pulse-shaping that can vary with direction of transmission and reception.  The result is the received pulse shape associated with a given path is dependent on that path.

This work provides a needed algorithm, called the Sensor-CLEAN algorithm, for taking into account these special bandwith-dependent effects, so that quantitative comparisons of the UWB channel can be made with more narrowband results, and the performance of UWB communication systems predicted.

The algorithm was applied to measured indoor propagation data to develop models for the time- and angle-of-arrival of UWB signals, which combined with the Sensor-CLEAN method for processing measured data also enables the future statitstical description of propagation environments in other building architectures and geometries.

Learn More:
  • J.M. Cramer, R. A. Scholtz and M.Z. Win, "Evaluation of an Ultra-Wideband Propagation Channel," IEEE Transactions on Antennas and Propagation, Vol. 50, May 2002, pp. 561-570.  (This paper received the 2003 A. Shelkunoff Transactions Prize Paper Award of the IEEE Antennas and Propagation Society)
  • M. Z. Win and R. A. Scholtz, "Impulse Radio: How it works," IEEE Communications Letters, Vol. 2, Feb.1998, pp. 36-38.
  • Q. Spencer, M. Rice, B. Jeffs and M. Jensen, "A Statistical Model for the Angle-of-Arrival in Indoor Multipath Propagation," IEEE Vehicular Technology Conference, Vol. 7, May 1997, pp. 1415-1419.

Wireless Resource Management
Prof. Mehmet Akar, Prof. Urbashi Mitra, Ph.D. Candidate Ayanendu Paul, & Prof. Michael G. Safonov

Dynamic resource allocation in wireless networks is important to maintain reliable communication links between base stations and mobile users. In order to achieve this objective, the transmitted powers/rates, base station assignments, and allocated channels may need to be updated as the mobile user moves in a cellular environment or when a new call is admitted to the network. Although these resources can be controlled individually, joint allocation improves capacity and battery life, and decreases interference.

In this work, we use control theoretic methods including tools of hybrid/switched systems, adaptive control, optimization, and dynamic programming to develop distributed, fast and robust resource allocation algorithms that take into account the effects of channel fading and mobility, and achieve a tradeoff between the satisfaction levels of the mobile users and the network operator, thereby provide satisfactory service for the users while reducing the burden on the network such as undesired switching between base stations.

Learn More:
  • M. Akar and U. Mitra, "Joint downlink power and handoff control using a hybrid systems framework," in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), vol. 3, pp. 1614-1621, San Francisco, CA, April 2003.
  • M. Akar and U. Mitra, "Soft handoff algorithms for CDMA cellular networks," in IEEE Transactions on Wireless Communications, vol. 2, no. 6, pp. 1259-1274, November 2003.
  • M. Akar and U. Mitra, "Variations on optimal and suboptimal handoff control for wireless communication networks," in IEEE Transactions in Selected Areas in Communications: Wireless, vol. 19, no. 6, pp. 1173-1185, June 2001.

Extraction of Good Graphical Models of Codes
Prof. Keith M. Chugg & Ph.D. Candidate Thomas R. Halford

We distiguish between two modeling problems: model extraction and model construction. The construction problem has been largely addressed by the coding theory communtity: given a set of design parameters, there exist well-known methods for designing codes with graphical models that imply low-complexity, near-optimal decoding algorithms. The extraction problem, however, is largely unsolved. Given an arbitrary linear block code, there exist no known methods for extracting good graphical models. For specific codes, there do exist good graphical models. One such example is the tail-biting trellis-based model of the Golay code. Current known good graphical models of specific codes depend on particular algebraic properties of those codes and do not extend to arbitrary codes. We are developing heuristics for the systematic extraction of good graphical models of arbitrary linear block codes and also in studying the fundamental tradeoff between the algebraic structure of a code and the complexity of allowable graphical models with a given topology.

Learn More:
  • T. R. Halford and K. M. Chugg, "An Algorithm for Counting Cycles in Bipartite Graphs," in IEEE Trans. Information Theory, Jan. 2006.
  • G. D. Forney Jr., "Codes on Graphs: Normal Realizations", in IEEE Trans. Information Theory, Feb. 2001.