1,039 research outputs found
Blind equalization of DS-CDMA and MC-CDMA modulations in time-variant frequency selective channels
The paper addresses the blind equalization problem of spread spectrum modulations in the presence of fast time-variant frequency-selective channels. The basic assumption of the paper is that the channel response exhibits fast changes. A second goal of the paper is to force the definition of a universal CDMA blind equalization scheme that is capable of performing for DS-CDMA or multi-carrier CDMA signal modulations without any modification in the equalizer. The formulation of the equalization scheme allows the consideration of temporal and/or spatial diversity front-end receivers. The result is a high-performance system that uses a deterministic blind criterion to equalize the channel, avoiding the use of stochastic methods. The proposed technique performs direct channel equalization without previous channel estimation. Although the proposed equalizer in this work performs equalization at chip rate, this paper suggests a solution to achieve equalization at lower rates.Peer ReviewedPostprint (published version
The MIMO Iterative Waterfilling Algorithm
This paper considers the non-cooperative maximization of mutual information
in the vector Gaussian interference channel in a fully distributed fashion via
game theory. This problem has been widely studied in a number of works during
the past decade for frequency-selective channels, and recently for the more
general MIMO case, for which the state-of-the art results are valid only for
nonsingular square channel matrices. Surprisingly, these results do not hold
true when the channel matrices are rectangular and/or rank deficient matrices.
The goal of this paper is to provide a complete characterization of the MIMO
game for arbitrary channel matrices, in terms of conditions guaranteeing both
the uniqueness of the Nash equilibrium and the convergence of asynchronous
distributed iterative waterfilling algorithms. Our analysis hinges on new
technical intermediate results, such as a new expression for the MIMO
waterfilling projection valid (also) for singular matrices, a mean-value
theorem for complex matrix-valued functions, and a general contraction theorem
for the multiuser MIMO watefilling mapping valid for arbitrary channel
matrices. The quite surprising result is that uniqueness/convergence conditions
in the case of tall (possibly singular) channel matrices are more restrictive
than those required in the case of (full rank) fat channel matrices. We also
propose a modified game and algorithm with milder conditions for the uniqueness
of the equilibrium and convergence, and virtually the same performance (in
terms of Nash equilibria) of the original game.Comment: IEEE Transactions on Signal Processing (accepted
Constructive Multiuser Interference in Symbol Level Precoding for the MISO Downlink Channel
This paper investigates the problem of interference among the simultaneous
multiuser transmissions in the downlink of multiple antennas systems. Using
symbol level precoding, a new approach towards the multiuser interference is
discussed along this paper. The concept of exploiting the interference between
the spatial multiuser transmissions by jointly utilizing the data information
(DI) and channel state information (CSI), in order to design symbol-level
precoders, is proposed. In this direction, the interference among the data
streams is transformed under certain conditions to useful signal that can
improve the signal to interference noise ratio (SINR) of the downlink
transmissions. We propose a maximum ratio transmission (MRT) based algorithm
that jointly exploits DI and CSI to glean the benefits from constructive
multiuser interference. Subsequently, a relation between the constructive
interference downlink transmission and physical layer multicasting is
established. In this context, novel constructive interference precoding
techniques that tackle the transmit power minimization (min power) with
individual SINR constraints at each user's receivers is proposed. Furthermore,
fairness through maximizing the weighted minimum SINR (max min SINR) of the
users is addressed by finding the link between the min power and max min SINR
problems. Moreover, heuristic precoding techniques are proposed to tackle the
weighted sum rate problem. Finally, extensive numerical results show that the
proposed schemes outperform other state of the art techniques.Comment: Submitted to IEEE Transactions on Signal Processin
Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria
In this two-parts paper we propose a decentralized strategy, based on a
game-theoretic formulation, to find out the optimal precoding/multiplexing
matrices for a multipoint-to-multipoint communication system composed of a set
of wideband links sharing the same physical resources, i.e., time and
bandwidth. We assume, as optimality criterion, the achievement of a Nash
equilibrium and consider two alternative optimization problems: 1) the
competitive maximization of mutual information on each link, given constraints
on the transmit power and on the spectral mask imposed by the radio spectrum
regulatory bodies; and 2) the competitive maximization of the transmission
rate, using finite order constellations, under the same constraints as above,
plus a constraint on the average error probability. In Part I of the paper, we
start by showing that the solution set of both noncooperative games is always
nonempty and contains only pure strategies. Then, we prove that the optimal
precoding/multiplexing scheme for both games leads to a channel diagonalizing
structure, so that both matrix-valued problems can be recast in a simpler
unified vector power control game, with no performance penalty. Thus, we study
this simpler game and derive sufficient conditions ensuring the uniqueness of
the Nash equilibrium. Interestingly, although derived under stronger
constraints, incorporating for example spectral mask constraints, our
uniqueness conditions have broader validity than previously known conditions.
Finally, we assess the goodness of the proposed decentralized strategy by
comparing its performance with the performance of a Pareto-optimal centralized
scheme. To reach the Nash equilibria of the game, in Part II, we propose
alternative distributed algorithms, along with their convergence conditions.Comment: Paper submitted to IEEE Transactions on Signal Processing, September
22, 2005. Revised March 14, 2007. Accepted June 5, 2007. To be published on
IEEE Transactions on Signal Processing, 2007. To appear on IEEE Transactions
on Signal Processing, 200
Frequency domain equalization for single and multiuser generalized spatial modulation systems in time dispersive channels
In this letter, a low-complexity iterative detector with frequency domain equalization is proposed for generalized spatial modulation (GSM) aided single carrier (SC) transmissions operating in frequency selective channels. The detector comprises three main separate tasks namely, multiple-input multiple-output (MIMO) equalization, active antenna detection per user and symbol wise demodulation. This approach makes the detector suitable for a broad range of MIMO configurations, which includes single-user and multiuser scenarios, as well as arbitrary signal constellations. Simulation results show that the receiver can cope with the intersymbol interference induced by severe time dispersive channels and operate in difficult underdetermined scenarios.info:eu-repo/semantics/acceptedVersio
- …