Select a calendar:
Filter August Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Conferences, Lectures, & Seminars
Events for August
-
Network Coding for Wireless Networks
Thu, Aug 03, 2006 @ 03:30 PM - 04:30 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
SPEAKER: Prof. Muriel Medard, MITABSTRACT: The use of network coding in wireless networks has emerged as an active area of research both in the information theoretic and systems community. In this talk, we overview some of the main aspects of network coding for wireless systems. We consider both performance advantages, such as throughput, energy consumption and delay, and algorithmic issues. We show that network coding in multicast situations leads to simplified optimality conditions over routing-based approaches and to the possibility of distributed operation. For non-multicast cases, we show that network coding schemes are necessarily sub-optimal, yet even heuristics can significantly outperform traditional routing-based approaches. BIO: Muriel Medard is a Harold E. and Esther Edgerton Associate Professor in the Electrical Engineering and Computer Science at MIT and the Associate Director of the Laboratory for Information and Decision Systems. She was previously an Assistant Professor in the Electrical and Computer Engineering Department and a member of the Coordinated Science Laboratory at the University of Illinois Urbana-Champaign. From 1995 to 1998, she was a Staff Member at MIT Lincoln Laboratory in the Optical Communications and the Advanced Networking Groups. Professor Medard received B.S. degrees in EECS and in Mathematics in 1989, a B.S. degree in Humanities in 1990, a M.S. degree in EE 1991, and a Sc D. degree in EE in 1995, all from the Massachusetts Institute of Technology (MIT), Cambridge. She serves as an Associate Editor for the Optical Communications and Networking Series of the IEEE Journal on Selected Areas in Communications, as an Associate Editor in Communications for the IEEE Transactions on Information Theory and as a Guest Editor for the Joint special issue of the IEEE Transactions on Information Theory and the IEEE/ACM Transactions on Networking on Networking and Information Theory . She has served as a Guest Editor for the IEEE Journal of Lightwave Technology and as an Associate Editor for the OSA Journal of Optical Networking.
Professor Medard's research interests are in the areas of network coding and reliable communications, particularly for optical and wireless networks. She was awarded the IEEE Leon K. Kirchmayer Prize Paper Award 2002 for her paper, "The Effect Upon Channel Capacity in Wireless Communications of Perfect and Imperfect Knowledge of the Channel," IEEE Transactions on Information Theory, Volume 46 Issue 3, May 2000, Pages: 935-946. She was co- awarded the Best Paper Award for G. Weichenberg, V. Chan, M. Medard, "Reliable Architectures for Networks Under Stress", Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), October 2003, Banff, Alberta, Canada. She received a NSF Career Award in 2001 and was co-winner 2004 Harold E. Edgerton Faculty Achievement Award, established in 1982 to honor junior faculty members "for distinction in research, teaching and service to the MIT community."HOST: Prof. Michael J. Neely, mjneely@usc.eduLocation: Hughes Aircraft Electrical Engineering Center (EEB) - -248
Audiences: Everyone Is Invited
Contact: Mayumi Thrasher
-
Ph.D. Thesis Defense: Jordan Melzer (Communication Sciences Institute, USC)
Mon, Aug 14, 2006 @ 10:00 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Jordan Melzer (Communication Sciences Institute, USC)TITLE: Low complexity turbo-like codesTHESIS ADVISOR: Keith Chugg (USC)ABSTRACT: Error-control coding is a key feature of most modern
communications systems, allowing close to a factor of ten in increased
receiver sensitivity. We explore two aspects of low-cost error-control
code decoders. First we design single decoders that provide competitive
performance-complexity trade-offs over a wide range of operation. We
introduce a new class of codes, show design rules and design techniques
for this class, and design new codes in this class able to give, from a
single decoder, extremely good performance over a range of decoding
effort, block sizes, and code rates and give close to no performance
penalty when generating rate-compatible codewords.
The flexibility and
competitive performance-complexity profile
of these decoder designs
allows them to be good choices both for systems that support a range of
operating conditions and those
that don't.Next we explore decoders with hardware errors. We show that
error-control code decoders that have faults in memory may exhibit very
little performance degradation and suggest design techniques that
virtually eliminate the performance loss from a single
error.Location: Hughes Aircraft Electrical Engineering Center (EEB) - 539 (10:00am)
Audiences: Everyone Is Invited
Contact: michael neely
-
Smart Camera Systems Technology Roadmap Seminar by Bruce Flinchbaugh
Tue, Aug 22, 2006 @ 10:30 AM - 11:30 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Consider a 'smart' camera to be a software-programmable camera in which video data digitized from an image sensor is fully exposed to software for processing. In this talk we review the technology trends of programmable processors used in millions of smart cameras today. We consider the application-specific requirements of real-time image, video and vision processing in camera systems, emphasizing consumer electronics, automotive vision and video surveillance equipment. Finally, the requirements and trends are extrapolated to project future smart camera systems, as well as related challenges for vision research.Bio:
Dr. Bruce Flinchbaugh, TI Fellow, manages video and image processing projects in the DSP R&D Center at Texas Instruments. Current activities target vision systems, image processing and adoption of H.264/AVC and China AVS video standards, and OpenGL ES graphics in digital cameras and cellular phones. Since 1982, Bruce and his teams have enabled TI products for diverse systems including the development of algorithms and DSP-based prototypes for intelligent video surveillance, network video recording and digital cameras. He holds twenty patents for TI methods and has published or presented in over 60 technical forums including journals, industry trade magazines and conferences.Host: Professor C.-C. Jay Kuo, x04658, cckuo@sipi.usc.edu
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Gloria Halfacre
-
On Average Throughput and Alphabet Size in Network Coding
Mon, Aug 28, 2006 @ 11:00 AM - 12:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
SPEAKER: Dr. Emina Soljanin, Bell LaboratoriesABSTRACT: Network coding, envisioned as an extension of multicommodity data routing, offers two main advantages with respect to routing. First, this technique offers large symmetric throughout (the one achievable uniformly by all receivers) benefits in some directed networks. Second, while optimal multicommodity routing is NP hard, network coding can be performed in a randomized and decentralized manner with high probability of success when the code alphabet size is sufficiently large. In this talk, we will settle the question about the benefits that network coding offers in directed multicast networks with respect to the receivers' average throughput achievable by routing. We will also address certain issues concerning the network code alphabet size as a tradeoff between routing and coding as well as between deterministic and randomized coding, and show that, for certain classes of networks, there are huge savings to be made in terms of alphabet size if one resorts to routing as opposed to coding with a small throughput loss, or to deterministic as opposed to random coding with no throughput loss.BIO: Emina Soljanin received the B.S. degree in Electrical Engineering from Sarajevo University, Bosnia and Herzegovina in 1986, and the M.S. and Ph.D. degrees in Electrical Engineering from Texas A&M University, College Station, in 1989 and 1994.
From 1986 to 1988, she worked in the Energoinvest Company, Bosnia and Herzegovina, developing optimization algorithms and software for power system control. After graduating from Texas A&M, she joined Bell Laboratories, Murray Hill, NJ, where she now serves as a Distinguished Member Staff in the Mathematical Sciences Research Center. Her research interests are in the broad area of communications, information and coding theory as well as their applications in storage and wireless systems, and, more recently, quantum computation and statistics.
Dr. Soljanin was the recipient of the 1992 Texas A&M University Electrical Engineering Department Fouraker fellowship. She served as a Technical Proof-Reader, 1990-1992, and as the Associate Editor for Coding Techniques, 1997-2000, for the IEEE Transactions on Information Theory. She was a co-chair for DIMACS Special Focus on Computational Information Theory and Coding 2001-2005.Host: Prof. Urbashi Mitra, ubli@usc.eduLocation: Hughes Aircraft Electrical Engineering Center (EEB) - -248
Audiences: Everyone Is Invited
Contact: Mayumi Thrasher
-
Probability Density Evolution Method: a new approach in Stochastic Mechanics
Wed, Aug 30, 2006 @ 02:00 PM - 03:00 PM
Sonny Astani Department of Civil and Environmental Engineering
Conferences, Lectures, & Seminars
Speaker:Dr. Jianbing Chen
Associate Professor, School of Civil Engineering, Tongji University, P. R. China
Visiting Scholar, Department of Civil and Environmental Engineering, USC, USAAbstract: Stochastic mechanics has gained increasing interests in the past decades. Meanwhile, great efforts have been devoted to the discipline, coming up with many valuable contributions leading to some approaches validated in some important aspects. The presentation will deal with a newly developed probability density evolution method, which starts from revisiting the principle of preservation of probability. Based on the random event description (Lagrangian description), a partial differential equation governing evolution of the one- or any arbitrary- dimensional joint probability density function could be set up. Numerically solving this equation combining the deterministic dynamic analysis and the finite difference method will then yield the instantaneous probability density function of any arbitrary response quantities of interest. The probability density evolution method could be applied to static/dynamic stochastic response analysis of linear/nonlinear structures, dynamic reliability evaluation and system reliability evaluation, etc. Some key problems needing further investigations are discussed.Location: Kaprielian Hall (KAP) - rielian Hall, Room 203
Audiences: Everyone Is Invited
Contact: Evangeline Reyes
