Non-Linear Detection Algorithms for Mimo Multiplexing Systems
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 > Energy technology and engineering > Electrical engineering > Non-Linear Detection Algorithms for Mimo Multiplexing Systems
Non-Linear Detection Algorithms for Mimo Multiplexing Systems

Non-Linear Detection Algorithms for Mimo Multiplexing Systems


     0     
5
4
3
2
1



Out of Stock


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

This dissertation, "Non-linear Detection Algorithms for MIMO Multiplexing Systems" by Wei, Peng, 彭薇, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled "Non-linear Detection Algorithms for MIMO Multiplexing Systems" Submitted by Peng Wei for the degree of Doctor of Philosophy at The University of Hong Kong in November 2007 The multiple input multiple output (MIMO) technique has attracted a lot of interest due to its potential use in future high speed wireless communications. This thesis focuses on non-linear detection algorithms for MIMO multiplexing systems. The performance of maximum likelihood (ML) detection and successive interference cancellation (SIC) detection are analyzed, and a low-complexity adaptive QR decomposition associated M (QRD-M) algorithm is proposed. A novel method is proposed for the performance analysis of ML detection. In this method, the symbol error probability (SEP) of one transmitted signal is first expressed in terms of the SEPs conditioned on a set of error events corresponding to the other transmitted signals and the probabilities of those error events. By analyzing the post-detection signal to noise ratio (SNR), the conditional SEPs are expressed in closed-form and the SEPs are finally obtained by solving a set of equations. The effects of imperfect channel estimation and power allocation scheme (equal and unequal power allocations) are investigated. The accuracy of the proposed method is demonstrated by Monte-Carlo simulations. It is shown that the analytical results match the simulation ones irrespective of the SNR, which is an advantage over the existing methods where a significant gap generally exists between the analytical and simulation results in the low SNR region. The problem of performance analysis for zero-forcing (ZF) SIC detection is addressed. A method is presented to derive the SEP of the signals detected at each stage. First, the SEPs conditioned on the decision errors at the previous stages are determined in closed-form by analyzing the post-detection SNR and the statistics of the QR decomposed channel matrix. Then, the average SEP at each detection stage is given as the sum of the weighted conditional SEPs. Practical issues including channel estimation errors and the propagation of the decision errors from one detection stage to the next are taken into account. The accuracy of the analytical results is demonstrated by Monte-Carlo simulations. Finally, an adaptive low-complexity QRD-M algorithm is proposed. In the proposed algorithm, the number of candidates for each transmitted signal and the number of surviving paths at each stage are adaptively and independently controlled by an adjustable parameter according to the instantaneous channel conditions and the noise power. The adjustable parameter enables the system designer to compromise between system performance and computational complexity. By Monte-Carlo simulations, it is shown that the proposed algorithm can achieve comparable performance to that of the existing QRD-M algorithms with significantly reduced complexity, especially when modulation with large constellation size is utilized. The number of words: 417 DOI: 10.5353/th_b3955856 Subjects: Demodulation (Electronics) Algorithms MIMO systems Wireless communication systems


Best Sellers


Product Details
  • ISBN-13: 9781361469422
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 100
  • Weight: 254 gr
  • ISBN-10: 1361469420
  • Publisher Date: 27 Jan 2017
  • Binding: Paperback
  • Language: English
  • Spine Width: 5 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Non-Linear Detection Algorithms for Mimo Multiplexing Systems
Open Dissertation Press -
Non-Linear Detection Algorithms for Mimo Multiplexing Systems
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.

Non-Linear Detection Algorithms for Mimo Multiplexing Systems

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!