72
Editor-in-Chief JERRY D. GIBSON Third Edition HANDBOOK

Mobile Communications Handbook, Third Edition

Embed Size (px)

Citation preview

K10892

ISBN: 978-1-4398-1723-0

9 781439 817230

90000

Electrical Engineering

With 26 entirely new and 5 extensively revised chapters out of the total of 39, the Mobile Communications Handbook, Third Edition presents an in-depth and up-to-date overview of the full range of wireless and mobile technologies that we rely on every day. This includes, but is not limited to, everything from digital cellular mobile radio and evolving personal communication systems to wireless data and wireless networks.

Illustrating the extraordinary evolution of wireless communications and networks in the last 15 years, this book is divided into five sections: • Basic Principles provides the essential underpinnings for the wide-ranging mobile communication technologies currently in use throughout the world.

• Wireless Standards contains technical details of the standards we use every day, as well as insights into their development. 

• Source Compression and Quality Assessment covers the compression techniques used to represent voice and video for transmission over mobile communications systems as well as how the delivered voice and video quality are assessed.

• Wireless Networks examines the wide range of current and developing wireless networks and wireless methodologies. 

• Emerging Applications explores newly developed areas of vehicular communications and 60 GHz wireless communications.

Written by experts from industry and academia, this book provides a succinct overview of each topic, quickly bringing the reader up to date, but with sufficient detail and references to enable deeper investigations. Providing much more than a “just the facts” presentation, contributors use their experience in the field to provide insights into how each topic has emerged and to point toward forth-coming developments in mobile communications.

H A N D B O O K Third Edit ion

Editor- in-Chief J E R R Y D . G I B S O N

Third Edi t ion

H A N D B O O K

G I B S O N

HA

ND

BO

OK

THIRDEDITION

Third Edi t ion

H A N D B O O K

The Electrical Engineering Handbook Series

Series EditorRichard C. DorfUniversity of California, Davis

Titles Included in the Series

The Avionics Handbook, Second Edition, Cary R. SpitzerThe Biomedical Engineering Handbook, Third Edition, Joseph D. BronzinoThe Circuits and Filters Handbook, Third Edition, Wai-Kai ChenThe Communications Handbook, Second Edition, Jerry GibsonThe Computer Engineering Handbook, Vojin G. OklobdzijaThe Control Handbook, Second Edition, William S. Levine CRC Handbook of Engineering Tables, Richard C. DorfDigital Avionics Handbook, Second Edition, Cary R. SpitzerThe Digital Signal Processing Handbook, Vijay K. Madisetti and Douglas WilliamsThe Electric Power Engineering Handbook, Second Edition, Leonard L. GrigsbyThe Electrical Engineering Handbook, Third Edition, Richard C. DorfThe Electronics Handbook, Second Edition, Jerry C. WhitakerThe Engineering Handbook, Third Edition, Richard C. DorfThe Handbook of Ad Hoc Wireless Networks, Mohammad IlyasThe Handbook of Formulas and Tables for Signal Processing, Alexander D. PoularikasHandbook of Nanoscience, Engineering, and Technology, Second Edition, William A. Goddard, III, Donald W. Brenner, Sergey E. Lyshevski, and Gerald J. IafrateThe Handbook of Optical Communication Networks, Mohammad Ilyas and Hussein T. MouftahThe Industrial Electronics Handbook, Second Edition, Bogdan M. Wilamowski and J. David IrwinThe Measurement, Instrumentation, and Sensors Handbook, John G. WebsterThe Mechanical Systems Design Handbook, Osita D.I. Nwokah and Yidirim HurmuzluThe Mechatronics Handbook, Second Edition, Robert H. BishopMobile Communications Handbook, Third Edition, Jerry D. GibsonThe Ocean Engineering Handbook, Ferial El-HawaryThe RF and Microwave Handbook, Second Edition, Mike GolioThe Technology Management Handbook, Richard C. DorfTransforms and Applications Handbook, Third Edition, Alexander D. PoularikasThe VLSI Handbook, Second Edition, Wai-Kai Chen

CRC Press is an imprint of theTaylor & Francis Group, an informa business

Boca Raton London New York

Editor- in-Chief J E R R Y D . G I B S O N

Third Edi t ion

H A N D B O O K

MATLAB® is a trademark of The MathWorks, Inc. and is used with permission. The MathWorks does not warrant the accuracy of the text or exercises in this book. This book’s use or discussion of MATLAB® software or related products does not constitute endorsement or sponsorship by The MathWorks of a particular pedagogical approach or particular use of the MATLAB® software.

CRC PressTaylor & Francis Group6000 Broken Sound Parkway NW, Suite 300Boca Raton, FL 33487-2742

© 2013 by Taylor & Francis Group, LLCCRC Press is an imprint of Taylor & Francis Group, an Informa business

No claim to original U.S. Government worksVersion Date: 20120608

International Standard Book Number-13: 978-1-4398-1724-7 (eBook - PDF)

This book contains information obtained from authentic and highly regarded sources. Reasonable efforts have been made to publish reliable data and information, but the author and publisher cannot assume responsibility for the valid-ity of all materials or the consequences of their use. The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to copyright holders if permission to publish in this form has not been obtained. If any copyright material has not been acknowledged please write and let us know so we may rectify in any future reprint.

Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or uti-lized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopy-ing, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers.

For permission to photocopy or use material electronically from this work, please access www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged.

Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe.

Visit the Taylor & Francis Web site athttp://www.taylorandfrancis.com

and the CRC Press Web site athttp://www.crcpress.com

v

Contents

Preface.............................................................................................................................................. ix

Editor............................................................................................................................................... xi

Contributors.................................................................................................................................xiii

Section i Basic Principles

. 1. The.Discrete.Fourier.Transform........................................................................ 5Bryan Usevitch

. 2. Pulse.Code.Modulation.................................................................................... 23Leon W. Couch II

. 3. Baseband.Signaling.and.Pulse.Shaping........................................................... 35Michael L. Honig and Melbourne Barton

. 4. Complex.Envelope.Representations.for.Modulated.Signals........................... 55Leon W. Couch II

. 5. Modulation.Methods........................................................................................ 71Gordon L. Stüber

. 6. Error.Control.Coding...................................................................................... 91Thomas E. Fuja

. 7. Information.Theory....................................................................................... 115Emmanuel Abbe, Bixio Rimoldi, and Rüdiger Urbanke

. 8. Rayleigh.Fading.Channels............................................................................. 133Bernard Sklar

. 9. Channel.Equalization..................................................................................... 167John G. Proakis

.10. Echo.Cancellation.......................................................................................... 191Giovanni Cherubini

.11. Synchronization.of.Communication.Receivers............................................. 207Costas N. Georghiades and Erchin Serpedin

vi Contents

.12. Pseudonoise.Sequences.................................................................................. 237Tor Helleseth and P. Vijay Kumar

.13. Introduction.to.Spread.Spectrum.Systems.................................................... 253Dinesh Rajan

.14. Signal.Space.................................................................................................... 265Rodger E. Ziemer

.15. Optimum.Receivers........................................................................................ 279Geoffrey C. Orsak

.16. MIMO.Systems.for.Diversity.and.Interference.Mitigation........................... 293Marco Chiani

.17. High-Throughput.MIMO Systems..................................................................313Marco Chiani

.18. Digital.Communication.System.Performance............................................... 333Bernard Sklar

.19. Fundamental.Limitations.on.Increasing.Data.Rate.in.Wireless.Systems..... 355Donald C. Cox

.20. Interference.and.Its.Impact.on.System.Capacity.......................................... 369Bijan Jabbari and Alireza Babaei

.21. Cell.Design.Principles.................................................................................... 389Michel Daoud Yacoub

Section ii Wireless Standards

.22. Wireless.Data.................................................................................................. 405Allen H. Levesque and Kaveh Pahlavan

.23. Third-Generation.Cellular.Communications:.An.Air.Interface.Overview...... 429Giridhar D. Mandyam

.24. 3GPP.LTE/LTE-Advanced.Radio.Access.Technologies................................. 451Sassan Ahmadi

.25. IEEE.802.16m.Radio.Access.Technology....................................................... 481Sassan Ahmadi

.26. Land.Mobile.Radio.and.Professional.Mobile.Radio:.Emergency.First.Responder.Communications.......................................................................... 513Jerry D. Gibson

.27. Digital.Audio.Broadcasting........................................................................... 527Carl-Erik W. Sundberg

Section iii Source compression and Quality Assessment

.28. Speech.Coding.for.Wireless.Communications.............................................. 539Jerry D. Gibson

viiContents

.29. Video.Compression........................................................................................ 559Do-Kyoung Kwon, Madhukar Budagavi, Vivienne Sze, and Woo-Shik Kim

.30. Machine.Assessment.of.Speech.Communication.Quality............................ 587Wai-Yip Chan and Tiago H. Falk

Section iV Wireless networks

.31. Wireless.Network.Protocols........................................................................... 603Renato Mariz de Moraes and Hamid R. Sadjadpour

.32. Cross-Layer.Design.in.Wireless.Communications....................................... 615Sayantan Choudhury and Jerry D. Gibson

.33. Cooperative.Communication.Technologies.................................................. 627Jong-Soo Seo and Zhi Ding

.34. Cross-Layer.Cooperative.Communication.in.Wireless.Networks................ 657Matthew Nokleby, Gareth Middleton, and Behnaam Aazhang

.35. Wireless.Mesh.Networks................................................................................ 683Hyunok Lee

.36. IP.Multimedia.Subsystem:.Analysis.of.Scalability.and.Integration.................. 695Lava N. Al-Doski, Rabindra Ghimire, and Seshadri Mohan

.37. Cognitive.Radio.Networks............................................................................. 713Kwang-Cheng Chen

Section V emerging Applications

.38. Vehicular.Communications........................................................................... 729Antonio Servetti, Paolo Bucciol, and Juan Carlos De Martin

.39. 60.GHz.Wireless.Communication................................................................. 747Upamanyu Madhow and Sumit Singh

Glossary........................................................................................................................................ 759

ix

Preface

This. third. edition. of. the Mobile Communications Handbook. reflects. the. extraordinary. evolution. of.wireless.communications.and.networks.over.the.last.15.years,.with.5.extensively.revised.chapters.and.26.entirely.new.chapters.out.of.a.total.of.39.chapters..We.use.the.term.mobile communications.to.include.technologies.ranging.from.digital.cellular.mobile.radio.and.evolving.personal.communication.systems.to.wireless.data.and.wireless.networks..This.range.of.topics.is.presented.in.39.concise.chapters.authored.by.experts.from.industry.and.academia..The.chapters.are.written.to.provide.a.succinct.overview.of.each.topic,.quickly.bringing.the.reader.up.to.date,.but.with.sufficient.detail.and.references.to.enable.deeper.investigations..The.chapters.are.more.than.a.“just.the.facts”.presentation,.with.the.authors.using.their.experience.in.the.field.to.provide.insights.into.how.each.topic.has.emerged.and.to.point.toward.forth-coming.developments.in.mobile.communications.

This.book.is.divided.into.five.sections:.Basic.Principles,.Wireless.Standards,.Source.Compression.and.Quality. Assessment,. Wireless. Networks,. and. Emerging. Applications.. The. chapters. in. the. Basic.Principles. section. provide. the. essential. underpinnings. for. the. wide-ranging. mobile. communication.technologies.currently.in.use.throughout.the.world..The.section.on.Wireless.Standards.contains.techni-cal.details.of.the.standards.we.use.every.day,.and.the.chapters.give.insights.into.the.development.of.the.several. standards.. The. third. section. covers. the. compression. techniques. used. to. represent. voice. and.video. for. transmission. over. mobile. communications. systems.as. well. as. how. the. delivered.voice. and.video. quality. are. assessed.. The. Wireless. Networks. section. examines. the. wide. range. of. current. and.developing.wireless.networks.and.wireless.methodologies.all.the.way.through.the.newly.developed.areas.of.vehicular.communications.and.60.GHz.wireless.communications.

The.Basic.Principles.chapters.readily.allow.the.reader.to.jump.right.to.the.mobile.communications.topic.of.interest,.with.the.option.of.efficiently.filling.in.any.gaps.in.one’s.background.by.referring.back.to.the.Basic.Principles.section.as.needed,.without.flipping.through.a.textbook.or.searching.the.Internet.

Although.there.is.an.ordering.to.the.chapters,.the.sequence.does.not.have.to.be.read.from.the.begin-ning.to.the.end..Each.chapter.was.written.to.be.an.independent.contribution.with.intentional.overlap.between.some.chapters.to.show.how.the.many.topics.interconnect..Interestingly,.as.the.reader.will.dis-cover,.this.overlap.often.admits.alternative.views.of.difficult.issues.

It.has.been.a.great.pleasure.to.work.with.the.authors.to.publish.this.third.edition..The.authors.come.from.all.parts.of. the.world.and.constitute.a. literal.who’s.who.of.workers. in.digital.and.mobile.com-munications.. Certainly,. each. article. is. an. extraordinary. contribution. to. the. communications. and..networking. fields,. and. the. collection,. I. believe,. is. the. most. comprehensive. treatment. of. the. mobile..communication.field.available.in.one.volume.today.

I.appreciate.the.patience,.support,.and.guidance.of.the.staff.at.CRC.Press/Taylor.&.Francis,.particu-larly.Nora.Konopka,.and.the.energetic.and.responsive.assistance.of.Ashley.Gasque.during.all.stages.of.developing.and.producing.this.handbook.

Jerry D. GibsonSanta Barbara, California

x Preface

MATLAB®.is.a.registered.trademark.of.The.MathWorks,.Inc..For.product.information,.please.contact:

The.MathWorks,.Inc.3.Apple.Hill.DriveNatick,.MA.01760-2098.USATel:.508.647.7000Fax:.508-647-7001E-mail:[email protected]:.www.mathworks.com

xi

Editor

Jerry D. Gibson.is.a.professor.and.the.department.chair.of.electrical.and.computer.engineering.at.the.University. of. California,. Santa. Barbara.. He. is. the. coauthor. of. the. books. Digital Compression for Multimedia.(Morgan-Kaufmann,.1998).and.Introduction to Nonparametric Detection with Applications.(Academic.Press,.1975.and.IEEE.Press,.1995).and.author.of.the.textbook.Principles of Digital and Analog Communications. (Prentice-Hall,. 2nd. ed.,. 1993).. He. is. editor-in-chief. of. the Mobile Communications Handbook.(CRC.Press,.2nd.ed.,.1999),.editor-in-chief.of.The Communications Handbook.(CRC.Press,.2nd. ed.,. 2002),. and. editor. of. the. book. Multimedia Communications: Directions and Innovations.(Academic.Press,.2000).

Dr..Gibson.was.associate.editor.for.speech.processing.for.the.IEEE Transactions on Communications.from.1981.to.1985.and.an.associate.editor.for.communications.for.the.IEEE Transactions on Information Theory.from.1988.to.1991..He.was.president.of.the.IEEE.Information.Theory.Society.in.1996.and.served.on.the.Board.of.Governors.of.the.IT.Society.for.10.years..He.was.a.member.of.the.Speech.Technical.Committee.of.the.IEEE.Signal.Processing.Society.from.1992.to.1994..Dr..Gibson.served.as.technical.program. chair. and. founder. of. the. 1999 IEEE Wireless Communications and Networking Conference,.technical.program.chair.of.the.1997 Asilomar Conference on Signals, Systems, and Computers,.and.gen-eral. co-chair. of. the. 1993 IEEE International Symposium on Information Theory.. He. was. an. elected.Member-at-Large.on.the.Communications.Society.Board.of.Governors.from.2005.to.2007..Currently,.he.serves.on.the.Steering.Committee.for.the.Wireless.Communications.and.Networking.Conference..He.was.an.IEEE.Communications.Society.Distinguished.Lecturer.for.2007–2008,.and.he.is.a.member.of.the.IEEE.Awards.Committee.and.the.IEEE.Medal.of.Honor.Committee.

In.1990,.Dr..Gibson.received.the.Fredrick.Emmons.Terman.Award.from.the.American.Society.for.Engineering.Education,.and.in.1992,.he.was.elected.Fellow.of.the.IEEE.“for.contributions.to.the.theory.and.practice.of.adaptive.prediction.and.speech.waveform.coding.”.He.was.recipient.of.the.1993.IEEE.Signal.Processing.Society.Senior.Paper.Award.for.the.Speech.Processing.area..Dr..Gibson.received.the.IEEE.Technical.Committee.on.Wireless.Communications.Recognition.Award.in.2009.for.contributions.in.the.area.of.Wireless.Communications.Systems.and.Networks,.and.he.and.his.students.received.the.IEEE Transactions on Multimedia.Best.Paper.Award.in.2010.

His. research. interests. include. data,. speech,. image,. and. video. compression,. multimedia. over. net-works,.wireless.communications,.information.theory,.and.digital.signal.processing.

xiii

Contributors

Behnaam AazhangDepartment.of.Electrical.and.Computer.

EngineeringRice.UniversityHouston,.Texas

Emmanuel AbbeCommunication.and.Computer.Sciences.SchoolÉcole.polytechnique.fédérale.de.LausanneLausanne,.Switzerland

Sassan AhmadiSenior.Wireless.Systems.Architect.and.Cellular.

Standards.ExpertCupertino,.California

Lava N. Al-DoskiDepartment.of.Systems.EngineeringUniversity.of.ArkansasLittle.Rock,.Arkansas

Alireza BabaeiDepartment.of.Electrical.and.Computer.

EngineeringAuburn.UniversityAuburn,.Alabama

Melbourne BartonTelcordia.TechnologiesRed.Bank,.New.Jersey

Paolo BucciolPolitecnico.di.TorinoTorino,.Italy

Madhukar BudagaviTexas.Instruments.Inc.Dallas,.Texas

Wai-Yip ChanDepartment.of.Electrical.and.Computer.

EngineeringQueen’s.UniversityKingston,.Ontario,.Canada

Kwang-Cheng ChenDepartment.of.Electrical.EngineeringNational.Taiwan.UniversityTaipei,.Taiwan

Giovanni CherubiniStorage.Technologies.DepartmentIBM.ReseachZurich,.Switzerland

Marco ChianiDepartment.of.Electronics,.Computer.Sciences.

and.SystemsUniversity.of.BolognaBologna,.Italy

Sayantan ChoudhuryNokia.Research.CenterBerkeley,.California

Leon W. Couch IIDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.FloridaGainesville,.Florida

Donald C. CoxDepartment.of.Electrical.EngineeringStanford.UniversityStanford,.California

xiv Contributors

Zhi DingDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.California,.DavisDavis,.California

Tiago H. FalkCentre.Énergie.Matériaux.

TélécommunicationsMontréal,.Québec,.Canada

Thomas E. FujaDepartment.of.Electrical.EngineeringUniversity.of.Notre.DameNotre.Dame,.Indiana

Costas N. GeorghiadesDepartment.of.Electrical.and.Computer.

EngineeringTexas.A&M.UniversityCollege.Station,.Texas

Rabindra GhimireDepartment.of.Applied.ScienceUniversity.of.ArkansasLittle.Rock,.Arkansas

Jerry D. GibsonDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.California,.Santa.BarbaraSanta.Barbara,.California

Tor HellesethDepartment.of.InfomaticsUniversity.of.BergenBergen,.Norway

Michael L. HonigDepartment.of.Electrical.Engineering.and.

Computer.ScienceNorthwestern.University.Evanston,.Illinois

Bijan JabbariDepartment.of.Electrical.and.Computer.

EngineeringGeorge.Mason.UniversityFairfax,.Virginia

Woo-Shik KimTexas.Instruments.Inc.Dallas,.Texas

P. Vijay KumarDepartment.of.Electrical.Engineering-SystemsUniversity.of.Southern.CaliforniaLos.Angeles,.California

Do-Kyoung KwonTexas.Instruments.Inc.Dallas,.Texas

Hyunok LeeAT&T.Labs,.Inc.San.Ramon,.California

Allen H. LevesqueDepartment.of.Electrical.and.Computer.

EngineeringWorcester.Polytechnic.InstituteWorcester,.Massachusetts

Upamanyu MadhowDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.California,.Santa.BarbaraSanta.Barbara,.California

Giridhar D. MandyamQualComm.Inc.San.Diego,.California

Juan Carlos De MartinPolitecnico.di.TorinoTorino,.Italy

Gareth MiddletonDepartment.of.Electrical.and.Computer.

EngineeringRice.UniversityHouston,.Texas

Seshadri MohanDepartment.of.Systems.EngineeringUniversity.of.ArkansasLittle.Rock,.Arkansas

Renato Mariz de MoraesDepartment.of.Electrical.EngineeringUniversity.of.Brasília.(UnB)Campus.Universitário.Darcy.RibeiroBrasília,.Brazil

xvContributors

Matthew NoklebyDepartment.of.Electrical.and.Computer.

EngineeringRice.UniversityHouston,.Texas

Geoffrey C. OrsakDepartment.of.Electrical.EngineeringSouthern.Methodist.UniversityDallas,.Texas

Kaveh PahlavanDepartment.of.Electrical.and.Computer.

EngineeringWorcester.Polytechnic.InstituteWorcester,.Massachusetts

John G. ProakisDepartment.of.Electrical.and.Computer.

EngineeringNortheastern.UniversityBoston,.Massachusetts

Dinesh RajanDepartment.of.Electrical.EngineeringSouthern.Methodist.UniversityDallas,.Texas

Bixio RimoldiCommunication.Theory.LaboratoryÉcole.polytechnique.fédérale.de.LausanneLausanne,.Switzerland

Hamid R. SadjadpourDepartment.of.Electrical.Engineering.University.of.California,.Santa.CruzSanta.Cruz,.California

Jong-Soo SeoYonsei.UniversitySeoul,.South.Korea

Erchin SerpedinDepartment.of.Electrical.EngineeringTexas.A&M.UniversityCollege.Station,.Texas

Antonio ServettiPolitecnico.di.TorinoTorino,.Italy

Sumit SinghMoseley.Wireless.Solutions.GroupSanta.Barbara,.California

Bernard SklarCommunications.Engineering.ServicesTarzana,.California

Gordon L. StüberSchool.of.Electrical.and.Computer.EngineeringGeorgia.Institute.of.TechnologyAtlanta,.Georgia

Carl-Erik W. SundbergSundCommSunnyvale,.California

Vivienne SzeTexas.Instruments.Inc.Dallas,.Texas

Rüdiger UrbankeCommunication.Theory.LaboratoryÉcole.polytechnique.fédérale.de.LausanneLausanne,.Switzerland

Bryan UsevitchDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.Texas,.El.PasoEl.Paso,.Texas

Michel Daoud YacoubSchool.of.Electrical.and.Computer.EngineeringState.University.of.CampinasSão.Paulo,.Brazil

Rodger E. ZiemerDepartment.of.Electrical.and.Computer.

EngineeringUniversity.of.Colorado,.Colorado.SpringsColorado.Springs,.Colorado

1

IBasic Principles

1 The Discrete Fourier Transform Bryan Usevitch.................................................................... 5Introduction. •. DFT.Theory. •. Properties.of.the.DFT. •. Fast.Fourier.Transforms. •. Bibliography

2 Pulse Code Modulation Leon W. Couch II.............................................................................. 23Introduction. •. Generation.of.PCM. •. Percent.Quantizing.Noise. •. Practical.PCM.Circuits. •. Bandwidth.of.PCM. •. Effects.of.Noise. •. Nonuniform.Quantizing:.μ-Law.and.A-Law.Companding. •. Example:.Design.of.a.PCM.System. •. References. •. Further.Reading

3 Baseband Signaling and Pulse Shaping Michael L. Honig and Melbourne Barton........ 35Communication.System.Model. •. Intersymbol.Interference.and.the.Nyquist.Criterion. •Nyquist.Criterion.with.Matched.Filtering. •. Eye.Diagrams. •. Partial-Response.Signaling. •Additional.Considerations. •. Examples. •. References. •. Further.Reading

4 Complex Envelope Representations for Modulated Signals Leon W. Couch II.............. 55Introduction. •. Complex.Envelope.Representation. •. Representation.of.Modulated.Signals. •. Generalized.Transmitters.and.Receivers. •. Spectrum.and.Power.of.Bandpass.Signals. •. Amplitude.Modulation. •. Phase.and.Frequency.Modulation. •. QPSK.Signaling. •OFDM.Signaling. •. Reference. •. Further.Reading

5 Modulation Methods Gordon L. Stüber.................................................................................. 71Introduction. •. Basic.Description.of.Modulated.Signals. •. Quadrature.Amplitude.Modulation. •. Phase.Shift.Keying.and.π/4-QDPSK. •. Continuous.Phase.Modulation,.Minimum.Shift.Keying,.and GMSK. •. Orthogonal.Frequency.Division.Multiplexing. •. Summary.and.Conclusions. •. References. •. Further.Reading

6 Error Control Coding Thomas E. Fuja................................................................................... 91Introduction. •. Block.Codes. •. Convolutional.Codes. •. Turbo.Codes. •. Low-Density.Parity.Check.Codes. •. Coding.and.Bandwidth-Efficient.Modulation. •. Automatic.Repeat.Request. •. References

7 Information Theory Emmanuel Abbe, Bixio Rimoldi, and Rüdiger Urbanke................. 115Introduction. •. The.Communication.Problem. •. Source.Coding.for.Discrete-Alphabet.Sources. •. Universal.Source.Coding. •. Rate.Distortion.Theory. •. Channel.Coding. •. Simple.Binary.Codes. •. References. •. Further.Reading

8 Rayleigh Fading Channels Bernard Sklar............................................................................ 133Introduction. •. The.Challenge.of.a.Fading.Channel. •. Mobile.Radio.Propagation:.Large-Scale.Fading.and Small-Scale.Fading. •. Signal.Time-Spreading.Viewed.in.the.Time-Delay.Domain:.Figure.8.1,.Block.7—The.Multipath.Intensity.Profile. •. Signal.Time-Spreading.Viewed.in.the.Frequency.Domain:.Figure.8.1,.Block.10—The.Spaced-Frequency.Correlation Function. •. Typical.Examples.of.Flat.Fading.and.Frequency-Selective.Fading.Manifestations. •. Time.Variance.Viewed.in.the.Time.Domain:.Figure.8.1,.

2 Basic Principles

Block.13—The.Spaced-Time.Correlation.Function. •. Time.Variance.Viewed.in.the.Doppler-Shift.Domain:.Figure 8.1,.Block.16—The.Doppler.Power.Spectrum. •. Analogy.between.Spectral.Broadening.in.Fading.Channels.and.Spectral.Broadening.in.Digital.Signal.Keying. •. Degradation.Categories.due.to.Time.Variance,.Viewed.in the.Doppler-Shift.Domain. •. Mitigation.Methods. •. Summary.of.the.Key.Parameters.Characterizing.Fading Channels. •. The.Viterbi.Equalizer.as.Applied.to.GSM. •. The.Rake.Receiver.Applied.to.Direct-Sequence.Spread-Spectrum.(DS/SS).Systems. •. Example.of.a.DS/SS.System.Using.a.Rake.Receiver. •. Conclusion. •. References

9 Channel Equalization John G. Proakis................................................................................. 167Characterization.of.Channel.Distortion. •. Characterization.of.Intersymbol.Interference. •Linear.Equalizers. •. Decision-Feedback.Equalizer. •. Maximum-Likelihood.Sequence.Detection. •. Conclusions. •. References. •. Further.Reading

10 Echo Cancellation Giovanni Cherubini................................................................................ 191Introduction. •. Echo.Cancellation.for.Pulse–Amplitude.Modulation Systems. •. Echo.Cancellation.for.Quadrature.Amplitude.Modulation Systems. •. Echo.Cancellation.for.Orthogonal.Frequency.Division Multiplexing.Systems. •. Summary.and.Conclusions. •. References. •. Further.Reading

11 Synchronization of Communication Receivers Costas N. Georghiades and Erchin Serpedin....................................................................................................................207Introduction. •. Carrier.Synchronization. •. Carrier.Phase.Synchronization. •. Carrier.Acquisition.for.QAM.Constellations. •. Symbol.Synchronization. •. To.Browse.Further. •. Frame.Synchronization. •. Synchronization.of.MIMO.Systems. •References. •. Further.Reading

12 Pseudonoise Sequences Tor Helleseth and P. Vijay Kumar............................................... 237Introduction. •. m.Sequences. •. The.q-ary.Sequences.with.Low.Autocorrelation. •. Families.of.Sequences.with.Low.Cross-Correlation. •. Aperiodic.Correlation. •. Other.Correlation.Measures. •. References. •. Further.Reading

13 Introduction to Spread Spectrum Systems Dinesh Rajan................................................ 253Introduction. •. Direct.Sequence.Spread.Spectrum. •. Frequency.Hopping.Spread.Spectrum. •Applications.of.Spread.Spectrum. •. Conclusions. •. References

14 Signal Space Rodger E. Ziemer................................................................................................ 265Introduction. •. Fundamentals. •. Application.of.Signal.Space.Representation.to Signal Detection. •. Application.of.Signal.Space.Representation.to.Parameter.Estimation. •. Miscellaneous.Applications. •. References. •. Further.Reading

15 Optimum Receivers Geoffrey C. Orsak ..............................................................................279Introduction. •. Preliminaries. •. Karhunen–Loève.Expansion. •. Detection.Theory. •. Performance. •. Signal.Space. •. Standard.Binary.Signaling.Schemes. •. M-ary.Optimal.Receivers. •. More.Realistic.Channels. •. Dispersive.Channels. •References. •. Further.Reading

16 MIMO Systems for Diversity and Interference Mitigation Marco Chiani................... 293Advantages.of.Multiple.Antennas.Systems. •. SISO.Systems. •. MIMO.Channel.Models. •Diversity.Techniques. •. SIMO.with.Interference.(Optimum.Combining,.MMSE Receivers). •. Acronyms. •. References

17 High-Throughput MIMO Systems. Marco Chiani ............................................................ 313Introduction. •. Capacity.of.Fixed.MIMO.Channels. •. Capacity.of.MIMO.Fading.Channels. •. MIMO.Systems.for.Spatial.Multiplexing. •. Multiuser.MIMO. •. Other.Applications.of.MIMO:.Cooperative.Communications,.Virtual.MIMO,.Distributed.Antenna Systems. •. Acronyms. •. References

18 Digital Communication System Performance Bernard Sklar......................................... 333Introduction. •. Bandwidth.and.Power.Considerations. •. Example.1:.Bandwidth-Limited.Uncoded.System. •. Example.2:.Power-Limited.Uncoded.System. •. Example.3:.

3Basic Principles

Bandwidth-Limited.and.Power-Limited.Coded System. •. Example.4:.Direct-Sequence.Spread-Spectrum.Coded System. •. Conclusion. •. Appendix.A:.Received.Eb/N0.Is.Independent.of.the.Code.Parameters. •. Appendix.B:.MATLAB®.Program.Qinv.m.for.Calculating.Q−1(x). •. References. •. Further.Reading

19 Fundamental Limitations on Increasing Data Rate in Wireless Systems Donald C. Cox............................................................................................................. 355

Introduction. •. Increasing.Data.Rate.by.Increasing.Bandwidth. •. Changing.Modulation.Levels. •. Multiple-Input,.Multiple-Output. •. Changing.Carrier.Frequency.Band.and.Base.Station.Antenna Height. •. Other.Ways.to.Increase.Data.Transmission.Rate. •. Line-of-Sight.Wireless.Link.Considerations. •. Discussion. •. Acknowledgments. •. References

20 Interference and Its Impact on System Capacity Bijan Jabbari and Alireza Babaei...... 369Introduction. •. Interference.in.Wireless.Networks. •. Interference.Modeling. •Interference.Statistics.and.Capacity. •. Applications.in.Cognitive.Radio.Networks. •Conclusions. •. References

21 Cell Design Principles Michel Daoud Yacoub..................................................................... 389Introduction. •. Cellular.Principles. •. Performance.Measures.and.System.Requirements. •System.Expansion.Techniques. •. Basic.Design.Steps. •. Traffic.Engineering. •. Cell.Coverage. •. Interference. •. Conclusions. •. References. •. Further.Reading

5

1The Discrete Fourier

Transform

1.1. Introduction...........................................................................................51.2. DFT.Theory.............................................................................................6

Fourier.Transform.Review. •. The.DFT.as.a.Sampled.DTFT. •. The.DFT.as a Change.of.Basis

1.3. Properties.of.the.DFT.........................................................................12Periodicity. •. Circular.Shift. •. Circular.Convolution. •. Duality. •.Conjugate.Property. •. Symmetries. •. Parseval’s.Theorem. •Zero.Padding.and.Linear.Convolution

1.4. Fast.Fourier.Transforms.....................................................................18Bibliography.....................................................................................................22Bryan Usevitch

1.1 introduction

The.discrete.Fourier.transform.(DFT).is.a.method.that.represents.the.frequency.content.of.a.finite.length.time.sequence,.or.sequence.of.samples..Specifically,.it.takes.N.input.samples.x(n).and.converts.them.into.N.frequency.coefficients.X(k)

.X k x n W k N

n

N

Nkn( ) ( ) , , , , ,= = … −

=

∑0

1

0 1 1.

(1.1)

where

. WN N� e j− 2π.

Conversely,.given.the.N.frequency.coefficients.X(k).of.a.DFT,.the.time.sequence.x(n).can.be.recovered.using.the.inverse.formula

.

x n N X k W n Nk

N

Nkn( ) ( ) , , , , .= = … −

=

−∑1 0 1 10

1

.(1.2)

An.important.characteristic.of.the.DFT.is.that.the.frequency.response.is.represented.with.a.finite.set.of.values.X(k)..This.is.in.contrast.to.the.related.discrete.time.Fourier.transform.(DTFT),.which.represents.the.frequency.content.of.a.discrete.time.sequence.as.a.function.of.a.continuous-valued.frequency.argu-ment..This.allows.the.DFT.to.be.conveniently.computed,.manipulated,.and.stored.on.a.general-purpose.

6 Mobile Communications Handbook

computer. or. digital. processor.. Furthermore,. the. discovery. of. fast. methods. for. computing. the. DFT,.called.fast.Fourier.transforms.(FFTs),.has.led.to.the.widespread.use.of.the.DFT.and.has.established.digi-tal.signal.processing.as.a.major.research.and.application.area.

The.DFT.is.very.closely.related.to.the.discrete.Fourier.series.(DFS)..In.fact,.the.two.transforms.share.the.same.formulas.(1.1).and.(1.2),.but.differ.in.their.interpretations..The.DFS.represents.a.periodic.dis-crete.time.sequence.as.a.linear.combination.of.complex.exponentials..The.weights.of.this.linear.combi-nation.are.X(k)/N.as.shown.in.Equation.1.2..Since.the.coefficients.X(k).are.the.sinusoid.weights,.they.represent.the.frequency.content.of.the.time.signal.x(n)..The.DFS.differs.from.the.continuous.time.Fourier.series. (FS). since. it. requires. at. most. N. complex. sinusoids. to. represent. a. signal,. whereas. the. FS. may.require.an.infinite.number..This.is.because.the.dual.constraints.of.sampling.and.periodicity.with.period.N.limit.the.total.number.of.possible.sinusoids.to.be.N.

In.contrast.to.the.DFS,.the.DFT.can.be.interpreted.as.a.linear.transformation.from.one.finite.length.sequence. to. another.. In. this. viewpoint. the. forward. and. inverse. equations. can. be. represented. using.N.×.N.matrices,.and.concepts.from.linear.algebra.can.be.used.in.analysis..Alternatively,.the.DFT.can.be.viewed.as.a.frequency-sampled.version.of.the.DTFT..The.sampling.causes.both.the.time.signal.x(n).and.the.frequency.signal.X(k).to.be.discrete.and.periodic.with.period.N..These.signals.are.formed.by.periodi-cally.repeating.the.original.time.or.frequency.sequences.defined.over.the.original.length.N.intervals..Both.interpretations.of.the.DFT.are.discussed.below.and.both.interpretations.find.use.depending.on.the.specific.application.

The.next.section.of.this.chapter.discusses.how.the.DFT.relates.to.other.Fourier.transforms.(FTs),.and.its.interpretation.from.a.sampled.DTFT.as.well.as.a.linear.algebraic.standpoint..The.following.section.derives.the.main.properties.of.the.DFT..The.subsequent.section.gives.an.overview.of.FFT.algorithms,.which.are.fast.computational.versions.of.the.DFT.

1.2 DFt theory

1.2.1 Fourier transform Review

Much.insight.into.the.nature.and.properties.of.the.DFT.can.be.gained.by.relating.the.DFT.to.other.FTs..In.particular,.the.DFT.is.very.closely.related.to.the.DTFT..Thus,.as.a.preface.to.discussing.the.DFT,.we.review.the.commonly.used.FTs.shown.in.Figure.1.1..The.first.transform.shown.is.the.continuous-time.FT,. which. computes. the. frequency. spectrum. of. a. continuous-time. signal.. The. forward. and. inverse.transform.equations.of.the.FT.are.given.by

.

X x t t

x t X

t

t

( ) ( )

( ) ( ) .

Ω

Ω Ω

Ω

Ω

=

=

−∞

−∞

e d

e d

j

j12π

When.the.time.signal.is.continuous.and.periodic,.the.frequency.spectrum.is.determined.by.the.FS..The.following.formulas.give.the.forward.and.inverse.equations.for.the.FS:

.

a k T x t tk t

T

( ) ( )= −∫1

0

0

0

e dj Ω

.(1.3)

.x t a k

k

k t( ) ( ) ,==−∞

∑ ej Ω0

.(1.4)

7The Discrete Fourier Transform

where.T0.is.the.fundamental.period.of.the.time.function,.Ω0.is.the.fundamental.frequency,.and.these.are.related.by.Ω0.=.(2π/T0)..Observe.in.particular.that.continuous-time.periodic.signals.result.in.a.discrete,.or.sampled,.frequency.spectrum,.and.the.frequencies.are.all.integer.multiples.of.the.fundamental.fre-quency.Ω0.

While.the.FS.results.in.samples.in.the.frequency.domain,.what.is.often.needed.in.signal.processing.is.a.transform.that.operates.on.sampled.time.values..This.is.the.case.handled.by.the.DTFT.which.deter-mines.the.frequency.spectrum.of.sampled.time.signals..By.using.the.sampling.theorem,.or.equivalently.the.FS.and.duality,. it.can.be.shown.that.the.resulting.frequency.spectrum.of.the.DTFT.is.continuous.valued.and.periodic..The.exact.mathematical.form.of.the.DTFT.can.be.derived.by.applying.the.FS.in.the.frequency.domain..The.formula.of.this.frequency.domain.FS.comes.from.Equations 1.3.and.1.4.by.revers-ing.all.frequency.and.time.variables,.and.also.reversing.the.signs.of.the.exponentials..This.results.in

.

b k W G

G b k

W

kt

k

kt

( ) ( )

( ) ( )

=

=

∑=−∞

10

0

0

0

ω ω

ω

ω

ω

e d

e

j

j

where.W0.is.the.period.of.the.periodic.frequency.domain.signal,.t0.is.the.spacing.of.the.samples.in.the.time.domain,.and.t0.=.(2π./W0).

FS

FT

· · ·· · ·

Ω

N − 1

T0

Ω0

Ω

DTFT· · ·· · ·

W0 = 2π

t0 = 1

ωn

· · · · · ·

DFS/DFT

n

· · ·k

· · ·

N − 1

· · · · · ·

t

t

FIGURE 1.1 Figure. shows. commonly. used. Fourier. transforms. including,. from. the. top,. the. continuous. time.Fourier.transform.(FT),.the.continuous.time.Fourier.series.(FS),.the.discrete.time.Fourier.transform.(DTFT),.the.discrete.Fourier. series. (DFS),.and.discrete.Fourier. transform.(DFT).. (See.L..Ludeman..Fundamentals of Digital Signal Processing..New.York:.Harper.&.Row,.1986.)

8 Mobile Communications Handbook

The.DTFT.is.normalized.to.have.sample.times.fixed.on.the.integers.resulting.in.t0.=.1.and.W0.=.2π..The.resulting.DTFT.computation.formulas.are.thus

.

X x n

x n X w

n

n

n

( ) ( )

( ) ( ) .

ω

πω

ω

ω

π

π

=

=

=−∞

e

e d

j

j12

The.normalization.of.the.DTFT.results.in.x(n).being.measured.in.time.units.of.samples,.and.ω.being.measured.in.units.of.radian/sample..This.explains.the.use.of.different.frequency.variables.for.the.FT/FS.(Ω–radians/second).and.the.DTFT.(ω–radians/sample).

1.2.2 the DFt as a Sampled DtFt

We.now.investigate.the.effect.of.sampling.the.DTFT..Assume.that.we.have.a.sequence.x(n).with.DTFT.represented.by.X(ω)..We.sample.X(ω).uniformly.to.obtain.the.frequency.sequence.Y(k)

.Y k X N k k N( ) , , , , .=

⎛⎝⎜

⎞⎠⎟

= … −2 0 1 1π

The.question.we.now.want.to.answer.is.how.does.y(n),.the.time.sequence.of.Y(k),.relate.to.the.original.signal.x(n)?.This.will.demonstrate.the.net.result.of.sampling.the.DTFT..Since.X(ω).is.periodic,.Y(k).is.discrete.periodic..Thus,.we.can.find.the.time.sequence.y(n).using.the.inverse.DFS.formula.of.Equation 1.2

.y n N Y k W n N

k

N

Nkn( ) ( ) , , , , .= = … −

=

−∑1 0 1 10

1

.(1.5)

Since.Y(k).comes.from.the.sampled.DTFT,.we.can.represent.it.as

.Y k X x m

N

Nk

m

km( ) ( )| ( ) .= ==

=−∞

∞−∑ω

ω π

π

2

2e j

.(1.6)

Substituting.Equation.1.6.into.Equation.1.5.gives

.

y n N x m

x m N

m

km

k

Nkn

m

N N( ) ( )

( )

=⎛

⎝⎜

⎠⎟

=

=−∞

∞−

=

=−∞

∑∑

1

1

2 2

0

1

e ej jπ π

eej 2

0

N k n m

k

N( ).−

=

∑.

(1.7)

Equation.1.7.can.be.simplified.using.the.following.identity:

.

1 10

2

0

1

Nn lN

N kn

k

N

eotherwise

j π

=

∑ ==⎧

⎨⎪

⎩⎪.

9The Discrete Fourier Transform

Rewriting.this.identity.as

.

1 2

0

1

N n lN p nN kn

k

N

l

ej πδ

=

=−∞

∑ ∑= −( ) ( ),�.

(1.8)

Equation.1.7.can.be.expressed.as.a.convolution

.y n x m p n m x n p n

m

( ) ( ) ( ) ( ) ( ).= − = ∗=−∞

Carrying.out.the.convolution.results.in

.y n x n lN x n

lN( ) ( ) ( ).= −

=−∞

∑ � p

.(1.9)

where.x nNp ( ).is.the.periodic.extension.of.x(n).with.period.N.

This.result.shows.that.frequency.sampling.has.the.dual.effect.of.time.sampling..Namely,.it.causes.a.periodic.repetition.of.the.time-domain.sequence..In.order.to.recover.the.original.X(ω).from.its.sam-ples,.and.thus.for.the.DFT.to.be.a.valid.transform,.requires.one.more.constraint..This.constraint.is.that.the. signal. x(n). be. limited. to. the. range. 0.≤.n.≤.L.−.1. and. the. number. of. samples. in. the. DFT. satisfy.N.≥.L..In.this.case.x(n).can.be.recovered.from.extracting.one.period.of. x nN

p ( ) ,.and.X(ω).can.be.recov-ered.through.the.DTFT.of.x(n)..This.proves.that.X(ω).can.be.recovered.from.its.samples..However,.if.N.<.L. then. x nN

p ( ) . consists. of. time-aliased. replicas. of. x(n). and. X(ω). cannot. be. recovered. from. the.samples.X kN( )2≠ .

Example 1.1

In. this. example. we. use. the. DTFT. sampling. method. to. compute. the. DFT. of. a. finite. length,..complex.sinusoid

. x n p nnN( ) ( ),= ejω0

. (1.10)

where

.p n

n NN ( ) .=

≤ ≤ −⎧⎨⎪

⎩⎪

1 0 10 otherwise

We.start.by.computing.the.DTFT.of.the.windowing.pulse.pN(n)

.

P p n

N

N Nn

n n

n

N N( ) ( )

sin

ω

ω

ω ωω

ω= = =−−

=

⎛⎝

=−∞

− −

=

− −

−∑ ∑e e ee

j jj

j0

1 11

2⎜⎜⎞⎠⎟

⎛⎝⎜

⎞⎠⎟

− −

sin.

12

12

ω

ωe j N

.

(1.11)

10 Mobile Communications Handbook

The.final.DTFT.of.Equation.1.10.results.from.using.the.frequency.shift.property.on.Equation 1.11

.

X

NN

( )sin ( )

sin ( ).( )

ωω ω

ω ω

ω ω=

−⎛⎝⎜

⎞⎠⎟

−⎛⎝⎜

⎞⎠⎟

−−

−212

0

0

12 0e j

To.get.the.desired.DFT.coefficients,.we.substitute.ω.=.(2π/N)k.into.the.above.equation

.

X k

NN k

N k

N

( )sin

sin=

−⎛⎝⎜

⎞⎠⎟

⎝⎜⎞

⎠⎟

−⎛⎝⎜

⎞⎠⎟

⎝⎜⎞

⎠⎟

−−2

2

12

2

0

0

πω

πω

ej 11

22

ωN k−⎛⎝⎜

⎞⎠⎟ .

.

(1.12)

Now.consider.two.separate.cases.of.frequencies.for.the.input.sinusoid..The.first.case.is.for.frequencies.that.have.an.integer.number.of.cycles.in.the.N.sample.window:.ω0.=.(2π/N)k0..For.this.case.the.DFT.coefficients.of.Equation.1.12.simplify.to

.

X k k k

N k k

NN k k( ) sin( ( ))

sin ( ).( )

=−

−⎛⎝⎜

⎞⎠⎟

−−

−ππ

π0

0

10e j

Note.that.the.quotient.of.sines.in.the.equation.above.is.a.digital.sinc.function..This.results.in.all.values.of.the.DFT.being.zero,.except.at.the.index.k.=.k0,.which.corresponds.to.the.index.of.the.input.frequency..A.plot.of.both.the.DFT.coefficients.and.underlying.DTFT.for.the.case.of.N.=.8.and.k0.=.3.is.shown.in.Figure.1.2.

Now.consider.the.second.case.where.the.input.frequency.does.not.have.an.integer.number.of.cycles.in.the.N.sample.time.input..Using.Equation.1.12.for.the.case.of.N.=.8.and.ω0.=.0.7π.gives.the.result.shown.in.Figure.1.2..Note.in.particular.that.the.samples.occur.at.nonzero.values.of.the.underlying.DTFT.frequency.response..It.may.seem.counterintuitive.that.the.DFT.of.a.sinusoid.results.in.the.spectrum.on.the.right-hand.side.of.Figure.1.2..However,.note.that.the.input.is.only.a.sinusoid.in.the.initial.N.sample.input.window..Frequency.sampling.causes.this.window.to.be.periodically.repeated.as.shown.by.Equation.1.9..Since.the.input.does.not.have.an.integer.number.of.frequency.cycles.in.the.input.window,.this.results.in.discontinuities.at.the.repeated.window.boundaries..The.overall.periodic. input. is. thus.not.a.clean.sinusoid,.and.the.spectrum.on.the.right.of.Figure.1.2.results.

1.2.3 the DFt as a change of Basis

A.second.way.of.viewing.the.DFT.is.as.a.linear.transform.from.one.finite.sequence.to.another..In.this.case.we.represent.the.input.x(n).and.DFT.coefficients.X(k).as.vectors

.

x X=

⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥

=

⎢⎢⎢⎢⎢

xx

x N

XX

X N

( )( )

( )

,

( )( )

( )

01

1

01

1� �

⎥⎥⎥⎥⎥⎥

.

As.shown.below,.the.transformation.from.x.to.X.is.accomplished.using.an.N.×.N.DFT.matrix.From.the.linear.algebra.viewpoint,.the.DFT.becomes.a.way.of.representing.a.vector.on.an.alternative.basis

.x b=

=

∑αii

N

i0

1

,.

(1.13)

11The Discrete Fourier Transform

where.bi.are.the.basis.vectors.and.the.αi.are.the.scalar.weights.needed.to.reconstruct.the.signal.x.using.this.basis..Specifically,.for.the.DFT,.the.basis.vectors.are.complex.sinusoids.at.uniformly.spaced.frequen-cies,.where.each.basis.vector.has.an.integer.number.of.cycles.in.the.N.sample.window

.

biin

Ni

Ni

NN i

N

WW

W

=

⎢⎢⎢⎢

⎥⎥⎥⎥

=

⎢⎢⎢⎢⎢⎢

⎥⎥⎥

− −

|

|( )

ej 2

1

2

1

π

�⎥⎥⎥⎥

.

Given.these.specific.basis.vectors,.the.problem.becomes.one.of.finding.the.weights.αi.that.represent.x..This.problem.can.be.solved.in.a.straightforward.manner.by.expressing.Equation.1.13.in.matrix.form

. x W= α

where

.

W b b b=

⎢⎢⎢

⎥⎥⎥

=−

− − − −

| | |

| | |

( )

0 1 �

��

N

N N NN

N N

W W WW W1

1 2 1

2

1 1 1 111 −− − −

− − − − − − −

⎢⎢⎢⎢⎢⎢

4 2 1

1 2 1 1 11

�� � � �

W

W W W

NN

NN

NN

NN N

( )

( ) ( ) ( )( )⎦⎦

⎥⎥⎥⎥⎥⎥

.

Since.the.basis.vectors.are.orthogonal,.the.columns.of.W.are.orthogonal.(and.only.differ.from.ortho-normal.vectors.by.a.common.constant)..The.inverse.of.the.matrix.W.can.thus.be.formed.by.taking.its.Hermitian.transpose

00

1

2

3

4

5

6

7

8

0

1

2

3

4

5

6

7

8

1 2 3 4Index Index

5 6 7 8 0 1 2 3 4 5 6 7 8

FIGURE 1.2 The.left.plot.shows.the.magnitude.of.the.DTFT.(solid).and.8-point.DFT.(samples).of.a.complex.sinu-soid.having.an.integer.number.of.cycles.in.the.N.sample.time.window. ( . )ω ππ

028 3 0 75= ⋅ = ..For.this.case.the.zeros.

of.the.DTFT.align.with.the.samples.of.the.DFT..The.right.plot.repeats.this.example.except.that.the.sinusoid.no.longer.has.an.integer.number.of.cycles.in.the.N.sample.time.window.(ω0.=.0.7π)..As.a.result,.the.samples.of.the.DFT.no.longer.align.with.the.zeros.of.the.DTFT.

12 Mobile Communications Handbook

.I W W WW= =

1 1N N

H H.

The.matrix.D.=.WH.is.called.the.DFT.matrix.and.is.written.as

.

D

bb

b

=

−− −−

−− −−

−− −−

⎢⎢⎢⎢⎢

⎥⎥⎥⎥⎥

=

−0

2

1

2 1

1 1 1 11

H

H

H

��

N

N N NNW W W

11

1

2 4 2 1

1 2 1 1 1

W W W

W W W

N N NN

NN

NN

NN N

�� � � � �

( )

( ) ( )( )

− − − −

⎢⎢⎢⎢⎢⎢

⎦⎦

⎥⎥⎥⎥⎥⎥

.

.

(1.14)

The.reason.D.is.called.the.DFT.matrix.is.that.it.can.be.readily.verified.from.Equations.1.1.and.1.14.that.multiplying.a.vector.by.D.results.in.computing.its.DFT:.X.=.Dx..Returning.to.the.basis.representa-tion.problem,.we.have.that

.x Ix WDx WX b= = = =

=

∑1 1 1

0

1

N N N X kk

N

k( ) ..

(1.15)

We.can.see.from.Equation.1.15.that.when.we.represent.a.vector.x.using.the.DFT.basis.vectors,.the.DFT.coefficients.divided.by.N.are.the.scalar.weights.in.the.linear.combination.needed.to.reconstruct.the.vector.x..Since.each.of.the.basis.vectors.represents.a.separate.frequency,.the.DFT.coefficients.tabulate.the frequency.content.of.the.original.vector.

1.3 Properties of the DFt

In.this.section,.we.enumerate.some.of.the.properties.of.the.DFT.transform..Many.of.these.properties.are.similar.to.those.of.the.continuous.time.FT.and.DTFT,.which.is.to.be.expected.since.all.these.transforms.decompose.signals.onto.a.set.of.complex.sinusoids..However,.the.DFT.has.some.idiosyncrasies.due.to.it.being.a.transform.for.finite.length.(or.equivalently.periodic).sequences..Properties.of.the.DFT.are.sum-marized.in.Table.1.1.

1.3.1 Periodicity

The.sequences.x(n).and.X(k).are.periodic.with.period.N

. x n x n N X k X k N n k( ) ( ), ( ) ( ), .= + = + for all and

This.property.can.be.proved.directly.from.Equations.1.1.and.1.2..For.example,.the.proof.for.the.time.sequence.x(n).is

.

x n N N X k N X kk

Nk n N

k

NknN N( ) ( ) ( ) ( )( )+ = =

=

−+

=

∑ ∑1 1

0

1

0

122 2

e e ej j jπ ππ kk

k

Nkn

N X k x nN= ==

∑1

0

12

( ) ( ).ej π

13The Discrete Fourier Transform

1.3.2 circular Shift

Standard.time.shifting.in.the.DFT.presents.a.problem.for.a.finite.length.sequence.since.coefficients.can. be. shifted. out. of. the. original. N. sample. time. window,. 0.≤.n.≤.N.−.1.. However,. this. problem. is.solved.by.considering.the.underlying.periodic.signal.corresponding.to.the.finite.sequence..Time.shift-ing.in.the.DFT.corresponds.to.linearly.shifting.this.periodic.signal.and.retaining.only.the.values.that.fall.into.the.original.N.sample.window.(see.Figure.1.3)..Alternatively,.the.periodic.shift.can.be.viewed.as.circularly.shifting.the.samples.in.the.original.N.sample.window.as.also.shown.in.Figure.1.3..The.locations.of.circularly.shifted.samples.can.be.computed.using.modulo.arithmetic..If.we.represent.the.circularly.shifted.x(n).by.xs(n),. then.xs(n).can.be.written. in. terms.of. the.original.sequence.x(n). for.0.≤.n.≤.N.−.1.as

. x n x n n x n nN Nsp( ) ( ) (( ))= − = −0 0

where. ((⋅))N. represents. the.modulo.remainder..For.positive.n,. the.modulo.remainder. is.computed.by.writing.n.as.n.=.qN.+.r,.from.which.the.remainder.is.read.directly.as.((n))N.=.r..For.negative.n,.multiples.of.N.are.added.until.kN.+.n. is.positive.and.the.modulo.operator. is.applied.on.this.positive.value.. In.particular,.the.time.reversal.of.x(n).can.be.written.x(−n).=.x(N.−.n).

The.previous.definition.of.shifting.results. in.a.DFT.property.which.parallels.those.of.the.FT.and.DTFT..Namely,.the.result.of.shifting.a.time.sequence.is.to.multiply.its.DFT.by.a.complex.exponential

. x n n X kNknN(( )) ( ) .− ← →⎯⎯ −

02

0DFT jeπ

This.property.is.proved.for.shifts.in.the.range.0.≤.n0.≤.N.−.1.only,.since.any.shift.n1.outside.this.range.can.be.written.as.n1.=.n0.+.lN,.l.an.integer,.and

. x n n x n n lN x n nN N N(( )) (( ( ))) (( )) .− = − + = −1 0 0

TABLE 1.1 DFT Properties

Property Time.Domain Frequency.Domain

Signals x(n),.y(n) X(k),.Y(k)Linearity ax(n).+.by(n) aX(k).+.bY(k)Time.reversal x((N.−.n))N X((N.−.k))N

Time.shift x((n.−.n0))N X k N kn( )e j− 20

π

Frequency.shift x n N k n( )ej 20

≠X((k.−.k0))N

Time.convolutionx l y n l

l

NN

=

∑ −0

1( ) (( ))

X(k)Y(k)

Frequency.convolution x(n)y(n) 10

1

N X m Y k mm

NN

=

∑ −( ) (( ))

Duality 1N X n( ) x((N.−.k))N

Complex.conjugate X*(n) X*((N.−.k))N

Parseval’s.theorem| ( ) | | ( ) |

n

N

k

Nx n N X k

=

=

∑ ∑=0

12

0

121

14 Mobile Communications Handbook

This.shows.that.all.shifts.can.be.mapped.into.this.range..We.start.from.the.DFT.definition

.x n n x n nN

n

N

NknN(( )) (( )) .− −← →⎯⎯

=

−−∑0

0

1

02DFT jeπ

Splitting. the. sum. into. positive. and. negative. time. indices,. and. recognizing. that. for. negative. indices.((n.−.n0))N.=.(N.+.n.−.n0).gives

.x n n x N n n x n nN

n

nkn

n n

NN(( )) ( ) ( )− + − + −← →⎯⎯

=

−−

=

∑ ∑00

1

0

1

0

02

0

DFT jeπ

ee j− 2πN kn.

Using.the.substitutions.m.=.N.+.n.−.n0.and.m.=.n.−.n0.for.the.two.sums.and.combining.results.in

.

x n n x m x mNm N n

Nk m n

m

N n

N(( )) ( ) (( )− +← →⎯⎯= −

−− +

=

− −

∑ ∑0

1

0

1

0

20

0DFT je

π

))

( ) ( )

( )e

e e e

j

j j j

− +

=

−− − −= =∑

20

2 20

20

0

1

π

π π π

N

N N N

k m n

m

Nkm kn knx m X k

which.proves.the.property..A.main.point.to.take.away.from.the.previous.discussion.is.that.because.of.the.underlying.periodic.nature.of.the.DFT,.all.time.and.frequency.shifts.for.sequences.are.circular.shifts..As.a. result,. many. texts. eliminate. the. modulo. notation. for. shifts. except. when. explicitly. discussing. shift.operations.

N − 1 N − 1n

······

Circular shiftLinear shift

n

N − 1 N − 1n

······

n

FIGURE 1.3 The.left.figure.shows.the.linear.shift.of.a.periodic,.length.N.sequence,.and.the.right.figure.shows.the.circular.shift.of.a.finite.length.N.sequence,.demonstrating.that.the.two.operations.are.equivalent.

15The Discrete Fourier Transform

1.3.3 circular convolution

Since.convolution.uses.time.shifts,.the.convolution.defined.for.the.DFT.is.circular.convolution

.y n x l h n l x n h n

l

N

N( ) ( ) (( )) ( ) ( ),= − ==

∑0

1

○N

.(1.16)

where.○N .denotes.circular.convolution.of.length.N..Like.other.FTs,.circular.convolution.results.in.mul-tiplication.of.the.DFT.transforms

. x n h n X k H k( ) ( ) ( ) ( ).○N DFT← →⎯⎯ . (1.17)

This.property.can.be.proved.by.substituting.the.inverse.transform.definitions.from.Equation.1.2.into.the.circular.convolution.formula.(1.16).and.using.the.time.shift.property.of.the.DFT

.

x l h n l N X k N Hl

N

Nk

Nkl

l

N

m

N

=

=

=

∑ ∑∑− =⎛

⎝⎜

⎠⎟

0

1

0

1

0

1 1 12( ) (( )) ( )ej π

==

−−

=

=

∑∑

⎝⎜

⎠⎟

=

0

1

0

1

0

1

2

21

Nm n l

m

N

k

Nm

m

N X k H m

N

N

( )

( ) ( )

( )e

e

j

j

π

π nn kl

l

Nml

NN N

1 2 2

0

1

e ej jπ π

=

−−∑

⎣⎢⎢

⎦⎥⎥.

Using.the.identity.of.Equation.1.8.for.the.bracketed.term,.this.expression.simplifies.to

.x l h n l N X k H k

l

N

Nk

NknN

=

=

∑ ∑− =0

1

0

11 2( ) (( )) ( ) ( ) .ej π

Recognizing.that.the.right-hand.side.of.this.equation.is.the.inverse.DFT.of.the.product.X(k)H(k).proves.the.DFT.transform.pair.of.Equation.1.17.

The.dual.to.the.convolution.multiplication.property.can.also.be.proved.in.a.similar.manner..This.prop-erty.states.that.multiplication.in.the.time.domain.is.equivalent.to.convolution.in.the.frequency.domain

.v n x n N V k X k( ) ( ) ( ) ( ).DFT N← →⎯⎯

1 ○.

(1.18)

Example 1.2

In.this.example.we.compute.the.four-point.circular.convolution.of.the.following.sequences:

.x n h n( ) { , , , }, ( ) { , , , }= =

↓ ↓

5 2 1 3 1 2 3 4.

(1.19)

Equation.1.16.shows.that.each.output.y(n).is.computed.from.an.inner.product.of.x(n).and.a.time.reversed.and.shifted.h(n)..Thus,.for.example,.y(0).is.computed.as

.y x k h k

k

( ) ( ) ( ) .0 5 1 2 4 1 3 3 2 220

3

= − = ⋅ + ⋅ + ⋅ + ⋅ ==∑

Figure.1.4.shows.the.circular.convolution.process.and.the.resulting.convolution.output.

16 Mobile Communications Handbook

1.3.4 Duality

As.can.be.seen.from.Equations.1.1.and.1.2,.the.forward.and.inverse.DFT.differ.by.only.a.sign.in.the.exponent.and.a.scaling.factor..This.similarity.leads.to.the.duality.property.which.states.that.if.the.DFT.of.x(n).is.X(k),.then

.1N X n x k( ) ( ).DFT← →⎯⎯ −

The.proof.of.this.property.is

.

1 1 1

0

1

0

12 2

N X n N X n N X nn

Nkn

n

Nk nN N( ) ( ) ( ) ( )DFT j je e← →⎯⎯ =

=

−−

=

−−∑ ∑

π π

== −x k( ).

This.property.has. theoretic.usefulness. in. that.any. forward.DFT.property.can.be.changed. into.an.inverse.property,.and.vice.versa..It.also.has.a.practical.application..Memory-limited.computer.systems.only.need.to.store.a.forward.DFT.routine..The.inverse.DFT,.according.to.the.duality.property,.can.then.be.computed.from.the.forward.DFT.by.the.three-step.process.of:.(1).scaling.by.1/N,.(2).forward.DFT,.and.(3).time.reversal.

1.3.5 conjugate Property

This.property.is.useful.for.determining.symmetries.and.also.for.proving.Parseval’s.theorem..Given.a.DFT.pair,.x(n).and.X(k),.the.DFT.of.the.conjugate.is

. x n X N k*( ) ( ).*DFT← →⎯⎯ − . (1.20)

This.property.is.proved.as.follows:

.

x n x n x nn

Nkn kn

n

N

n

NN N*

*( ) ( ) ( ( )

=

−−

=

=

−−∑ ∑ ∑= ( ) =

0

1

0

1

0

12 2

e e ej j jπ π 22πN k n

X k X N k

( )

*

* *( ) ( ).

−⎛

⎝⎜

⎠⎟

= − = −

Index 0 1 2 3x(k) 5 2 1 3 y(n)h(−k) 1 4 3 2 22h(1.−.k) 2 1 4 3 25h(2.−.k) 3 2 1 4 32h(3.−.k) 4 3 2 1 31y(n) 22 25 32 31

FIGURE 1.4 This.figure.tabulates.the.circular.convolution.of.two.length.4.time.sequences.given.in.Equation.1.19..To.compute.the.output.y(n),.take.the.inner.(dot).product.of.the.row.labeled.x(k).with.a.time-reversed.and.shifted.impulse.response.row.h(n −.k)..The.output.of.each.inner.product.is.shown.to.the.right.of.the.corresponding.h(n −.k),.and.also.repeated.(to.give.the.correct.time.index.values).on.the.bottom.row.

17The Discrete Fourier Transform

1.3.6 Symmetries

Signals.which.are.symmetric.about.the.origin,.and.thus.equal.their.time.reversal,.are.said.to.be.even..An.even.DFT.time.sequence.thus.satisfies

. x n x n x N ne e e( ) ( ) ( ).= − = −

Sequences.which.are.antisymmetric.about.the.origin.are.called.odd.and.satisfy

. x n x n x N no o o( ) ( ) ( ).= − − = − −

Using.these.definitions,.we.now.examine.the.symmetry.properties.of.DFT.transforms.of.real.sequences..Real.sequences.are.equal.to.their.conjugates,.x(n).=.x*(n)..Using.the.conjugate.property.(1.20).and.not-ing.that.the.DFT.coefficients.are.unique.result.in

. X k X N k( ) ( ).*= − . (1.21)

Signals. that. satisfy. Equation. 1.21. are. called. conjugate. symmetric.. Thus,. conjugate. symmetric.sequences.equal.the.conjugate.of.their.time.reversal..Writing.Equation.1.21.in.terms.of.real.and.imagi-nary.parts.results.in

. X k X k X N k X N kR I R Ij j( ) ( ) ( ) ( ),+ = − − −

from.which.we.derive.the.following.equalities:

.

X k X N kX k X N k

R R

I I

( ) ( )( ) ( ).

= −

= − − .(1.22)

This.shows.that.for.real.input.sequences.the.real.part.of.the.DFT.is.even,.and.the.imaginary.part.is.odd.If.we.further.restrict.the.real.function.to.be.even,.we.get

.

x n x n N kn xn

Nkn

n

N

n

NN

ej

e ee j=

−−

=

=

∑ ∑ ∑=⎛⎝⎜

⎞⎠⎟−

0

1

0

1

0

12 2( ) ( )cosπ π (( )sin

( )cos ( ).

n N kn

x n N kn X kn

N

2

2

0

1

π

π

⎛⎝⎜

⎞⎠⎟

=⎛⎝⎜

⎞⎠⎟=

=

∑ e R . (1.23)

The.imaginary.term.in.the.equation.above.is.zero.since.the.product.xe(n).sin(2πnk/N).is.odd,.and.the.sum.over.one.period.of.an.odd.periodic.function.is.zero..Thus,.the.DFT.transform.coefficients.of.an.even.real.sequence.are.both.real.(by.1.23).and.even.(by.1.22)..In.a.similar.manner.it.can.be.shown.that.the.DFT.of.an.odd.real.sequence.xo(n).results.in.a.sequence.that.is.both.imaginary.and.odd.

1.3.7 Parseval’s theorem

Parseval’s.theorem.is.not.a.transform.pair,.but.rather.an.equality..The.theorem.states.that.the.energy.in.the.time.sequence.coefficients.equals.the.energy.in.the.DFT.transform.coefficients:

.x n N X k

n

N

k

N

( ) ( ) .2 2

0

1

0

11

=

=

∑ ∑=

.(1.24)

18 Mobile Communications Handbook

Proof.of.this.theorem.starts.with.the.two.sequences.x(n).and.y*(n)..Using.the.multiplication.property.(1.18).and.conjugate.property.(1.20).gives.the.following.DFT.pair:

.x n y n N X k Y N k( ) ( ) ( ) ( ).* DFT N← →⎯⎯ −∗1

Á

Writing.this.pair.as.an.equality.gives

.x n y n N X l Y l k

n

Nkn

l

N

NN

=

−−

=

∑ ∑= −0

1

0

12 1( ) ( ) ( ) (( )) .* *e j π

Setting.k.=.0.results.in.the.general.form.of.Parseval’s.theorem

.x n y n N X l Y l

n

N

l

N

=

=

∑ ∑=0

1

0

11( ) ( ) ( ) ( ).* *

.(1.25)

The.energy.equality.form.of.Parseval’s.theorem.(1.24).follows.from.Equation.1.25.by.setting.x(n).=.y(n).

1.3.8 Zero Padding and Linear convolution

In.most.practical.situations.it.is.linear.convolution.that.is.needed.and.not.the.circular.convolution.pro-vided.by.the.DFT..Using.a.straightforward.technique.called.zero.padding.allows.the.DFT.to.compute.linear.convolution.using.circular.convolution..Zero.padding.is.the.lengthening.of.a.sequence.through.the.addition.of.zeros.so.that.it.can.be.used.in.a.larger-sized.DFT..The.effect.of.zero.padding.can.be.seen.from.the.viewpoint.of.the.DFT.as.a.sampled.DTFT..Recall.that.for.a.time.sequence.of.length.L,.the.DFT.must.have.a.length.of.at. least.N.=.L. to.avoid.time.aliasing,.which.corresponds.to.N.DTFT.frequency.samples. (see.Section.1.2.2)..Using.a.DFT. length.of.N.>.L. also.avoids. time.aliasing.and. results. in.an.invertible. DFT.. For. this. case. of. N.>.L,. the. input. time. vector. needs. additional. values. for. the. indices.L.≤.n.≤.N.−.1,.and.these.are.provided.by.zero.padding..The.effect.of.zero.padding.on.the.DFT.can.be.seen.by.noting.that.the.original.length.L.sequence.and.the.zero-padded.length.N.sequence.both.have.exactly.the.same.DTFT..Thus,. increasing.the.DFT.length.only.serves.to.sample.the.DTFT.frequency.response.more.densely..This.effect.is.demonstrated.in.Figure.1.5.

Using.zero.padding.allows.circular.convolution.to.compute.linear.convolution..The.key.point.to.note.is.that.when.convolving.a.length.L.sequence.with.a.length.M.sequence,.the.result.is.a.length.L.+.M.−.1.sequence..Using.a.DFT.length.of.N.≥.L.+.M.−.1.avoids.the.“aliasing”.wrap.around.from.circular.convo-lution,.and.results.in.linear.convolution..This.is.demonstrated.in.Figure.1.6.where.the.convolution.of.Example.1.2.is.repeated.with.zero.padding.

1.4 Fast Fourier transforms

The.Fast.Fourier.transform.(FFT).refers.to.algorithms.that.reduce.the.number.of.computations.required.to.compute.the.DFT..The.savings.achieved.by.the.FFT.can.be.dramatic,.usually.reducing.the.computa-tional.load.by.orders.of.magnitude.versus.the.DFT..In.fact,.the.computational.savings.in.computing.the.DFT.provided.by.the.FFT.was.a.major.factor.in.digital.signal.processing.becoming.a.major.research.and.application.area..It.should.be.noted.that.the.DFT.and.FFT.both.give.the.same.results,.and.differ.only.in.implementation..For.example,.the.popular.computing.package.MATLAB®.does.not.have.a.“DFT”.rou-tine.but.only.an.“FFT”.routine.

19The Discrete Fourier Transform

0–1

–0.8–0.6–0.4–0.2

00.20.40.60.8

Original sequence

Zero-padded sequence

Index0

–1–0.8–0.6–0.4–0.2

00.20.40.60.8

1 8

7

6

5

4

3

2

1

01 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8

Index

1

1 2 3 4 5 6 7 8Index

9 10 11 12 13 14 15 00

1

2

3

4

5

6

7

8

1 2 3 4 5 6 7 8Index

9 10 11 12 13 14 15 16

FIGURE 1.5 These.plots.illustrate.the.effect.of.zero.padding.the.DFT..The.top.left.shows.the.(real).samples.of.a.complex.sinusoid.of.length.8..The.top.right.shows.the.magnitude.of.both.the.DTFT.(solid.line).and.DFT.(samples)..The.bottom.figures.show.what.happens.when.the.identical.input.is.zero.padded.to.length.16..Note.that.the.DTFT.remains.unchanged..However,.since.the.length.of.the.DFT.has.doubled,.the.DFT.sampling.density.of.the.DTFT.is.twice.that.of.the.original.length.8.DFT.

Index 0 1 2 3 4 5 6x(k) 5 2 1 3 0 0 0 y(n)h(−k) 1 0 0 0 4 3 2 5h(1.−.k) 2 1 0 0 0 4 3 12h(2.−.k) 3 2 1 0 0 0 4 20h(3.−.k) 4 3 2 1 0 0 0 31h(4.−.k) 0 4 3 2 1 0 0 17h(5.−.k) 0 0 4 3 2 1 0 13h(6.−.k) 0 0 0 4 3 2 1 12y(n) 5 12 20 31 17 13 12

FIGURE 1.6 This.figure.repeats.the.convolution.example.of.Figure.1.4.except.that.the.sequences.have.been.zero.padded.to.guarantee.that.the.resulting.convolution.is.linear..Note,.for.example,.that.the.values.of.h(−k).that.wrap.around.due.to.circular.shifting.now.are.multiplied.by.zero.values.of.x(k)..Thus.zero.padding.eliminates.“collisions”.due.to.the.wrap.around.of.circular.shifting.

20 Mobile Communications Handbook

To.understand. the.computational. savings.of. the.FFT,.we.first. examine. the.computational. require-ments.of.the.DFT..Referring.to.the.DFT.definition.(1.1).or.the.matrix.form.of.Equation.1.14,.we.see.that.the. computation. of. each. DFT. frequency. coefficient. requires. an. N. point. inner. product.. We. assume.throughout.our. the.discussion. that. the. time.sequence.x(n). is.complex.valued..Thus,. to.compute.each.value.X(k).requires.N.complex.multiplies,.resulting.in.a.total.of.N2.complex.multiplies.to.compute.the.entire.DFT..The.most.commonly.used.FFT.algorithms.can.compute. the.DFT.using.only.O( log )N N2 .complex. multiplies.. Specifically,. for. the. power. of. 2. FFT. shown. below,. only. ( )logN N/2 2 . multiplies.are required.

To.appreciate.the.savings.offered.by.the.FFT,.consider.the.ratio.of.N2/((N/2)log2N)..For.N.=.1024.the.ratio.is.204.8..Using.a.time.analogy.where.time.is.proportional.to.multiplies,.1.min.to.compute.the.FFT.would.require.nearly.3.5.h. for. the.DFT..For. length.215.=.32k,. the.ratio. is.4369.and.1.min. for. the.FFT.stretches.out.to.over.3.days.for.the.DFT.to.compute.the.same.result.

In.the.following.we.derive.the.FFT.for.the.most.common.case.of.N.being.a.power.of.2.(N.=.2l,. l.an.integer)..We.start.with.the.equation.for.the.forward.DFT.(1.1).and.divide.it.into.sums.over.even-.and.odd-indexed.coefficients

.X k x n W x n W

nNkn

nNkn( ) ( ) ( ) .

, ,

= +∑ ∑even odd

Representing.the.even.and.odd.indices.with.n.=.2m.and.n.=.2m.+.1,.respectively,.gives

.X k x m W W x m W

mN

kmNk

mN

km

N N

( ) ( ) ( ) .= + +=

=

∑ ∑0

1

2

0

1

22 2

2 2 1

Observing.that

.W WN

km km km kmN NN

2 22 22

2= = =− −e ej jπ π

/ ,

the.previous.equation.simplifies.to

.X k x m W W x m W

m

kmNk

m

km

N

N

N

N( ) ( ) ( ) .= + +=

=

∑ ∑0

1

0

12

2

2

22 2 1

We.recognize.the.first.term.in.the.previous.equation.as.the.N/2.point.DFT.of.the.even-indexed.inputs,.and.the.second.term.as.WN

k .times.the.N/2.point.DFT.of.the.odd-indexed.inputs..Denoting.these.DFTs.as.A(k).and.B(k),.respectively,.and.noting.the.fact.that.these.DFTs.are.periodic.with.period.N/2,.we.can.write.this.equation.as

.

X k A k W B k k N

X k N A k W B k

Nk

Nk N

( ) ( ) ( ), , , ,

( ) (

= + = … −

+⎛⎝⎜

⎞⎠⎟= +

+( )

0 1 2 1

22 )), , , , .k N

= … −0 1 2 1

21The Discrete Fourier Transform

An.additional.savings.in.multiplies.results.from.noting.that

. W WNk k k

Nk

NN N

NN

+ − − ( ) − −= = = −22 2

22

e e e ej j j jπ π ππ ,

which.allows.the.results.to.be.written

.

X k A k W B k k N

X k N A k W B k k

Nk

Nk

( ) ( ) ( ), , , ,

( ) ( ),

= + = … −

+⎛⎝⎜

⎞⎠⎟= − =

0 1 2 1

2 0,, , , .1 2 1… −N

The.previous.shows.that.computation.of.an.N.point.DFT.can.be.done.by.computing.two.N/2.point.DFTs,.weighting.the.coefficients.of.one.DFT.by.W

Nk ,.and.adding.or.subtracting.from.these.results..This.

is.shown.in.Figure.1.7.for.a.length.8.DFT.using.flow.graph.notation..Significant.computational.savings.results.since.no.additional.multiplies.are.required.to.compute.the.last.N/2.coefficients..All.these.prod-ucts.were.already.computed.when.determining.the.first.N/2.coefficients.

The.simplification.process.continues.by.dividing.each.N/2.DFT.into.two.N/4.DFTs,.and.then.into.four N/8.DFTs,.and.so.on,.until.all.DFTs.are.length.2..The.resulting.structure.is.called.a.decimation.in time.(DIT).FFT,.and.an.example.DIT.FFT.for.N.=.8.is.shown.in.Figure.1.8..The.total.number.of mul-tiplies.needed.to.compute.the.FFT.can.be.determined.by.noting.that.each.stage.of.the.FFT.requires.N/2 .multiplies.by.the.factors.W k

α..Since.a.length.N.FFT.requires.log2N.stages,.the.total.number.of.com-

plex.multiplies.required.is. N N2 2log ..As.mentioned.previously,.this.is.a.significant.savings.over.the.N2.complex.multiplies.required.by.direct.computation.of.the.DFT..Although.this.discussion.only.derived.the.power.of.two.FFT,.similar.methods.yield.FFTs.for.arbitrary.DFT.lengths.

W 08

W18

W 28

W 38

x(0)

x(4)

x(2)

x(6)

x(1)

x(5)

x(3)

x(7)

X(0)

X(1)

X(2)

X(3)

X(4)

X(5)

X(6)

X(7)

−1

−1

−1

−1

4 pointDFT

4 pointDFT

FIGURE 1.7 This.figure.shows.how.a.DFT.of.length.8.can.be.computed.by.combining.the.outputs.of.two.length.4.DFTs.of.the.even-.and.odd-indexed.inputs.

22 Mobile Communications Handbook

Bibliography

. 1.. L..Ludeman..Fundamentals of Digital Signal Processing..New.York:.Harper.&.Row,.1986.

. 2.. S..Mitra..Digital Signal Processing..New.York:.McGraw-Hill,.2006.

. 3.. A..Oppenheim.and.R..Schafer..Discrete-Time Signal Processing..NJ:.Prentice-Hall,.1989.

. 4.. J..Proakis.and.D..Manolakis..Digital Signal Processing..NJ:.Prentice-Hall,.2007.

W 02

W 02

W 02

W 02

W 04

W 14

W 04

W 14

W 08

W 18

W 28

W 38

x(0)

x(4)

x(2)

x(6)

x(1)

x(5)

x(3)

x(7)

X(0)

X(1)

X(2)

X(3)

X(4)

X(5)

X(6)

X(7)

−1

Stage 1 Stage 2 Stage 3

−1

−1

−1

−1

−1

−1

−1

−1

−1

−1

−1

FIGURE 1.8 This.figure.shows.the.signal.flow.diagram.of.a.full.decimation.in.time.FFT.for.N.=.8..Observe.that.the.output.indices.are.in.numerical.order,.whereas.the.input.indices.are.in.bit-reversed.order.

The Discrete Fourier Transform L. Ludeman . Fundamentals of Digital Signal Processing. New York: Harper & Row, 1986. S. Mitra . Digital Signal Processing. New York: McGraw-Hill, 2006. A. Oppenheim and R. Schafer . Discrete-Time Signal Processing. NJ: Prentice-Hall, 1989. J. Proakis and D. Manolakis . Digital Signal Processing. NJ: Prentice-Hall, 2007.

Pulse Code Modulation * Gibson, J.D. , The Communications Handbook. Boca Raton, FL: CRC Press, Inc., 1997. Dorf, R.C. , The Electrical Engineering Handbook. Boca Raton, FL: CRC Press, Inc., 1993. Couch, L.W. , Digital and Analog Communication Systems, 7th ed. Upper Saddle River, NJ: Pearson Prentice-Hall, 2007. Couch, L.W. , Modern Communication Systems: Principles and Applications. New York, NY: MacmillanPublishing, 1995. Spilker, J.J. , Digital Communications by Satellite. Englewood Cliffs, NJ: Prentice-Hall, 1977. Jayant, N.S. and Noll, P. , Digital Coding of Waveforms. Englewood Cliffs, NJ: Prentice-Hall, 1984. Miyaoka, S. , Digital audio is compact and rugged. IEEE Spectrum, 21(3), 35–39, 1984. Peek, J.B.H. , Communication aspects of the compact disk digital audio system. IEEE CommunicationsMagazine, 23(2), 7–15, 1985. Smith, B. , Instantaneous companding of quantized signals. B. S. T. J., 36(5), 653–709, 1957. Dammann, C.L. , McDaniel, L.D. , and Maddox, C.L. , D2 Channel bank—Multiplexing and coding. B. S. T. J.,12(10), 1675–1700, 1972. Cattermole, K.W. , Principles of Pulse-Code Modulation. New York, NY: American Elsevier, 1969. Lathi, B.P. , Modern Digital and Analog Communication Systems, 3rd ed. New York, NY: Oxford UniversityPress, 1998. Couch, L.W., II. , Digital and Analog Communication Systems, 5th ed. Upper Saddle River, NJ: Prentice-Hall,1997. Many practical design situations and applications of PCM transmission via twisted-pair T-1 telephone lines,fiber optic cable, microwave relay, and satellite systems are given in [3] and [4]. In computer systems a PCMtype of data set called a WAV file is often saved and used to reconstruct analog audio signals. Seehttp://en.wilkipedia.orgformoredetails.

Baseband Signaling and Pulse Shaping Lender, A. , The duobinary technique for high-speed data Transmission. AIEE Trans. on Comm. Electronics, 82(March), 214–218, 1963. Kretzmer, E. R. , Generalization of a technique for binary data communication. IEEE Trans. Comm. Tech.,COM-14(Feb.), 67, 68, 1966. Kalet, I. and Saltzberg, B. R. , QAM transmission through a companding channel—Signal constellations anddetection. IEEE Trans. on Comm., 42(2–4), 417–429, 1994. Muller, S. H. and Huber, J. B. , OFDM with reduced peak-to-average power ratio by optimum combination ofpartial transmit sequences, Electronic Letters, 33(5), 368-369, 2002. Bingham, J. A. C. , Multicarrier modulation for data transmission: An idea whose time has come. IEEECommun. Mag., 28(May), 5–14, 1990. Harashima, H. and Miyakawa, H. , Matched-transmission technique for channels with intersymbol interference.IEEE Trans. on Commun., COM-20(Aug.), 774–780, 1972. Tomlinson, M. , New automatic equalizer employing modulo arithmetic. Electron. Lett., 7(March), 138, 139,1971. 3GPP TS 25.101 V9.5.0 and 25.102 V9.2.0 (2010-09), 3rd Generation Partnership Project; TechnicalSpecification Group Radio Access Network; User Equipment (UE) radio transmission and reception (FDD andTDD) (Release 9), September 2010. Telecommunication Industry Association . Physical Layer Standard for cdma2000 Standards for SpreadSpectrum Systems. TIA/EIA/IS-2000.2-A, March 2000. IEEE Standard 802.11TM-2007 , Local and metropolitan area networks, Part 11: Wireless LAN Medium AccessControl (MAC) and Physical Layer (PHY) Specifications, June, 2007.

IEEE Standard 802.16TM , Local and metropolitan area networks, Part 16: Air Interface for Broadband WirelessAccess Systems, May, 2009. 3GPP TS 36.101 V9.5.0 (2010-10), 3rd Generation Partnership Project; Technical Specification Group RadioAccess Network; Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) radio transmission andreception (Release 9), October 2010. Baseband signaling and pulse shaping is fundamental to the design of any digital communications system andis, therefore, covered in numerous texts on digital communications. For more advanced treatments see J.Barry, E. A. Lee and D. G. Messerschmitt, Digital Communication, Kluwer 2004, and J. G. Proakis and M.Salehi, Digital Communications, McGraw-Hill 2008.

Complex Envelope Representations for Modulated Signals * Couch, L. W., II. , Digital and Analog Communication Systems, 7th ed. Upper Saddle River, NJ: PearsonPrentice-Hall, 2007. Bedrosian, E. , The analytic signal representation of modulated waveforms. Proc. IRE, 50(October),2071–2076, 1962. Dugundji, J. , Envelopes and pre-envelopes of real waveforms. IRE Trans. Information Theory, IT-4(March),53–57, 1958. Voelcker, H.B. , Toward the unified theory of modulation—Part I: Phase-envelope relationships. Proc. IRE,54(March), 340–353, 1966. Voelcker, H.B. , Toward the unified theory of modulation—Part II: Zero manipulation. Proc. IRE, 54(May),735–755, 1966. Ziemer, R.E. and Tranter, W.H. , Principles of Communications, 4th ed. New York: John Wiley and Sons, 1995. Weinstein, S.B. , The history of orthogonal frequency-division multiplexing. IEEE Communications Magazine,47(November), 26–35, 2009.

Modulation Methods G. L. Stüber , Principles of Mobile Communication, 3rd edn, Springer Science + Business Media, 2011. J. B. Anderson , T. Aulin , and C. E. Sundberg , Digital Phase Modulation. New York, NY: Plenum, 1986. P. A. Laurent , Exact and approximate construction of digital phase modulations by superposition of amplitudemodulated pulses (AMP). IEEE Trans. Commun., 34, 150–160, 1986. K. Murota and K. Hirade , GMSK modulation for digital mobile radio telephony. IEEE Trans. Commun., 29(July),1044–1050, 1981. G. J. Garrison , A power spectral density analysis for digital FM. IEEE Trans. Commun., 23(November),1228–1243, 1975. A good discussion on modulation techniques can be found in Digital Communications, 5th edn., J. G. Proakisand M. Salehi, McGraw-Hill, 2008. Also Principles of Mobile Communication, 3rd edn., G. L. Stüber, SpringerScience + Business Media, 2011. Proceedings of various IEEE conferences such as the Vehicular Technology Conference, InternationalConference on Communications, and Global Telecommunications Conference, document the latestdevelopments in the field of wireless communications each year. Journals such as the IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Vehicular Technology report advances in wireless modulation.

Error Control Coding C. E. Shannon , A mathematical theory of communication, Bell System Technical Journal, July–October, 1948,pp. 379–423, 623–665. M. J. E. Golay , Notes on digital coding, Proceedings of the IRE, 37, 657, 1949. R. W. Hamming , Error detecting and error correcting codes, Bell System Technical Journal, 29, 147–160,1950. A. Hocquenghem , Codes correcteurs d'Erreurs, Chiffres, 2, 147–156, 1959. R. C. Bose and D. K. Ray-Chaudhuri , On a class of error correcting binary group codes, Information andControl, 3, 68–79, 1960.

I. S. Reed and G. Solomon , Polynomial codes over certain finite fields, Journal of the Society for Industrial andApplied Mathematics, 8, 300–304, 1960. John G. Proakis , Digital Communications, 4th edition, McGraw-Hill, New York, NY, 2001. V. Guruswami and A. Vardy , Maximum likelihood decoding of Reed-Solomon codes is NP-hard, IEEETransactions on Information Theory, 51(7), 2249–2256, 2005. J. Jing and K. Narayanan , Algebraic soft-decision decoding of Reed-Solomon codes using bit-level softinformation, IEEE Transactions on Information Theory, 54(9), 3907–3928, 2008. P. Elias , Coding for noisy channels, IRE Convention Record, 3, part 4, 37–46, 1955. A. Viterbi , Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEETransactions on Information Theory, IT-13, 260–269, 1967. C. Berrou , A. Glavieux , and P. Thitimajshima , Near Shannon limit error-correcting coding and decoding:Turbo codes, Proceedings of the 1993 International Conference on Communications, Geneva, Switzerland, pp.1064–1070. C. Berrou and A. Glavieux , Near optimum error correcting coding and decoding: Turbo codes, IEEETransactions on Communications, 44(10), 1261–1271, 1996. L. Bahl , J. Cocke , F. Jelinek , and J. Raviv , Optimal decoding of linear codes for minimizing symbol error rate,IEEE Transactions on Information Theory, IT-20(2), 284–287, 1974. S. Lin and D. J. Costello, Jr. , Error Control Coding, 2nd edition, Pearson Prentice-Hall, Upper Saddle River,NJ, 2004. T. Moon , Error Correction Coding, Wiley-Interscience, Hoboken, NJ, 2005. Robert G. Gallager , Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963. D. J. C. MacKay and R. M. Neal , Near shannon limit performance of low density parity check codes, ElectronicLetters, 32(18), 457–458, 1996. T. Richardson and R. Urbanke , Modern Coding Theory, Cambridge University Press, New York, NY, 2008. S.-Y. Chung , G. D. Forney , T. Richardson , and R. Urbanke , On the design of low-density parity check codeswithin 0.0045 dB of the Shannon limit, IEEE Communications Letters, 5(2), 58–60, 2001. G. Ungerboeck , Channel coding with multilevel/phase signals, IEEE Transactions on Information Theory,28(1), 55–67, 1982. E. Zehavi , 8-PSK Trellis’ codes for a Rayleigh channel, IEEE Transactions on Communications, 40(5),873–884, 1992. G. Caire , G. Taricco , and E. Biglieri , Bit-interleaved coded modulation, IEEE Transactions on InformationTheory, 44(3), 927–946, 1998. S. Lin , D. Costello, Jr. , and M. Miller , Automatic repeat request error control schemes, IEEE CommunicationsMagazine, December, 5–16, 1984. L. Rasmussen and S. Wicker , The performance of type-I Trellis coded hybrid-ARQ protocols over AWGN andslowly fading channels, IEEE Transactions on Information Theory, March, 418–428, 1994.

Information Theory Arikan, E. 2009. Channel polarization: A method for constructing capacity-achieving codes for symmetricbinary-input memoryless channels, IEEE Trans. Inform. Theory, 55:3051–3073. Arikan, E. and Telatar, E. 2009. On the rate of channel polarization. In Proceeding of the 2009 IEEEInternational Symposium on Information Theory, Seoul, Korea, pp. 1493–1495. Berrou, C. , Glavieux, A. , and Thitimajshima, P. 1993. Near Shannon limit error-correcting coding anddecoding. In Proceedings of ICC’93, Geneva, Switzerland, pp. 1064–1070. Blahut, R. 1987. Principles and Practice of Information Theory, Addison–Wesley, Reading, MA. Cover, T.M. and Thomas, J.A. 1991. Elements of Information Theory, Wiley, New York. Csiszár, I. and Körner, J. 1981. Information Theory: Coding Theorems for Discrete Memoryless Systems,Academic Press, New York. Gallager, R.G. 1963. Low-Density Parity-Check Codes, Monograph, M.I.T. Press, Cambridge, MA. Gallager, R.G. 1968. Information Theory and Reliable Communication, Wiley, New York. Luby, M. , Mitzenmacher, M. , Shokrollahi, A. , Spielman, D. , and Stemann, V. 1997. Practical loss-resilientcodes. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pp. 150–159. MacKay, D. 1999. Good error correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory,45:399–431. McEliece, R.J. 1977. The Theory of Information and Coding, Addison–Wesley, Reading, MA. Richardson, T. , Shokrollahi, A. , and Urbanke, R. 2001. Design of probably good low-density parity checkcodes, IEEE Trans. Inf. Theory, 47:619–637. Wyner, A.D. and Ziv, J. 1994. The sliding-window Lempel–Ziv algorithm is asymptotically optimal. InCommunications and Cryptography, Blahut, R.E. , Costello, D.J., Jr. , Maurer, V. , and Mittclholzer, T. (Eds.),

Kluwer Academic Publishers, Boston, MA. Ziv, J. and Lempel, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, IT-23(May):337–343. Ziv, J. and Lempel, A. 1978. Compression of individual sequences by variable rate coding. IEEE Trans. Inf.Theory, IT-24 (Sept.):530–536. For a lucid and up-to-date treatment of information theory extending beyond the area of communication, a mostrecommended reading is Cover and Thomas (1991). For readers interested in continuous-time channels andsources, we recommend Gallager (1968). For mathematically inclined readers who do not require muchphysical motivation, strong results for discrete memoryless channels and sources may be found in Csiszár andKörner (1981). Other excellent readings are Blahut (1987) and McEliece (1977). Most results in informationtheory are published in IEEE Transactions on Information Theory.

Rayleigh Fading Channels * Sklar, B. , Digital Communications: Fundamentals and Applications, 2nd Edition, Prentice-Hall, Upper SaddleRiver, NJ, 2001. Van Trees, H. L. , Detection, Estimation, and Modulation Theory, Part I, John Wiley & Sons, New York, Ch. 4,1968. Rappaport, T. S. , Wireless Communications, Prentice-Hall, Upper Saddle River, NJ, Chs. 3 and 4, 1996. Greenwood, D. and Hanzo, L. , Characterisation of mobile radio channels, In: Mobile Radio Communications,Steele, R. , Ed., Pentech Press, London, Ch. 2, 1994. Lee, W. C. Y. , Elements of cellular mobile radio systems, IEEE Trans. Vehicular Technol., 35(2), 48–56, 1986. Okumura, Y. , Field strength and its variability in VHF and UHF land mobile radio service, Rev. Elec. Comm.Lab., 16(9–10), 825–873, 1968. Hata, M. , Empirical formulae for propagation loss in land mobile radio services, IEEE Trans. VehicularTechnol., VT-29(3), 317–325, 1980. Seidel, S. Y. , Path loss, scattering and multipath delay statistics in four European cities for digital cellular andmicrocellular radiotelephone, IEEE Trans. Vehicular Technol., 40(4), 721–730, 1991. Cox, D. C. , Murray, R. , and Norris, A. , 800 MHz Attenuation measured in and around suburban houses,AT&T Bell Lab. Tech. J., 673(6), 921–954, 1984. Schilling, D. L. , Broadband CDMA for personal communications systems, IEEE Commun. Mag., 29(11), 86–93,1991. Andersen, J. B. , Rappaport, T. S. , and Yoshida, S. , Propagation measurements and models for wirelesscommunications channels, IEEE Commun. Mag., 33(1), 42–49, 1995. Amoroso, F. , Investigation of signal variance, bit error rates and pulse dispersion for DSPN signalling in amobile dense scatterer ray tracing model, Int. J. Satellite Commun., 12, 579–588, 1994. Bello, P. A. , Characterization of randomly time-variant linear channels, IEEE Trans. Commun. Syst., 360–393,1963. Proakis, J. G. , Digital Communications, McGraw-Hill, New York, Ch. 7, 1983. Green, P. E., Jr. , Radar astronomy measurement techniques, MIT Lincoln Laboratory, Lexington, MA, Tech.Report No. 282, Dec. 1962. Pahlavan, K. and Levesque, A. H. , Wireless Information Networks, John Wiley & Sons, New York, Chs. 3 and4, 1995. Lee, W. Y. C. , Mobile Cellular Communications, McGraw-Hill, New York, 1989. Amoroso, F. , Use of DS/SS signalling to mitigate Rayleigh fading in a dense scatterer environment, IEEEPersonal Commun., 3(2), 52–61, 1996. Clarke, R. H. , A statistical theory of mobile radio reception, Bell Syst. Tech. J., 47(6), 957–1000, 1968. Bogusch, R. L. , Digital Communications in Fading Channels: Modulation and Coding, Mission Research Corp.,Santa Barbara, California, Report No. MRC-R-1043, March 11, 1987. Amoroso, F. , The bandwidth of digital data signals, IEEE Commun. Mag., 18(6), 13–24, 1980. Bogusch, R. L. , Frequency selective propagation effects on spread-spectrum receiver tracking, Proc. IEEE,69(7), 787–796, 1981. Jakes, W. C. , Ed., Microwave Mobile Communications, John Wiley & Sons, New York, 1974. Joint Technical Committee of Committee T1 R1P1.4 and TIA TR46.3.3/TR45.4.4 on Wireless Access, DraftFinal Report on RF Channel Characterization, Paper No. JTC(AIR)/94.01.17–238R4, January 17, 1994. Bello, P. A. and Nelin, B. D. , The influence of fading spectrum on the binary error probabilities of incoherentand differentially coherent matched filter receivers, IRE Trans. Commun. Syst., CS-10, 160–168, 1962. Amoroso, F. , Instantaneous frequency effects in a Doppler scattering environment, IEEE InternationalConference on Communications, 1458–1466, June 7–10, 1987.

Bateman, A. J. and McGeehan, J. P. , Data transmission over UHF fading mobile radio channels, IEEE Proc.,131, Pt. F(4), 364–374, 1984. Feher, K. , Wireless Digital Communications, Prentice-Hall, Upper Saddle River, NJ, 1995. Davarian, F. , Simon, M. , and Sumida, J. , DMSK: A practical 2400-bps receiver for the mobile satellite service,Jet Propulsion Laboratory Publication 85–51 (MSAT-X Report No. 111), June 15, 1985. Rappaport, T. S. , Wireless Communications, Prentice-Hall, Upper Saddle River, NJ, Ch. 6, 1996. Bogusch, R. L. , Guigliano, F. W. , and Knepp, D. L. , Frequency-selective scintillation effects and decisionfeedback equalization in high data-rate satellite links, Proc. IEEE, 71(6), 754–767, 1983. Qureshi, S. U. H. , Adaptive equalization, Proc. IEEE, 73(9), 1340–1387, 1985. Forney, G. D. , The Viterbi algorithm, Proc. IEEE, 61(3), 268–278, 1978. Sklar, B. , Digital Communications: Fundamentals and Applications, 2nd Edition, Prentice-Hall, Upper SaddleRiver, NJ, Ch. 7, 1988. Price, R. and Green, P. E., Jr. , A communication technique for multipath channels, Proc. IRE, 555–570, 1958. Turin, G. L. , Introduction to spread-spectrum antimultipath techniques and their application to urban digitalradio, Proc. IEEE, 68(3), 328–353, 1980. Simon, M. K. , Omura, J. K. , Scholtz, R. A. , and Levitt, B. K. , Spread Spectrum Communications Handbook,McGraw-Hill, New York, 1994. Birchler, M. A. and Jasper, S. C. , A 64 kbps Digital Land Mobile Radio System Employing M-16QAM,Proceedings of the 1992 IEEE Int. Conference on Selected Topics in Wireless Communications, Vancouver,British Columbia, 158–162, June 25–26, 1992. Sari, H. , Karam, G. , and Jeanclaude, I. , Transmission techniques for digital terrestrial TV broadcasting, IEEECommun. Mag., 33(2), 100–109, 1995. Cavers, J. K. , The performance of phase locked transparent tone-in-band with symmetric phase detection,IEEE Trans. Commun., 39(9), 1389–1399, 1991. Moher, M. L. and Lodge, J. H. , TCMP—A modulation and coding strategy for Rician fading channel, IEEE J.Selected Areas Commun., 7(9), 1347–1355, 1989. Harris, F. , On the relationship between multirate polyphase FIR filters and windowed, over-lapped FFTprocessing, Proceedings of the Twenty Third Annual Asilomar Conference on Signals, Systems, andComputers, Pacific Grove, California, 485–488, October 30 to November 1, 1989. Lowdermilk, R. W. and Harris, F. , Design and performance of fading insensitive orthogonal frequency divisionmultiplexing (OFDM) using polyphase filtering techniques, Proceedings of the Thirtieth Annual AsilomarConference on Signals, Systems, and Computers, Pacific Grove, California, November 3–6, 1996. Kavehrad, M. and Bodeep, G. E. , Design and experimental results for a direct-sequence spread-spectrumradio using differential phase-shift keying modulation for indoor wireless communications, IEEE JSAC, SAC-5(5), 815–823, 1987. Hess, G. C. , Land-Mobile Radio System Engineering, Artech House, Boston, 1993. Hagenauer, J. and Lutz, E. , Forward error correction coding for fading compensation in mobile satellitechannels, IEEE JSAC, SAC-5(2), 215–225, 1987. McLane, P. I. , PSK and DPSK trellis codes for fast fading, shadowed mobile satellite communication channels,IEEE Trans. Commun., 36(11), 1242–1246, 1988. Schlegel, C. and Costello, D. J., Jr. , Bandwidth efficient coding for fading channels: Code construction andperformance analysis, IEEE JSAC, 7(9), 1356–1368, 1989. Edbauer, F. , Performance of interleaved trellis-coded differential 8–PSK modulation over fading channels,IEEE J. Selected Areas Commun., 7(9), 1340–1346, 1989. Soliman, S. and Mokrani, K. , Performance of coded systems over fading dispersive channels, IEEE Trans.Commun., 40(1), 51–59, 1992. Divsalar, D. and Pollara, F. , Turbo codes for PCS applications, Proc. ICC’95, Seattle, Washington, 54–59,June 18–22, 1995. Hanzo, L. and Stefanov, J. , The Pan-European digital cellular mobile radio system—known as GSM, In: MobileRadio Communications. Steele, R. , Ed., Pentech Press, London, Ch. 8, 1992.

Channel Equalization Forney, G. D., Jr. , Maximum-likelihood sequence estimation of digital sequences in the presence ofintersymbol interference. IEEE Trans. Inform. Theory, IT-18, 363–378, 1972. Lucky, R. W. , Automatic equalization for digital communications. Bell Syst. Tech. J., 44, 547–588, 1965. Lucky, R. W. , Techniques for adaptive equalization of digital communication. Bell Syst. Tech. J., 45, 255–286,1966. Proakis, J. G. , Digital Communications, 4th ed., McGraw-Hill, New York, 2001.

For a comprehensive treatment of adaptive equalization techniques and their performance characteristics, thereader may refer to the book by Proakis [4]. The two papers by Lucky [2,3] provide a treatment on linearequalizers based on the zero-forcing criterion. Additional information on decision-feedback equalizers may befound in the journal papers “An Adaptive Decision-Feedback Equalizer” by D.A. George, R.R. Bowen, and J.R.Storey, IEEE Transactions on Communications Technology, Vol. COM-19, pp. 281–293, June 1971, and“Feedback Equalization for Fading Dispersive Channels” by P. Monsen, IEEE Transactions on InformationTheory, Vol. IT-17, pp. 56–64, January 1971. A thorough treatment of channel equalization based onmaximum-likelihood sequence detection is given in the paper by Forney [1].

Echo Cancellation Cherubini, G. , Analysis of the convergence behavior of adaptive distributed-arithmetic echo cancellers. IEEETrans. Commun., 41(11), 1703–1714, 1993. Cherubini, G. , Creigh, J. , Ölçer, S. , Rao, S.K. , and Ungerboeck, G. , 100BASE-T2: A new standard for 100Mb/s Ethernet transmission over voice-grade cables. IEEE Commun. Mag., 35(11), 115–122, 1997. Cherubini, G. , Eleftheriou, E. , and Ölçer, S. , Filtered multitone modulation for very high-speed digitalsubscriber lines. IEEE J. Sel. Areas Commun., 20(5), 1016–1028, 2002. Cherubini, G. , Ölçer, S. , and Ungerboeck, G. , A quaternary partial-response class-IV transceiver for 125Mbit/s data transmission over unshielded twisted-pair cables: Principles of operation and VLSI realization. IEEEJ. Sel. Areas Commun., 13(9), 1656–1669, 1995. Duttweiler, D.L. , Adaptive filter performance with nonlinearities in the correlation multiplier. IEEE Trans.Acoust., Speech, Signal Processing, 30(8), 578–586, 1982. Falconer, D.D. , Adaptive reference echo-cancellation. IEEE Trans. Commun., 30(9), 2083–2094, 1982. Ho, M. , Cioffi, J.M. , and Bingham, J.A.C. , Discrete multitone echo cancellation. IEEE Trans. Commun., 44(7),817–825, 1996. Lee, E.A. and Messerschmitt, D.G. , Digital Communication, 2nd ed., Kluwer Academic Publishers, Boston, MA,1994. Melsa, P.J.W. , Younce, R.C. , and Rohrs, C.E. , Impulse response shortening for discrete multitonetransceivers. IEEE Trans. Commun., 44(12), 1662–1672, 1996. Messerschmitt, D.G. , Echo cancellation in speech and data transmission. IEEE J. Sel. Areas Commun., 2(2),283–297, 1984. Messerschmitt, D.G. , Design issues for the ISDN U-Interface transceiver. IEEE J. Sel. Areas Commun., 4(8),1281–1293, 1986. Ruiz, A. , Cioffi, J.M. , and Kasturia, S. , Discrete multiple tone modulation with coset coding for the spectrallyshaped channel. IEEE Trans. Commun., 40(6), 1012–1029, 1992. Smith, M.J. , Cowan, C.F.N. , and Adams, P.F. , Nonlinear echo cancellers based on transpose distributedarithmetic. IEEE Trans. Circuits Systems, 35(1), 6–18, 1988. Ungerboeck, G. , Theory on the speed of convergence in adaptive equalizers for digital communication. IBM J.Res. Develop., 16(6), 546–555, 1972. Weinstein, S.B. , A passband data-driven echo-canceller for full-duplex transmission on two-wire circuits. IEEETrans. Commun., 25(7), 654–666, 1977. Ysebaert, G. , Pisoni, F. , Bonaventura, M. , Hug, R. , and Moonen, M. , Echo cancellation in DMT-receivers:Circulant decomposition canceler. IEEE Trans. Signal Processing, 52(9), 2612–2624, 2004. For further information on adaptive transversal filters with application to echo cancellation, see Adaptive Filters:Structures, Algorithms, and Applications, M.L. Honig and D.G. Messerschmitt, Kluwer, 1984.

Synchronization of Communication Receivers J.J. Stiffler , Theory of Synchronous Communications, Englewood Cliffs, NJ, Prentice-Hall, 1971. W. Lindsey and M. Simon , Telecommunication Systems Engineering, Englewood Cliffs, NJ, Prentice-Hall,1973. H. Meyr and G. Ascheid , Synchronization in Digital Communications, New York, Wiley, 1990. H. Meyr , M., Moeneclaey , and S.A. Fechtel , Digital Communication Receivers, New York, Wiley, 1998. U. Mengali and A.N. D'Andrea , Synchronization Techniques for Digital Receivers, Plenum Press, New York,1997. F.M. Gardner , Frequency detectors for digital demodulators via maximum-likelihood derivation, Final Report:Part II, ESTEC Contract No. 8022/88/NL/DG, ESA, June 4, 1990.

A.N. D'Andrea and U. Mengali , Noise performance of two frequency-error detectors derived from maximumlikelihood estimation methods, IEEE Transactions on Communications, 42, 793–802, 1994. A.N. D'Andrea and U. Mengali , Design of quadricorrelators for automatic frequency control systems, IEEETransactions on Communications, 41, 988–997, 1993. A.N. D'Andrea and U. Mengali , Performance of a quadricorrelator driven by modulated signals, IEEETransactions on Communications, 38, 1952–1957, 1990. F.M. Gardner , Demodulator reference recovery techniques suited for digital implementation, European SpaceAgency, Final Report, ESTEC Contract No. 6847/86/NL/DG, August 1988. F.M. Gardner , Properties of frequency difference detectors, IEEE Transactions on Communications, 33,131–138, 1985. T. Alberty and V. Hespelt , A new pattern jitter free frequency error detector, IEEE Transactions onCommunications, 37, 159–163, 1989. M. Moeneclaey , Overview of digital algorithms for carrier frequency synchronization, International ESAWorkshop on DSP Techniques Applied to Space Communications, pp. 1.1–1.7, London, UK, September26–28, 1994. F. Classen and H. Meyr , Two frequency estimation schemes operating independently of timing information,Globecom ’93 Conference, pp. 1996–2000, Houston, TX, USA, November 29–December 2, 1993. F. Classen , H. Meyr , and P. Sehier , Maximum likelihood open loop carrier synchronizer for digital radio, ICC’93, pp. 493–497, Geneva, Switzerland, 1993. M.P. Fitz , Planar filtered techniques for burst mode carrier synchronization, Globecom ’91, paper 12.1,Phoenix, AZ, December 1991. M.P. Fitz , Further results in the fast estimation of a single frequency, IEEE Transactions on Communications,42, 862–864, 1994. M. Luise and R. Reggiannini , Carrier frequency recovery in all-digital modems for burst-Mode transmissions,IEEE Transactions on Communications, 43, 1169–1178, 1995. J.C.-I. Chuang and N.R. Sollenbeger , Burst coherent demodulation with combined symbol timing, frequencyoffset estimation, and diversity selection, IEEE Transactions on Communications, 39, 1157–1164, 1991. Y. Wang , E., Serpedin , and P. Ciblat , Optimal blind carrier recovery for burst M-PSK transmissions, IEEETransactions on Communications, 51(9), 1571–1581, 2003. Y. Wang , E. Serpedin and P. Ciblat , Optimal blind nonlinear least-squares carrier phase and frequency offsetestimation for general QAM modulations, IEEE Transactions on Wireless Communications, 2(5), 1040–1054,2003. E. Serpedin , G.B. Giannakis , A. Chevreuil , and P. Loubaton , Blind joint estimation of carrier frequency offsetand channel using non-redundant periodic modulation precoders, The 9th IEEE Statistical Signal and ArrayProcessing Workshop, pp. 288–291, Portland, OR, Sept. 1998. P. Ciblat , P. Loubaton , E. Serpedin , and G.B. Giannakis , Performance analysis of blind carrier frequencyoffset estimators for noncircular transmissions through frequency-selective channels, IEEE Transactions onSignal Processing, 50(1), 130–140, 2002. F. Gini and G.B. Giannakis , Frequency offset and symbol timing recovery in flat fading channels: Acyclostationary approach, IEEE Transactions on Communications, 46, 400–411, 1998. Y. Wang , E. Serpedin , P. Ciblat , and P. Loubaton , Performance analysis of a class of non-data aided carrierfrequency offset and symbol timing delay estimators for flat-fading channels, IEEE Transactions on SignalProcessing, 50(9), 2295–2305, 2002. H.L. Van Trees , Detection, Estimation, and Modulation Theory, New York, Wiley 1968. A. Viterbi , Principles of Coherent Communication, New York, McGraw-Hill, 1966. M. Moeneclaey and G. de Jonghe , ML-Oriented NDA carrier synchronization for general rotationally symmetricsignal constellations, IEEE Transactions on Communications, 42, 2531–2533, 1994. C.N. Georghiades , Blind carrier phase acquisition for QAM constellations, IEEE Transactions onCommunications, 45, 1477–1486, 1997. M. Morelli , A.N. D'Andrea , and U. Mengali , Feedforward estimation techniques for carrier recovery in 16-QAMmodulation, in M. Luise and S. Pupolin (Eds.) Broadband Wireless Communications, Springer-Verlag, London,1998. E. Serpedin , P. Ciblat , G.B. Giannakis , and P. Ciblat , Performance analysis of blind carrier phase estimatorsfor general QAM constellations, IEEE Transactions on Signal Processing, 49(8), 1816–1823, 2001. F. M. Gardner , Phaselock Techniques, 3rd edition, 2005, John Wiley & Sons. K.H. Mueller and M. Muller , Timing recovery in digital synchronous data receivers, IEEE Transactions onCommunications, COM-24, 516–531, 1976. O. Agazzi , C.-P.J. Tzeng , D.G. Messerschmitt , and D.A. Hodges , Timing recovery in digital subscriber loops,IEEE Transactions on Communications, COM-33, 558–569, 1985. F.M. Gardner , A BPSK/QPSK Timing-error detector for sampled receivers, IEEE Transactions onCommunication, COM-34, 423–429, 1986. C.N. Georghiades and M. Moeneclaey , Sequence estimation and synchronization from nonsynchronizedsamples, IEEE Transactions on Information Theory, 37, 1649–1657, 1991.

J.L. Massey , Optimum frame synchronization, IEEE Transactions on Communications, COM-20, 115–119,1972. R.H. Barker , Group synchronization of binary systems, Communication Theory, W. Jackson Editor, London,pp. 273–287, 1953. F. Neuman and L. Hofman , New pulse sequences with desirable correlation properties, Proceedings of theNational Telemetry Conference, Washington, DC, pp. 272–282, 1971. P.T. Nielsen , On the expected duration of a search for a fixed pattern in random data, IEEE Transactions onInformation Theory, September, 702–704, 1973. Y.C. Wu , S.C. Chan and E. Serpedin , Symbol-timing estimation in space–time coding systems based onorthogonal training sequences, IEEE Transactions on Wireless Communications, 4(2), pp. 603–613, 2005. J. Riba , J. Sala , and G. Vazguez , Conditional maximum likelihood timing recovery: Estimators and bounds,IEEE Transactions on Signal Processing, 49, 835–850, 2001. A.N. D'Andrea , V. Mengali , and R. Reggiannini , The modified Cramer–Rao bound and its application tosynchronization problem, IEEE Transactions on Communications, 42, 1391–1399, 1994. Y.C. Wu and E. Serpedin , Symbol timing estimation in MIMO correlated fading channels, WirelessCommunications and Mobile Computing (WCMC) Journal, Wiley, 4(7), 773–790, 2004. F. Simoens and M. Moeneclaey , Reduced-complexity data-aided and code-aided frequency offset estimationfor flat-fading MIMO channels, IEEE Transactions on Wireless Communications, 5(6), 1558–1567, 2006. O. Besson and P. Stoica , On parameter estimation of MIMO flat-fading channels with frequency offsets, IEEETransactions on Signal Processing, 51(3), 602–613, 2003. The Proceedings of the International Communications Conference (ICC), Global TelecommunicationsConference (GLOBECOM), and International Conference on Acoustics, Speech and Signal Processing(ICASSP) are good sources of current information on synchronization work. Other sources of archival value arethe IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, and IEEETransactions on Signal Processing.

Pseudonoise Sequences An M. , Brodzik A.K. , and Tolimieri R. Ideal Sequence Design in Time-Frequency Space: Applications toRadar, Sonar and Communication Systems, Birkhauser, Boston, 2009. Anand M. and Kumar P.V. Low-correlation sequences over the QAM constellation, IEEE Transactions onInformation Theory, IT-54, 791–810, 2008. Baumert L.D. Cyclic Difference Sets, Lecture Notes in Mathematics, Vol. 182, Springer–Verlag, New York,1971. Borwein P. , Choi K.-K.S. , and Jedwab J. Binary sequences with merit factor greater than 6.34, IEEETransactions on Information Theory, IT-50, 3234–3249, 2004. Boztas S. CDMA over QAM and other arbitrary energy constellations, IEEE International Conference onCommunication Systems, 2, 21.7.1–21.7.5, 1996. Dillon J. Multiplicative difference sets via additive characters, Designs Codes and Cryptography, 17, 225–235,1999. Dillon J. and Dobbertin H. New cyclic difference sets with Singer parameters, Finite Fields and TheirApplications, 10, 342–389, 2004. Dobbertin H. Kasami power functions, permutation polynomials and cyclic difference sets, In Difference Sets,Sequences and Their Correlation Properties (eds.) A. Pott pp. 133–158, The Netherlands, Kluwer AcademicPublishers, 1999. Fan P. and Darnell M. Sequence Design for Communications Applications, John Wiley & Sons, London, 1996. Garg G. , Helleseth T. , and Kumar P.V. Recent advances in low-correlation sequences, In New Directions inWireless Communications Research (ed.) V. Tarokh , Springer, Berlin, 2009. Golomb S.W. Shift Register Sequences, Aegean Park Press, San Francisco, CA, 1982. Golomb S.W. and Gong G. Signal Design for Good Correlation: For Wireless Communication, Cryptography,and Radar, Cambridge University Press, New York, 2005. Helleseth T. and Kumar P.V. Sequences with low correlation. In Handbook of Coding Theory (eds.) V.S. Plessand W.C. Huffman , Elsevier Science Publishers, Amsterdam, 1998. Jedwab J. A survey of the merit factor problem for binary sequences, Proceedings of Sequences and TheirApplications, 3486, 30–55, 2004. Jensen J.M. , Jensen H.E. , and Høholdt T. The merit factor of binary sequences related to difference sets,IEEE Transactions on Information Theory, IT-37, 617–626, 1991. Kristiansen R.A. and Parker M.G. Binary sequences with merit factor >6.3, IEEE Transactions on InformationTheory, IT-50, 3385–3389, 2004. Kumar P.V. , Scholtz R.A. , and Welch L.R. Generalized bent functions and their properties, Journal ofCombinatorial Theory Series A., 40, 90–107, 1985.

Long B. , Zhang P. , and Hu J. A generalized QS-CDMA system and the design of new spreading codes, IEEETransactions on Vehicular Technology, 47, 1268–1275, 1998. Litsyn S. Peak Power Control in Multicarrier Communications, Cambridge University Press, New York, 2007. MacWilliams F.J. and Sloane N.J.A. The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. Maschietti A. Difference sets and hyperovals, Designs, Codes and Cryptography, 14, 89–98, 1998. Mow W.H. On McEliece's open problem on minimax aperiodic correlation, Proceedings of the IEEEInternational Symposium on Information Theory, 75, 1994. No J.-S. , Golomb S.W. , Gong G. , Lee H.-K. , and Gaal P. Binary pseudorandom sequences of period 2 n – 1with ideal autocorrelation properties, IEEE Transactions on Information Theory, IT-44, 814–817, 1998. Omrani R. and Kumar P.V. Improved constructions and bounds for 2-D optical orthogonal codes, Proceedingsof the IEEE International Symposium on Information Theory, 127–131, 2005. Peterson W.W. and Weldon E.J., Jr. Error-Correcting Codes, 2nd ed., MIT Press, Cambridge, MA, 1972. Sarwate D.V. An upper bound on the aperiodic autocorrelation function for a maximal-length sequence. IEEETransactions on Information Theory, IT-30, 685–687, 1984. Sarwate D.V. and Pursley M.B. Crosscorrelation properties of pseudorandom and related sequences,Proceedings of the IEEE, 68, 593–619, 1980. Simon M.K. , Omura J.K. , Scholtz R.A. , and Levitt B.K. Spread Spectrum Communications Handbook, reviseded., McGraw Hill, New York, 1994. Tang X.H. , Fan P.Z. , and Matsufuji S. Lower bounds on correlation of spreading sequence set with low or zerocorrelation zone, Electronics Letters, 36, 551–552, 2000. Yang G.C. and Kwong W.C. Two-dimensional spatial signature patterns, IEEE Transactions onCommunications, 44, 184–191, 1996. A more in-depth treatment of pseudonoise sequences may be found in [9], [11], [12], [13, Chapter 21], [27], and[28, Chapter 5]. Sequence design related to peak-power control of transmitted signal energy, not covered here,is covered in [19]. Recent advances in low-correlation sequence design, relating to new cyclic difference sets,sequences with high merit factor, sequences over a QAM alphabet, and low-correlation zone sequencesappear in [10].

Introduction to Spread Spectrum Systems A. Wheeler , Commercial applications of wireless sensor networks using ZigBee, IEEE CommunicationsMagazine, 45(4), 70–77, 2007. C. Park and T. Rappaport , Short-range wireless communications for next-generation networks: UWB, 60 GHzMillimeter-Wave WPAN, and ZigBee, IEEE Wireless Communications, 14(4), 70–78, 2007. J. Bray and C. F. Sturman , Bluetooth 1.1: Connect without Cables, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2001. B. Chatschik , An overview of the Bluetooth wireless technology, IEEE Communications Magazine, 39(12),86–94, 2001. S. Verdu , Multiuser Detection. Cambridge, UK: Cambridge University Press, 1998. H. Poor and L. Rusch , A promising multiplexing technology for cellular telecommunications: Narrowbandinterference suppression in spread spectrum CDMA, IEEE Personal Communications, 1(3), 14, 1994. T. H. Stitz and M. Renfors , Filter-bank-based narrowband interference detection and suppression in spreadspectrum systems, EURASIP Journal of Applied Signal Processing, 2004, 1163–1176, 2004. [Online].Available: http://dx.doi.org/10.1155/S1110865704312102. H. Lamarr and G. Antheil , Secret communication system, U.S. Patent 2292 387, August, 1942. J. G. Proakis , Digital Communications. New York: McGraw-Hill Inc., 2008. O.-S. Shin and K. B. Lee , Performance comparison of FFH and MCFH spread-spectrum systems with optimumdiversity combining in frequency-selective Rayleigh fading channels, IEEE Transactions on Communications,49(3), 409–416, 2001. J. Wang and C. Jiang , Analytical study of FFH systems with square-law diversity combining in the presence ofmultitone interference, IEEE Transactions on Communications, 48(7), 1188–1196, 2000. N. Golmie , O. Rebala , and N. Chevrollier , Bluetooth adaptive frequency hopping and scheduling, inProceedings of MILCOM, Boston, MA, October 2003, pp. 1138–1142. F. C. C. , Revision of part 15 of the commissions rules regarding ultra-wideband transmission systems, Onlineat http://hraunfoss.fcc.gov/edocs-public/attachmatch/FCC-02-48A1.pdf, April 2002, eT Docket 98–153. J. Balakrishnan , A. Batra , and A. Dabak , A multi-band OFDM system for UWB communication, in IEEEConference on Ultra Wideband Systems and Technologies, November 2003, pp. 354–358. P. Runkle , J. McCorkle , T. Miller , and M. Welborn , DS–CDMA: The modulation technology of choice for UWBcommunications, in IEEE Conference on Ultra Wideband Systems and Technologies, November 2003, pp.364–368.

S. Bensley and B. Aazhang , Maximum-likelihood synchronization of a single user for code-division multiple-access communication systems, IEEE Transactions on Communications, 46(3), 392–399, 1998. C. F. Cook , F. W. Ellersick , L. B. Milstein , and D. L. Schilling , Spread Spectrum Communications. New York:IEEE Press, 1983. R. C. Dixon , Spread Spectrum Systems. New York: John Wiley and Sons Inc., 1994. M. K. Simon , J. K. Omura , R. A. Scholtz , and B. K. Levitt , Spread Spectrum Communications Handbook.New York: McGraw-Hill Inc., 1994. A. J. Viterbi , CDMA: Principles of Spread Spectrum Communication. Reading, MA: Addison-Wesley PublishingCompany, 1995. M. Medard and R. Gallager , Bandwidth scaling for fading multipath channels, IEEE Trans. Inf. Thy., 48(4),840–852, 2002.

Signal Space Arthurs, E. and Dym, H. 1962. On the optimum detection of digital signals in the presence of white gaussiannoise—A geometric approach and a study of three basic data transmission systems. IRE Trans. Commun.Syst., CS-10(Dec.): 336–372. Benedetto, S. and Biglieri, E. 1983. Nonlinear equalization of digital satellite channels. IEEE J. Sel. Areas inCommun., SAC-1(Jan.): 57–62. Haykin, S. 1996. Adaptive Filter Theory, 3rd ed. Englewood Cliffs, NJ: Prentice Hall. Kotel'nikov, V.A. 1968. The Theory of Optimum Noise Immunity (trans. R.A. Silverman ), Dover, New York. Mathews, V. 1991. Adaptive polynomial filters. IEEE Signal Proc. Mag., 8(Jul.): 10–26. Papoulis, A. and Pillai, S. Unnikrishna . 2001. Probability, Random Variables, and Stochastic Processes, 3rded., New York: McGraw–Hill. Rioul, O. and Vetterli, M. 1991. Wavelets in signal processing. IEEE Signal Proc. Mag., 8(Oct.):14–38. Stakgold, I. 1967. Boundary Value Problems of Mathematical Physics, Vol. 1, London: Macmillan,Collier–Macmillan Ltd. Wozencraft, J.M. and Jacobs, I.M. 1965. Principles of Communication Engineering, New York: Wiley. (Availablefrom Prospect Heights, IL: Waveland Press.) Ziemer, R.E. , Tranter, W.H. , and Fannin, D.R. 1998. Signals and Systems: Continuous and Discrete, 4th ed.New York: Macmillan. Ziemer, R.E. and Tranter, W.H. 2009. Principles of Communications: Systems, Modulation, and Noise, 6th ed.Boston, MA: Houghton Mifflin. Very readable expositions of signal space concepts as applied to signal detection and estimation are found inChapter 4 of the classic book by Wozencraft and Jacobs. The paper by Arthurs and Dym listed in thereferences is also worth reading. A treatment of signal space concepts and applications to signal detection andparameter estimation is given in Chapter 10 of the book by Ziemer and Tranter. For the mathematical theorybehind signal space concepts, the book by Stakgold is recommended. For those interested in wavelettransforms and their relationship to signal spaces, the April 1992 issue of the IEEE Signal Processing Magazineprovides a tutorial article on wavelet transforms. A tutorial treatment on adaptive Volterra filters is provided inthe paper by Mathews.

Optimum Receivers Gibson, J. D. , Principles of Digital and Analog Communications, 2nd ed. New York: MacMillan. 1993. Haykin, S. , Communication Systems, 3rd ed. New York: John Wiley & Sons. 1994. Lee, E. A. and Messerschmitt, D. G. , Digital Communication. Norwell, MA: Kluwer Academic Publishers. 1988. Papoulis, A. , Probability, Random Variables, and Stochastic Processes, 3rd ed. New York: McGraw-Hill. 1991. Poor, H. V. , An Introduction to Signal Detection and Estimation. New York: Springer-Verlag. 1988. Proakis, J. G. , Digital Communications, 2nd ed. New York: McGraw-Hill. 1989. Shiryayev, A. N. , Probability. New York: Springer-Verlag. 1984. Sklar, B. , Digital Communications, Fundamentals and Applications. Englewood Cliffs, NJ: Prentice Hall. 1988. Van Trees, H. L. , Detection, Estimation, and Modulation Theory, Part I. New York: John Wiley & Sons. 1968. Wong, E. and Hajek, B. , Stochastic Processes in Engineering Systems. New York: Springer-Verlag. 1985. Wozencraft, J. M. and Jacobs, I. , Principles of Communication Engineering (Reissue), Prospect Heights,Illinois: Waveland Press. 1990. Ziemer, R. E. and Peterson, R. L. , Introduction to Digital Communication, New York: Macmillan. 1992.

The fundamentals of receiver design were put in place by Wozencraft and Jacobs in their seminal book. Sincethat time, there have been many outstanding textbooks in this area. For a sampling see [1,2,3,8,12]. For acomplete treatment on the use and application of detection theory in communications see [5,9]. For deeperinsights into the Karhunen–Loève expansion and its use in communications and signal processing see [10].

MIMO Systems for Diversity and Interference Mitigation J. H. Winters , On the capacity of radio communication systems with diversity in Rayleigh fading environment,IEEE J. Select. Areas Commun., SAC-5(5), 871–878, 1987. G. J. Foschini , Layered space-time architecture for wireless communication a fading environment when usingmultiple antennas, Bell Labs Tech. J., 1(2), 41–59, 1996. G. J. Foschini and M. J. Gans , On limits of wireless communications in a fading environment when usingmultiple antennas, Wireless Personal Commun., 6(3), 311–335, 1998. E. Telatar , Capacity of multi-antenna Gaussian channels, Eur. Trans. Telecomm., 10(6), 585–595, 1999. A. Goldsmith , Wireless Communications. Cambridge University Press, New York, 2005. D. Tse and P. Viswanath , Fundamentals of Wireless Communication. Cambridge University Press, New York,2006. A. Molisch , Wireless Communications. John Wiley & Sons Ltd., England, 2011. D. Gesbert , H. Bolcskei , D. Gore , and A. Paulraj , Outdoor MIMO wireless channels: Models and performanceprediction, IEEE Trans. Commun., 50(12), 1926–1934, 2002. P. Almers , E. Bonek , A. Burr , N. Czink , M. Debbah , V. Degli-Esposti , H. Hofstetter , Survey of channel andradio propagation models for wireless MIMO systems, EURASIP J. Wirel. Commun. Netw., 2007, 56–56, 2007. A. Giorgetti , P. J. Smith , M. Shafi , and M. Chiani , MIMO capacity, level crossing rates and fades: The impactof spatial/temporal channel correlation, KICS/IEEE Int. J. Commun. Netw., 5(2), 104–115, 2003 (special issueon Coding and Signal Processing for MIMO systems).

High-Throughput MIMO Systems J. H. Winters , On the capacity of radio communication systems with diversity in Rayleigh fading environment,IEEE J. Select. Areas Commun., SAC-5(5), 871–878, 1987. G. J. Foschini , Layered space-time architecture for wireless communication a fading environment when usingmultiple antennas, Bell Labs Tech. J., 1(2), 41–59, 1996. G. J. Foschini and M. J. Gans , On limits of wireless communications in a fading environment when usingmultiple antennas, Wireless Personal Commun., 6(3), 311–335, 1998. E. Telatar , Capacity of multi-antenna Gaussian channels, Europ. Trans. on Telecomm., 10(6), 585–595, 1999. A. Goldsmith , Wireless Communications. Cambridge University Press, New York, 2005. D. Tse and P. Viswanath , Fundamentals of Wireless Communication. Cambridge University Press, New York,2006. A. Molisch , Wireless Communications. Wiley, John Wiley & Sons, England, 2011. M. Chiani , M. Z. Win , and A. Zanella , On the capacity of spatially correlated MIMO Rayleigh fading channels,IEEE Trans. Inform. Theory, 49(10), 2363–2371, 2003. P. J. Smith , S. Roy , and M. Shafi , Capacity of MIMO systems with semicorrelated flat fading, IEEE Trans.Inform. Theory, 49(10), 2781–2788, 2003. H. Shin , M. Win , J. H. Lee , and M. Chiani , On the capacity of doubly correlated MIMO channels, IEEE Trans.Wireless Commun., 5(8), 2253–2266, 2006. M. McKay and I. Collings , General capacity bounds for spatially correlated Rician MIMO channels, InformationTheory, IEEE Transactions on, 51(9), 3121–3145, 2005. S. Jayaweera and H. Poor , Capacity of multiple-antenna systems with both receiver and transmitter channelstate information, Information Theory, IEEE Transactions on, 49(10), 2697–2709, 2003. A. Zanella and M. Chiani , Analytical comparison of power allocation methods in MIMO systems with singularvalue decomposition, in Proc. IEEE Global Telecomm. Conf., Honolulu, HI, Nov./Dec. 2009, pp. 101–106. M. Chiani , D. Dardari , and M. K. Simon , New exponential bounds and approximations for the computation oferror probability in fading channels, IEEE Trans. Wireless Commun., 2(4), 840–845, 2003. A. Zanella , M. Chiani , and M. Z. Win , MMSE reception and successive interference cancellation for MIMOsystems with high spectral efficiency, IEEE Trans. Wireless Commun., 4(3), 1244–1253, 2005. M. Damen , H. El Gamal , and G. Caire , On maximum-likelihood detection and the search for the closest latticepoint, IEEE Trans. on Information Theory, 49(10), 2389–2402, 2003.

Z. Luo , W. Ma , A. So , Y. Ye , and S. Zhang , Semidefinite relaxation of quadratic optimization problems,Signal Process. Mag., IEEE, 27(3), 20–34, 2010. M. Chiani , M. Z. Win , and H. Shin , MIMO networks: the effects of interference, IEEE Trans. Inf. Theory, 56(1),336–349, 2010. Q. Spencer , C. Peel , A. Swindlehurst , and M. Haardt , An introduction to the multi-user MIMO downlink,Commun. Mag., IEEE, 42(10), 60–67, 2004. D. Gesbert , M. Kountouris , R. Heath , C.-B. Chae , and T. Salzer , Shifting the MIMO Paradigm, SignalProcess. Mag., IEEE, 24(5), 36–46, 2007.

Digital Communication System Performance * Anderson, J.B. and Sundberg, C.-E.W. , Advances in constant envelope coded modulation, IEEE Commun.,Mag., 29(12), 36–45, 1991. Borjesson, P.O. and Sundberg, C.E. , Simple approximations of the error function Q(x) for communicationsapplications, IEEE Trans. Comm., COM-27, 639–642, 1979. Clark, G.C., Jr. and Cain, J.B. , Error-Correction Coding for Digital Communications, Plenum Press, New York,1981. Hodges, M.R.L. , The GSM radio interface, British Telecom Technol. J., 8(1), 31–43, 1990. Johnson, J.B. , Thermal agitation of electricity in conductors, Phys. Rev., 32, 97–109, 1928. Korn, I. , Digital Communications, Van Nostrand Reinhold Co., New York, 1985. Lin, S. and Costello, D.J. Jr. , Error Control Coding: Fundamentals and Applications, Prentice-Hall, EnglewoodCliffs, NJ, 1983. Lindsey, W.C. and Simon, M.K. , Telecommunication Systems Engineering, Prentice-Hall, Englewood Cliffs,NJ, 1973. Nyquist, H. , Thermal agitation of electric charge in conductors, Phys. Rev., 32, 110–113, 1928. Nyquist, H. , Certain topics on telegraph transmission theory, Trans. AIEE, 47, 617–644, 1928. Odenwalder, J.P. , Error Control Coding Handbook, Linkabit Corp., San Diego, CA, July 15, 1976. Shannon, C.E. , A mathematical theory of communication, BSTJ., 27, 379–423, 623–657, 1948. Shannon, C.E. , Communication in the presence of noise, Proc. IRE., 37(1), 10–21, 1949. Sklar, B. , What the system link budget tells the system engineer or how I learned to count in decibels, Proc. Int.Telemetering Conf., San Diego, CA, November 1979. Sklar, B. , Digital Communications: Fundamentals and Applications, 2nd Edition, Prentice-Hall, Upper SaddleRiver, NJ, 2001. Title 47 , Code of Federal Regulations, Part 15 Radio Frequency Devices. Ungerboeck, G. , Trellis-coded modulation with redundant signal sets, Pt. I and II, IEEE Comm. Mag., 25, 5–21.1987. Van Trees, H.L. , Detection, Estimation, and Modulation Theory, Pt. I, John Wiley & Sons, New York, 1968. Viterbi, A.J. , Principles of Coherent Communication, McGraw-Hill, New York, 1966. Viterbi, A.J. , Spread spectrum communications—Myths and realities, IEEE Comm. Mag., 11–18, 1979. A useful compilation of selected papers can be found in Cellular Radio and Personal Communications—A Bookof Selected Readings, edited by Theodore S. Rappaport, Institute of Electrical and Electronics Engineers, Inc.,Piscataway, New Jersey, 1995. Fundamental design issues, such as propagation, modulation, channel coding,speech coding, multiple-accessing, and networking, are well represented in this volume. Another useful sourcebook that covers the fundamentals of mobile communications in great detail is MobileRadio Communications, edited by Raymond Steele, Pentech Press, London 1992. This volume is also availablethrough the Institute of Electrical and Electronics Engineers, Inc., Piscataway, New Jersey. For spread-spectrum systems, an excellent reference is Spread Spectrum Communications Handbook, byMarvin K. Simon, Jim K. Omura, Robert A. Scholtz, and Barry K. Levitt, McGraw-Hill Inc., New York, 1994. For coverage of digital communication fundamentals that emphasizes system subtleties, some of which wereexplored in this chapter, see the book Digital Communications Fundamentals and Applications, 2nd edition, byBernard Sklar, Prentice-Hall 2001.

Fundamental Limitations on Increasing Data Rate in Wireless Systems W.C. Jakes , Microwave Mobile Communications. New York: Wiley, 1974; reissued by IEEE Press, 1994. D.C. Cox , Universal digital portable radio communications, Proc. IEEE, 75(4), 436–477, 1987. D.C. Cox , R.R. Murray , and A.W. Norris , 800 MHz attenuation measured in and around suburban houses,Bell Labs Tech. J., 63(6), 921–954, 1984. T.S. Rappaport , Wireless Communications: Principles and Practice, 2nd ed. New York: Prentice-Hall, 2002. A.B. Carlson , P.B. Crilly , and J. Rutledge , Communication Systems, 4th ed. New York: McGraw-Hill, 2002. A. Paulraj , R. Nabar , and D. Gore , Introduction to Space-Time Wireless Communications. London:Cambridge University Press, 2003. E. Telatar , Capacity of multi-antenna Gaussian channels, Eur. Trans. Telecomm., 10(6), 585–595, 1999. P. Kyritsi , Multiple Element Antenna Systems in an Indoor Environment, PhD thesis, Stanford University,Stanford, CA, Nov. 2001. D.M. Devasirvatham , R.R. Murray , H.W. Arnold , and D.C. Cox , Four-frequency CW measurements inresidential environments for personal communications, in Proc. IEEE Int. Symp. Personal, Indoor and MobileCommunications (PIMRC), Yokohama, Japan, Sept. 1993, pp. 201–205. D.C. Cox , R.R. Murray , and A.W. Norris , Antenna height dependence of 800 MHz attenuation measured inhouses, IEEE Trans.Veh. Tech., 34(2), 108–115, 1985. D.C. Cox , Introduction to Wireless Communications, course reader for EE276, Available from StanfordUniversity Bookstore, Stanford, CA 94305. D.R. Fordham , IEEE 802.11 experiments in Virginia's Shenandoah Valley, QST, 89(7), 35–41, 2005. Donald C. Cox and Hyunok Lee , Physical relationships, IEEE Microwave Magazine, pp. 89–94, August 2008. Donald C. Cox , Fundamental limitations on increasing data rate in wireless systems, Technology LeadersForum, IEEE Communications Magazine, pp. 16–17, December 2008.

Interference and Its Impact on System Capacity W. C. Jakes , Microwave Mobile Communications, Wiley-IEEE Press, Piscataway, NJ, 1994. A. P. Subramanian , M. M. Buddhikot , and S. Miller , Interference aware routing in multi-radio wireless meshnetworks, in Proceedings of IEEE WiMesh 2006, Reston, Virginia, Sept. 2006. V. H. MacDonald , Advanced mobile phone service the cellular concept, Bell System Technical Journal, 58(1),15–41, 1979. D. Tse and P. Wisvanath , Fundamentals of Wireless Communications, Cambridge University Press, New York,2005. J. G. Andrews , M. Haenggi , N. Jindal , and S. Weber , A primer on spatial modeling and analysis in wirelessnetworks, IEEE Communications Magazine, Nov. 2–9, 2010. F. Baccelli and B. Blaszczyszyn , Stochastic Geometry and Wireless Networks, Foundation and Trends inWireless Networking, NOW Publishers, Paris, France, 2009. M. Haenggi , J. G. Andrews , F. Baccelli , O. Dousse , and M. Franceschetti , Stochastic geometry and randomgraphs for the analysis and design of wireless networks, IEEE Journal of Selected Areas in Communications,27(7), 1029–1046, 2009. P. Gupta and P. R. Kumar , The capacity of wireless networks, IEEE Transactions on Information Theory,46(2), 388–404, 2000. The NS2 Network Simulator , available online at www.isi.edu/nsnam/ns/ T. Nandagopal , T. E. kim , X. Gao , and V. Bharghavan , Achieving MAC layer fairness in wireless packetnetworks, in Proceedings of IEEE/ACM Mobicom 2000, Boston, Massachusetts, Aug. 2000. A. Iyer , C. Rosenberg , and A. Karnik , What is the right model for wireless channel interference, IEEETransactions on Wireless Communications, 8(5), 2662–2671, 2009. David Cox , Renewal Theory, Methuen, London, UK, 1970. P. J. Diggle , Statistical Analysis of Spatial Point Patterns, 2nd Edition, Arnold, London, UK, 2003. J. A. Ludwig and J. F. Reynolds , Statistical Ecology: A Primer on Methods and Computing, John Wiley & Sons,New York, 1988. J. Ohser and F. Mucklich , Statistical Analysis of Microstructures in Materials Science, John Wiley & Sons,Chichester, 2000. N. Campbell , The study of discontinuous phenomena, Mathematica Proceedings of the Cambridge PhilosophySociety, 15, 117–136, 1909. J. Kingman , Poisson Processes, Oxford University Press, New York, 1993. M. Schwartz , Mobile Wireless Communications, Cambridge University Press, New York, 2005. B. Matérn , Spatial Variation, Springer Lecture Notes in Statistics, New York, 2nd edition, 1986. M. Haenggi , Mean interference in hard-core wireless networks, IEEE Communications Letters, 15(8), 2011.

E. S. Sousa and J. A. Silvester , Optimum transmission ranges in a direct-sequence spread-spectrum multihoppacket radio network, IEEE Journal of Selected Areas in Communications, 8(5), 762–771, 1990. J. Ilow and D. Hatzinakos , Analytical alpha-stable noise modeling in a poisson field of interferers or scatterers,IEEE Trans. Signal Process., 46(6), 1601–1611, 1998. K. Gulati , B. L. Evans , J. G. Andrews , and K. R. Tinsley , Statistics of co-channel interference in a field ofpoisson and poisson-poisson clustered interferers, IEEE Trans. Signal Process., 58(12), 2010. A. Babaei , M. Haenggi , P. Agrawal , and B. Jabbari , Interference statistics of a poisson field of interferers withrandom puncturing, in Proceedings of IEEE Military communications Conference 2011, Baltimore, Maryland,Nov. 2011. S. Ihara , On the capacity of channels with additive non-gaussian noise, Information and Control, 37, 34–39,1978. A. Babaei , P. Agrawal , and B. Jabbari , Capacity bounds in random wireless networks, Journal ofCommunications and Networks, 14(1), 2012. A. Babaei and B. Jabbari , Interference modeling and avoidance in spectrum underlay cognitive wirelessnetworks, In Proceedings of ICC 2010, Cape Town, South Africa, May 2010, pp. 1–5. S. Haykin , Cognitive radio: brain-empowered wireless communications, IEEE Journal on Selected Areas inCommunications, 32(2), 201–220, 2005. D. Cabric , S. M. Mishra , and R. W. Brodersen , Implementation issues in spectrum sensing for cognitiveradios, in Proceedings of Asilomar Conference on Signals, Systems, and Computers, Monterey, California,Nov. 2004, pp. 772–776. A. P. Hulbert , Spectrum sharing through beacons, In Proc. IEEE Int. Symp. Personal, Indoor and Mobile RadioCommunications (PIMRC’05), Berlin, Germany, Sept. 2005, pp. 989–993. M. Abramowitz , Milton , and I. A., Handbook of Mathematical, New York: Dover Publications, 1972. A. Babaei and B. Jabbari , Internodal distance distribution and power control for coexisting radio networks, inProceedings of Globecom 2008, Dec. 2008, pp. 1–5. A. Babaei , P. Agrawal , and B. Jabbari , Cooperative spectrum sharing for a primary network with capacityconstraint, In Proceedings of IEEE VTC-Spring 2011, Budapest, Hungary, 2011. D. Middleton , Statistical-physical models of electromagnetic interference, U.S. department of commerce, officeof telecommunications, Tech. Rep., Apr. 1976. A. Papoulis and S. U. Pillai , Probability, Random Variables and Stochastic Processes, 4th Edition, McGraw-Hill, New York, 2002.

Cell Design Principles Egli, J. , Radio above 40 Mc over irregular terrain. Proc. IRE., 45(10), 1383–1391, 1957. Hata, M. , Empirical formula for propagation loss in land-mobile radio services. IEEE Trans. Vehicular Tech.,VT-29, 317–325, 1980. Ho, M. J. and Stüber, G. L. , Co-channel interference of microcellular systems on shadowed Nakagami fadingchannels. Proc. IEEE Vehicular Tech. Conf., 568–571, 1993. Ibrahim, M. F. and Parsons, J. D. , Signal strength prediction in built-up areas, Part I: median signal strength.Proc. IEEE. Pt. F. (130), 377–384, 1983. Lee, W. C. Y. , Mobile Communications Design Fundamentals, Howard W. Sams, Indianapolis, IN, 1986. Leonardo, E. J. and Yacoub, M. D. , A statistical approach for cell coverage area in land mobile radio systems.Proceedings of the 7th IEE. Conf. on Mobile and Personal Comm., Brighton, UK, 16–20, Dec. 1993a. Leonardo, E. J. and Yacoub, M. D. , (Micro) Cell coverage area using statistical methods. Proceedings of theIEEE Global Telecom. Conf. GLOBECOM’93, Houston, TX, 1227–1231, Dec. 1993b. Okumura, Y. , Ohmori, E. , Kawano, T. , and Fukuda, K. , Field strength and its variability in VHF and UHF landmobile service. Rev. Elec. Comm. Lab., 16, 825–873, 1968. Reudink, D. O. , Large-scale variations of the average signal. In Microwave Mobile Communications, Jakes, W.C. (ed.), pp. 79–131, John Wiley & Sons, New York, 1974. Sowerby, K. W. and Williamson, A. G. , Outage probability calculations for multiple cochannel interferers incellular mobile radio systems. IEE Proc., Pt. F. 135(3), 208–215, 1988. Suzuki, H. , A statistical model for urban radio propagation. IEEE Trans. Comm., 25(7), 673–680, 1977. The fundamentals of mobile radio engineering in connection with many practical examples and applications aswell as an overview of the main topics involved can be found in Yacoub, M. D., Foundations of Mobile RadioEngineering, CRC Press, Boca Raton, FL, 1993.

Wireless Data Pahlavan, K. and Levesque, A. H. Wireless data communications, Proceedings of the IEEE, 82(9): 1398–1430,1994. Pahlavan, K. and Levesque, A. H. Wireless Information Networks, 2nd ed., J. Wiley & Sons, New York, NY,2005. Geier, J. Wireless LANs, MacMillan Technical Publishing, New York, 1999. IEEE 802.11 Standard Group Document , IEEE 802.11-00/282r2, 2000. Pahlavan, K. and Krishnamurthy, P. Networking Fundamentals, J. Wiley & Sons, New York, NY, 2009. Rappaport, T. Wireless Communications—Principles and Practice, 2nd ed., Prentice-Hall, Upper Saddle River,NJ, 2002. Bodson, D. McClure, G. F. , and McConoughey, S. R. (Eds.). Land-Mobile Communications Engineering,Selected Reprint Series, IEEE Press, New York, NY, 1984. Rice, P. L. , Longley, A. G. , Norton, K. A. , and Barsis, A. P. Transmission loss predictions for troposphericcommunication circuits, NBS Technical Note, 101, 1967. Longley, A. G. and Rice, P. L. Prediction of Tropospheric Radio Transmission Over Irregular Terrain. A.Computer Method—1968, ESSA Technical Report ERL 79-ITS 67, U.S. Government Printing Office,Washington, DC, 1968. Okumura, Y. E. Field Strength and its variability in VHF and UHF land-mobile service, Review of the ElectronicCommunication Laboratory, 16: 825–873, 1968. Hata, M. Empirical formula for propagation loss in land-mobile radio services, IEEE Transactions on VehicularTechnology, 29(3): 317–325, 1980. Khan, M. and Kilpatrick, J. Mobitex and mobile data standards, IEEE Communications Magazine, 33(3):96–101, 1995. Mouly, M. and Pautet, M.-B. The GSM System for Mobile Communications, Palaiseau, France, 1992. Haug, T. Overview of GSM: Philosophy and results. International Journal of Wireless Information Networks, 1,7–16, 1994. Heine, G. GSM Networks: Protocols, Terminology, and Implementation. Artech House, Norwood, MA, 1999. Quick, R. R. Jr. , and Balachandran, K. Overview of the Cellular Packet Data (CDPD) System, Proceedings ofthe Personal, Indoor and Mobile Radio Conference (PIMRC’93), Yokoham, Japan: 338–343, 1993. Redl, S. M. , Weber, M. K. , and Oliphant, M. W. An Introduction to GSM, Artech House, Norwood, MA, 1995. Eberspächer, J. , Vogel, H.-J. , and Bettstetter, C. GSM Switching, Services and Protocols, Second Edition.Chichester, UK: John Wiley & Sons, Ltd., 2001. Bates, R. J. . GPRS—General Packet Radio Service. New York: McGraw-Hill, 2002. Steele, S. , Lee, C.-C. , and Gould, P. GSM, cdmaOne and 3G Systems. Chichester, UK: John Wiley & Sons,Ltd., 2001. Halonen, T. , Romero, J. , and Melero, J. , (Eds.) GSM, GPRS and EDGE Performance. Chichester, UK: JohnWiley & Sons, Ltd., 2003. Levesque, A. H. General Packet Radio Service, In Bidgoli, H. (Ed.) The Handbook of Computer Networks,Volume 2, Hoboken, NJ: John Wiley & Sons, 658–674, 2008. Hakaste, M. , Nikula, E. , and Hamiti, S. GSM/EDGE Standards Evolution (up to Rel’4). In Halonen, T. ,Romero, J. and Melero, J. (Eds.). GSM, GPRS and EDGE Performance, Second Edition. Chichester, UK: JohnWiley & Sons, Ltd., 2003. Furuskar, A. EDGE: enhanced data rates for GSM and TDMA/136 evolution. IEEE Personal Communications,6, 56–66, 1999. Seurre, E. , Savelli, P. , and Pietri, P.-J. EDGE for Mobile Internet. Artech House, Norwood, MA, 2003. Gilhausen, K. S. On the capacity of a cellular CDMA system, IEEE Trans. Veh. Technol., VT-40, 303–313,1991. Foschini, G. J. Simplified processing for high spectral efficiency wireless communication employing multi-element arrays, IEEE J. Sel. Areas Commun., SAC-17(11), 1999. Van Nee, R. and Prasad, R. OFDM for Wireless Multimedia Communications, Artech House, Norwood, MA,2000. Reference 5 provides a comprehensive review of the wireless data field as of 2009, covering major topics inboth WLANs and wide-area networks and standards. Up to date information on the progress of leadingstandards initiatives can be found on the 802.11, 3GPP and 3GPP2 websites. The journals IEEECommunications Magazine, IEEE Wireless Communications Magazine, and the IEEE Transactions onVehicular Technology regularly report advances in many areas of mobile communications, including wirelessdata. For subscription information contact: IEEE Service Center, 445 Hoes Lane, P. O. Box 1331, Piscataway,NJ 08855–1131. Phone: (732) 981–0060. Internet: www.comsoc.org

Third-Generation Cellular Communications: An Air Interface Overview Mandyam, G. and J. Lai . Third Generation CDMA Systems for Enhanced Data Services. San Diego, CA:Elsevier, 2002. The Telecommunications Industry Association . TIA/EIA IS-95: Mobile Station-Base Station CompatibilityStandards for Dual-Mode Wideband Spread Spectrum Cellular Systems. 1994. 3GPP2 C.S0002-A. Physical Layer Standard for cdma2000 Spread Spectrum Systems-Release A. TIA as IS-2000.2-A, Arlington, VA: The Telecommunications Industry Association, 2000. 3GPP2 C.S0004-A. Link Access Control (LAC) Standard for cdma2000 Spread Spectrum Systems-Release A.TIA as IS-2000.4-A, Arlington, VA: The Telecommunications Industry Association, 2000. 3GPP2 C.S0005-A. Upper Layer (Layer 3) Standard for cdma2000 Spread Spectrum Systems-Release A. TIAas IS-2000.5-A, Arlington, VA: The Telecommunications Industry Association, 2000. 3GPP2 C.S0005-A. Upper Layer (Layer 3) Standard for cdma2000 Spread Spectrum Systems -Release A. TIAas IS-2000.5-A, Arlington, VA: The Telecommunications Industry Association, 2000. Bender, P. , P. Black , M. Grob , R. Padovani , N. Sindhushayana , and A. Viterbi . CDMA/HDR: A bandwidthefficient high speed wireless data service for Nomadic users. IEEE Communications Magazine 38(7), 2000,70–77. 3GPP2 C.S0024. cdma2000 High Rate Packet Data Air Interface Specification. October 27, 2000. Holma, H. and A. Toskala , (eds.) WCDMA for UMTS: Radio Access for Third Generation MobileCommunications. West Sussex, United Kingdom: John Wiley & Sons, 2000. Third Generation Partnership Project. TS 25.101 Version 4.1.0. UE Radio Transmission and Reception (FDD).June 2001. Third Generation Partnership Project. TS 25.211 Version 4.0.0. Physical Channels and Mapping of TransportChannels onto Physical Channels (FDD). March 2001. Third Generation Partnership Project. TS 25.212 Version 4.0.0. Multiplexing and Channel Coding (FDD).December 2000. Third Generation Partnership Project. TR 25.944 Version 4.1.0. Channel Coding and Multiplexing Examples.June 2001. Third Generation Partnership Project. TS 25.213 Version 4.0.0. Spreading and Modulation (FDD). March 2001. Third Generation Partnership Project. TR 25.848 Version 4.0.0. Physical Layer Aspects of UTRA High SpeedDownlink Packet Access. March 2001. Third Generation Partnership Project. TR 25.855 Version 5.0.0. High Speed Downlink Packet Access.September 2001. Third Generation Partnership Project. TR 25.855 Version 5.0.0. High Speed Downlink Packet Access; PhysialLayer Aspects. March 2002. Third Generation Partnership Project. TR 25.309 Version 6.6.0. FDD Enhanced Uplink; Overall Description.March 2006. Third Generation Partnership Project. TR 25.211 Version 6.7.0. Physical Channels and Mapping of TransportChannels onto Physical Channels (FDD). December 2005. Holma, H. and A. Toskala , (eds.) HSDPA/HSUPA for UMTS: High Speed Radio Access for MobileCommunications. West Sussex, United Kingdom: John Wiley & Sons, 2006. Holma, H. and A. Toskala , (eds.) LTE for UMTS: OFDMA and SC-FDMA Based Radio Access. West Sussex,United Kingdom: John Wiley & Sons, 2009. Voice over LTE. Ericsson white paper. December 2010. http://www.ericsson.com/res/docs/whitepapers/voice-over-lte.pdf.

3GPP LTE/LTE-Advanced Radio Access Technologies 3GPP TS 25.913, Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN), March 2006. 3GPP TR 36.913, Requirements for Further Advancements for E-UTRA (LTE-Advanced), June 2008. 3GPP TR 36.814, Further Advancements for E-UTRA Physical Layer Aspects, March 2010. 3GPP TR 36.912, Further Advancements for E-UTRA (LTE-Advanced), June 2010. ITU Global Standard for International Mobile Telecommunications ‘IMT-Advanced’, http://www.itu.int/ITU-R. 3GPP TS 36.300, Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal TerrestrialRadio Access Network (E-UTRAN); Overall Description; Stage 2, December 2010. 3GPP TS 36.401, Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Architecture Description,December 2010. 3GPP TS 36.331, Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC);Protocol Specification, December 2010. 3GPP TS 36.323, Evolved Universal Terrestrial Radio Access (E-UTRA); Packet Data Convergence Protocol(PDCP) Specification, December 2010.

3GPP TS 36.201, Evolved Universal Terrestrial Radio Access (E-UTRA); Long Term Evolution (LTE) PhysicalLayer; General description, December 2010. 3GPP TS 36.211, Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation,December 2010. 3GPP TS 36.212, Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding,December 2010. 3GPP TS 36.213, Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer Procedures, December2010. 3GPP TS 36.101, Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) RadioTransmission and Reception, January 2011. E. Dahlman , 3G Evolution: HSPA and LTE for Mobile Broadband, 2 nd Edition, Academic Press, UK, October2008. Stefania Sesia , Issam Toufik , Matthew Baker , LTE, the UMTS Long Term Evolution: From Theory to Practice,John Wiley & Sons, UK, April 2009. 3GPP TS 36.321, Evolved Universal Terrestrial Radio Access (E-UTRA); Medium Access Control (MAC)Protocol Specification, December 2010. 3GPP TS 36.322, Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Link Control (RLC) ProtocolSpecification, December 2010.

IEEE 802.16m Radio Access Technology Recommendation ITU-R M.1645, Framework and overall objectives of the future development of IMT-2000 andsystems beyond IMT-2000, June 2003. Report ITU-R M.2134, Requirements related to technical system performance for IMT-Advanced radiointerface(s), November 2008. IEEE 802.16m-07/002r10, IEEE 802.16m System Requirements, (http://ieee802.org/16/tgm/index.html),January 2010. Report ITU-R M.2135-1, Guidelines for evaluation of radio interface technologies for IMT-Advanced, December2009. IEEE 802.16m-08/004r5, IEEE 802.16m Evaluation Methodology Document,(http://ieee802.org/16/tgm/index.html), January 2009. Sassan Ahmadi , Mobile WiMAX; A Systems Approach to Understanding IEEE 802.16m Radio AccessTechnology, 1 st Edition, Academic Press, 2010. WiMAX Forum Network Architecture Release 1.5 Version 1—Stage 2: Architecture Tenets, Reference Modeland Reference Points, http://www.wimaxforum.org/resources/documents/technical/release, September 2009. WiMAX Forum Mobile System Profile, Release 1.5, September 2010(http://www.wimaxforum.org/resources/documents/technical/release) IEEE 802.16m-08/0034r4 , IEEE 802.16m System Description Document,(http://ieee802.org/16/tgm/index.html), December 2010. IEEE Std 802.16m-2011 , IEEE Standard for Local and Metropolitan Area Networks—Part 16: Air Interface forBroadband Wireless Access Systems, Amendment 3: Advanced Air Interface, May 2011. IEEE Std 802.16-2009 , IEEE Standard for Local and Metropolitan Area Networks, PART 16: Air Interface forBroadband Wireless Access Systems, May 2009.

Land Mobile Radio and Professional Mobile Radio: Emergency First ResponderCommunications L. Miller and Z. Hass , Public safety, IEEE Communications Magazine, 44(1), 28–29, 2006. Technologies and standards for mobile radio communications networks, TAIT Radio Communications, Tech.Rep., February 2010. R. I. Desourdis , D. R. Smith , W. D. Speights , R. J. Dewey , and J. R. DiSalvo , Emerging Public SafetyWireless Communication Systems, Artech House, Inc., Norwood, Massachusetts, 2002. M. Metcalf , Project MESA: Advanced mobile broadband communications for public safety applications, in The14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, Beijing, China, Vol. 2, pp.1159–1161, September 2003. Emergency Communications during the Minneapolis Bridge Disaster: A Technical Case Study by the FederalCommunications Commission's Public Safety and Homeland Security Bureau's Communications SystemsAnalysis Division, pp. 1–61, November 2008.

Project Mesa; service specification group-services and applications; statement of requirements executivesummary. MESA Organizational Partners (ETSI, TIA), 2005. [Online]. Available: www.projectmesa.org. APCO project 25 statement of requirements P25SoR, P25, 2010. Project 25 Technology Interest Group , http:www.project25.org. L. DaSilva , G. Morgan , C. Bostian , D. Sweeney , S. Midkiff , J. Reed , C. Thompson , W. Newhall , and B.Woerner , There surgence of push-to-talk technologies, IEEE Communications Magazine, 44(1), 48–55, 2006. ETSI. Terrestrial Trunked Radio (TETRA); Voice plus Data (V + D); Designers’ guide; Part 1: Overview,technical description and radio aspects, ETR 300-1, 1997. ETSI, Terrestrial Trunked Radio (TETRA); Voice plus Data (V + D); Part 2: Air Interface (AI) , ETS 300 392-2,1999. P25 Radio Systems, Training Guide, Daniels Electronics Ltd., Canada, 2004. R. Rudolph and E. Yu , IMBE and AMBE speech compression, International IC99, 232–234, 1999. D. Atkinson and A. Catellier , Intelligibility of Selected Radio Systems in the Presence of Fireground Noise: TestPlan and Results. NTIA Technical Report, 2008. W. Kushner , S. Harton , R. Novorita , and M. McLaughlin , The acoustic properties of SCBA equipment and itseffects on speech communication, IEEE Communications Magazine, 44(1), 66–72, 2006. H. Holma and A. Toskala , Eds., LTE for UMTS OFDMA and SC-FDMA Based Radio Access, John Wiley &Sons Ltd, Great Britain, 2009. C. Redding , N. DeMinco , and J. Linder , Voice Quality Assessment of Vocoders in Tandem Configuration,NTIA Report, pp.1–21, April 2001. S. F. Campos Neto , F. Corcoran , and A. Karahisar , Performance assessment of tandem connection ofcellular and satellite-mobile coders, in 1997 IEEE International Conference on Acoustics, Speech, and SignalProcessing, Munich, Bavaria, Germany, Vol. 2, pp. 1379–1382, April 1997. S. F. Campos Neto and F. Corcoran , Performance assessment of tandem connection of cellular and satellite-mobile coders, in IEEE International Conference on ICASSP, Phoenix, Arizona, Vol. 1, pp. 177–180, March1999. ETSI, Terrestrial trunked radio (TETRA); speech codec for full-rate traffic channel; part 2: TETRA codec , ETSIEN 300-395-2 V1.3.1, 2005. Background noise and radio performance: Best practices help firefighters and other first responders maximizethe intelligibility of two-way radio communications in high-noise environments, Motorola, Tech. Rep., 2008. EADS, White paper: Interoperable mission critical broadband/narrowband solution for public safetycommunications, Alcatel-Lucent, Tech. Rep., 2010. J. Facella , Current state of 700 MHz Broadband for Public Safety, PowerPoint Presentation, HarrisCorporation, Nov. 19, 2010.

Digital Audio Broadcasting [F02] C. Faller , Technical advances in digital audio radio broadcasting, Proc. of the IEEE, 90(8), 2002, pp.1303–1333. [ETSI_1] ETSI EN300400 v1.4.1 Original DAB specification, www.etsi.org [wDAB] www.eworlddab.org/technology/dab [ETSI_2] ETSI TS102563 v1.1.1 DAB+ enhancement specification, webapp.etsi.org [wikiDAB] en.wikipedia.org/wiki/Digital_Audio_Broadcasting [wikiHEAAC] en.wikipedia.org/wiki/High_Efficiency_Advanced_Audio_Coding [wikiAAC] en.wikipedia.org/wiki/Advanced_Audio_Coding [LC04] S. Lin and D. J. Costello , Error Control Coding, 2nd Ed, Prentice-Hall, New York, 2004. [C91] R. V. Cox , Sub-band speech coding and matched convolutional channel coding for mobile radiochannels, IEEE Transactions on Acoustics, Speech & Signal Processing, 39(8), 1717–1731, 1991. [D08] E. Dahlman , 3G Evolution, 2nd Ed, Academic Press, New York, 2008. [wikifDAB] en.wikipedia.org/wiki/File:Digital_Audio_Broadcasting.svg [wIBQ] www.iBiquity.com [wIBQ_P] P. J. Peyla , The structure and generation of robust waveforms for FM. In Band on Channel DigitalBroadcasting, www.iBiquity.com [wIBQ_J] S. A. Johnson , The structure and generation of robust waveforms for AM. In Band on Channel DigitalBroadcasting, www.iBiquity.coms [wFCC] www.fcc.gov [PS08] H. C. Papadopoulos and C.-E. W. Sundberg , Precoded modulo-precancelling systems for simulcastinganalog FM and digital data, IEEE Transactions on Communications, 56(8), 1279–1288, 2008. [PS98] H. C. Papadopoulos and C.-E. W. Sundberg , Simultaneous broadcasting of analog FM and digitalaudio signals by means of adaptive precanceling strategies, IEEE Transactions on Communications, 46(9),

1233–1242, 1998. [CS00a] B. Chen and C.-E. W. Sundberg , Digital audio broadcasting in the FM band by means of contiguousband Insertion and precancelling techniques, IEEE Transactions on Communications, 48(10), 1634–1637,2000. [CS00b] B. Chen and C.-E. W. Sundberg , Complementary punctured pair convolutional codes for digital audiobroadcasting, IEEE Transactions on Communications, 48(11), 1829–1839, 2000. [SS94] N. Seshadri and C.-E. W. Sundberg , List Viterbi decoding algorithms with applications, IEEETransactions on Communications, 42(2/3/4), 313–323, 1994. [LS01] J. N. Laneman and C.-E. W. Sundberg , Soft selection combining for terrestrial digital audiobroadcasting in the FM band, IEEE Transactions on Broadcasting, 47(2), 103–114, 2001. [S99] C.-E. W. Sundberg , Multistream Hybrid On Channel Systems for digital audio broadcasting in the FMband, IEEE Transactions on Broadcasting, 45(3), 410–417, 1999. [L02] H.-L. Lou , Multi-stream transmission for Hybrid IBOC AM with embedded multidescriptive audio coding,IEEE Transactions on Broadcasting, 48(3), 179–192, 2002. [wHDR] www.hdradio.com [wIBQ_I] www.ibiquity.com/international [wDRM] www.drm.org [RS08] S. A. Ramprashad and C. E. W. Sundberg , Hierarchical QAM BICM MIMO systems with iterativedecoding and applications to media broadcast, IEEE WOWMOM 2008, Newport Beach, CA, June 2008. [wikiDRM] en.wikipedia/wiki/Digital_Radio_Mondiale [wSXM] www.siriusxm.com [N05] N. Naik , Joint encoding and decoding methods for digital audio broadcasting of multiple programs, IEEETransactions on Broadcasting, 51(4), 439–448, 2005. [wikiISDB] en.wikipedia.org/wiki/ISDB [wikiDVBH] en.wikipedia.org/wiki/DVB-H [wikiFLO] en.wikipedia.org/wiki/MediaFLO [wQC] www.qualcomm.com [C07] M. R. Chari , FLO Physical Layer: an overview, IEEE Transactions on Broadcasting, 53(1), 145–160,2007. [w3GPP] www.3gpp.org [BH05] M. Bakhuizen and U. Horn , Mobile broadcast/multicast in mobile networks, Ericsson Review, 82(1),6–13, 2005. [I08] J.-A. Ibanez , Mobile TV over 3G networks—Service and enablers evolution, Ericsson Review, 85(1),38–42, 2008. [wikiDD] en.wikipedia.org/wiki/Dolby_Digital [B10] D. Bodson , Digital audio around the world, IEEE Vehicular Technology Magazine, 5(4), 24–30, 2010. [C83] M. Costa , Writing on dirty paper, IEEE Transactions on Information Theory, 29(3), 439–441, 1983. [wikiGSM] en.wikipedia.org/wiki/GSM [AAS86] J. B. Anderson , T. M. Aulin , and C.-E. W. Sundberg , Digital Phase Modulation, Plenum, New York,1986. [MH81] K. Murota and K. Hirade , GMSK modulation for digital mobile telephony, IEEE Transactions onCommunications, 29(7), 1044–1050, 1981. [BKB03] G. de Boer , C. Kupfenschmidt , D. Bederov , and H.-P. Kuchenbecker , Digital audio broadcasting inthe FM band based on continuous phase modulation, IEEE Transactions on Broadcasting, 49(3), 293–303,2003. [KAB08] C. Kupfenschmidt , A. Ayadi-Miessen , G. de Boer , R. Patino , and H.-P. Kuchenbecker , Field tests ofdigital radio broadcasting in the FM band based on continuous phase modulation, IEEE Transactions onBroadcasting, 54(2), 236–248, 2008.

Speech Coding for Wireless Communications J. D. Gibson , Speech coding methods, standards, and applications, IEEE Circuits and Systems Magazine, 5,30–49, 2005. W. B. Kleijn and K. K. Paliwal , eds., Speech Coding and Synthesis, Amsterdam, Holland: Elsevier, 1995. ITU-T Recommendation P.862, Perceptual Evaluation of Speech Quality (PESQ), an Objective Method for End-to-End Speech Quality Assessment of Narrowband Telephone Networks and Speech Codecs, February 2001. ITU-T Recommendation G.114, One-Way Transmission Time, May 2000. H. S. Malvar , Signal Processing with Lapped Transforms, Norwood, MA: Artech House, 1992. A. M. Kondoz , Digital Speech: Coding for Low Bit Rate Communication Systems, West Sussex, England: JohnWiley & Sons, 2004.

ITU-T Recommendation G.722.1, Coding at 24 and 32 kbit/s for Hands-Free Operation in Systems with LowFrame Loss, September 1999. ITU-T Recommendation G.722.2, Wideband Coding of Speech at around 16 kbit/s Using Adaptive Multi-RateWideband (AMR-WB), 2002. ITU-T Recommendation G. 718, Series G: Transmission Systems and Media, Digital Systems and Networks,Digital Terminal Equipments—Coding of Voice and Audio Signals, June 2008. ITU-T Recommendation G. 719, Series G: Transmission Systems and Media, Digital Systems and Networks,Digital Terminal Equipments—Coding of Analogue Signals by Pulse Code Modulation, June 2008. B. Bessette , The adaptive multirate wideband speech codec (AMR-WB), IEEE Transactions on Speech andAudio Processing, 10, 620–636, 2002. M. Jelinek , On the architecture of the cdma2000® variable-rate multimode wideband (VMR -WB) speechcoding standard, Proceedings of ICASSP, 2004, pp. I-281–I-284. R. Cox , S. F. de Campos Neto , C. Lamblin , and M. H. Sherif , ITU-T coders for wideband, superwideband,and fullband speech communication, IEEE Communications Magazine, 106–109, 2009. K. Jarvinen , I. Bouazizi , L. Laaksonen , P. Ojala , and A. Ramo , Media coding for the next generation mobilesystem LTE, Computer Communication, 1916–1927, 2010. M. Neuendorf , P. Gournay , M. Multrus , J. Lecomte , B. Bessette , R. Geiger , S. Bayer , A novel scheme forlow bitrate unified speech and audio coding-MPEG RM0, Audio Engineering Society, Convention Paper 7713,May 2009. IETF Opus Interactive Audio Codec, http://opus-codec.org/, 2011.

Video Compression Video codec for audiovisual services at p × 64 Kbits/s, ITU-T, Rec. H.261, ITU-T, March 1993. Coding of moving pictures and associated audio for digital storage medic at up to about 1.5 Mbits/s, Part 2:Video, ISO/IEC 11172-2, March 1993. Generic coding of moving pictures and associated audio information, Part 2: Video, ITU-T Rec. H.262 andISO/IEC 13818-2, November 1994. Video codec for low bit rate communication, ITU-T, Rec. H.263, ITU-T, January 1998. Coding of audiovisual objects, Part 2: Visual, ISO/IEC 14496-2, ISO/IEC JTC 1, May 2004. Advanced video coding for generic audiovisual services, ITU-T Rec. H.264 and ISO/IEC 14496-10, ITU-T andISO/IEC JTC1, April 2007. T. Wiegand , G. J. Sullivan , G. Bjøntegaard , and A. Luthra , Overview of the H.264/AVC video codingstandard. IEEE Trans. Circuits Syst. Video Technol., 13(7), 560–576, 2003. G. Sullivan , Overview of known H.264/MPEG-4 pt. 10/AVC deployment plans and status, Joint Video Team(JVT) of ISO/IEC MPEG & ITU-T VCEG, Document JVT-L009, Jul. 2004. JVT and Test and Video Group , Report of the formal verification tests on AVC/H.264, ISO/IECJTC1/SC29/WG11, Document N6231, Dec. 2003. J. M. Boyce , Weighted prediction in the H.264/MPEG AVC video coding standard, in Proc. ISCAS, 2004. D.-K. Kwon and H. J. Kim , Region-based weighted prediction for real-time H.264 encoder, in Proc. ICCE,2011. M. Flierl and B. Girod , Generalized B pictures and the draft H.264/AVC video compression standard. IEEETrans. Circuits and Syst. Video Technol., 13(7), 2003. H. Malvar , A. Hallapuro , M. Karczewicz , and L. Kerofsky , Low-complexity transform and quantization inH.264/AVC. IEEE Trans. Circuits Syst. Video Technol., 13(7), 598–603, 2003. M. Wien , Variable block-size transforms for H.264/AVC, IEEE Trans. Circuits Syst. Video Technol. 13(7),604–613, 2003. D. Marpe , H. Schwarz , and T. Wiegand , Context-based adaptive binary arithmetic coding in the H.264/AVCvideo compression standard. IEEE Trans. Circuits and Syst. Video Technol., 13(7), 2003. A. M. Tourapis , A. Leontaris , K. Sühring , and G. Sullivan , H.264/14496-10 AVC Reference Software Manual(revised for JM 17.1), Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG, Document JVT-AE010, June2009. A. Ortega and K. Ramchandran . Rate-distortion techniques in image and video compression. IEEE SignalProc. Magazine, 15(6), 23–50, 1998. G. J. Sullivan and T. Wiegand . Rate-distortion optimization for video compression. IEEE Signal Proc.Magazine, 15(6), 74–90, 1998. T. Wiegand and B. Girod . Lagrange multiplier selection in hybrid video coder control. In Proc. of IEEE Int. Conf.Image Proc., ICIP 2009, pp. 542–545, Cairo, Egypt, Oct. 2001. T. Wiegand , H. Schwarz , A. Joch , F. Kossentini , and G. J. Sullivan . Rate constrained coder control andcomparison of video coding standards. IEEE Trans. Circuits Syst. Video Technol., 13(7), 688–703, 2003.

G. Sullivan , Adaptive quantization encoding technique using an equal expected-value rule, Joint Video Team(JVT) of ISO/IEC MPEG & ITU-T VCEG, Document JVT-N011, Jan. 2005. G. J. Sullivan , P. Topiwala , and A. Luthra , The H.264/AVC Advanced video coding standard: Overview andintroduction to the Fidelity Range Extensions. SPIE Conference on Applications of Digital Image ProcessingXXVII, Aug., 2004. D. Marpe , T. Wiegand , S. Gordon , H.264/MPEG4-AVC Fidelity Range Extensions: Tools, profiles,performance, and application areas. In Proc. of IEEE Int. Conf. Image Proc., ICIP 2005, Sep. 2005. T. Oelbaum , V. Baroncini , T. K. Tan , and C. Fenimore , Subjective quality assessment of the emergingAVC/H.264 video coding standard. International Broadcasting Conference (IBC), Sep., 2004. H. Schwarz , D. Marpe , and T. Wiegand , Overview of the scalable video coding extension of the H.264/AVCstandard. IEEE Trans. Circuits and Syst. Video Technol., 17(9), 2007. M. Wien , H. Schwarz , and T. Oelbaum , Performance analysis of SVC. IEEE Trans. Circuits and Syst. VideoTechnol., 17(9), 2007. H. Schwarz , D. Marpe , T. Schierl , and T. Wiegand , Combined scalability support for the scalable extension ofH.264/AVC. In Proc. ICME, 2005. P. Merkle , A. Smolic , K. Muller , and T. Wiegand , Efficient prediction structure for multiview video coding.IEEE Trans. Circuits and Syst. Video Technol., 17(9), 2007. A. M. Tourapis , P. Pahalawatta , A. Leontaris , Y. He , Y. Ye , K. Stec , and W. Husak , A frame compatiblesystem for 3D delivery, ISO/IEC JCT1/SC29/WG11, Doc. M17925, July 2010. J. H. Kim , P. Lai , and A. Ortega , New coding tools for illumination and focus mismatch compensation inmultiview video coding. IEEE Trans. Circuits and Syst. Video Technol., 17(11), 2007. K. Yamamoto , M. Kitahara , H. Kimata , T. Yendo , T. Fujii , M. Tanimoto , S. Shimizu , K. Kamikura , and Y.Yashima , Multiview video coding using view interpolation and color correction. IEEE Trans. Circuits and Syst.Video Technol., 17(11), 2007. K. N. Iyer , K. Maiti , B. Navathe , H. Kannan , and A. Sharma , Multiview video coding using depth based 3Dwarping. In Proc. ICME, 2008. P. Merkle , A. Smolic , K. Muller , and T. Wiegand , Multi-view video plus depth representation and coding. InProc. ICIP, 2007. C. Fehn , Depth-image-based rendering (DIBR), compression and transmission for a new approach on 3D-TV.In Proc. SPIE, 2004. S. Ince , E. Martinian , S. Yea , and A. Vetro , Depth estimation for view synthesis in multiview video coding. In3DTV conference, 2007. Q. Zhang , P. An , Y. Zhang , L. Shen , and Z. Zhang , Improved multi-view depth estimation for view synthesisin 3D video coding. In 3DTV conference, 2011. W. S. Kim , A. Ortega , J. Lee , and H. Wey , 3-D video coding using depth transition data. In Proc. PictureCoding Symposium, December 2010. Call for Proposals on 3D video coding technology, ISO/IEC JCT1/SC29/WG11, Doc. N12036, March 2011. B. Bross , W.-J. Han , J.-R. Ohm , G. J. Sullivan , T. Wiegand , WD4: Working Draft 4 of High-Efficiency VideoCoding, JCTVC-F803, JCT-VC, 6th Meeting: Torino, IT, July14-22, 2011.

Machine Assessment of Speech Communication Quality ATIS Recommendation PP-0100005.2006 . 2006. Auditory non-intrusive quality estimation plus (ANIQUE+):Perceptual model for non-intrusive estimation of narrow-band speech quality. American National StandardsInstitute (ANSI). Beerends, J. , Hekstra, A. , Rix, A. , and Hollier, M. 2002. Perceptual evaluation of speech quality (PESQ) thenew ITU standard for end-to-end speech quality assessment. Part II: Psychoacoustic model. Journal of theAudio Engineering Society 50(10): 765–778. Bishop, C. M. 2007. Pattern Recognition and Machine Learning, 2nd edition. New York, NY: Springer. Deller, J. R., Jr. , Hansen, J. H. L. , and Proakis, J. G. 1999. Discrete-Time Processing of Speech Signals.Piscataway, NJ: Wiley-IEEE Press. Clark, A. D. 2001. Modeling the effects of burst packet loss and recency on subjective voice quality.Proceedings of the IP-Telephony Workshop 123–127. Falk, T. and Chan, W.-Y. 2006. Nonintrusive speech quality estimation using Gaussian mixture models. IEEESignal Processing Letters 13(2): 108–111. Falk, T. and Chan, W.-Y. 2008. Hybrid signal-and-link-parametric speech quality measurement for VoIPcommunications. IEEE Transactions on Audio, Speech & Language Processing 16(8): 1579–1589. Gibson, J.D. , Ed. 2002. The Communications Handbook, 2nd edition. Boca Raton, FL: CRC Press. Gray, P. , Hollier, M. , and Massara, R. 2000. Non-intrusive speech quality assessment using vocal tractmodels. IEE Proceedings—Vision, Image, and Signal Processing 147(6): 493–501.

ITU-T Recommendation G.107 . 2005. The E-model, a computational model for use in transmission planning.International Telecommunication Union. ITU-T Recommendation P.561 . 2002. In-service non-intrusive measurement device—Voice servicemeasurements. International Telecommunication Union. ITU-T Recommendation P.563 . 2004. Single ended method for objective speech quality assessment in narrow-band telephony applications. International Telecommunication Union. ITU-T Recommendation P.800 . 1996. Methods for subjective determination of transmission quality.International Telecommunication Union. ITU-T Recommendation P.835 . 2003. Subjective test methodology for evaluating speech communicationsystems that include noise suppression algorithms. International Telecommunication Union. ITU-T Recommendation P.861 . 1996. Perceptual speech quality measure: Objective quality measurement oftelephone-band speech codecs. International Telecommunication Union. ITU-T Recommendation P.862 . 2001. Perceptual evaluation of speech quality: An objective method for end-to-end speech quality assessment of narrow-band telephone networks and speech codecs. InternationalTelecommunication Union. ITU-T Recommendation P.862.1 . 2003. Mapping function for transforming P.862 raw result scores to MOS-LQO. International Telecommunication Union. ITU-T Recommendation P.862.2 . 2005. Wideband extension to Recommendation P.862 for the assessment ofwideband telephone networks and speech codecs. International Telecommunication Union. ITU-T Recommendation P.862.3 . 2007. Application guide for objective quality measurement based onRecommendations P.862, P.862.1 and P.862.2. International Telecommunication Union. ITU-T Recommendation P.863 . 2011. Perceptual objective listening quality assessment. InternationalTelecommunication Union. Karlsson, A. , Heikkila, G. , Minde, T. B. , Nordlund, M. , Timus, B. , and Wiren, N. 1999. Radio link parameterbased speech quality index—SQI. Proc. 1999 IEEE Workshop on Speech Coding 147–149. Malfait, L. , Berger, J. , and Kastner, M. 2006. P.563: The ITU-T standard for single-ended speech qualityassessment. IEEE Transactions Audio, Speech, and Language Processing 14(6): 1924–1934. Quackenbush, S. , Barnwell, T. , and Clements, M. 1988. Objective Measures of Speech Quality. EnglewoodCliffs, New Jersey: Prentice-Hall. Rix, A. , Hollier, M. , Hekstra, A. , and Beerends, J. 2002. Perceptual evaluation of speech quality (PESQ) thenew ITU standard for end-to-end speech quality assessment. Part I: Time-delay compensation. Journal of theAudio Engineering Society 50(10): 755–764. Wang, Z. , Bovik, A.C. , Skeikh, H.R. , and Simoncelli, E.P. 2004. Image quality assessment: From errorvisibility to structural similarity. IEEE Transactions on Image Processing 13(4): 600–612. Winkler, S. and Mohandas, P. 2008. The evolution of video quality measurement: From PSNR to hybridmetrics. IEEE Transactions on Broadcasting 54(3): 660–668.

Wireless Network Protocols N. Abramson , The ALOHA system: Another alternative for computer communications. Proceedings of Fall JointComputer Conference, Houston, TX, USA, November 1970. A. Papoulis and S. U. Pillai , Probability, Random Variables and Stochastic Processes, McGraw-Hill, Inc.,Boston, 2002. L. G. Roberts , ALOHA packet system with and without slots and capture. Computer Communications Review,5(2), 28–42, 1975. M. Stojanovic , On the relationship between capacity and distance in an underwater acoustic communicationchannel. Proceedings of ACM WUWNet, September 2006. L. Freitag , M. Johnson , M. Grund , S. Singh , and J. Priesig , Integrated acoustic communication andnavigation for multiple uuvs, Proceedings of IEEE OCEANS, November 2001. N. Parrish , L. Tracy , S. Roy , P. Arabshahi , and W. L. J. Fox , System design considerations for underseanetworks: Link and multiple access protocols. IEEE Journal on Selected Areas in Communications, 26(9),1720–1730, 2009. L. Kleinrock and F. Tobagi , Packet switch in radio channels: Part I–carrier sense multiple access modes andtheir throughput-delay characteristics. IEEE Transactions on Communications, 23(12), 1400–1416, 1975. IEEE Standard for wireless LAN medium access control (MAC) and physical layer (PHY) specifications, 1999. C. E. Perkins , E. M. Belding-Royer , and S. R. Das , Ad hoc on-demand distance vector routing. Request forComments, 3561, July 2003. D. Johnson , Y. Hu , and D. Maltz , The dynamic source routing protocol (DSR) for mobile ad hoc networks forIPv4. Request for Comments, 4728, February, 2007. T. Clausen and P. Jacquet , Optimized link state routing protocol (OLSR), Request for Comments, 3626,October 2003.

J. M. McQuillan , I. Richer , and E. C. Rosen , The new routing algorithm for the ARPANet. IEEE Transactionson Communications, 28(5), 711–719, 1980. C. E. Perkins and P. Bhagwat , Highly dynamic destination-sequenced distance-vector routing (DSDV) formobile computers. Proceedings of ACM SIGCOMM, August 1994. C. Hedrick , Routing information protocol. Request for Comments, 1058, June 1988. C. S. R. Murthy and B. S. Manoj , Ad Hoc Wireless Networks Architectures and Protocols. Prentice-Hall, 2004. P. Mohapatra and S. Krishnamurthy , Ad Hoc Networks: Technologies and Protocols. Springer, 2010. More information on this topic can be found in IEEE Transactions on Communications, IEEE Transactions onWireless Communications, IEEE Transactions on Vehicular Technology, Elsevier Ad Hoc Networks, and issuesof IEEE Journal on Selected Areas in Communications covering wireless ad hoc networks.

Cross-Layer Design in Wireless Communications R. Laroia , S. Uppala , and J. Li , Designing a mobile broadband wireless access network, IEEE SignalProcessing Magazine, 21(5), 20–28, 2004. V. Kawadia , and P. R. Kumar , A cautionary perspective on cross-layer design, IEEE WirelessCommunications, 12(1), 3–11, 2005. Larry L. Peterson , and Bruce S. Davie , Computer Networks: A Systems Approach, Morgan Kaufmann, 2007. S. Shakkottai , T. S. Rappaport , and P. C. Karlsson , Cross-layer design for wireless networks, IEEECommunications Magazine, 41(10), 74–80, 2003. V. Srivastava , and M. Motani , Cross-layer design: A survey and the road ahead, IEEE CommunicationsMagazine, 43(12), 112–119, 2005. S. Choudhury and J. D. Gibson , Payload length and rate adaptation for multimedia communications in wirelessLANs, IEEE Journal on Selected Areas in Communications, 25(4), 796–807, May 2007. S. Choudhury and J. D. Gibson , Throughput optimization for wireless LANs in the presence of packet error rateconstraints, IEEE Communications Letters, 12(1), 11–13, January 2008, doi: 10.1109/LCOMM.2008.071434. S. Choudhury , I. Sheriff , J. D. Gibson , and E. Belding-Royer , Effect of payload length variation andretransmissions on multimedia in WLANs, ACM International Wireless Communication and Mobile ComputingConference (IWCMC), Vancouver, Canada, July 3–6, 2006. J. Hu , S. Choudhury , and J. D. Gibson , Video capacity of WLANs with a multiuser perceptual qualityconstraint, IEEE Trans. on Multimedia, 10(8), 1465–1478, 2008. N. Shetty , S. Choudhury , and J. D. Gibson , Voice capacity under quality constraints for IEEE 802.11a basedWLANs, ACM International Wireless Communication and Mobile Computing Conference (IWCMC), Vancouver,Canada, July 3–6, 2006. M. Van der Schaar , and D. S. Turaga , Cross-layer packetization and retransmission strategies for delay-sensitive wireless multimedia transmission, IEEE Transactions on Multimedia, 9(1), 185–197, 2007. D. Astely , E. Dahlman , A. Furuskar , Y. Jading , M. Lindstrom , and S. Parkvall , LTE: The evolution of mobilebroadband, IEEE Communications Magazine, 47(4), 44–51, 2009. S. Lee , S. Choudhury , A. Khoshnevis , S. Xu , and S. Lu , Downlink MIMO with frequency-domain packetscheduling for 3GPP LTE, IEEE INFOCOM, Rio de Janeiro , pp. 1269–1277, 19–25 April 2009, doi:10.1109/INFCOM.2009.5062041. S. Lee , I. Pefkianakis , S. Choudhury , S. Xu , and S. Lu , Exploiting spatial, frequency, and multiuser diversityin 3GPP LTE cellular networks, IEEE Transactions on Mobile Computing, vol. PP(99), pp.1, 2011, doi:10.1109/TMC.2011.206. G. Song , and Ye Li , Cross-layer optimization for OFDM wireless networks-part I: Theoretical framework, IEEETransactions on Wireless Communications, 4(2), 614–624, 2005. G. Song , and Ye Li , Cross-layer optimization for OFDM wireless networks-part II: Algorithm development,IEEE Transactions on Wireless Communications, 4(2), 625–634, 2005. T. Kwon , H. Lee , S. Choi , J. Kim , D. Cho , S. Cho , S. Yun , W. Park , and K. Kim , Design andimplementation of a simulator based on a cross-layer protocol between MAC and PHY layers in a WiBroCompatible IEEE 802.16e OFDMA system, IEEE Communications Magazine, 43(12), 136–146, 2005. K. Lahiri , A. Raghunathan , S. Dey , and D. Panigrahi , Battery-driven system design: A new frontier in lowerpower design, in Proc. Intl. Conf. on VLSI Design, Bangalore, India, Jan. 2002, pp. 261–267 G. Miao , N. Himayat , Y. Li , and D. Bormann , Energy efficient design in wireless OFDMA, IEEE InternationalConference on Communications, 2008 (ICC ’08), Beijing, pp. 3307–3312, 19–23 May 2008, doi:10.1109/ICC.2008.622. G.-W. Miao , N. Himayat , G. Y. Li , and A. Swami , Cross-layer optimization for energy-efficient wirelesscommunications: A survey, Wiley Journal on Wireless Communications and Mobile Computing, 9(4), 529–542,2009. S. Cui , A. J. Goldsmith , and A. Bahai , Energy-constrained modulation optimization, IEEE Transactions onWireless Communications, 4(5), 2349–2360, 2005.

A. El Gamal , C. Nair , B. Prabhakar , E. Uysal-Biyikoglu , and S. Zahedi , Energy-efficient scheduling of packettransmissions over wireless networks, IEEE Proceedings INFOCOM 2002, Twenty-First Annual JointConference of the IEEE Computer and Communications Societies, 3, 1773–1782, 2002. J. Rabaey , J. Ammer , J. L. da Silva, Jr. , and D. Patel , PicoRadio: Ad-hoc wireless networking of ubiquitouslow-energy sensor/monitor nodes, Proceedings of IEEE Computer Society Workshop on VLSI, Orlando, FL, pp.9–12, 2000, doi: 10.1109/IWV.2000.844522. M. Haenggi , and D. Puccinelli , Routing in ad hoc networks: A case for long hops, IEEE CommunicationsMagazine, 43(10), 93–101, 2005. S. Cui , A. J. Goldsmith , and A. Bahai , Energy-efficiency of MIMO and cooperative MIMO techniques in sensornetworks, IEEE Journal on Selected Areas in Communications, 22(6), 1089–1098, 2004. I. F. Akyildiz , W.-Y. Lee , C. Mehmet , V. S. Mohanty , Next generation/dynamic spectrum access/cognitiveradio wireless networks: A survey, Computer Networks, 50(13), 2127–2159, 2006.

Cooperative Communication Technologies T. Cover and A. El Gamal , Capacity theorems for the relay channel, IEEE Trans. on Information Theory, IT-25(5): 572–584, 1979. G. Kramer , I. Maric , and R. D. Yates , Cooperative communications, Foundations and Trends in Networking,1(3–4): 271–425, 2006. J. N. Laneman , D. N. C. Tse , and G. W. Wornell , Cooperative diversity in wireless networks: Efficientprotocols and outage behavior, IEEE Trans. Inf. Theory, 50(12): 3062–3080, 2004. I. Hammerström , M. Kuhn , and A. Wittneben , Channel adaptive scheduling for cooperative relay networks,IEEE Vehicular Technology Conference, VTC Fall 2004, Los Angeles, September 2004. A. Sendonaris , E. Erkip , and B. Aazhang , User cooperation diversity—part I: System description, IEEE Trans.Comm., 51: 1927–1938, 2003. J. N. Laneman and G. W. Wornell , Distributed space–time-coded protocols for exploiting cooperative diversityin wireless networks, IEEE Trans. Inf. Theory, 49(10): 2415–2425, 2003. L. Zheng and D. N. C. Tse , Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels,IEEE Trans. Inf. Theory, 49(5): 1073–1096, 2003. S. Huixia , Evolution and interference analysis of cooperative communication systems., ZTE Commun., 8(1):17–20, 2010. A. Goldsmith , Wireless Communications, Cambridge University Press, New York, NY, 2005. R. U. Nabar , H. Bolcskei , and F. W. Kneubuhler , Fading relay channels: Performance limits and space–timesignal design, IEEE J. Selected Areas Commun., 22: 1099–1109, 2004. A. S. Avestimehr , S. Diggavi , and D. N. C. Tse , A deterministic approach to wireless relay networks, Proc.Allerton Conference on Communications, Control and Computing, Monticello, IL, USA, October 2007. A. Host-Madsen and J. Zhang , Capacity bounds and power allocation in wireless relay channel, IEEE Trans.on Information Theory, 51: 2020–2040, 2005. I. Maric and R. D. Yates , Bandwidth and power allocation for cooperative strategies in Gaussian relaynetworks, Proc. 38th Asilomar Conf. Signal, System Computers, pp. 1907–1911, November 2004. Y. Zhao , R. Adve , and T.-J. Lim , Improving amplify-and-forward relay networks: Optimal power allocationversus selection, IEEE Trans. Wireless Communications, 6(8):1234–1238, 2006. L.-L. Xie and P. R. Kumar , A network information theory for wireless communication: Scaling laws and optimaloperation, IEEE Trans. Inf. Theory, 50(5): 748–767, 2004. J. Boyer , D. D. Falconer , and H. Yanikomeroglu , Multihop diversity in wireless relaying channels, IEEE Trans.on Commun., 52(10): 1820–1830, 2004. A. K. Sadek , W. Su , and K. J. R. Liu , Multinode cooperative communications in wireless networks, IEEETrans. Signal Processing, 55(1): 341–355, 2007. G. K. Karagiannidis , T. Tsiftsis , and R. K. Mallik , Bounds for multihop relayed communications in Nakagamifading, IEEE Trans. Communications, 54(1): 18–22, 2006. M. O. Hasna and M. S. Alouini , Outage probability of multihop transmission over Nakagami fading channels,IEEE Comm. Letters, 7(5): 216–218, 2003. M. S. P. Kumar , P. Herhold , R. Bhattacharjee , and G. Fettweis , Cooperative multi-hop relaying over fadingchannels using cascaded 2-hop technique, Proceedings of the IEEE INDICON 2004, pp. 139–142, December20–22, 2004. G. Kramer , M. Gastpar , and P. Gupta , Cooperative strategies and capacity theorems for relay networks, IEEETrans. Inf. Theory, 51(9): 3037–3063, 2005. A. Bletsas , A. Khisti , D. P. Reed , and A. Lippman , A simple cooperative diversity method based on networkpath selection, IEEE J. Select. Areas Commun., 24(3): 659–672, 2006. E. Beres and R. Adve , Selection cooperation in multi-source cooperative networks, IEEE Trans. WirelessCommunications, 7(1): 118–127, 2008.

A. Ribeiro , X. Cai , and G. B. Giannakis , Symbol error probabilities for general cooperative links, IEEE Trans.Wireless Communications, 4(3): 1264–1273, 2005. T. C.-Y. Ng and W. Yu , Joint optimization of relay strategies and resource allocations in cooperative cellularnetworks, IEEE J. Select. Areas Commun., 25(2): 328–339, 2007. B. Zhao and M. C. Valenti , Practical relay networks: A generalization of hybrid-ARQ, IEEE J. Select. AreasCommun., 23(1): 7–18, 2005. H. Bolcskei , R. U. Nabar , O. Oyman , and A. J. Paulraj , Capacity scaling laws in MIMO relay networks, IEEETrans. Wireless Commun., 5(6): 1433–1444, 2006. G. Scutari and S. Barbarossa , Distributed space–time coding for regenerative relay networks, IEEE Trans.Wireless Commun., 4(5): 2387–2399, 2005. S. Yiu , R. Schober , and L. Lampe , Distributed space–time block coding, IEEE Trans. Communications, 55(7):1195–1206, 2006. P. A. Anghel , G. Leus , and M. Kaveh , Distributed space–time cooperative systems with regenerative relays,IEEE Trans. Wireless Commun., 5(11): 3130–3141, 2006. Y. Jing and B. Hassibi , Distributed space–time coding in wireless relay networks, IEEE Trans. WirelessCommun., 5(12): 3524–3536, 2006. S. Yang and J.-C. Belfiore , Optimal space–time codes for the MIMO amplify-and-forward cooperative channel,IEEE Trans. Inf. Theory, 53(2): 647–663, 2007. B. Sirkeci-Mergen and A. Scaglione , Randomized space–time coding for distributed cooperativecommunication, IEEE Trans. Signal Process., 55(10): 5003–5017, 2007. K. J. R. Liu , A. K. Sadek , W. Su , and A. Kwasinski , Cooperative Communications and Networking,Cambridge University Press, New York, NY, USA, 2009. R. Ahlswede , N. Cai , S.-Y. R. Li , and R. W.-H. Yeung , Network information flow, IEEE Trans. on InformationTheory, 46: 1204–1216, 2000. S. Li , R. Yeung , and N. Cai , Linear network coding, IEEE Trans. on Information Theory, 49(2): 371–381,2003. R. Koetter and M. Medard , An algebraic approach to network coding, IEEE Trans. on Networking,11(5):782–796, October 2003. S. Zhang , S. C. Liew , and P. P. Lam , Physical-Layer Network Coding, ACM MobiCom, Los Angeles, USA,September 2006. B. Rankov and A. Wittneben , Spectral efficient protocols for half-duplex fading relay channels, IEEE J. Select.Areas Commun., 25(2): 379–389, 2007. K. Narayanan , M. P. Wilson , and A. Sprintson , Joint physical layer coding and network coding for bi-directional relaying, Proc. Allerton Conference on Communication, Control and Computing, Monticello, IL, USA,2007. F. Xue and S. Sandhu , PHY-Layer Network Coding for Broadcast Channel with Side Information, ITW 2007,Lake Tahoe, California, September 2–6, 2007. E. G. Larsson and Y. Cao , Collaborative transmit diversity with adaptive radio resource and power allocation,IEEE Comm. Lett., 9(6): 511–513, 2005. M. Yuksel and E. Erkip , Diversity in relaying protocols with amplify and forward, IEEE GlobalTelecommunications Conference, 2003, vol. 4, pp. 2025–2029, December 1–5, 2003. I. Maric and R. D. Yates , Cooperative multihop broadcast for wireless networks, IEEE J. Selected Areas inCommunications, 22(6): 1080–1088, 2004. O. Gurewitz , A. de Baynast , and E. W. Knightly , Cooperative strategies and achievable rate for tree networkswith optimal spatial reuse, IEEE Trans. Inf. Theory, 53(10): 3596–3614, 2007. X. Deng and A. M. Haimovich , Power allocation for cooperative relaying in wireless networks, IEEE Comm.Letters, 9(11): 994–996, 2005. Y.-W. Hong , W.-J. Huang , F.-H. Chiu , and C.-C. J. Kuo , Cooperative communications in resource-constrained wireless networks, IEEE Signal Processing Mag., 24(3): 47–57, 2007. A. Nosratinia , T. E. Hunter , and A. Hedayat , Cooperative communication in wireless networks, IEEE Comm.Magazine, 42(10): 74–80, 2004. R. Pabst Relay-based deployment concepts for wireless and mobile broadband radio, IEEE Comm. Magazine,42(9): 80–89, 2004. A. Scaglione , D. L. Goeckel , and J. N. Laneman , Cooperative communications in mobile Ad Hoc networks,IEEE Signal Processing Magazine, 23(5): 18–29, 2006. M. Dohler and Y. Li , Cooperative Communications: Hardware, Channel & PHY, Wiley, Hoboken, NJ, 2010. P. Y.-W. Hong , W.-J. Huang , and C.-C. J. Kuo , Cooperative Communications and Networking: Technologiesand System Design, Springer, New York, 2010. K. Loa , C.-C. Wu , S.-T. Sheu , Y. Yuan , M. Chion , D. Huo , and X. Ling , IMT-advanced relay standards,IEEE Comm. Magazine, 48(8): 40–48, 2010. Y. Yang , H. Hu , J. Xu , and G. Mao , Relay technologies for WiMAX and LTE-advanced mobile systems, IEEEComm. Magazine, 47(10): 1–7, 2009.

S. W. Peters and R. W. Heath, Jr. , The future of WiMAX: Multihop relaying with IEEE 802.16j, IEEE Comm.Magazine, 47(1): 104–111, 2009. J. Camp and E. Knightly , The IEEE 802.11s extended service set mesh networking standard, IEEE Comm.Magazine, 46(8): 120–126, 2008. P. Liu , Z. Tao , S. Narayanan , T. Korakis , and S. S. Panwar , CoopMAC: A cooperative MAC for wirelessLANs, IEEE J. on Selected Areas in Communications, 25(2): 340–354, 2007. A. Ghosh , R. Ratasuk , B. Mondal , N. Mangalvedhe , and T. Thomas , LTE-advanced: Next-generationwireless broadband technology, IEEE Wireless Communications, 17(3): 10–22, 2010.

Cross-Layer Cooperative Communication in Wireless Networks E. C. van der Meulen , Three-terminal communication channels, Advanced Applied Probability, 3, 120–154,1971. T. Cover and A. E. Gamal , Capacity theorems for the relay channel, IEEE Transactions on Information Theory,25, 572–584, 1979. A. Sendonaris , E. Erkip , and B. Aazhang , User cooperation diversity. Part I. System description, IEEETransactions on Communications, 51, 1927–1938, 2003. J. N. Laneman and G. W. Wornell , Distributed space-time coded protocols for exploiting cooperative diversityin wireless networks, IEEE Transactions on Information Theory, 49(10), 2415–2525, 2003. J. N. Laneman , D. N. C. Tse , and G. W. Wornell , Cooperative diversity in wireless networks: Efficientprotocols and outage behavior, IEEE Transactions on Information Theory, 50(12), 3062–3080, 2005. IEEE standard for local and metropolitan area networks, part 16: Air interface for broadband wireless accesssystems, amendment 1: Multihop relay specification, IEEE LAN/MAN Standards Committee, 2009. J. F. Nash , The bargaining problem, Econometrica, 18, 155–162, 1950. M. A. Khojastepour , Distributed cooperative communications in wireless networks, Ph.D. dissertation, RiceUniversity, Houston, TX, 2005. S. Verdú , On channel capacity per unit cost, IEEE Transactions on Information Theory, 36, 1019–1030, 1990. A. E. Gamal , M. Mohseni , and S. Zahedi , Bounds on capacity and minimum energy-per-bit for AWGN relaychannels, IEEE Transactions on Information Theory, 52, 1545–1561, 2006. S. Mathur , L. Sankar , and N. B. Mandayam , Coalitions in cooperative wireless networks, IEEE Journal onSelected Areas in Communications, 26, 1104–1115, 2008. Y. Chen and S. Kishnore , A game-theoretic analysis of decode-and-forward user cooperation, IEEETransactions on Wireless Communications, 7, 1941–1951, 2008. Z. Zhang , J. Shi , H.-H. Chen , M. Guizani , and P. Qiu , A cooperation strategy based on Nash bargainingsolution in cooperative relay networks, IEEE Transactions on Vehicular Technology, 57, 2570–2577, 2008. J. F. Nash , Non-cooperative games, Annals of Mathematics, 54, 286–295, 1951. M. Kaneko , An extension of the Nash bargaining problem and the Nash social welfare function, Theory andDecision, 12, 135–148, 1980. R. Horst and N. V. Thoai , DC programming: Overview, Journal of Optimization Theory and Applications, 103,1–43, 1999. J. W. Friedman , A non-cooperative equilibrium for supergames, The Review of Economic Studies, 38, 1–12,1971. P. Gupta and P. R. Kumar , The capacity of wireless networks, IEEE Transactions on Information Theory, 46,388–404, 2000. V. R. Cadambe and S. A. Jafar , On calculating power-aware connected dominating sets for efficient routing inad hoc wireless networks, IEEE International Conference on Communications, pp. 971–975, May 2008. L. Tassiulas and S. Sarkar , Maxmin fair scheduling in wireless networks, Proceedings of the 21st Annual IEEEINFOCOM, New York, NY, vol. 1, pp. 763–772, 2002. E. Dijkstra , A note on two problems in connexion with graphs, Numerische Mathematik, 1, 269–271, 1959. R. Bellman , On a routing problem, Quartely Applied Mathematics, 16(1), 87–90, 1959. C. E. Shannon , A mathematical theory of communication, Bell Systems Technical Journal, 27, 369–423, 1948. T. H. Corman , C. E. Leiserson , and R. L. Rivest , Introduction to Algorithms. McGraw-Hill, Cambridge, MA,1996. G. B. Middleton , B. Aazhang , and J. Lilleberg , A flexible framework for polynomial-time resource allocation inmultiflow wireless networks, Proceedings of the 47th Allerton Conference on Communication, Control andComputing, Monticello, IL, September 2009. G. B. Middleton , B. Aazhang , and J. Lilleberg , Efficient resource allocation and interference management forstreaming multiflow wireless networks, International Conference on Communications, Cape Town, South Africa,May 2010.

T. M. Cover and A. E. Gamal , Capacity theorems for the relay channel, IEEE Transactions on InformationTheory, 25, 572–584, 1979. A. Host-Madsen and J. Zhang , Capacity bounds and power allocation for wireless relay channels, IEEETransactions on Information Theory, 51(6), 2020–2040, 2005. M. Nokleby and B. Aazhang , User cooperation for energy-efficient cellular communications, IEEE InternationalConference on Communications, Cape Town, South Africa, May 2010.

Wireless Mesh Networks I. Akyildiz and X. Wang , A survey on wireless mesh networks. IEEE Communications Magazine, 43(9),S23–S30, 2005. R. Bruno , M. Conti , and E. Gregori , Mesh networks: Commodity multihop ad hoc networks. IEEECommunications Magazine, 43(3), 123–131, 2005. M.J. Lee , J. Zheng , Y.-B. Ko , and D.M. Shrestha , Emerging standards for wireless mesh technology, IEEEWireless Communications Magazine, 13(2), 56–63, 2006. Google, Inc . [Online]. Available: http://www.google.com/corporate/. Tropos, Inc . [Online]. Available: http://www.tropos.com. E. Perkins , E. Belding-Royer , and S. Das . (2003, Jul.) Ad hoc on demand distance vector (AODV) routing.[Online]. Available: http://www.ietf.org/rfc/rfc3561.txt. C. Perkins and P. Bhagwat , Highly dynamic destination-sequenced distance-vector (DSDV) routing for mobilecomputers. ACM SIGCOMM Computer Communication Review, 24(4), 234–244, 1994. D. Johnson and D. Maltz , Dynamic source routing in ad hoc wireless networks. Mobile Computing, 353,153–181, 1996. T. Clausen and P. Jaquet . (2003, Oct.) Optimized link state routing protocol (OLSR). [Online]. Available:http://www.ietf.org/rfc/rfc3626.txt. R. Draves , J. Padhye , and B. Zill , Comparisons of routing metrics for static multi-hop wireless networks. Prof.of ACM Special Interest Group on Data Communications Conference (SIGCOMM), pp. 133–144, Aug. 2004. R. Draves , J. Padhye , and B. Zill , Routing in multi-radio, multi-hop wireless mesh networks. Proceedings ofACM Mobile Computing and Networking Conference (MOBICOM), Philadelphia, PA, pp. 114–128, Sep. 2004. D. Couto , A high-throughput path metric for multi-hop wireless routing. Wireless Networks, 11(4), 419–434,2005. Z. Tang and J. Garcia-Luna-Aceves , A protocol for topology-dependent transmission scheduling in wirelessnetworks. Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), New Orleans,LA, pp. 1333–1337, Sep. 1999. C. Zhu and M. Corson , A five-phase reservation protocol (FPRP) for mobile ad hoc networks. WirelessNetworks, 7(4), 371–384, 2001. C. Zhu and M. Corson , An evolutionary-TDMA scheduling protocol (E-TDMA) for mobile ad hoc networks,Proceedings of Advanced Telecommunications/Information Distribution Research Program (ATIRP), CollegePark, MD, Mar. 2000. H. Lee and D. Cox , A fully-distributed control time slot assignment protocol for large wireless mesh networks.Proceedings of IEEE Military Communications Conference (MILCOM), San Diego, CA, Nov. 2008. H. Lee and D. Cox , A fully cooperative and distributed medium access control protocol for large TDMA/TDD-based wireless mesh networks. Proceedings of IEEE Vehicular Technology Conference (VTC)-Spring,Barcelona, Spain, Apr. 2009. H. Lee and D. Cox , Admission and congestion control for large-scale wireless mesh access networks.Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, Apr.2010. H. Lee , Wireless mesh networks: Protocol design and performance evaluation. PhD dissertation, StanfordUniversity, Stanford, CA, USA, Mar. 2010. I. Chlamtac and S. Kutten , A spatial-reuse of TDMA/FDMA for mobile multi- hop radio networks. Proceedingsof IEEE Conference on Computer Communications (INFOCOM), Washington, DC, 1985. I. Cidon and M. Sidi , Distributed assignment algorithms for multihop packet radio networks. IEEE Transactionson Computers, 38(10), 1353–1361, 1989. A. Ephremedis and T. Truong , Scheduling broadcasts in multihop radio net works. IEEE Transactions onCommunications, 38(4), 456–460, 1990. S. Ramanathan , A unified framework and algorithm for channel assignment in wireless networks. WirelessNetworks, 5(2), 81–94, 1999. IEEE Std. 802.11 , 1999 Edition (R2003), Information technology Telecommunications and informationexchange between systems—Local and metropolitan area networks—Specific requirements—Part 11: WirelessLAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications.

D. Zhao , J. Zou , and T. Todd , Admission control with load balancing in IEEE 802.11-based ESS meshnetworks. Wireless Networks, 13(3), 351–359, 2007. C. Zhu and M. Corson , Qos routing for mobile ad hoc networks, Proceedings of IEEE Conference on ComputerCommunications (INFOCOM), New York, NY, pp. 958–967, Jun. 2002. I. P802.11s/D0.01 , Draft Amendment to Standard IEEE 802.11: ESS Mesh Networking. IEEE, Mar. 2006, workin progress. M. Bahr , Proposed routing for IEEE 802.11s WLAN mesh network. Proceedings of Wireless InternetConference (WICON), Boston, MA, Aug. 2006.

IP Multimedia Subsystem: Analysis of Scalability and Integration * 3rd Generation Partnership Project (3GPP), IP Multimedia Subsystem (IMS), TS23.228, Rel10. http://www.openmobilealliance.org/. M. Poikselka , G. Mayer , H. Khartabil , and A. Niemi , The IMS IP Multimedia Concepts and Services for theMobile Domain, Wiley, 2004, ISBN 0-470-87113-X. G. Camarillo and M. Garcia-Martin , The 3G IP Multimedia Subsystem (IMS), John Wiley, 2006, ISBN 0-470-01818-6. M. Koukal and R. Bestak , Architecture of IP multimedia subsystem, Proceedings of the 48th InternationalSymposium, Zadar, Croatia, pp. 323–326, 2006. F. Cuervo , N. Greene , A. Rayhan , C. Huitema , B. Rosen , and J. Segers , Megaco protocol version 1.0, IETFRFC Request for Comments: 3015, November 2000. Internet Engineering Task Force (IETF), Session initiation protocol (SIP) , RFC 3261, June 2002. M. Wuthnow , M. Stafford , and J. Shih , IMS A New Model for Blending Applications, Informal Telecoms &Media, 2009. U. Iqbal , S. Sohail , and M. Javed , SIP based QoS management architecture for IP multimedia subsystemsover IP access networks, World Academy of Science, Engineering and Technology, 64, 2010. S. Blake , D. Black , M. Carlson , E. Davies , Z. Wang , and W. Weiss , An architecture for differentiatedservices, IETF RFC Request for Comments, December, 2475, 1998. Z. Bei , Analysis of SIP in UMTS IP multimedia subsystem, PhD thesis, North Carolina State University, USA,p. 91, 2003. W. Wang and I. Akyildiz , intersystem location update and paging schemes for multitier wireless networks,International Conference on Mobile Computing and Networking, Massachusetts, USA, 2000, pp. 99–109. S. Mohan and R. Jain , Two user location strategies for personal communications services IEEE PersonalCommunications, 1, 42–50, 1994. D. Dunwang , L. Xia , and Z. Hua , Study of multi-connection mechanism in IMS, Communications and MobileComputing (CMC) International Conference, Shenzhen, China, vol. 1, pp. 345–349, 2010. J. Xiao , C. Huang , and J. Yan , A flow-based traffic model for SIP messages in IMS IEEE GLOBCOM 09, pp.1–7, 2009. M. Buddhikot , G. Chandranmenon , Design and implementation of a WLAN/CDMA2000 interworkingarchitecture, IEEE Communications Magazine, 41, 90–100, 2003. H. Mahmood and B. Gage , An architecture for integrating CDMA2000 and 802.11 WLAN Networks, IEEE 58thVehicular Technology Conference, VTC2003, vol. 3, 2003. L. Saleem , R. Ghimire , and S. Mohan , An analysis of IP multimedia subsystems for a hybrid network, IEEE4th International Conference on Internet Multimedia Services Architecture and Applications (IMSAA),Bangalore, India, pp. 1–6, 2010. L. Saleem and S. Mohan , A complexity analysis of IP multimedia subsystems (IMS), First InternationalSymposium on Advanced Networks and Telecommunications Systems (ANTS), Mumbai, India, December2007.

Cognitive Radio Networks J. Mitola, III , G.Q. Maguire , Cognitive radio: Making software radios more personal, IEEE Pers. Commun.,6(4), 13–18, 1999. S. Haykins , Cognitive radio: Brain-empowered wireless communications, IEEE J. Selected Areas Commun.,23(2), 201–220, 2005. T.J. Shepard , Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet RadioNetworks, PhD dissertation, MIT, Cambridge, MA, 1995.

P. Gupta and P.R. Kumar , The capacity of wireless networks, IEEE Trans. Inform. Theory, 46(2), 388–404,2000. K.-C. Chen , P.-Y. Chen , N. Prasad , Y.-C. Liang , and S. Sun , Trusted cognitive radio networking, WirelessCommunications and Mobile Computing, Wiley, 2010. C.-H. Huang , Y.-C. Lai , and K.-C. Chen , Network capacity of cognitive radio relay networks, Phys. Commun.,1(2), 112–120, 2008. A. Goldsmith , S.A. Jafar , I. Maric , and S. Srinivasa , Breaking spectrum gridlock with cognitive radios: Aninformation theoretic perspective, Proc. IEEE, 97(5), 894–914, 2009. S. Geirhofer , L. Tong , and B. M. Sadler , Dynamic spectrum access in the time domain: Modeling andexploiting white space, IEEE Commun. Mag., pp. 66–72, May 2007. V. Pla , J.R. Vidal , J. Martinez-Bauset , and L. Guijarro , Modeling and characterization of spectrum whitespaces for underlay cognitive radio networks, Cape Town, IEEE International Conference on Communications,2010. B. Canberk , I.F. Akyildiz , and S. Oktug , Primary user activity modeling using first-difference filter clusteringand correlation in cognitive radio networks, to appear IEEE/ACM Transactions on Networking, 19(1), 170–183,Feb. 2011. K.-C. Chen , B.K. Cetin , Y.-C. Peng , N. Prasad , J. Wang , and S. Lee , Routing for cognitive radio networksconsisting of opportunistic links, Wireless Communications and Mobile Computing, 10(4), 451–466, 2010. Y.C. Liang , K.C. Chen , Y.J. Li , and P. Mähönen , Cognitive radio networking and communications: Anoverview, IEEE Trans. Vehicular Technol., 60(7), 3386–3407, 2011. G. Ganesan and J. Li , Cooperative spectrum sensing in cognitive radio, Part I: Two-user networks, IEEETrans. Wireless Commun., 6(6), 2204–2213, 2007. G. Ganesan and J. Li , Cooperative spectrum sensing in cognitive radio, Part II: Multiuser networks, IEEETrans. Wireless Commun., 6(6), 2214–2222, 2007. J. Unnikrishnan and V. V. Veeravalli , Cooperative sensing for primary detection in cognitive radio, IEEE J.Selected Topics Signal Process., 2(1), 18–27, 2008. K.C. Chen , S. Y. Tu , and C. K. Yu , Statistical inference in cognitive radio networks, IEEE ChinaCom, Xi-An,August 2009. C.K. Yu , S. Cheng , and K. C. Chen , Cognitive radio network tomography, the special issue of achievementsand road ahead: The first decade of cognitive radio. IEEE Trans. Vehicular Technol., 59(4), 1980–1997, 2010. C. Cormio and K. R. Chowdhury , A survey on MAC protocols for cognitive radio networks, Ad Hoc Networks, 7,1315–1329, 2009. Q. Zhao , L. Tong , A. Awami , and Y. Chen , Decentralized cognitive MAC for opportunistic spectrum access inad hoc networks: A POMDP framework, IEEE J. Selected Areas Commun., 25(3), 589–600, 2007. L. Lai , H. El Gamal , H. Jiang , and H.V. Poor , Cognitive medium access: Exploration, exploitation, andcompetition, IEEE Trans. Mobile Comput., 10(2), 239–253, 2011. K.C. Chen and R. Prasad , Cognitive Radio Networks, West Sussex, UK, Wiley, 2009. W.-Y. Lee and I.F. Akyildiz , A spectrum decision framework for cognitive radio networks, IEEE Trans. MobileComput., 10(2), 161–174, 2011. Y.-C. Liang , Y. Zeng , E.C.Y. Peh , and A.T. Hoang , Sensing-throughput tradeoff for cognitive radio networks,IEEE Trans. Wireless Commun., 7(4), 1326–1337, 2008. A.A. El-Sherif and K.J.R. Liu , Joint design of spectrum sensing and channel access in cognitive radionetworks, IEEE Trans. Wireless Commun., 10(6), 1743–1753, 2011. Y.Y. Lin and K. C. Chen , Asynchronous dynamics spectrum access, IEEE Trans. Vehicular Technol., 61(1),222–236, January 2012. D. Niyato and E. Hossain , Competitive pricing for spectrum sharing in cognitive radio networks: Dynamicgame, inefficiency of Nash equilibrium, and collusion, IEEE J. Selected Areas Commun., 26(1), 192–202, 2008. D. Niyato and E. Hossain , Competitive spectrum sharing in cognitive radio networks: A dynamic gameapproach, IEEE Trans. Wireless Commun., 7, 2651–2660, 2008. Y. Thomas Hou and Y. Shi , Spectrum sharing for multi-hop networking with cognitive radio, IEEE J. SelectedAreas Commun., 26(1), 146–155, 2008. H.B. Chang and K.C. Chen , Auction based spectrum management of cognitive radio networks, the specialissue of achievements and road ahead: The first decade of cognitive radio, IEEE Trans. Vehicular Technol.,59(4), 1923–1935, 2010. K.R. Chowdhury and I.F. Akyildiz , CRP: A routing protocol for cognitive radio ad hoc networks, IEEE J.Selected Areas Commun., 29(4), 794–804, 2011. M.Z. Win , P.C. Pinto , and L.A. Sheep , A mathematical theory of network interference and its applications,Proc. IEEE, 97(2), 205–230, 2009. M. Haenggi and R.K. Ganti , Interference in large wireless networks, Foundations Trends Networking, 3(2),127–248, 2008. M. Haenggi , J. Andrews , F. Baccelli , O. Dousse , and M. Franceschetti , Stochastic geometry and randomgraphs for the analysis and design of wireless networks, IEEE J. Selected Areas Commun., 27(7), 1029–1046,2009.

W. Ren , Q. Zhao , and A. Swami , On the connectivity and multihop delay of ad hoc cognitive radio networks,IEEE J. Selected Areas Commun., 29(4), 805–818, 2011. W.C. Ao and K.C. Chen , Upper bound on broadcast transmission capacity of heterogeneous wireless ad hocnetworks, IEEE Commun. Lett., 15(11), pp. 1172–1174, 2011. W.C. Ao , S.M. Cheng , and K.C. Chen , Connectivity of multiple cooperative cognitive radio ad hoc networks,IEEE J. Selected Areas Commun., 30(2), 263–270, February 2012. C. Gao , Y. Shi , Y.T. Hou , and S. Kompella , On the throughput of MIMO-empowered multihop cognitive radionetworks, IEEE Trans. Mobile Comput., 10(1), 1506–1519, 2011. W.C. Ao and K.C. Chen , End-to-end HARQ in cognitive radio networks, IEEE Wireless Communications andNetworking Conference, Sydney, 2010. H.B. Chang , S.M. Cheng , S.Y. Lien , and K.C. Chen , Statistical delay control of opportunistic links in cognitiveradio networks, IEEE International Symposium on Personal Indoor Mobile Radio Communications, Istanbul,2010. P.Y. Chen , S.M. Cheng , W.C. Ao , and K.C. Chen , Multi-path routing with end-to-end statistical QoSprovisioning in underlay cognitive radio networks, IEEE INFOCOM Workshop, Shanghai, 2011. A. Alshamrano , X.S. Shen , and L.-L. Xie , QoS provisioning for heterogeneous services in cooperativecognitive radio networks, IEEE J. Selected Areas Commun., 29(4), 819–820, 2011. Z. Liang , S. Feng , D. Zhao , and X. Shen , Delay performance analysis for supporting real-time traffic in acognitive radio sensor network, IEEE Trans. Wireless Commun., 10(1), 325–335, 2011. X.-L. Huang , G. Wang , F. Hu , and S. Kumar , The impact of spectrum sensing frequency and packet-loadingscheme on multimedia transmission over cognitive radio networks, IEEE Trans. Multimedia, 13(4), 748–761,2011. S. Gunawardena and W. Zhuang , Capacity analysis and call admission control in distributed cognitive radionetworks, IEEE Trans. Wireless Commun., 10(9), 3110–3120, 2011. T. Do and B.L. Mark , Joint spatial-temporal spectrum sensing for cognitive radio networks, IEEE Trans.Vehicular Technol., 59(7), 3480–3490, 2010. T.W. Chiang and K.C. Chen , Synthetic aperture radar construction of spectrum map for cognitive radionetworking, International Conference on Wireless Communications and Mobile Computing, Caen, France,2010. S.Y. Shih and K.C. Chen , Compressed sensing construction of spectrum map for routing in cognitive radionetworks, IEEE Vehicular Technology Conference—Spring, Budapest, 2011. S.C. Lin and K.C. Chen , Spectrum aware opportunistic routing in cognitive radio networks, IEEE GLOBECOM,Miami, 2010. S.Y. Lien , Y.Y. Lin , and K.C. Chen , Cognitive and game-theoretical radio resource management forautonomous femtocells with QoS guarantees, 10(7), 2196–2206, IEEE Trans. Wireless Commun., 2011. S.M. Cheng , S.Y. Lien , F.S. Chu , and K.C. Chen , On exploiting cognitive radio to mitigate interference inmacro/femto heterogeneous networks, IEEE Wireless Commun., special issue on Heterogeneous Networks,18(3), 40–47, 2011. S. Filin , H. Harada , H. Murakami , and K. Ishizu , International standardization of cognitive radio systems,IEEE Commun. Mag., pp. 82–89, March 2011. P. Di Lorenzo and S. Barbarossa , A bio-inspired swarming algorithm for decentralized access in cognitiveradio, IEEE Trans. Signal Process., 59(1), 6160–6174, 2011. H. Li and Z. Han , Socially optimal queuing control in cognitive radio networks subject to service interruptions:To queue or not to queue? IEEE Trans. Wireless Commun., 10(5), 1656–1666, 2011. C.H. Huang , and K.C. Chen , Dual-observation time division spectrum sensing for cognitive radios, IEEETrans. Vehicular Technol., 60(7), 3712–3725, 2011. S.Y. Lien , K.C. Chen , and Y.H. Lin , Toward ubiquitous massive accesses in 3GPP machine-to-machinecommunications, IEEE Commun. Mag., 49(4), 66–74, 2011.

Vehicular Communications Alshaer, H. and E. Horlait . 2005. An optimized adaptive broadcast scheme for inter-vehicle communication. InIEEE Vehicular Technology Conference, 5: 2840–2844. Benslimane, A. 2004. Optimized dissemination of alarm messages in vehicular ad-hoc networks (VANET). InHigh Speed Networks and Multimedia Communications, 655–666. Berlin: Springer. Biswas, S. , R. Tatchikou , and F. Dion . 2006. Vehicle-to-vehicle wireless communication protocols forenhancing highway traffic safety. IEEE Communications Magazine, 44(1): 74–82. Blum, J.J. , A. Eskandarian , and L.J. Hoffman . 2004. Challenges of intervehicle ad hoc networks. In IEEETransactions on Intelligent Transportation Systems, 5(4): 347–351. Bucciol, P. , E. Masala , N. Kawaguchi , K. Takeda , and J.C. De Martin . 2005. Performance Evaluation ofH.264 Video Streaming over Inter-Vehicular 802.11 Ad Hoc Networks. In Proc. of 16th Annual IEEE Int.

Symposium on Personal, Indoor and Mobile Radio Communications. CALM . ISO TC 204 WG 16. 2011. Communications access for land mobiles (CALM).http://www.isotc204wg16.org/home (accessed February 25, 2011). Chlamtac, I. , M. Conti , and J. J.-N. Liu . 2003. Mobile Ad Hoc networking: Imperatives and challenges. Ad HocNetworks, 1(1): 13–64. DFT 2011. UK Department for Transport (DFT). Trends in travel.http://www.dft.gov.uk/pgr/statistics/datatablespublications/trends/current/section2ptbm.pdf (accessed February25, 2011). Durresi, M. , A. Durresi , and L. Barolli . 2005. Emergency broadcast protocol for inter-vehicle communications.In 11th International Conference on Parallel and Distributed Systems, 402–406. Ergen, M. 2010. Critical penetration for vehicular networks. IEEE Communications Letters. 14(5): 414–416. ETSI . 2011. ETSI Technical Committee on Intelligent Transport Systems.http://www.etsi.org/website/Technologies/IntelligentTransportSystems.aspx (accessed February 25, 2011) Fussler, H. , M. Mauve , H. Hartenstein , M. Kasemann , and D. Vollmer . 2003. Location-based routing forvehicular ad-hoc networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(1): 47–49. Goldman Sachs . 2011. Dreaming with BRICs: The Path to 2050.http://www2.goldmansachs.com/ideas/brics/book/99-dreaming.pdf (accessed February 25, 2011). Grossglauser, M. and D.N.C. Tse . 2002. Mobility increases the capacity of ad hoc wireless networks.IEEE/ACM Transactions on Networking, 10(4): 477–486. Guo, M. , M.H. Ammar , and E.W. Zegura . 2005. V3: A vehicle-to-vehicle live video streaming architecture. InIEEE International Conference on Pervasive Computing and Communications. New York: IEEE Press. Härri, J. , F. Filali , and C. Bonnet . 2009. Mobility models for vehicular Ad Hoc networks: A survey andtaxonomy. IEEE Communications Surveys & Tutorials, 11(4): 19–41. Hartenstein, H. and K.P. Laberteaux . 2008. A tutorial survey on vehicular ad hoc networks. IEEECommunications Magazine, 46(6): 164–171. Hartenstein, H. and K. Laberteaux . 2010. VANET Vehicular Applications and Inter-Networking Technologies.Ed. Hannes Hartenstein and Kenneth P Laberteaux Technology. John Wiley & Sons, Ltd. ISBN: 978-0-470-74056-9. Hu, Y. , D. Johnson , and D. Maltz . 2007. RFC 4728—The Dynamic Source Routing Protocol (DSR) for MobileAd Hoc Networks for IPv4. Internet RFCs. http://www.rfc-editor.org/rfc/rfc4728.txt (accessed February 25,2011). Iwata, A. , C. Chiang , G. Pei , M. Gerla , and T. Chen . 1999. Scalable routing strategies for ad hoc wirelessnetworks. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, 7(8):1369–1379. Jacquet, P. , P. Muhlethaler , A. Qayyum , A. Laouiti , L. Viennot , and T. Clausen . 1998. Optimized link staterouting protocol. RFC 3626 IETF. http://www.ietf.org/rfc/rfc3626.txt. Johnson, D.B. and D.A. Maltz . 1996. Dynamic source routing in ad hoc wireless networks. In MobileComputing, 353: 153–181. US Springer. Karp, B. and H.T. Kung . 2000. GPSR: Greedy perimeter stateless routing for wireless networks. In ACM/IEEEInternational Conference on Mobile Computing and Networking, 243–254. New York: ACM Press. Korkmaz, G. , E. Ekici , F. Ozguner , and U. Ozguner . 2004. Urban multi-hop broad-cast protocol for inter-vehicle communication systems. In First ACM International Workshop on Vehicular Ad Hoc Networks, 76–85.New York: ACM Press. Kosch, T. , C.J. Adler , S. Eichler , C. Schroth , and M. Strassberger . 2006. The scalability problem of vehicularad hoc networks and how to solve it. IEEE Wireless Communications, 13(5): 22–28. Lee, U. , B. Zhou , M. Gerla , E. Magistretti , P. Bellavista , and A. Corradi , 2006. Mobeyes: Smart mobs forurban monitoring with a vehicular sensor network. IEEE Wireless Communications, 13(5): 52–57. Lee, U. , M. Magistretti , M. Gerla , P. Bellavista , and A. Corradi . 2009. Dissemination and harvesting of urbandata using vehicular sensing platforms. IEEE Transactions on Vehicular Technology, 58(2): 882–901. Little T. and A. Agarwal . 2005. An information propagation scheme for VANETs. In 8th International IEEEConference on Intelligent Transportation Systems, 155–160. New York: IEEE Press. Liu, G. , B.-S. Lee , B.-C. Seet , C.H. Foh , K.J. Wong , and K.-K. Lee . 2004. A routing strategy for metropolisvehicular communications. In International Conference on Information Networking, 134–143, US: SpringerPress. Lochert, C. , H. Hannes , T. Jing , H. Fussler , H. Dagmar , and M. Mauve . 2003. A routing strategy forvehicular ad hoc networks in city environments. In IEEE Intelligent Vehicles Symposium, 1: 156–161. NewYork: IEEE Press. Lochert, C. , M. Mauve , H. FuBler , and H. Hartenstein . 2004. Geographic routing in city scenarios. In ACMSIGMOBILE Mobile Computing and Communications Review, 9(1): 69–72. New York: ACM Press. Maihofer C. 2004. A survey of geocast routing protocols. IEEE Communications Surveys & Tutorials, 6(2):32–42. Maihofer, C. and R. Eberhardt . 2004. Geocast in vehicular environments: caching and transmission rangecontrol for improved efficiency. In IEEE Intelligent Vehicles Symposium, 951–956. New York: IEEE Press.

Maihofer, C. , T. Leinmuller , and E. Schoch . 2005. Abiding geocast: Time–stable geocast for ad hoc networks.In Second ACM international workshop on Vehicular ad hoc networks, 20–29. New York: ACM Press. Menouar, H. , M. Lenardi , and F. Filali . 2005. A movement prediction-based routing protocol for vehicle-to-vehicle communications. In First International Vehicle-to-Vehicle Communications Workshop. Moske, M. , H. Füβlet , H. Hartenstein , and W. Franz . 2004. Performance measurements of a vehicular ad hocnetwork. In Proc. IEEE Vehicular Technology Conference, 4: 2116–2120. Nandan, A. , S. Tewari , S. Das , M. Gerla , and L. Kleinrock . 2006. Adtorrent: Delivering location cognizantadvertisements to car networks. In Third IEEE/IFIP Annual Conference on Wireless On-demand NetworkSystems and Services. New York: IEEE Press. Nadeem, T. , S. Dashtinezhad , C. Liao , and L. Iftode . 2004. Traffic view: Traffic data dissemination using car-to-car communication. ACM Mobile Computing and Communications Review, 8(3): 6–19. Namboodiri, V. , M. Agarwal , and L. Gao . 2004. A study on the feasibility of mobile gateways for vehicular ad-hoc networks. In First International Workshop on Vehicular Ad Hoc Networks, 66–75. Perkins, C.E. and E.M. Royer . 1999. Ad-hoc on-demand distance vector routing. In Second IEEE Workshop onMobile Computing Systems and Applications, 90–100. New York: IEEE Press. Perkins, C. , E. Belding-Royer , and S. Das . 2003. RFC3561: Ad hoc On-Demand Distance Vector (AODV)Routing. Internet RFCs. http://www.ietf.org/rfc/rfc3561.txt (accessed February 25, 2011). Rossi, D. , R. Fracchia , and M. Meo . 2008. VANETs: Why Use Beaconing at All? IEEE Int. Conf. onCommunications, 2745–2751. SAE . 2011. US Department of Transportation. SAE J2735—Dedicated Short Range Communications (DSRC)Message Set Dictionary. http://www.standards.its.dot.gov/fact_sheet.asp?f=71. (accessed February 25, 2011). Schoch, E. , F. Kargl , M. Weber , and T. Leinmuller . 2008. Communication patterns in VANETs. IEEECommunications Magazine, 46(1): 119–125. Sengupta, R. , S. Rezaei , S. Shladover , D. Cody , S. Dockey , and H. Krishnan . 2007. Cooperative collisionwarning systems: Concept definition and experimental implementation. Journal of Intelligent TransportationSystems, 11(3): 143–155. Sichitiu, M.L. and M. Kihl . 2008. Inter-vehicle communication systems: A survey. IEEE CommunicationsSurveys & Tutorials, 10(2): 88–105. Ström, E. , H. Hartenstein , P. Santi , and W. Wiesbeck . 2010. Vehicular communications: Ubiquitous networksfor sustainable mobility. Proceedings of the IEEE, 98(7): 111–112. Sun, M. , W. Feng , T. Lai , K. Yamada , H. Okada , and K. Fujimura . 2000. GPS-based message broadcastingfor inter-vehicle communication. In International Conference on Parallel Processing, 279–286. US Census Bureau . 2011. US Census Bureau. Average commute times in the USA.http://factfinder.census.gov/home/saff/main.html (accessed February 25, 2011). WAVE . 2011. IEEE 1609 WG—Dedicated Short Range Communication Working Group. 2011. WirelessAccess in Vehicular Environments (WAVE). http://standards.ieee.org/develop/wg/1609_WG.html (accessedFebruary 25, 2011). Willke, T.L. , P. Tientrakool , and N.F. Maxemchuk . 2009. A Survey of inter-vehicle communication protocolsand their applications. IEEE Communications Surveys & Tutorials, 11(2): 3–20. Wischhof, L. and H. Rohling . 2005. Congestion control in vehicular ad hoc networks. In IEEE InternationalConference on Vehicular Electronics and Safety, 58–63. New York: IEEE Press. Wisitpongphan, N. , F. Bai , P. Mudalidge , V. Sadekar , and O. Tonguz . 2007. Routing in sparse vehicular adhoc wireless networks. In IEEE Journal on Selected Areas in Communications, 25(8): 1538–1556. Wu, H. , R.M. Fujimoto , R. Guensler , and M. Hunter . 2004. MDDV: a mobility-centric data disseminationalgorithm for vehicular networks. In First ACM International Workshop on Vehicular Ad Hoc Networks, 47–56.New York: IEEE Press. Yang, X. , L. Liu , N.H. Vaidya , and F. Zhao . 2004. A vehicle-to-vehicle communication protocol forcooperative collision warning. In First Annual International Conference on Mobile and Ubiquitous Systems:Networking and Services, 114–123. New York: IEEE Press. Zhao, J. and G. Cao . 2006. VADD: Vehicle-assisted data delivery in vehicular ad hoc networks. In IEEEInternational Conference on Computer Communications, 1–12. New York: IEEE Press. Information on governmental actions can be found on the Europe's Information Society portal (Intelligent CarInitiative, url: http://ec.europa.eu/information_society/activities/intelligentcar/) for European countries; on the USDepartment of Transport portal (Research and Innovative Technology Administration - ITS, URL:http://www.its.dot.gov/) for the United States; and on the Ministry of Land, Infrastructure, Transport and Tourismof Japan portal (URL: http://www.mlit.go.jp/index_e.html) for Japan. Information on standardization actions can be found on the IEEE, ISO and ETSI portals (references (WAVE2011), (CALM 2011), and (ETSI 2011)). Reference (Hartenstein and Laberteaux 2010) provides more details on the topics discusses within this chapter. Advances in the state of the art of VANETs are regularly published in the following journals and workshops:IEEE Transactions on Intelligent Transportation Systems; IEEE Transactions on Vehicular Technology; IEEECommunications Magazine; ACM VANET.

60 GHz Wireless Communication Standard ECMA-387 High Rate 60 GHz PHY, MAC and HDMI PAL. http://www.ecma-international.org/publications/standards/Ecma-387.htm. IEEE 802.15.3c: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for HighRate Wireless Personal Area Networks (WPANs), Amendment 2: Millimeter-wave based alternative physicallayer extension, 2009. http://standards.ieee.org/about/get/802/802.15.html. IEEE 802.11 Task Group AD. http://www.ieee802.org/11/Reports/tgad_update.htm. E. Perahia , C. Cordeiro , M. Park , and L. L. Yang . IEEE 802.11ad: Defining the Next Generation Multi-GbpsWiFi, pp. 1–5, January 2010. Wireless Gigabit Alliance. http://wirelessgigabitalliance.org/. S. Singh , R. Mudumbai , and U. Madhow . Distributed coordination with deaf neighbors: Efficient mediumaccess for 60 GHz mesh networks. In Proc. IEEE Infocom 2010, San Diego, CA, USA, March 2010. Z. Pi and F. Khan . An introduction to millimeter-wave mobile broadband systems. IEEE CommunicationsMagazine, 49(6): 101–107, 2009. Y. P. Zhang and D. Liu . Antenna-on-chip and antenna-in-package solutions to highly integrated millimeter-wave devices for wireless communications. Antennas and Propagation, IEEE Transactions on, 57(10):2830–2841, October 2009. S. Geng , J. Kivinen , X. Zhao , and P. Vainikainen . Millimeter-wave propagation channel characterization forshort-range wireless communications. IEEE Transactions on Vehicular Technology, 58(1): 3–13, 2009. H. Xu , V. Kukshya , and T. S. Rappaport . Spatial and temporal characteristics of 60-GHz indoor channels.IEEE Journal on Selected Areas in Communications, 20(3): 620–630, 2002. E. Torkildson , C. Sheldon , U. Madhow , and M. Rodwell . Nonuniform array design for robust millimeter-waveMIMO links. In 2009 IEEE Global Communications Conference (Globecom 2009), November 2009. H. Zhang , S. Venkateswaran , and U. Madhow . Channel modeling and MIMO capacity for outdoor millimeterwave links. In Proc. IEEE WCNC 2010, April 2010. J. Singh , O. Dabeer , and U. Madhow . On the limits of communication with low-precision analog-to-digitalconversion at the receiver. IEEE Transactions on Communications, 57(12): 3629–3639, 2009. C. Sheldon , M. Seo , E. Torkildson , U. Madhow , and M. Rodwell . A 2.4 Gb/s millimeter-wave link usingadaptive spatial multiplexing. pages 1–4, July 2010. S. K. Reynolds A 16-element phased-array receiver IC for 60-GHz communications in SiGe BiCMOS. In Proc.2010 IEEE Radio Frequency Integrated Circuits Symposium, Anaheim, CA, USA, May 2010. J. D. Kraus . Electromagnetics. McGraw-Hill, Inc., New York, 1991. S. Singh , F. Zilliotto , U. Madhow , E. M. Belding , and M. Rodwell . Blockage and directivity in 60 ghz wirelesspersonal area networks: From cross-layer model to multihop mac design. IEEE Journal on Selected Areas inCommunications, Special Issue on Realizing Gbps Wireless Personal Area Networks, 27(8): 1400–1413, 2009. S. Singh , R. Mudumbai , and U. Madhow . Interference analysis for highly directional 60-GHz mesh networks:The case for rethinking medium access control. IEEE/ACM Transactions on Networking, 19(5):1513–1527,2011. P. Gupta and P. R. Kumar . The capacity of wireless networks. Information Theory, IEEE Transactions on,46(2): 388–404, 2000. M. Park , P. Gopalakrishnan , and R. Roberts . Interference mitigation techniques in 60 Ghz wireless networks.IEEE Communications Magazine, 47(12): 34–40, 2009. A. Maltsev , R. Maslennikov , A. Sevastyanov , A. Khoryaev , and A. Lomayev . Experimental investigations of60 GHz WLAN systems in office environment. IEEE Journal on Selected Areas in Communications, specialissue on Realizing Gbps Wireless Personal Area Networks, 27(8):1488–1499, October 2009. M. Park and P. Gopalakrishnan . Analysis on spatial reuse and interference in 60-GHz wireless networks. IEEEJournal on Selected Areas in Communications, special issue on Realizing Gbps Wireless Personal AreaNetworks, 27(8): 1443–1452, 2009. Millimeter wave communication systems research at UCSB.http://www.ece.ucsb.edu/wcsl/mmwcsresearch/doku.php.