Reduced Cluster Search ML Decoding for QO-STBC Systems
暂无分享,去创建一个
Taufik Abrão | Fernando Casadevall | Fernando Ciriaco | Bruno A. Angélico | F. Casadevall | F. Ciriaco | T. Abrão | P. Jeszensky | Isaque Suzuki | Paul Jean E. Jeszensky | B. Angélico | I. Suzuki
[1] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[2] Kyungwhoon Cheun,et al. An efficient decoding algorithm for QO-STBCs based on iterative interference cancellation , 2008 .
[3] Dongfeng Yuan,et al. A low complexity decoding scheme for quasi-orthogonal space-time block coding , 2008, 2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop.
[4] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[5] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[6] David J. C. MacKay,et al. Encyclopedia of Sparse Graph Codes , 1999 .
[7] Hamid Jafarkhani,et al. Space-Time Coding - Theory and Practice , 2010 .
[9] Markus Rupp,et al. Efficient Decoding Techniques for LDPC Codes , 2007 .
[10] Siavash M. Alamouti,et al. A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..
[11] Yi Hong,et al. On Fast-Decodable Space-Time Block Codes , 2008 .
[12] Hamid Jafarkhani. A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..
[13] Desmond P. Taylor,et al. Robust high throughput space time block codes using parallel interference cancellation , 2008, IEEE Transactions on Wireless Communications.
[14] Chau Yuen,et al. Quasi-orthogonal STBC with minimum decoding complexity: further results , 2005, IEEE Wireless Communications and Networking Conference, 2005.
[15] Serdar Sezginer,et al. Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.