14 research outputs found
Single-Symbol-Decodable Differential Space-Time Modulation Based on QO-STBC
We present a novel differential space-time modulation (DSTM) scheme that is
single-symbol decodable and can provide full transmit diversity. It is the
first known singlesymbol- decodable DSTM scheme not based on Orthogonal STBC
(O-STBC), and it is constructed based on the recently proposed
Minimum-Decoding-Complexity Quasi-Orthogonal Space-Time Block Code
(MDC-QOSTBC). We derive the code design criteria and present systematic
methodology to find the solution sets. The proposed DSTM scheme can provide
higher code rate than DSTM schemes based on O-STBC. Its decoding complexity is
also considerably lower than DSTM schemes based on Sp(2) and
double-symbol-decodable QOSTBC, with negligible or slight trade-off in decoding
error probability performance.Comment: Accepted for IEEE Trans Wireless Comm
Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs
The problem of designing high rate, full diversity noncoherent space-time
block codes (STBCs) with low encoding and decoding complexity is addressed.
First, the notion of -group encodable and -group decodable linear STBCs
is introduced. Then for a known class of rate-1 linear designs, an explicit
construction of fully-diverse signal sets that lead to four-group encodable and
four-group decodable differential scaled unitary STBCs for any power of two
number of antennas is provided. Previous works on differential STBCs either
sacrifice decoding complexity for higher rate or sacrifice rate for lower
decoding complexity.Comment: 5 pages, 2 figures. To appear in Proceedings of IEEE ISIT 2007, Nice,
Franc
Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks
The differential encoding/decoding setup introduced by Kiran et al, Oggier et
al and Jing et al for wireless relay networks that use codebooks consisting of
unitary matrices is extended to allow codebooks consisting of scaled unitary
matrices. For such codebooks to be used in the Jing-Hassibi protocol for
cooperative diversity, the conditions that need to be satisfied by the relay
matrices and the codebook are identified. A class of previously known rate one,
full diversity, four-group encodable and four-group decodable Differential
Space-Time Codes (DSTCs) is proposed for use as Distributed DSTCs (DDSTCs) in
the proposed set up. To the best of our knowledge, this is the first known low
decoding complexity DDSTC scheme for cooperative wireless networks.Comment: 5 pages, no figures. To appear in Proceedings of IEEE ISIT 2007,
Nice, Franc
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
The differential encoding/decoding setup introduced by Kiran et al,
Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use
codebooks consisting of unitary matrices is extended to allow codebooks
consisting of scaled unitary matrices. For such codebooks to be usable in the
Jing-Hassibi protocol for cooperative diversity, the conditions involving the
relay matrices and the codebook that need to be satisfied are identified. Using
the algebraic framework of extended Clifford algebras, a new class of
Distributed Differential Space-Time Codes satisfying these conditions for power
of two number of relays and also achieving full cooperative diversity with a
low complexity sub-optimal receiver is proposed. Simulation results indicate
that the proposed codes outperform both the cyclic codes as well as the
circulant codes. Furthermore, these codes can also be applied as Differential
Space-Time codes for non-coherent communication in classical point to point
multiple antenna systems.Comment: To appear in IEEE Transactions on Wireless Communications. 10 pages,
5 figure
Transmit Diversity Assisted Space Shift Keying for Colocated and Distributed/Cooperative MIMO Elements
Space Shift Keying (SSK) modulation is a recently proposed MIMO technique, which activates only a single transmit antenna during each time slot and uses the specific index of the activated transmit antenna to implicitly convey information. Activating a single antenna is beneficial in terms of eliminating the inter-channel interference, and mitigates the peak-to-mean power ratio, while avoiding the need for synchronisation among transmit antennas. However, this benefit is achieved at a sacrifice, since the transmit diversity gain potential of the multiple transmit antennas is not fully exploited in existing SSK assisted systems. Furthermore, a high SSK throughput requires the transmitter to employ a high number of transmit antennas, which is not always practical. Hence, we propose four algorithms, namely open-loop Space Time Space Shift Keying (ST-SSK), closed-loop feedback-aided phase rotation, feedback-aided power allocation, and cooperative ST-SSK, for the sake of achieving a diversity gain. The performance improvements of the proposed schemes are demonstrated by Monte-Carlo simulations for spatially independent Rayleigh fading channels. Their robustness against channel estimation errors is also considered. We advocate the proposed ST-SSK techniques, which are capable of achieving a transmit diversity gain of about 10 dB at a BER of 10-5, at a cost of imposing a moderate throughput loss dedicated to a modest feedback overhead. Furthermore, our proposed ST-SSK scheme lends itself to efficient communication, because the deleterious effects of deep shadow fading no longer impose spatial correlation on the signals received by the antennas, which cannot be readily avoided by co-located antenna elements
Codificação distribuída em sistemas com diversidade cooperativa
Doutoramento em Engenharia ElectrotécnicaO presente trabalho propõe-se a divulgar as mais significativas técnicas de esquemas cooperativos, de forma a ultrapassar alguns dos problemas dos sistemas móveis sem fios da próxima geração, estendendo a área de cobertura destes sistemas, assim como a sua capacidade e fiabilidade. O estudo de diversos esquemas cooperativos é efetuado em termos de capacidade e de taxa de erros, fazendo variar o número de relays e de antenas em cada elemento do sistema. Diversos algoritmos com aplicação em sistemas cooperativos são desenvolvidos e propostos ao longo desta tese, como códigos espaço-frequência aplicados de forma distribuída nos relays, para sistemas baseados na tecnologia OFDM e sob diversos cenários próximos da realidade. Os sistemas cooperativos são particularmente úteis em situações em que o caminho direto entre dois terminais não está acessível ou tem uma fraca qualidade de transmissão. Tendo este aspeto em consideração, e pretendendo ter a máxima eficiência espetral e máxima diversidade, um algoritmo com precodificação é também proposto para múltiplos relays, cada um equipado com uma ou duas antenas. A formulação matemática associada aos algoritmos propostos é apresentada, assim como a derivação da probabilidade de erro teórica. O desempenho dos sistemas assistidos por relays usando os algoritmos propostos é comparado em relação a outros esquemas cooperativos equivalentes e a esquemas não-cooperativos, considerando cenários com diferentes qualidades de canal, daí advindo importantes conclusões em relação a estes sistemas.Cooperative schemes are promising solutions for cellular wireless networks aiming to improve system fairness, extend coverage and increase capacity. Measurements of these system performances are made in terms of BER and capacity for different configurations, by varying the number of relays and of antennas equipping each node. In this work we propose and evaluate distributed space-frequency codes applied to cooperative systems in a distributed way, with application in OFDM systems and considering realistic scenarios. Moreover, the use of relays is of significant interest to allow radio access in situations where a direct path is not available or has poor quality. Thus, a data precoded relay-assisted scheme is also proposed for a system cooperating with multiple relays, each equipped with either a single antenna or two-antenna array. Mathematical formulation of the proposed algorithms is derived as well as the pairwise error probability. We further present the performances of the proposed algorithms apllied in relay-assisted schemes, and compare them with equivalent cooperative and non-cooperative schemes, for several channel quality scenarios, through which important conclusions are achieved.FCT/FS