Buy Algorithms for Communications Systems and their Applications
close menu
Bookswagon
search
My Account
Home > Electronics and communications engineering > Communications engineering / telecommunications > Algorithms for Communications Systems and their Applications
Algorithms for Communications Systems and their Applications

Algorithms for Communications Systems and their Applications


     0     
5
4
3
2
1



International Edition


X
About the Book

The definitive guide to problem-solving in the design of communications systems

In Algorithms for Communications Systems and their Applications, 2nd Edition, authors Benvenuto, Cherubini, and Tomasin have delivered the ultimate and practical guide to applying algorithms in communications systems. Written for researchers and professionals in the areas of digital communications, signal processing, and computer engineering, Algorithms for Communications Systems presents algorithmic and computational procedures within communications systems that overcome a wide range of problems facing system designers.

New material in this fully updated edition includes:

  • MIMO systems (Space-time block coding/Spatial multiplexing /Beamforming and interference management/Channel Estimation)
  • OFDM and SC-FDMA (Synchronization/Resource allocation (bit and power loading)/Filtered OFDM)
  • Improved radio channel model (Doppler and shadowing/mmWave)
  • Polar codes (including practical decoding methods)
  • 5G systems (New Radio architecture/initial access for mmWave/physical channels)

The book retains the essential coding and signal processing theoretical and operative elements expected from a classic text, further adopting the new radio of 5G systems as a case study to create the definitive guide to modern communications systems.



Table of Contents:

Preface 3

Acknowledgments 3

1 Elements of signal theory 7

1.1 Continuous-time linear systems 7

1.2 Discrete-time linear systems 10

1.3 Signal bandwidth 22

1.4 Passband signals and systems 26

1.5 Second-order analysis of random processes 38

1.6 The autocorrelation matrix 56

1.7 Examples of random processes 60

1.8 Matched filter 66

1.9 Ergodic random processes 69

1.10 Parametric models of random processes 82

1.11 Guide to the bibliography 95

Bibliography 95

Appendixes 97

2 The Wiener filter 129

2.1 The Wiener filter 129

2.2 Linear prediction 140

2.3 The least squares method 145

2.4 The estimation problem 155

2.5 Examples of application 164

Bibliography 173

Appendixes 174

3 Adaptive transversal filters 179

3.1 The MSE design criterion 180

3.2 The recursive least squares algorithm 208

3.3 Fast recursive algorithms 215

3.4 Examples of application 216

Bibliography 221

4 Transmission channels 223

4.1 Radio channel 223

4.2 Telephone channel 268

Appendixes 272

Bibliography 274

5 Vector quantization 277

5.1 Basic concept 277

5.2 Characterization of VQ 278

5.3 Optimum quantization 281

5.4 The Linde, Buzo, and Gray algorithm 284

5.5 Variants of VQ 288

5.6 VQ of channel state information 292

5.7 Principal component analysis 295

Bibliography 299

6 Digital transmission model and channel capacity 301

6.1 Digital transmission model 301

6.2 Detection 305

6.3 Relevant parameters of the digital transmission model 314

6.4 Error probability 317

6.5 Capacity 320

6.6 Achievable rates of modulations in AWGN channels 326

Bibliography 333

Appendixes 334

7 Single-carrier modulation 341

7.1 Signals and systems 341

7.2 Intersymbol interference 356

7.3 Performance analysis 365

7.4 Channel equalization 367

7.5 Optimum methods for data detection 410

7.6 Numerical results obtained by simulations 447

7.7 Precoding for dispersive channels 451

7.8 Channel estimation 456

7.9 Faster-than-Nyquist Signalling 467

8 Multicarrier modulation 499

8.1 MC systems 499

8.2 Orthogonality conditions 500

8.3 Efficient implementation of MC systems 502

8.4 Non-critically sampled filter banks 510

8.5 Examples of MC systems 515

8.6 Analog signal processing requirements in MC systems 517

8.7 Equalization 521

8.8 Orthogonal time frequency space modulation 526

8.9 Channel estimation in OFDM 527

8.10 Multiuser access schemes 532

8.11 Comparison between MC and SC systems 535

8.12 Other MC waveforms 536

Bibliography 537

9 Transmission over multiple input multiple output channels 539

9.1 The MIMO NB channel 539

9.2 CSI only at the receiver 545

9.3 CSI only at the transmitter 558

9.4 CSI at both the transmitter and the receiver 565

9.5 Hybrid beamforming 566

9.6 Multiuser MIMO: broadcast channel 568

9.7 Multiuser MIMO: multiple-access channel 573

9.8 Massive MIMO 575

Bibliography 576

10 Spread-spectrum systems 581

10.1 Spread-spectrum techniques 581

10.2 Applications of spread-spectrum systems 593

10.3 Chip matched filter and rake receiver 597

10.4 Interference 601

10.5 Single-user detection 603

10.6 Multiuser detection 606

10.7 Multicarrier CDMA systems 612

Bibliography 613

Appendixes 615

10.A Walsh codes 616

11 Channel codes 619

11.1 System model 620

11.2 Block codes 622

11.3 Convolutional codes 690

11.4 Puncturing 711

11.5 Concatenated codes 711

11.6 Turbo codes 713

11.7 Iterative detection and decoding 730

11.8 Low-density parity check codes 734

11.9 Polar codes 751

11.10 Milestones in channel coding 775

Bibliography 775

Appendixes 781

11.A Nonbinary parity check codes 782

12 Trellis coded modulation 789

12.1 Linear TCM for one and two-dimensional signal sets 790

12.2 Multidimensional TCM 811

12.3 Rotationally invariant TCM schemes 817

Bibliography 817

13 Techniques to achieve capacity 819

13.1 Capacity achieving solutions for multicarrier systems 819

13.2 Capacity achieving solutions for single carrier systems 833

Achieving capacity 837

Bibliography 838

14 Synchronization 839

14.1 The problem of synchronization for QAM systems 839

14.2 The phase-locked loop 841

14.3 Costas loop 852

14.4 The optimum receiver 856

14.5 Algorithms for timing and carrier phase recovery 863

14.6 Algorithms for carrier frequency recovery 880

14.7 Second-order digital PLL 885

14.8 Synchronization in spread-spectrum systems 885

14.9 Synchronization in OFDM 891

14.10 Synchronization in SC-FDMA 896

Bibliography 899

15 Self-training equalization 901

15.1 Problem definition and fundamentals 901

15.2 Three algorithms for PAM systems 908

15.3 The contour algorithm for PAM systems 910

15.4 Self-training equalization for partial response systems 913

15.5 Self-training equalization for QAM systems 917

15.6 Examples of applications 924

Bibliography 928

Appendixes 930

15.A On the convergence of the contour algorithm 931

16 Low-complexity demodulators 933

16.1 Phase-shift keying 933

16.2 (D)PSK non-coherent receivers 940

16.3 Optimum receivers for signals with random phase 946

16.4 Frequency-based modulations 957

16.5 Gaussian MSK 968

Bibliography 985

Appendixes 985

16.A Continuous phase modulation 986

17 Applications of interference cancellation 989

17.1 Echo and near–end crosstalk cancellation for PAM systems 990

17.2 Echo cancellation for QAM systems 998

17.3 Echo cancellation for OFDM systems 1001

17.4 Multiuser detection for VDSL 1004

Bibliography 1014

18 Examples of communication systems 1019

18.1 The 5G cellular system 1019

18.2 GSM 1032

18.3 Wireless local area networks 1036

18.4 DECT 1037

18.5 Bluetooth 1040

18.6 Transmission over unshielded twisted pairs 1041

18.7 Hybrid fibre/coaxial cable networks 1048

Bibliography 1053

Appendixes 1057

18.A Duplexing 1058

18.B Deterministic access methods 1059

19 High-speed communications over twisted-pair cables 1063

19.1 Quaternary partial response class-IV system 1063

19.2 Dual duplex system 1077

Bibliography 1087

Appendixes 1087

19.A Interference suppression 1088



About the Author :

Nevio Benvenuto, Professor, DEI-Telecommunications Group, University of Padua, Italy. Nevio received his Ph.D. in engineering from the University of Massachusetts, Amherst, in 1983.

Giovanni Cherubini, IBM Research Zurich, Switzerland. Giovanni Cherubini received M.S. and Ph.D. degrees from the University of California, San Diego, in 1984 and 1986, respectively, all in Electrical Engineering.

Stefano Tomasin, Associate Professor, Department of Information Engineering, University of Padova, Italy. Stefano received the Ph.D. degree in Telecommunications Engineering from the University of Padova, Italy, in 2003.


Best Sellers


Product Details
  • ISBN-13: 9781119567967
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: John Wiley & Sons Inc
  • Height: 254 mm
  • No of Pages: 960
  • Returnable: N
  • Weight: 1912 gr
  • ISBN-10: 1119567963
  • Publisher Date: 04 Feb 2021
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 55 mm
  • Width: 178 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms for Communications Systems and their Applications
John Wiley & Sons Inc -
Algorithms for Communications Systems and their Applications
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithms for Communications Systems and their Applications

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    Your IP: 216.73.217.23 IN