Edward A. Lee

This book concerns digital communication. Specifically, we treat the transport of bit streams from one geographical location to another over various physical media, such as wire pairs, coaxial cable, optical fiber, and radio. We also treat multiple-access channels, where there are potentially multiple transmitters and receivers sharing a common medium. Ten years have elapsed since the Second Edition, and there have been remarkable advances in wireless communication, including cellular telephony and wireless local-area networks. This Third Edition expands treatment of communication theories underlying wireless, and especially advanced techniques involving multiple antennas, which tum the traditional single-input single-output channel into a multiple-input multiple-output (MIMO) channel. This is more than a trivial advance, as it stimulates many advanced techniques such as adaptive antennas and coding techniques that take advantage of space as well as time. This is reflected in the addition of two new chapters, one on the theory of MIMO channels, and the other on diversity techniques for mitigating fading. The field of error-control coding has similarly undergone tremendous changes in the past decade, brought on by the invention of turbo codes in 1993 and the subsequent rediscovery of Gallager's low-density parity-check codes. Our treatment of error-control coding has been rewritten to reflect the current state of the art. Other materials have been reorganized and reworked, and three chapters from the previous edition have been moved to the book's Web site to make room.

Software Synthesis from Dataflow Graphs addresses the problem of generating efficient software implementations from applications specified as synchronous dataflow graphs for programmable digital signal processors (DSPs) used in embedded real- time systems. The advent of high-speed graphics workstations has made feasible the use of graphical block diagram programming environments by designers of signal processing systems. A particular subset of dataflow, called Synchronous Dataflow (SDF), has proven efficient for representing a wide class of unirate and multirate signal processing algorithms, and has been used as the basis for numerous DSP block diagram-based programming environments such as the Signal Processing Workstation from Cadence Design Systems, Inc., COSSAP from Synopsys® (both commercial tools), and the Ptolemy environment from the University of California at Berkeley. A key property of the SDF model is that static schedules can be determined at compile time. This removes the overhead of dynamic scheduling and is thus useful for real-time DSP programs where throughput requirements are often severe. Another constraint that programmable DSPs for embedded systems have is the limited amount of on-chip memory. Off-chip memory is not only expensive but is also slower and increases the power consumption of the system; hence, it is imperative that programs fit in the on-chip memory whenever possible. Software Synthesis from Dataflow Graphs reviews the state-of-the-art in constructing static, memory-optimal schedules for programs expressed as SDF graphs. Code size reduction is obtained by the careful organization of loops in the target code. Data buffering is optimized by constructing the loop hierarchy in provably optimal ways for many classes of SDF graphs. The central result is a uniprocessor scheduling framework that provably synthesizes the most compact looping structures, called singleappearance schedules, for a certain class of SDF graphs. In addition, algorithms and heuristics are presented that generate single appearance schedules optimized for data buffering usage. Numerous practical examples and extensive experimental data are provided to illustrate the efficacy of these techniques.

This book concerns digital communication. Specifically, we treat the transport of bit streams from one geographical location to another over various physical media, such as wire pairs, coaxial cable, optical fiber, and radio. We also treat multiple-access channels, where there are potentially multiple transmitters and receivers sharing a common medium. Ten years have elapsed since the Second Edition, and there have been remarkable advances in wireless communication, including cellular telephony and wireless local-area networks. This Third Edition expands treatment of communication theories underlying wireless, and especially advanced techniques involving multiple antennas, which tum the traditional single-input single-output channel into a multiple-input multiple-output (MIMO) channel. This is more than a trivial advance, as it stimulates many advanced techniques such as adaptive antennas and coding techniques that take advantage of space as well as time. This is reflected in the addition of two new chapters, one on the theory of MIMO channels, and the other on diversity techniques for mitigating fading. The field of error-control coding has similarly undergone tremendous changes in the past decade, brought on by the invention of turbo codes in 1993 and the subsequent rediscovery of Gallager's low-density parity-check codes. Our treatment of error-control coding has been rewritten to reflect the current state of the art. Other materials have been reorganized and reworked, and three chapters from the previous edition have been moved to the book's Web site to make room.

This cutting-edge, practical guide brings you an independent, comprehensive introduction to DSP processor technology. A thorough tutorial and overview of DSP architectures, this book incorporates a broad range of today's product offerings in examples that illustrate DSP features and capabilities. This book is especially useful to electronic systems designers, processor architects, engineering managers, and product planners.

Software Synthesis from Dataflow Graphs addresses the problem of generating efficient software implementations from applications specified as synchronous dataflow graphs for programmable digital signal processors (DSPs) used in embedded real- time systems. The advent of high-speed graphics workstations has made feasible the use of graphical block diagram programming environments by designers of signal processing systems. A particular subset of dataflow, called Synchronous Dataflow (SDF), has proven efficient for representing a wide class of unirate and multirate signal processing algorithms, and has been used as the basis for numerous DSP block diagram-based programming environments such as the Signal Processing Workstation from Cadence Design Systems, Inc., COSSAP from Synopsys® (both commercial tools), and the Ptolemy environment from the University of California at Berkeley. A key property of the SDF model is that static schedules can be determined at compile time. This removes the overhead of dynamic scheduling and is thus useful for real-time DSP programs where throughput requirements are often severe. Another constraint that programmable DSPs for embedded systems have is the limited amount of on-chip memory. Off-chip memory is not only expensive but is also slower and increases the power consumption of the system; hence, it is imperative that programs fit in the on-chip memory whenever possible. Software Synthesis from Dataflow Graphs reviews the state-of-the-art in constructing static, memory-optimal schedules for programs expressed as SDF graphs. Code size reduction is obtained by the careful organization of loops in the target code. Data buffering is optimized by constructing the loop hierarchy in provably optimal ways for many classes of SDF graphs. The central result is a uniprocessor scheduling framework that provably synthesizes the most compact looping structures, called singleappearance schedules, for a certain class of SDF graphs. In addition, algorithms and heuristics are presented that generate single appearance schedules optimized for data buffering usage. Numerous practical examples and extensive experimental data are provided to illustrate the efficacy of these techniques.

This supplement contains worked out solutions to the chapter end problem sets found in Digital Communication, Second Edition, ISBN 0-7923-9391-0.

This book concerns digital communication. Specifically, we treat the transport of bit streams from one geographical location to another over various physical media, such as wire pairs, coaxial cable, optical fiber, and radio waves. Further, we cover the mul­ tiplexing, multiple access, and synchronization issues relevant to constructing com­ munication networks that simultaneously transport bit streams from many users. The material in this book is thus directly relevant to the design of a multitude of digital communication systems, including for example local and metropolitan area data net­ works, voice and video telephony systems, the integrated services digital network (ISDN), computer communication systems, voiceband data modems, and satellite communication systems. We extract the common principles underlying these and other applications and present them in a unified framework. This book is intended for designers and would-be designers of digital communication systems. To limit the scope to manageable proportions we have had to be selective in the topics covered and in the depth of coverage. In the case of advanced information, coding, and detection theory, for example, we have not tried to duplicate the in-depth coverage of many advanced textbooks, but rather have tried to cover those aspects directly relevant to the design of digital communication systems.