Near-Capacity Variable-Length Coding
Home > Science, Technology & Agriculture > Electronics and communications engineering > Communications engineering / telecommunications > WAP (wireless) technology > Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs
Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs

Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

Recent developments such as the invention of powerful turbo-decoding and irregular designs, together with the increase in the number of potential applications to multimedia signal compression, have increased the importance of variable length coding (VLC). Providing insights into the very latest research, the authors examine the design of diverse near-capacity VLC codes in the context of wireless telecommunications. The book commences with an introduction to Information Theory, followed by a discussion of Regular as well as Irregular Variable Length Coding and their applications in joint source and channel coding. Near-capacity designs are created using Extrinsic Information Transfer (EXIT) chart analysis. The latest techniques are discussed, outlining radical concepts such as Genetic Algorithm (GA) aided construction of diverse VLC codes. The book concludes with two chapters on VLC-based space-time transceivers as well as on frequency-hopping assisted schemes, followed by suggestions for future work on the topic. Surveys the historic evolution and development of VLCs Discusses the very latest research into VLC codes Introduces the novel concept of Irregular VLCs and their application in joint-source and channel coding

Table of Contents:
About the Authors Other Wiley and IEEE Press Books on Related Topics Acknowledgments Preface Chapter 1 Introduction 1.1 Historical Overview 1.2 Applications of Irregular Variable Length Coding 1.3 Motivation and Methodology 1.4 Outline of the Book 1.5 Novel Contributions of the Book Chapter 2 Information Theory Basics 2.1 Issues in Information Theory 2.2 AdditiveWhite Gaussian Noise Channel 2.3 Information of a Source 2.4 Average Information of Discrete Memoryless Sources 2.5 Source Coding for a Discrete Memoryless Source 2.6 Entropy of Discrete Sources Exhibiting Memory 2.7 Examples 2.8 Generating Model Sources 2.9 Run-Length Coding for Discrete Sources Exhibiting Memory 2.10 Information Transmission via Discrete Channels 2.11 Capacity of Discrete Channels 2.12 Shannon’s Channel Coding Theorem 2.13 Capacity of Continuous Channels 2.14 Shannon’s Message for Wireless Channels 2.15 Summary and Conclusions I Regular Concatenated Codes and Their Design List of Symbols in Part I Chapter 3 Sources and Source Codes 3.1 Introduction 3.2 Source Models 3.3 Source Codes 3.4 Soft-Decoding of Variable Length Codes 3.5 Summary and Conclusions Chapter 4 Iterative Source/Channel Decoding 4.1 Concatenated Coding and the Turbo Principle 4.2 SISO APP Decoders and Their EXIT Characteristics 4.3 Iterative Source/Channel Decoding Over AWGN Channels 4.4 Iterative Channel Equalisation, Channel Decoding and Source Decoding 4.5 Summary and Conclusions Chapter 5 Three-Stage Serially Concatenated Turbo Equalisation 5.1 Introduction 5.2 Soft-in/Soft-outMMSE Equalisation 5.3 Turbo Equalisation Using MAP/MMSE Equalisers 5.4 Three-stage serially concatenated coding and MMSE equalisation 5.5 Approaching the Channel Capacity Using EXIT-Chart Matching and IRCCs . 5.6 Rate-Optimisation of Serially Concatenated Codes 5.7 Joint Source-Channel Turbo Equalisation Revisited 5.8 Summary and Conclusions II Irregular Concatenated VLCs and Their Design List of Symbols in Part II Chapter 6 Irregular Variable Length Codes for Joint Source and Channel Coding 6.1 Introduction 6.2 Overview of proposed scheme 6.3 Transmission frame structure 6.4 VDVQ/RVLC encoding 6.5 APP SISO VDVQ/RVLC decoding 6.6 Simulation results 6.7 Summary and Conclusions Chapter 7 Irregular Variable Length Codes for EXIT Chart Matching 7.1 Introduction 7.2 Overview of proposed schemes 7.3 Parameter design for the proposed schemes 7.4 Simulation results 7.5 Summary and Conclusions Chapter 8 Genetic Algorithm Aided Design of Irregular Variable Length Coding Components 8.1 Introduction 8.2 The free distance metric 8.3 Overview of the proposed genetic algorithm 8.4 Overview of proposed scheme 8.5 Parameter design for the proposed scheme 8.6 Simulation results 8.7 Summary and Conclusions Chapter 9 Joint EXIT Chart Matching of Irregular Variable Length Coding and Irregular Unity Rate Coding 9.1 Introduction 9.2 Modifications of the EXIT chart matching algorithm 9.3 Joint EXIT chart matching 9.4 Overview of the transmission scheme considered 9.5 System parameter design 9.6 Simulation results 9.7 Summary and Conclusions III Applications of VLCs Chapter 10 Iteratively Decoded VLC Space-Time Coded Modulation 10.1 Introduction 10.2 Space Time Coding Overview 10.3 Two-Dimensional VLC Design 10.4 VL-STCM Scheme 10.5 VL-STCM-ID Scheme 10.6 Convergence Analysis 10.7 Simulation results 10.8 Conclusions Chapter 11 Iterative Detection of Three-Stage Concatenated IrVLC FFH-MFSK 11.1 Introduction 11.2 System Overview 11.3 Iterative decoding 11.4 System parameter design and Results 11.5 Conclusion Chapter 12 Conclusions and Future Research 12.1 Chapter 1: Introduction 12.2 Chapter 2: Information Theory Basics 12.3 Chapter 3: Sources and Source Codes 12.4 Chapter 4: Iterative Source/Channel Decoding 12.5 Chapter 5: Three-Stage Serially Concatenated Turbo Equalisation 12.6 Chapter 6: Joint source and channel coding 12.7 Chapters 7 – 9: EXIT chart matching 12.8 Chapter 8: GA-aided Design of Irregular VLC Components 12.9 Chapter 9: Joint EXIT Chart Matching of IRVLCs and IRURCs 12.10Chapter 10: Iteratively Decoded VLC Space-Time Coded Modulation 12.11Chapter 11: Iterative Detection of Three-Stage Concatenated IrVLC FFHMFSK 12.12Future work 12.13Closing remarks Appendix A VLC Construction Algorithms A.1 RVLC Construction Algorithm A A.2 RVLC Construction Algorithm B A.3 Greedy Algorithm (GA) and Majority Voting Algorithm (MVA) Appendix B SISO VLC Decoder Appendix C APP Channel Equalisation Bibliography Glossary Subject Index Author Index


Best Sellers


Product Details
  • ISBN-13: 9780470665206
  • Publisher: John Wiley & Sons Inc
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 31 mm
  • Weight: 1012 gr
  • ISBN-10: 0470665203
  • Publisher Date: 01 Oct 2010
  • Height: 252 mm
  • No of Pages: 516
  • Returnable: N
  • Sub Title: Regular and EXIT-Chart-Aided Irregular Designs
  • Width: 173 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs
John Wiley & Sons Inc -
Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs
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.

Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs

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

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!