Buy The Design and Analysis of Successive Decoding for Channels with Memory.
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Science, Technology & Agriculture > Technology: general issues > The Design and Analysis of Successive Decoding for Channels with Memory.
The Design and Analysis of Successive Decoding for Channels with Memory.

The Design and Analysis of Successive Decoding for Channels with Memory.


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Many communication systems have to cope with channels with unknown and time-varying state, including fading, inter-symbol interference, and more general finite-state Markov channels. This work proposes a novel successive decoding paradigm, or more specifically, a time-multiplexed transmission of multiple codes with multi-staged reception, to address the two fundamental aspects of these channels: the estimation of achievable information rate and the design of a practical coding system. The first part of this work shows that successive decoding under a deep rectangular interleaver essentially decomposes the original channel into a set of asymptotic memoryless subchannels with semi-infinite preceding training symbols. The achievable information rate of the original channel under a given input distribution can be efficiently computed from this set. Furthermore, the conventional coding system that separates estimation from decoding can operate on these memoryless channels without loss of mutual information. These results allow us to characterize accurately the binary-input capacity of correlated fading channels and to operate within 1.1 dB to the binary-input capacity using AWGN channel optimized LDPC codes. The second part of this work deals with the design of more practical successive decoding with a small number of levels. The main idea is to incorporate an irregular interleaving pattern and when necessary iterative estimation decoding within each level. These techniques provide a more flexible configuration of successive decoding for balancing the performance and the delay. The analysis of the achievable rate and the extrinsic information transfer (EXIT) charts are proposed for code rate allocation and for the efficient optimization of interleavers. Both the optimal random interleaver and a good construction of the deterministic interleaver are numerically shown to have performance very close to its binary-input capacity with a small number of levels.


Best Sellers


Product Details
  • ISBN-13: 9781243751478
  • Publisher: Proquest, Umi Dissertation Publishing
  • Publisher Imprint: Proquest, Umi Dissertation Publishing
  • Height: 254 mm
  • Weight: 313 gr
  • ISBN-10: 1243751479
  • Publisher Date: 01 Sep 2011
  • Binding: Paperback
  • Spine Width: 10 mm
  • Width: 203 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
The Design and Analysis of Successive Decoding for Channels with Memory.
Proquest, Umi Dissertation Publishing -
The Design and Analysis of Successive Decoding for Channels with Memory.
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.

The Design and Analysis of Successive Decoding for Channels with Memory.

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


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!