82 research outputs found
Overview of Constrained PARAFAC Models
In this paper, we present an overview of constrained PARAFAC models where the
constraints model linear dependencies among columns of the factor matrices of
the tensor decomposition, or alternatively, the pattern of interactions between
different modes of the tensor which are captured by the equivalent core tensor.
Some tensor prerequisites with a particular emphasis on mode combination using
Kronecker products of canonical vectors that makes easier matricization
operations, are first introduced. This Kronecker product based approach is also
formulated in terms of the index notation, which provides an original and
concise formalism for both matricizing tensors and writing tensor models. Then,
after a brief reminder of PARAFAC and Tucker models, two families of
constrained tensor models, the co-called PARALIND/CONFAC and PARATUCK models,
are described in a unified framework, for order tensors. New tensor
models, called nested Tucker models and block PARALIND/CONFAC models, are also
introduced. A link between PARATUCK models and constrained PARAFAC models is
then established. Finally, new uniqueness properties of PARATUCK models are
deduced from sufficient conditions for essential uniqueness of their associated
constrained PARAFAC models
Detection of channel variations to improve channel estimation methods
“The final publication is available at Springer via http://dx.doi.org/[10.1007/s00034-014-9767-8]”[Abstract] In current digital communication systems, channel information is typically
acquired by supervised approaches that use pilot symbols included in the transmit
frames. Given that pilot symbols do not convey user data, they penalize throughput
spectral efficiency, and transmit energy consumption of the system. Unsupervised
channel estimation algorithms could be used to mitigate the aforementioned drawbacks
although they present higher computational complexity than that offered by
supervised ones. This paper proposes a simple decision method suitable for slowly
varying channels to determine whether the channel has suffered a significant variation,
which requires to estimate the matrix of the recently changed channel. Otherwise, a
previous estimate is used to recover the transmitted symbols. The main advantage of
this method is that the decision criterion is only based on information acquired during
the time frame synchronization, which is carried out at the receiver. We show that the
proposed criterion provides a considerable improvement of computational complexity
for both supervised and unsupervised methods, without incurring in a penalization in
terms of symbol error ratio. Specifically, we consider systems that make use of the popular
Alamouti code. Performance evaluation is accomplished by means of simulated
channels as well as making use of indoor wireless channels measured using a testbed
Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases
Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems
Blind channel identification/equalization with applications in wireless communications
Ph.DDOCTOR OF PHILOSOPH
Blind source separation for interference cancellation in CDMA systems
Communication is the science of "reliable" transfer of information between two parties, in the sense that the information reaches the intended party with as few errors as possible. Modern wireless systems have many interfering sources that hinder reliable communication. The performance of receivers severely deteriorates in the presence of unknown or unaccounted interference. The goal of a receiver is then to combat these sources of interference in a robust manner while trying to optimize the trade-off between gain and computational complexity.
Conventional methods mitigate these sources of interference by taking into account all available information and at times seeking additional information e.g., channel characteristics, direction of arrival, etc. This usually costs bandwidth. This thesis examines the issue of developing mitigating algorithms that utilize as little as possible or no prior information about the nature of the interference. These methods are either semi-blind, in the former case, or blind in the latter case.
Blind source separation (BSS) involves solving a source separation problem with very little prior information. A popular framework for solving the BSS problem is independent component analysis (ICA). This thesis combines techniques of ICA with conventional signal detection to cancel out unaccounted sources of interference. Combining an ICA element to standard techniques enables a robust and computationally efficient structure. This thesis proposes switching techniques based on BSS/ICA effectively to combat interference. Additionally, a structure based on a generalized framework termed as denoising source separation (DSS) is presented. In cases where more information is known about the nature of interference, it is natural to incorporate this knowledge in the separation process, so finally this thesis looks at the issue of using some prior knowledge in these techniques. In the simple case, the advantage of using priors should at least lead to faster algorithms.reviewe
New Negentropy Optimization Schemes for Blind Signal Extraction of Complex Valued Sources
Blind signal extraction, a hot issue in the field of communication signal processing, aims to retrieve the sources through the optimization of contrast functions. Many contrasts based on higher-order statistics such as kurtosis, usually behave sensitive to outliers. Thus, to achieve robust results, nonlinear functions are utilized as contrasts to approximate the negentropy criterion, which is also a classical metric for non-Gaussianity. However, existing methods generally have a high computational cost, hence leading us to address the problem of efficient optimization of contrast function. More precisely, we design a novel “reference-based” contrast function based on negentropy approximations, and then propose a new family of algorithms (Alg.1 and Alg.2) to maximize it. Simulations confirm the convergence of our method to a separating solution, which is also analyzed in theory. We also validate the theoretic complexity analysis that Alg.2 has a much lower computational cost than Alg.1 and existing optimization methods based on negentropy criterion. Finally, experiments for the separation of single sideband signals illustrate that our method has good prospects in real-world applications
Robust pole placement using firefly algorithm
In this paper, the new automatic tool that is based on the firefly algorithm whose purpose is optimization of pole location in the control of state feedback has been presented. The aim is satisfying specifications of performance like settling and rise time, steady state as well as overshoot error. Utilization of Firefly algorithm has demonstrated the benefits of controllers based on this kind of time domain over controllers based on the frequency domain like Proportional-Integral Derivative (PID). The presented method is more particular for the multi-input multi-output (MIMO) systems that have substantial state numbers. The simulation results indicated that the proposed method had superior performance in providing solution to the problems that involved stabilization of helicopter under the Rationalized Model of helicopter/ Moreover, it demonstrates the Firefly algorithm effectiveness with regards to, the state observer design and feedback controller and auto-tuning
Second-order parameter estimation
This work provides a general framework for the design of second-order blind estimators without adopting any
approximation about the observation statistics or the a priori
distribution of the parameters. The proposed solution is obtained
minimizing the estimator variance subject to some constraints on
the estimator bias. The resulting optimal estimator is found to
depend on the observation fourth-order moments that can be calculated
analytically from the known signal model. Unfortunately,
in most cases, the performance of this estimator is severely limited
by the residual bias inherent to nonlinear estimation problems.
To overcome this limitation, the second-order minimum variance
unbiased estimator is deduced from the general solution by assuming
accurate prior information on the vector of parameters.
This small-error approximation is adopted to design iterative
estimators or trackers. It is shown that the associated variance
constitutes the lower bound for the variance of any unbiased
estimator based on the sample covariance matrix.
The paper formulation is then applied to track the angle-of-arrival
(AoA) of multiple digitally-modulated sources by means of
a uniform linear array. The optimal second-order tracker is compared
with the classical maximum likelihood (ML) blind methods
that are shown to be quadratic in the observed data as well. Simulations
have confirmed that the discrete nature of the transmitted
symbols can be exploited to improve considerably the discrimination
of near sources in medium-to-high SNR scenarios.Peer Reviewe
- …