Home > Store

CDMA: Principles of Spread Spectrum Communication

Register your product to gain access to bonus material or receive a coupon.

CDMA: Principles of Spread Spectrum Communication


  • Sorry, this book is no longer in print.
Not for Sale



  • Presents an introduction to digital communications and covers all aspects of commercial direct-sequence spread spectrum technology.
  • Incorporates both physical-level principles and network concepts.
  • Includes detailed information on signal generation, synchronization, modulation, and coding of direct-sequence spread spectrum signals.
  • Illustrates how these physical layer functions relate to link and network properties involving cellular coverage, Erlang capacity, and network control.


  • Copyright 1995
  • Dimensions: 7-1/2" x 9-1/4"
  • Pages: 272
  • Edition: 1st
  • Book
  • ISBN-10: 0-201-63374-4
  • ISBN-13: 978-0-201-63374-0

Spread spectrum multiple access communication, known commercially as CDMA (Code Division Multiple Access), is a driving technology behind the rapidly advancing personal communications industry. Its greater bandwidth efficiency and multiple access capabilities make it the leading technology for relieving spectrum congestion caused by the explosion in popularity of cellular mobile and fixed wireless telephones and wireless data terminals.

CDMA has been adopted by the Telecommunications Industry Association (TIA) as a wireless standard. As an electrical or communications engineer, you must acquire a thorough grasp of CDMA fundamentals in order to develop systems, products, and services for this demanding but rewarding market.

Written by a leader in the creation of CDMA and an internationally recognized authority on wireless digital communication, this book gives you the technical information you need. It presents the fundamentals of digital communications and covers all aspects of commercial direct-sequence spread spectrum technology, incorporating both physical-level principles and network concepts. You will find detailed information on signal generation, synchronization, modulation, and coding of direct-sequence spread spectrum signals. In addition, the book shows how these physical layer functions relate to link and network properties involving cellular coverage, Erlang capacity, and network control.

With this book, you will attain a deeper understanding of personal communications system concepts and will be better equipped to develop systems and products at the forefront of the personal wireless communications market.


Sample Content

Table of Contents

1. Introduction.

Definition and Purpose. Basic Limitations of the Conventional Approach. Spread Spectrum Principles. Organization of the Book.

2. Random and Pseudorandom Signal Generation.

Purpose. Pseudorandom Sequences. Maximal Length Linear Shift Register Sequences. Randomness Properties of MLSR Sequences. Conclusion. Generating Pseudorandom Signals (Pseudonoise) from Pseudorandom Sequences. First- and Second-Order Statistics of Demodulator Output in Multiple Access Interference. Statistics for QPSK Modulation by Pseudorandom Sequences. Examples. Bound for Bandlimited Spectrum. Error Probability for BPSK or QPSK with Constant Signals in Additive Gaussian Noise and Interference. Appendix 2A: Optimum Receiver Filter for Bandlimited Spectrum.

3. Synchronization of Pseudorandom Signals.

Purpose. Acquisition of Pseudorandom Signal Timing. Hypothesis Testing for BPSK Spreading. Hypothesis Testing for QPSK Spreading. Effect of Frequency Error. Additional Degradation When N is Much Less Than One Period. Detection and False Alarm Probabilities. Fixed Signals in Gaussian Noise (L=1). Fixed Signals in Gaussian Noise with Postdetection Integration (L>1). Rayleigh Fading Signals (L>/=1). The Search Procedure and Acquisition Time. Single-Pass Serial Search (Simplified). Single-Pass Serial Search (Complete). Multiple Dwell Serial Search. Time Tracking of Pseudorandom Signals. Early-Late Gate Measurement Statistics. Time Tracking Loop. Carrier Synchronization. Appendix 3A: Likelihood Functions and Probability Expressions. Bayes and Neyman-Pearson Hypothesis Testing. Coherent Reception in Additive White Gaussian Noise. Noncoherent Reception in AWGN for Unfaded Signals. Noncoherent Reception of Multiple Independent Observations of Unfaded Signals in AWGN. Noncoherent Reception of Rayleigh-Faded Signals in AWGN.

4. Modulation and Demodulation of Spread Spectrum Signals in Multipath and Multiple Access Interference.

Purpose. Chernoff and Battacharyya Bounds. Bounds for Gaussian Noise Channel. Chernoff Bound for Time-Synchronous Multiple Access Interference with BPSK Spreading. Chernoff Bound for Time-Synchronous Multiple Access Interference with QPSK Spreading. Improving the Chernoff Bound by a Factor of 2. Multipath Propagation: Signal Structure and Exploitation. Pilot-Aided Coherent Multipath Demodulation. Chernoff Bounds on Error Probability for Coherent Demodulation with Known Path Parameters. Rayleigh and Rician Fading Multipath Components. Noncoherent Reception. Quasi-optimum Noncoherent Multipath Reception for M-ary Orthogonal Modulation. Performance Bounds. Search Performance for Noncoherent Orthogonal M-ary Demodulators. Power Measurement and Control for Noncoherent Orthogonal M-ary Demodulators. Power Control Loop Performance. Power Control Implications. Appendix 4A: Chernoff Bound with Imperfect Parameter Estimates.

5. Coding and Interleaving.

Purpose. Interleaving to Achieve Diversity. Forward Error Control Coding - Another Means to Exploit Redundancy. Convolutional Code Structure. Maximum Likelihood Decoder - Viterbi Algorithm. Generalization of the Preceding Example. Convolutional Code Performance Evaluation. Error Probability for Tailed-off Block. Bit Error Probability. Generalizations of Error Probability Computation. Catastrophic Codes. Generalization to Arbitrary Memoryless Channels - Coherent and Noncoherent. Error Bounds for Binary-Input, Output-Symmetric Channels with Integer Metrics. A Near-Optimal Class of Codes for Coherent Spread Spectrum Multiple Access. Implementation. Decoder Implementation. Generating Function and Performance. Performance Comparison and Applicability. Orthogonal Convolutional Codes for Noncoherent Demodulation of Rayleigh Fading Signals. Implementation. Performance for L-Path Rayleigh Fading. Conclusions and Caveats. Appendix 5A: Improved Bounds for Symmetric Memoryless Channels and the AWGN Channel. Appendix 5B: Upper Bound on Free Distance of Rate 1/n Convolutional Codes.

6. Capacity, Coverage, and Control of Spread Spectrum Multiple Access Networks.

General. Reverse Link Power Control. Multiple Cell Pilot Tracking and Soft Handoff. Other-Cell Interference. Propagation Model. Single-Cell Reception - Hard Handoff. Soft Handoff Reception by the Better of the Two Nearest Cells. Soft Handoff Reception by the Best of Multiple Cells. Cell Coverage Issues with Hard and Soft Handoff. Hard Handoff. Soft Handoff. Erlang Capacity of Reverse Links. Erlang Capacity for Conventional Assigned-Slot Multiple Access. Spread Spectrum Multiple Access Outage - Single Cell and Perfect Power Control. Outage with Multiple-Cell Interference. Outage with Imperfect Power Control. An Approximate Explicit Formula for Capacity with Imperfect Power Control. Designing for Minimum Transmitted Power. Capacity Requirements for Initial Accesses. Erlang Capacity of Forward Links. Forward Link Power Allocation. Soft Handoff Impact on Forward Link. Orthogonal Signals for Same-Cell Users. Interference Reduction with Multisectored and Distributed Antennas. Interference Cancellation. Epilogue.

References and Bibliography.



Spread spectrum communication technology has been used in military communications for over half a century, primarily for two purposes: to overcome the effects of strong intentional interference (jamming), and to hide the signal from the eavesdropper (covertness). Both goals can be achieved by spreading the signal's spectrum to make it virtually indistinguishable from background noise. Several texts, or portions of texts, on this subject have been published over the past twenty years. This book is the first to present spectrum technology specifically for commercial wireless applications.

In response to an ever-accelerating worldwide demand for mobile and personal portable communications, spread spectrum digital technology has achieved much higher bandwidth efficiency for a given wireless spectrum allocation, and hence serves a far larger population of multiple access users, than analog or other digital technologies. While it is similar in implementation to its military predecessors, the spread spectrum wireless network achieves efficiency improvements by incorporating a number of unique features made possible by the benign noise-like characteristics of the signal waveform. Chief among these is universal frequency reuse (the fact that all users, whether communicating within a neighborhood, a metropolitan area, or even a nation, occupy a common frequency spectrum allocation). Besides increasing the efficiency of spectrum usage, this also eliminates the chore of planning for different frequency allocation for neighboring users or cells. Many other important multiple access system features are made possible through this universal frequency reuse by terminals employing wideband (spread) noise-like signal waveforms. Most important is fast and accurate power control, which ensures a high level of transmission quality while level for each terminal, and hence a low level of interference to other user terminals. Another is mitigation of faded transmission through the use of a Rake receiver, which constructively combines multipath components rather than allowing them to destructively combine as in narrowband transmission. A third major benefit is soft handoff among multiple cell base stations, which provides improved cell-boundary performance and prevents dropped calls.

In Chapters 2 to 5, this book covers all aspects of spread spectrum transmission over a physical multiple-access channel: signal generation, synchronization, modulation, and error-correcting coding of direct-sequence spread spectrum signals. Chapter 6 relates these physical layer functions to link and network layer properties involving cellular coverage, Erlang capacity, and network control. This outline is unusual in bringing together several wide-ranging technical disciplines, rarely covered in this sequence and in one text. However, the presentation is well integrated by a number of unifying threads. First, the entire text is devoted to the concept of universal frequency reuse by multiple users of multiple cells. Also, two fundamental techniques are used in a variety of different forms throughout the text. The first is the finite-state machine representation of both deterministic and random sequences; the second is the use of simple, elegant upper bounds on the probabilities of a wide range of events related to system performance.

However, given the focus on simultaneous wideband transmission for all users over a common frequency spectrum, the text purposely omits two important application areas: narrowband modulation and coding methods, including multipoint signal constellations and trellis codes; and frequency hopped multiple access, where modulation waveforms are instantaneously narrowband over the duration of each hop. It also generally avoids digressions into principles of information theory. In short, although the material covered through Chapter 5 mostly also applies to narrowband digital transmission systems, the book mainly covers topics that apply to wideband spread spectrum multiple access.

Three motivating forces drove me to write this book. It began with my three decades of teaching within the University of California system. There, keeping with the healthy trend in communication engineering courses, I tried to make theory continually more pertinent to applications. Then there was the fulfillment of a voluntary commission for the Marconi Foundation, which honored me with a Marconi Fellowship award in 1990. Most important was my participation in a significant technological achievement in communication system evolution: the implementation, demonstration, and standardization of a digital cellular spread spectrum code-division multiple access (CDMA) system. Adopted in 1993 by the Telecommunication Industry Association, the CDMA standard IS-95 is the embodiment of many of the principles presented in this text. Although this book is not meant solely for this purpose, it does explain and justify many of the techniques contained in the standard. I emphasize, however, that my goal is to present the principles underlying spread spectrum communication, most but not all of which apply to this standard. It is not to describe in detail how the principles were applied. This is left to the practicing engineer with the patience and commitment to delve into the details and correlate them with the principles presented here.

Which brings me to the question of prerequisites for a basic understanding. Several excellent texts on statistical communication and information theory have been available for almost four decades. Thus, I have not tried to provide all the fundamentals. The text is nevertheless self-contained: any significant results are derived either in the text or in appendices to the chapter where they are first used. Still, the reader should have at least an undergraduate electrical engineering background with some probability and communication engineering content. A first-year engineering graduate course in communication theory, stochastic processes, or detection and estimation theory would be preferable. As a text for a graduate-level course, the book can be covered in one semester, and with some compromises even in one quarter. It is equally suitable for a one- or two-week intensive short course.

This leaves only the pleasant task of thanking the many contributors to the creation of this text. First, from my superb group of colleagues at QUALCOMM Incorporated, running the gamut from mature and renowned engineers to newly minted graduates, have come the inventive system concepts and the innovative implementation approaches that turned the complex concepts into a useful reality. Among the major contributors, Klein Gilhousen, Irwin Jacobs, Roberto Padovani, Lindsay Weaver, and Charles Wheatley stand out. On the more focused aspects of the text, and the research which preceded it, I owe an enormous debt to Audrey Viterbi. She contributed not only ideas, but also considerable dedication to turn fluid concepts and derivations into firmer results with solid theoretical or simulation support. Finally, she was the first to read, critique, and error-correct the entire manuscript. Over a number of years, Ephraim Zehavi's many ideas and novel approaches have produced results included here. Jack Wolf, always a clear expositor, suggested several improvements. When it came to reviewing the final text and offering corrections and changes, I am indebted to more people than I can recall. Foremost among them are my collaborators at QUALCOMM, including Joseph Odenwalder, Yu-Cheun Jou, Paul Bender, Walid Hamdy, Samir Soliman, Matthew Grob, John Miller, and John McDonough. The last three served as experimental subjects among the first set of graduate students on which I class-tested the entire text. Very helpful outside reviews have come from Robert Gallager, Bijan Jabbari, Allen Levesque, James Mazo, Raymond Pickholtz, and Robert Scholtz. To all of the above, and especially to Deborah Casher, my infinitely patient and cooperative assistant, who processed all of my words and equations, I express my sincere thanks.



Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020