Литмир - Электронная Библиотека
Near-Capacity Multi-Functional MIMO Systems
Добавить похожую книгу
Better Than Chocolate
Похожа
Непохожа
War in European History
Похожа
Непохожа
Learning iOS Design
Похожа
Непохожа
Near-Capacity Multi-Functional MIMO Systems
Author:Alamri Osamah (EN)
Language of a book: Английский
Language of an original book: Английский
Publisher: Gardners Books

    Providing an all-encompassing self-contained treatment of Near-Capacity Multi-Functional MIMO Systems , the book starts by categorizing the family of Multiple-Input Multiple-Output (MIMO) schemes as diversity techniques, multiplexing schemes, multiple access arrangements and beam-forming techniques. Sophisticated coherent and low-complexity non-coherent MIMO receivers dispensing with channel estimation are considered in both classic and cooperation-aided scenarios. It is demonstrated that in the presence of correlated shadow-fading, cooperation-assisted systems may be expected to outperform their non-cooperative counterparts. The book contains a 100-page chapter on the unified treatment of all block codes in the context of high-flexibility, cutting-edge irregular Linear Dispersion Codes (LDC), which approach the MIMO-capacity. The majority of the book s solutions are in the optimum sphere-packing frame-work. Sophisticated amalgam of five year s near-capacity MIMO research Detailed examination of wireless landscape, including the fields of channel coding, spacetime coding and turbo detection techniques Novel tool of Extrinsic Information Transfer Charts (EXIT) used to address recent developments Material presented logically, allowing advanced readers to turn directly to any specific chapter of interest One of the only books to cover these subjects, giving equal weighting to each

    Поделиться:
    ]]>Facebook :0]]>  ]]>Twitter :0]]>  ]]>В контакте :0]]>  ]]>Livejournal :0]]>  ]]>Мой мир :0]]>  ]]>Gmail :0]]>  Email :0  ]]>Скачать :0]]>  
    Мой статус книги:
    Чтобы оставить свою оценку и комментарий вам нужно зайти на сайт или зарегистрироваться

    {"b":"380874","o":30}