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 (R) (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 single appearance 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 is for designers and would-be designers of digital communication systems. The general approach of this book is to extract the common principles underlying a range of media and applications and present them in a unified framework. Digital Communication is relevant to the design of a variety of systems, including voice and video digital cellular telephone, digital CATV distribution, wireless LANs, digital subscriber loop, metallic Ethernet, voiceband data modems, and satellite communication systems.

New in this Third Edition:

New material on recent advances in wireless communications, error-control coding, and multi-user communications has been added. As a result, two new chapters have been added, one on the theory of MIMO channels, and the other on diversity techniques for mitigating fading.

Error-control coding has been rewritten to reflect the current state of the art.

Chapters 6 through 9 from the Second Edition have been reorganized and streamlined to highlight pulse-amplitude modulation, becoming the new Chapters 5 through 7.

Readability is increased by relegating many of the more detailed derivations to appendices and exercise solutions, both of which are included in the book.

Exercises, problems, and solutions have been revised and expanded.

Three chapters from the previous edition have been moved to the booka (TM)s Web site to make room for new material.

This book is ideal as a first-year graduate textbook, and is essential to many industry professionals. The book is attractive to both audiences through the inclusion of many practical examples and a practical flavor in the choice of topics.

Digital Communicationhas a Web site at: http: //www.ece.gatech.edu/~barry/digital/, where the reader may find additional information from the Second Edition, other supplementary materials, useful links, a problem solutions manual, and errata.

This supplement contains worked solutions to the problems found in Digital Communication, which is intended for designers and would-be designers of digital communication systems. The overall focus of the main text is on the transport of bit streams from one geographical location to another over various physical media such as wire pairs, coaxial cable, optical fibre and radio waves.

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."

This open access book aims to set an agenda for research and action in the field of Digital Humanism through short essays written by selected thinkers from a variety of disciplines, including computer science, philosophy, education, law, economics, history, anthropology, political science, and sociology. This initiative emerged from the Vienna Manifesto on Digital Humanism and the associated lecture series. Digital Humanism deals with the complex relationships between people and machines in digital times. It acknowledges the potential of information technology. At the same time, it points to societal threats such as privacy violations and ethical concerns around artificial intelligence, automation and loss of jobs, ongoing monopolization on the Web, and sovereignty. Digital Humanism aims to address these topics with a sense of urgency but with a constructive mindset. The book argues for a Digital Humanism that analyses and, most importantly, influences the complex interplay of technology and humankind toward a better society and life while fully respecting universal human rights. It is a call to shaping technologies in accordance with human values and needs.

This open access book aims to set an agenda for research and action in the field of Digital Humanism through short essays written by selected thinkers from a variety of disciplines, including computer science, philosophy, education, law, economics, history, anthropology, political science, and sociology. This initiative emerged from the Vienna Manifesto on Digital Humanism and the associated lecture series. Digital Humanism deals with the complex relationships between people and machines in digital times. It acknowledges the potential of information technology. At the same time, it points to societal threats such as privacy violations and ethical concerns around artificial intelligence, automation and loss of jobs, ongoing monopolization on the Web, and sovereignty. Digital Humanism aims to address these topics with a sense of urgency but with a constructive mindset. The book argues for a Digital Humanism that analyses and, most importantly, influences the complex interplay of technology and humankind toward a better society and life while fully respecting universal human rights. It is a call to shaping technologies in accordance with human values and needs.

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 SynopsysA(R) (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 byconstructing 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 single appearance 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.