Block Layering Approach in TAST Codes英文文献资料.docVIP

Int. J. Communications, Network and System Sciences, 2010, 3, 788-792 doi:10.4236/ijcns.2010.310105 Published Online October 2010 (http://www.SciRP.org/journal/ijcns) Block Layering Approach in TAST Codes Zahoor Ahmed, Jean Pierre Cances, Vahid Meghdadi Université de Limoges - Ecole Nationale Supérieure dIngénieurs de Limoges (ENSIL) XLIM-Dept. C2S2, UMR CNRS 6172 16, Rue Atlantis Parc ESTER-BP 6804-87068 Limoges cedex, France E-mail: zahoor.ahmed@ensil.unilim.fr, cances@ensil.unilim.fr, meghdadi@ensil.unilim.fr Received July 26, 2010; revised August 20, 2010; accepted September 21, 2010 Abstract Threaded Algebraic Space Time (TAST) codes developed by Gamal et al. is a powerful class of space time codes in which different layers are combined and separated by appropriate Diophantine number? . In this paper we introduce a technique of block layering in TAST codes, in which a series of layers (we call it Block layers) has more than one transmit antenna at the same time instant. As a result we use fewer layers (Dio- phantine numbers) for the four transmit antennas scheme, which enhances the coding gain of our proposed scheme. In each block layer we incorporate Alamouti’s transmit diversity scheme which decreases the de- coding complexity. The proposed code achieves a normalized rate of 2 symbol/s. Simulation result shows that this type of codes outperforms TAST codes in certain scenarios. Keywords: TAST Code, Block Layer, Space Time Coding 1. Introduction known as Threaded Space Time (TST) codes. In this ar- chitecture, independent codes streams are distributed throughout the transmission resource array in different threads. Of course the efficient separation of individual layers from one another was the primary objectives in the design of such codes. The main draw back of this type of code is the complexity of ML decoder which rises expo- nentially with number of transmit antennas. Threaded Algebraic codes [5] bas