Biglieri, EzioHong, YiViterbo, EmanueleUniversitat Pompeu Fabra2013-02-272013-02-272009Biglieri E, Hong Y, Viterbo E. On fast-decodable space-time block codes. IEEE Trans. Inf. Theory. 2009; 55(2): 524-530. DOI 10.1109/TIT.2008.20098170018-9448http://hdl.handle.net/10230/20431We focus on full-rate, fast-decodable space–time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.application/pdfeng© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works./nThe final published article can be found at http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4777653Comunicació sense fil, Sistemes deSistemes MIMOinfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1109/TIT.2008.2009817Alamouti codeDecoding complexityMultiple-input multiple-output (MIMO)Quasi-orthogonal space-time block codes (STBCs)Sphere decoderinfo:eu-repo/semantics/openAccess