Performance analysis of MIMO-SESS with Alamouti scheme over Rayleigh fading channels

Las unidades fraseológicas han estado presentes en los repertorios desde los comienzos de la lexicografía. Y no solamente en los diccionarios generales, sino también en las catalogaciones especializadas, tanto de naturaleza monolingüe como bilingüe. No obstante, siempre ha existido dificultad terminológica para la categorización de los diferentes fenómenos del discurso repetido. Si bien esto no ha sido un inconveniente para que se hayan publicado numerosas compilaciones, sobre todo de refranes en un principio, ya que en la actualidad, fundamentalmente, gracias al auge de los estudios teóricos sobre fraseología, han proliferado otras obras (algunas aplicadas a la glosodidáctica, dada su importancia hoy en día) en las que se da cabida con mayor frecuencia a enunciados de valor específico y a locuciones; en unas ocasiones, ahondando en el origen que les dio entidad y, en otras, estableciendo etiquetados precisos que hasta el momento solían estar ausentes, pero con la finalidad, al fin y al cabo, de desentrañar el sentido, dada la escasa deducibilidad que presentan estas secuencias fijadas por la simple suma de sus elementos constitutivos. Un análisis de estos repertorios a través de los siglos, es, por tanto, el objetivo de este trabajo.Since the beginning of lexicography, phraseological units have been included in repertoires; not only in general dictionaries, but also in monolingual and bilingual specialized catalogues. However, there have always been terminological difficulties for classifying various phenomena of repeated speech. Although this has not been inconvenient for publishing many compilations of sayings, especially at the beginning, because nowadays they frequently include utterances with precise value and idioms, mainly due to the rise of theoretical studies on phraseology (some applied to ASL Linguistics, given its importance today). In them, sometimes, the origin of the phraseological unit is included and, in others, accurate labels that were absent before are determined in order, finally and ultimately, to unravel the meaning, given the reduced deductibility that these sequences present from the simple sum of their constituent elements. The objective of this work is, therefore, an analysis of these repertories throughout the centuries

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. 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. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. 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. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Novel precoded relay-assisted algorithm for cellular systems

Cooperative schemes are promising solutions for cellular wireless systems to improve system fairness, extend coverage and increase capacity. 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. A data precoded relay-assisted scheme is proposed for a system cooperating with 2 relays, each equipped with either a single antenna or 2-antenna array. However, because of the half-duplex constraint at the relays, relaying-assisted transmission would require the use of a higher order constellation than in the case when a continuous link is available from the BS to the UT. This would imply a penalty in the power efficiency. The simple precoding scheme proposed exploits the relation between QPSK and 16-QAM, by alternately transmitting through the 2 relays, achieving full diversity, while significantly reducing power penalty. Analysis of the pairwise error probability of the proposed algorithm with a single antenna in each relay is derived and confirmed with numerical results. We show the performance improvements of the precoded scheme, relatively to equivalent distributed SFBC scheme employing 16-QAM, for several channel quality scenarios. Copyright © 2010 Sara Teodoro, et al.European project CODIVPortuguese project CADWINPortuguese project AGILEFC

Data-precoded algorithm for multiple-relay-assisted systems

A data-precoded relay-assisted (RA) scheme is proposed for a system cooperating with multiple relay nodes (RNs), each equipped with either a single-antenna or a two-antenna array. The classical RA systems using distributed space-time/frequency coding algorithms, because of the half-duplex constraint at the relays, require the use of a higher order constellation than in the case of a continuous link transmission from the base station to the user terminal. This implies a penalty in the power efficiency. The proposed precoding algorithm exploits the relation between QPSK and 4 L -QAM, by alternately transmitting through L relays, achieving full diversity, while significantly reducing power penalty. This algorithm explores the situations where a direct path (DP) is not available or has poor quality, and it is a promising solution to extend coverage or increase system capacity. We present the analytical derivation of the gain obtained with the data-precoded algorithm in comparison with distributed space-frequency block code (SFBC) ones. Furthermore, analysis of the pairwise error probability of the proposed algorithm is derived and confirmed with numerical results. We evaluate the performance of the proposed scheme and compare it relatively to the equivalent distributed SFBC scheme employing 16-QAM and non-cooperative schemes, for several link quality scenarios and scheme configurations, highlighting the advantages of the proposed scheme

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547