3GPP LTE and LTE-Advanced

Editorial introductòria del número de la revista, en la qual s'exposa el tema del nou estàndard de mòbil, anomenatLong-TermEvolution (LTE),també referenciat com Evolved UMTS Terrestrial Radio Access(E-UTRA), que s'està definint com el substitut del sistema UMTSde tercera generació. LTE-Advanced, al seu torn, es refereix a la versió més avançada de LTE.

On high-rate full-diversity 2x2 space-time codes with low-complexity optimum detection

The 2×2 MIMO profiles included in Mobile WiMAX specifications are Alamouti’s space-time code (STC) fortransmit diversity and spatial multiplexing (SM). The former hasfull diversity and the latter has full rate, but neither of them hasboth of these desired features. An alternative 2×2 STC, which is both full rate and full diversity, is the Golden code. It is the best known 2×2 STC, but it has a high decoding complexity. Recently, the attention was turned to the decoder complexity, this issue wasincluded in the STC design criteria, and different STCs wereproposed. In this paper, we first present a full-rate full-diversity2×2 STC design leading to substantially lower complexity ofthe optimum detector compared to the Golden code with only a slight performance loss. We provide the general optimized form of this STC and show that this scheme achieves the diversitymultiplexing frontier for square QAM signal constellations. Then, we present a variant of the proposed STC, which provides a further decrease in the detection complexity with a rate reduction of 25% and show that this provides an interesting trade-off between the Alamouti scheme and SM.

Low-density parity-check codes for nonergodic block-fading channels

We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not performwell under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Outage probability analysis for MRC in η-μ fading channels with co-channel interference

Exact closed-form expressions are obtained for the outage probability of maximal ratio combining in η-μ fadingchannels with antenna correlation and co-channel interference. The scenario considered in this work assumes the joint presence of background white Gaussian noise and independent Rayleigh-faded interferers with arbitrary powers. Outage probability results are obtained through an appropriate generalization of the moment-generating function of theη-μ fading distribution, for which new closed-form expressions are provided.

Mutual information of IID complex Gaussian signals on block Rayleigh-faded channels

We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.

Per-antenna rate and power control for MIMO layered architectures in the low- and high-power regimes

In a MIMO layered architecture, several codewordsare transmitted from a multiplicity of antennas. Although thespectral efficiency is maximized if the rates of these codewordsare separately controlled, the feedback rate within the linkadaptation loop is reduced if they are constrained to be identical.This poses a direct tradeoff between performance andfeedback overhead. This paper provides analytical expressionsthat quantify the difference in spectral efficiency between bothapproaches for arbitrary numbers of antennas. Specifically, thecharacterization takes place in the realm of the low- and highpowerregimes via expansions that are shown to have a widerange of validity.In addition, the possibility of adjusting the transmit powerof each codeword individually is considered as an alternative tothe separate control of their rates. Power allocation, however,turns out to be inferior to rate control within the context of thisproblem.

Mutual Information of IID complex Gaussian signals on block Rayleigh-faded channels

We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian signal on a block Rayleigh-faded channel without side information at the receiver. The method accommodates both scalar and MIMO (multiple-input multiple-output) settings. Operationally, this mutual information represents the highest spectral efficiency that can be attained using Gaussiancodebooks. Examples are provided that illustrate the loss in spectral efficiency caused by fast fading and how that loss is amplified when multiple transmit antennas are used. These examples are further enriched by comparisons with the channel capacity under perfect channel-state information at the receiver, and with the spectral efficiency attained by pilot-based transmission.

Spectral efficiency in reference-signal-assisted low-power wireless communication

Expressions relating spectral efficiency, power and Doppler spectrum are derived for low-power Rayleighfaded wireless channels with proper complex signaling. Noside information on the state of the channel is assumed at the receiver. Rather, periodic reference signals are postulated inaccordance with the functioning of most wireless systems. In contrast with most previous studies, which relied on block-fading channel models, a continuous-fading model is adopted. This embeds the Doppler spectrum directly in thederived expressions thereby imbuing them with practical significance.

Capacity to within one bit of a class of Gaussian multicast channels with interference

This paper studies the fundamental operational limits of a class of Gaussian multicast channels with an interference setting. In particular, the paper considers two base stations multicasting separate messages to distinct sets of users. In the presence of channel state information at the transmitters and at the respective receivers, the capacity region of the Gaussian multicast channel with interference is characterized to within one bit. At the crux of this result is an extension to the multicast channel with interference of the Han-Kobayashi or the Chong-Motani-Garg achievable region for the interference channel.

Some applications of FISST to wireless communications

This paper aims at illustrating some applications of Finite Random Set (FRS) theory to the design and analysis of wireless communication receivers, and at pointing out similarities and differences between this scenario and that pertaining to multi-target tracking, where the use of FRS has been traditionally advocated. Two case studies are considered, l.e., multiuser detection in a dynamic environment, and multicarrier (OFDM) transmission on a frequency-selective channel. Detector designand performance evaluation are discussed, along with the advantages of importing FRS-based estimation techniques to the context of wireless communications.

Sequential estimation of time-varying multipath channel for MIMO-OFDM systems

In this paper, we introduce a pilot-aided multipath channel estimator for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. Typical estimation algorithms assume the number of multipath components and delays to be known and constant, while theiramplitudes may vary in time. In this work, we focus on the more realistic assumption that also the number of channel taps is unknown and time-varying. The estimation problem arising from this assumption is solved using Random Set Theory (RST), which is a probability theory of finite sets. Due to the lack of a closed form of the optimal filter, a Rao-Blackwellized Particle Filter (RBPF) implementation of the channel estimator is derived. Simulation results demonstrate the estimator effectiveness.

Large-system analysis of a CDMA dynamic channel under a Markovian input process

We study the minimum mean square error (MMSE) and the multiuser efficiency η of large dynamic multiple access communication systems in which optimal multiuser detection is performed at the receiver as the number and the identities of active users is allowed to change at each transmission time. The system dynamics are ruled by a Markov model describing the evolution of the channel occupancy and a large-system analysis is performed when the number of observations grow large. Starting on the equivalent scalar channel and the fixed-point equation tying multiuser efficiency and MMSE, we extend it to the case of a dynamic channel, and derive lower and upper bounds for the MMSE (and, thus, for η as well) holding true in the limit of large signal–to–noise ratios and increasingly large observation time T.

Marco metodológico para la definición de un perfil profesional en educación superior = Methodological framework for the definition of a professional profile in higher education

En el marco del Espacio Europeo de Educación Superior 1 se inscriben innumerables acciones que están desarrollando todas las universidades europeas con la intención de llegar al 2010 con un bagaje lo suficientemente importante como para afrontar este cambio con entereza y sobretodo conservando (o incrementando) la calidad de los procesos de enseñanza- aprendizaje que hasta el momento han predominado. Dentro de este amplio proceso de transformación se encuentra el diseño de los nuevos Grados que brinda la oportunidad de replantear los planes de estudios, por tanto, la organización de las asignaturas, estructura de los contenidos, metodologías y sistemas de evaluación. Toda esta reflexión debe girar, a nuestro entender, alrededor de tres núcleos que se encuentran en estado deinterdependencia: los escenarios profesionales, los perfiles profesionales y las competencias que en ellos se inscriben.Para poder plantear los nuevos Grados en coherencia con la era del EEES debe hacerse un análisis minucioso de los perfil profesionales demandados por el mercado de trabajo que, al fin y al cabo será el destino de los profesionales que se forman en nuestras universidades, es por ello, que la tarea de definir el perfil profesional a priori del diseño de los nuevos Grados resulta una máxima para garantizar la calidad de estos. En este trabajo se presenta un ejemplo de metodología a seguir para la definición de un perfil profesional en Educación Superior, concretamente, el del Ingeniero TIC mediante el Análisis Funcional.

Generalized low-density codes with BCH constituents for full-diversity near-outage performance

A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. Aclassical GLD code for ergodic channels (e.g., the AWGN channel,the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more.

Full diversity product codes for block erasure and block fading channels

We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.