Your next step
Cambridge Alerts
Customer services
|
Computer Science 2006 - Textbooks
|
Ron Roth
Error-correcting codes constitute one of the key ingredients in achieving the high degree of reliability required in modern data transmission and storage systems. This book introduces the reader to the theoretical foundations of error-correcting codes, with an emphasis on Reed-Solomon codes and their derivative codes. After reviewing linear codes and finite fields, Ron Roth describes Reed-Solomon codes and various decoding algorithms. Cyclic codes are presented, as are MDS codes, graph codes, and codes in the Lee metric. Concatenated, trellis, and convolutional codes are also discussed in detail.
Learn more...
|
|
John Talbot, Dominic Welsh
Cryptography plays a crucial role in many aspects of today's world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both computational complexity and a range of topics in pure mathematics. This book provides that knowledge, combining an informal style with strong proofs of the key results to provide an accessible introduction. It includes many examples and exercises, and is based on a highly successful course developed and taught over many years.
Learn more...
|
|
Daniel J. Velleman
Geared to preparing students to make the transition from solving problems to proving theorems, this text teachs them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed.
Learn more...
|
|
Jin Xiong
Essential Bioinformatics is a concise yet comprehensive textbook of bioinformatics, which provides a broad introduction to the entire field. Written specifically for a life science audience, the basics of bioinformatics are explained, followed by discussions of the state-of-the-art computational tools available to solve biological research problems. All key areas of bioinformatics are covered including biological databases, sequence alignment, genes and promoter prediction, molecular phylogenetics, structural bioinformatics, genomics and proteomics. The book emphasizes how computational methods work and compares the strengths and weaknesses of different methods. This balanced yet easily accessible text will be invaluable to students who do not have sophisticated computational backgrounds. Technical details of computational algorithms are explained with a minimum use of mathematical formulae; graphical illustrations are used in their place to aid understanding. The effective synthesis of existing literature as well as in-depth and up-to-date coverage of all key topics in bioinformatics make this an ideal textbook for all bioinformatics courses taken by life science students and for researchers wishing to develop their knowledge of bioinformatics to facilitate their own research.
Learn more...
|
|
Bernhard O. Palsson
Genome sequences are now available that enable us to determine the biological components that make up a cell or an organism. The new discipline of systems biology examines how these components interact and form networks, and how the networks generate whole cell functions corresponding to observable phenotypes. This textbook describes how to model networks, determine their properties, and relate these to phenotypic functions. Some knowledge of linear algebra and biochemistry is required, since the book reflects the irreversible trend of increasing mathematical content in biology education.
Learn more...
|
|
R. D. Tennent
This innovative volume provides a hands-on introduction to techniques for specifying the behavior of software components. A text for a second-year undergraduate course in Computer Science and Computer Engineering programs, it is also suitable for self-study. This book will help students to improve their programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership.
Learn more...
|
|
Ghinwa Jalloul
Ghinwa Jalloul's step-by-step introduction to object-oriented software development is suitable for teacher training as well as for practicing software engineers. Jalloul presents seven complete case studies and several smaller examples documented in UML, derived from small software projects developed for, and delivered to, real users. They are preceded by an overview of the object-oriented modeling artifacts in UML, on which the remainder of the book relies. The case studies provide a medium for experimental use and act as templates that can be tailored by readers to fit specific needs and circumstances.
Learn more...
|
|
Jon Lee
Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study.
Learn more...
|
|
Ethan D. Bolker, Bill Campbell
This book and CD set treats learning a programming language much like learning a spoken language: programming is best learned by immersion. Through building interesting programs and addressing real design issues much earlier than other texts, this book moves beyond the placement of semicolons and other syntactic details and is able to discuss the architecture of serious programs: how delegation and inheritance allow objects to cooperate to do useful work. Throughout the text, the authors deal with programs that implement applications realistic enough to be convincing.
Learn more...
|
|
George Em Karniadakis, Robert M. Kirby II
This book provides a seamless approach to numerical algorithms, modern programming techniques and parallel computing. These concepts and tools are usually taught serially across different courses and different textbooks, thus observing the connection between them. The necessity of integrating these subjects usually comes after such courses are concluded (e.g., during a first job or a thesis project), thus forcing the student to synthesize what is perceived to be three independent subfields into one in order to produce a solution. The book includes both basic and advanced topics and places equal emphasis on the discretization of partial differential equations and on solvers. Advanced topics include wavelets, high-order methods, non-symmetric systems and parallelization of sparse systems. A CD-ROM accompanies the text.
Learn more...
|
|
L. F. Shampine, I. Gladwell, S. Thompson
This book is a text for a one-semester course for upper-level undergraduates and beginning graduate students in engineering, science, and mathematics. Prerequisites are a first course in the theory of ODEs and a survey course in numerical analysis, in addition to specific programming experience, preferably in MATLAB, and knowledge of elementary matrix theory. Professionals will also find that this useful concise reference contains reviews of technical issues and realistic and detailed examples. The programs for the examples are supplied on the accompanying web site and can serve as templates for solving other problems.
Learn more...
|
|
Scott W. Ambler
Scott Ambler, award-winning author of Building Object Applications that Work, Process Patterns, and More Process Patterns, has revised his acclaimed first book, The Object Primer. Long prized by both students and professionals as the best introduction to object-oriented technology, this book is now completely up-to-date, with all modeling notation rewritten in the just-released UML 2.0. All chapters have been revised to take advantage of Agile Modeling (AM), which is presented in the new chapter 2 along with other important new modeling techniques. Review questions at the end of each chapter allow readers to test their newly acquired knowledge. In addition, Ambler takes time to reflect on the lessons learned over the past few years by discussing the proven benefits and drawbacks of the technology. This is the perfect book for any software development professional or student seeking an introduction to the concepts and terminology of object technology.
Learn more...
|
|
Thomas Dean
Thomas Dean explores a wide range of fundamental topics in computer science, from digital logic and machine language to artificial intelligence and the World Wide Web, explaining how computers and computer programs work and how the various subfields of computer science are interconnected. Dean touches on a number of questions including: How can a computer learn to recognize junk email? What happens when you click on a link in a browser? How can you program a robot to do two things at once? Are there limits to what computers can do?
Learn more...
|
|
Michael Huth, Mark Ryan
The second edition of this successful textbook continues to provide a clear introduction to formal reasoning relevant to the needs of modern computer science and sufficiently exacting for practical applications. Improvements have been made throughout with many new and expanded text sections. The coverage of model-checking has been substantially updated and additional exercises are included. Internet support includes worked solutions for teacher exercises and model solutions to some student exercises.
Learn more...
|
|
E. Reed Doke, Bill C. Hardgrave, Richard A. Johnson
Featuring the development of graphical user interfaces (GUI's) using the latest in Java swing components, this new edition of Java for the COBOL Programmer (Cambridge, 1999) provides COBOL programmers a clear, easy transition to Java programming by drawing on the numerous similarities between COBOL and Java. The authors introduce the COBOL programmer to the history of Java and object-oriented programming and then delve into the details of the Java syntax, always contrasting them with their parallels in COBOL. A running case study permits the reader to have an overall view of application development with Java.
Learn more...
|
|
Michael McMillan
Including a tutorial on how to use data structures and algorithms and a reference for implementation using VB.NET and the .NET Framework Class Library, this is the first Visual Basic.NET book to provide a comprehensive discussion of the major data structures and algorithms. Michael McMillan presents arrays and arraylists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching as well as more advanced algorithms, such as probabilistic algorithms and dynamic programming in an object-oriented fashion. Finally, the professional or student VB.NET programmer has a dedicated reference instead of having to translate material on C++ or Java.
Learn more...
|
|
Bill Casselman
This practical introduction to the techniques needed to produce high-quality mathematical illustrations is suitable for anyone with basic knowledge of coordinate geometry. Bill Casselman combines a completely self-contained step-by-step introduction to the graphics programming language PostScript with an analysis of the requirements of good mathematical illustrations. The many small simple graphics projects can also be used in courses in geometry, graphics, or general mathematics. Code for many of the illustrations is included, and can be downloaded from the book's web site: www.math.ubc.ca/~cass/graphics/manualMathematicians; scientists, engineers, and even graphic designers seeking help in creating technical illustrations need look no further.
Learn more...
|
|
Gregory Dudek, Michael Jenkin
This is a superb textbook for advanced undergraduate and graduate students in the field of mobile robotics. With a special emphasis on computation and algorithms, Dudek and Jenkin address a range of strategies for enabling robots to master problems of navigation, pose estimation, and autonomous exploration. While they concentrate on wheeled and legged mobile robots, they also discuss a variety of other propulsion systems with kinematic models developed for many of the more common locomotive strategies. Chapters present algorithms for both visual and nonvisual sensor technologies, including sonar, vision, and laser scanners. In the section on reasoning, the authors thoroughly examine the subject of planning and the issues related to spatial representation. A comprehensive overview of the field, Computational Principles of Mobile Robotics complements its discussion of state-of-the art methods with 139 illustrations of key current and historical technologies.
Learn more...
|
|
Neil Gershenfeld
This book first covers exact and approximate analytical techniques (ordinary differential and difference equations, partial differential equations, variational principles, stochastic processes); numerical methods (finite differences for ODE's and PDE's, finite elements, cellular automata); model inference based on observations (function fitting, data transforms, network architectures, search techniques, density estimation); as well as the special role of time in modeling (filtering and state estimation, hidden Markov processes, linear and nonlinear time series). Each of the topics in the book would be the worthy subject of a dedicated text, but only by presenting the material in this way is it possible to make so much material accessible to so many people. Each chapter presents a concise summary of the core results in an area, providing an orientation to what they can (and cannot) do, enough background to use them to solve typical problems, and pointers to access the literature for particular applications.
Learn more...
|
|
William J. Dally, John W. Poulton
What makes some computers slow? What makes some digital systems operate reliably for years while others fail mysteriously every few hours? Why do some systems dissipate kilowatts while others operate off batteries? These questions of speed, reliability, and power are all determined by the system-level electrical design of a digital system. Digital Systems Engineering presents a comprehensive treatment of these topics. It combines a rigorous development of the fundamental principles in each area with down-to-earth examples of circuits and methods that work in practice. The book not only can serve as an undergraduate textbook, filling the gap between circuit design and logic design, but also can help practicing digital designers keep up with the speed and power of modern integrated circuits. The techniques described in this book, which were once used only in supercomputers, are now essential to the correct and efficient operation of any type of digital system.
Learn more...
|
|
Richard K. Belew
The World Wide Web is rapidly filling with more text than anyone could have imagined a short time ago. However, the task of determining which data is relevant has become appreciably harder. In this original new work Richard Belew brings a cognitive science perspective to the study of information as a computer science discipline. He introduces the idea of Finding Out About (FOA), the process of actively seeking out information relevant to a topic of interest. Belew describes all facets of FOA, ranging from creating a good characterization of what the user seeks to evaluating the successful performance of search engines. His volume clearly shows how to build many of the tools that are useful for searching collections of text and other media. While computer scientists make up the book's primary audience, Belew skillfully presents technical details in a manner that makes important themes accessible to readers more comfortable with words than equations. (A CD is included with the text.)
Learn more...
|
|
David J. C. MacKay
Information theory and inference, often taught separately, are here united in one entertaining textbook. These topics lie at the heart of many exciting areas of contemporary science and engineering - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics, and cryptography.
Learn more...
|
|
Paul Hudak
Functional programming is a style of programming that emphasizes the use of functions (in contrast to object-oriented programming, which emphasizes the use of objects). It has become popular in recent years because of its simplicity, conciseness, and clarity. This book teaches functional programming as a way of thinking and problem solving, using Haskell, the most popular purely functional language. Rather than using the conventional (boring) mathematical examples commonly found in other programming language textbooks, the author uses examples drawn from multimedia applications, including graphics, animation, and computer music, thus rewarding the reader with working programs for inherently more interesting applications. Aimed at both beginning and advanced programmers, this tutorial begins with a gentle introduction to functional programming and moves rapidly on to more advanced topics. Details about progamming in Haskell are presented in boxes throughout the text so they can be easily found and referred to.
Learn more...
|
|
Joseph O'Rourke
This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
Learn more...
|
|
Richard Wiener, Lewis J. Pinson
Fundamentals of OOP and Data Structures in Java presents the fundamentals of Object-Oriented Programming (OOP) and Graphical User Interface (GUI) programming with Java as the example language. Wiener and Pinson introduce each of the major data structures with supporting, GUI-based laboratory programs designed to reinforce the basic concepts and principles. These laboratories allow the reader to explore and experiment with the properties of each data structure. All source code for the laboratories is available on the Web. By integrating the principles of OOP and GUI programming, this unique book presents the fundamental issues of data structures within the context of paradigms that are essential to today's professional software developer. The text assumes only an elementary understanding of Java and no experience with OOP.
Learn more...
|
|
N. K. Jha, S. Gupta
Device testing represents the single largest manufacturing expense in the semiconductor industry, costing over $40 billion a year. The most comprehensive and wide-ranging book of its kind, Testing of Digital Systems covers everything you need to know about this vitally important subject. Starting right from the basics, the authors take the reader through every key area, including detailed treatment of the latest techniques such as system-on-a-chip and IDDQ testing. Written for students and engineers, it is both an excellent senior/graduate level textbook and a valuable reference.
Learn more...
|
|
John C. Mitchell
Concepts in Programming Languages elucidates the central concepts used in modern programming languages, such as functions, types, memory management, and control. The book is unique in its comprehensive presentation and comparison of major object-oriented programming languages. Separate chapters examine the history of objects, Simula and Smalltalk, and the prominent languages C++ and Java. The author presents foundational topics, such as lambda calculus and denotational semantics, in an easy-to-read, informal style, focusing on the main insights provided by these theories. Advanced topics include concurrency, concurrent object-oriented programming, program components, and inter-language interoperability. A chapter on logic programming illustrates the importance of specialized programming methods for certain kinds of problems.
Learn more...
|
|
Paulo S. R. Diniz, Eduardo A. B. da Silva, Sergio L. Netto
Digital signal processing is an essential element of key communications technologies such as mobile phones and the Internet. This text covers all the major topics in digital signal processing (DSP) design and analysis, supported by MatLab examples and other modelling techniques. The authors explain clearly and concisely why and how to use digital signal processing systems; how to approximate a desired transfer function characteristic using polynomials and ratio of polynomials; why an appropriate mapping of a transfer function onto a suitable structure is important for practical applications; and how to analyze, represent, and explore the tradeoff between time and frequency representation of signals.
Learn more...
|
|
W. Cary Huffman, Vera Pless
Fundamentals of Error Correcting Codes is an in-depth introduction to coding theory from both an engineering and mathematical viewpoint. It reviews classical topics, and gives much coverage of recent techniques which could previously only be found in specialist publications. Numerous exercises and examples and an accessible writing style make this a lucid and effective introduction to coding theory for advanced undergraduate and graduate students, researchers and engineers - whether approaching the subject from a mathematical, engineering or computer science background.
Learn more...
|
|
B. A. Davey, H. A. Priestley
Ordered structures have been increasingly recognized in recent years due to an explosion of interest in theoretical computer science and all areas of discrete mathematics. This book covers areas such as ordered sets and lattices. A key feature of ordered sets, one which is emphasized in the text, is that they can be represented pictorially. Lattices are also considered as algebraic structures and hence a purely algebraic study is used to reinforce the ideas of homomorphisms and of ideals encountered in group theory and ring theory. Exposure to elementary abstract algebra and the rotation of set theory are the only prerequisites for this text. For the new edition, much has been rewritten or expanded and new exercises have been added.
Learn more...
|
|
Rex A. Dwyer
In this introduction to computational molecular biology, Rex Dwyer explains many basic computational problems and gives concise, working programs to solve them in the Perl programming language. With minimal prerequisites, he covers the biological background for each problem, develops a model for the solution, and then introduces the Perl concepts needed to implement the solution. The chapters discuss pairwise and multiple sequence alignment, fast database searches for homologous sequences, protein motif identification, genome rearrangement, physical mapping, phylogeny reconstruction, satellite identification, sequence assembly, gene finding, and RNA secondary structure. Concrete examples and a step-by-step approach enable readers to grasp the computational and statistical methods.
Learn more...
|
|
Sriram Pemmaraju, Steven Skiena
With examples of all 450 functions in action plus tutorial text on the mathematics, this book is the definitive guide to Experimenting with Combinatorica, a widely used software package for teaching and research in discrete mathematics. Three interesting classes of exercises are provided--theorem/proof, programming exercises, and experimental explorations--ensuring great flexibility in teaching and learning the material. The Combinatorica user community ranges from students to engineers, researchers in mathematics, computer science, physics, economics, and the humanities. Recipient of the EDUCOM Higher Education Software Award, Combinatorica is included with every copy of the popular computer algebra system Mathematica.
Learn more...
|
|
Michael R. A. Huth
This volume details what every computer scientist ought to know about cryptographic systems, security protocols, and secure information flow in programs. Highlights include discussions of the new advanced encryption standard "Rijndael"; an optimal public-key encryption using RSA which turns "textbook RSA" into a practical implementation; standard security models for information flow in computer programs or human organizations; and moral, legal, and political issues. Another novel feature is the presentation of a formal model-checking tool for specifying and debugging security protocols. A supporting web site http://www.cis.ksu.edu/~huth/scs contains Java source code for the programs featured plus links to other sites.
Learn more...
|
|
Andrew W. Appel, With Jens Palsberg
This textbook describes all phases of a compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes thorough coverage of current techniques in code generation and register allocation, and the compilation of functional and object-oriented languages. The most accepted and successful techniques are described and illustrated with actual Java^TM® classes. The first part is suitable for a one-semester first course in compiler design. The second part; which includes the compilation of object-oriented and functional languages, garbage collection, loop optimization, SSA form, instruction scheduling, and optimization for cache-memory hierarchies; can be used for a second-semester or graduate course. This new edition includes more discussion of Java and object-oriented programming concepts such as visitor patterns plus a new Mini-Java programming project. A unique feature is the newly redesigned compiler project in Java for a subset of Java itself. The project includes both front-end and back-end phases.
Learn more...
|
|
Samuel R. Buss
This introduction to 3D computer graphics emphasizes fundamentals and the mathematics underlying computer graphics, while also covering programming techniques using OpenGL, a platform-independent graphics programming environment. The minimal prerequisites make it suitable for self-study or for use as an advanced undergraduate or introductory graduate text as the author leads step-by-step from the basics of transformations to advanced topics such as animations and kinematics. Accompanying software, including source code for a ray tracing software package, is available freely from the book's web site.
Learn more...
|
|
Joachim von zur Gathen, Jürgen Gerhard
Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this text's comprehensiveness and reliability also make it an essential reference for professionals. Errors have been corrected and new sections on greatest common divisors and symbolic integration have been added to this updated edition.
Learn more...
|
|
David Yevick
C++ is rapidly becoming the programming language of choice for science and engineering applications because of its rich object-oriented features. Intended for beginning and intermediate programmers, this book surveys the application of C++ to technical problems. Modern object-oriented software engineering tools are employed to simplify the presentation and all aspects of modern C++ programming practices of relevance to scientific programming are surveyed.
Learn more...
|
|
David J. Lilja, Sachin S. Sapatnekar
Using Verilog, a leading commercial hardware description language, this text describes how to specify, design, and test a complete digital system. After a brief introduction to the Verilog language, the instruction set architecture (ISA) for the simple VeSPA (Very Small Processor Architecture) processor is defined. The remainder of the book demonstrates how both behavioral and structural models can be developed and intermingled in Verilog.
Learn more...
|
|
R. J. McEliece
This is a revised edition of McEliece's classic, published with students in mind. It is a self-contained introduction to all basic results in the theory of information and coding. This theory was developed to deal with the fundamental problem of communication, that of reproducing at one point, either exactly or approximately, a message selected at another point. There is a short and elementary overview introducing the reader to the concept of coding. Then, following the main results, the channel and source coding theorems, there is a study of specific coding schemes which can be used for channel and source coding. This volume can be used either for self-study, or for a graduate/undergraduate level course at university. It includes dozens of worked examples and several hundred problems for solution. The exposition will be easily comprehensible to readers with some prior knowledge of probability and linear algebra.
Learn more...
|
|
Michael Mitzenmacher, Eli Upfal
Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.
Learn more...
|
|
Andrea Goldsmith
Wireless technology is a truly revolutionary paradigm shift, enabling multimedia communications between people and devices from any location. It also underpins exciting applications such as sensor networks, smart homes, telemedicine, and automated highways. This book provides a comprehensive introduction to the underlying theory, design techniques and analytical tools of wireless communications, focusing primarily on the core principles of wireless system design.
Learn more...
|
|
Gregory Pottie, William Kaiser
Embedded network systems (ENS) provide a set of technologies that can link the physical world to large-scale networks in applications, such as monitoring of borders, infrastructure, health, the environment, automated production, supply chains, homes, and places of business. This book details the fundamentals for this interdisciplinary and fast-moving field. The book begins with mathematical foundations and the relevant background topics in signal propagation, sensors, detection and estimation theory, and communications. Key component technologies in ENS are discussed: synchronization and position localization, energy and data management, actuation, and node architecture. Ethical, legal, and social implications are addressed. The final chapter summarizes some of the lessons learned in producing multiple ENS generations. A focus on fundamental principles together with extensive examples and problem sets make this text ideal for use in graduate courses on electrical engineering and computer science. It will also appeal to engineers involved in the design of ENS.
Learn more...
|
|
P. C. Gregory
Researchers in many branches of science are increasingly coming into contact with Bayesian statistics or Bayesian probability theory. This book provides a clear exposition of the underlying concepts with large numbers of worked examples and problem sets. It also discusses numerical techniques for implementing the Bayesian calculations, including Markov Chain Monte-Carlo integration and linear and nonlinear least-squares analysis seen from a Bayesian perspective.
Learn more...
|
|
Mischa Schwartz
A wide range of real-world examples illustrates the theoretical aspects of this tutorial introduction to digital mobile wireless networks. In particular, 2.5G and 3G packet-switched systems are discussed in detail, as are wireless LANs and personal-area networks. Many worked examples and homework exercises are provided, and a solutions manual is available for instructors. The book is an ideal text for electrical engineering and computer science students taking courses in wireless communications. It will also be an invaluable reference for practicing engineers.
Learn more...
|
|
David Tse, Pramod Viswanath
The past decade has seen many advances in physical layer wireless communication theory and their implementation in wireless systems. This textbook takes a unified view of the fundamentals of wireless communication and explains the web of concepts underpinning these advances at a level accessible to an audience with a basic background in probability and digital communication. Topics covered include MIMO (multi-input, multi-output) communication, space-time coding, opportunistic communication, OFDM and CDMA. The concepts are illustrated using many examples from real wireless systems such as GSM, IS-95 (CDMA), IS-856 (1 x EV-DO), Flash OFDM and UWB (ultra-wideband). Particular emphasis is placed on the interplay between concepts and their implementation in real systems. An abundant supply of exercises and figures reinforce the material in the text. This book is intended for use on graduate courses in electrical and computer engineering and will also be of great interest to practising engineers.
Learn more...
|
|
Victor Shoup
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch. Thus the book can serve several purposes. It can be used as a reference and for self-study by readers who want to learn the mathematical foundations of modern cryptography. It is also ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.
Learn more...
|
|
