1,006 research outputs found
On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes
This paper concerns the maximum-likelihood channel estimation for MIMO
systems with orthogonal space-time block codes when the finite alphabet
constraint of the signal constellation is relaxed. We study the channel
coefficients estimation subspace generated by this method. We provide an
algebraic characterisation of this subspace which turns the optimization
problem into a purely algebraic one and more importantly, leads to several
interesting analytical proofs. We prove that with probability one, the
dimension of the estimation subspace for the channel coefficients is
deterministic and it decreases by increasing the number of receive antennas up
to a certain critical number of receive antennas, after which the dimension
remains constant. In fact, we show that beyond this critical number of receive
antennas, the estimation subspace for the channel coefficients is isometric to
a fixed deterministic invariant space which can be easily computed for every
specific OSTB code
A Study on Clustering for Clustering Based Image De-Noising
In this paper, the problem of de-noising of an image contaminated with
Additive White Gaussian Noise (AWGN) is studied. This subject is an open
problem in signal processing for more than 50 years. Local methods suggested in
recent years, have obtained better results than global methods. However by more
intelligent training in such a way that first, important data is more effective
for training, second, clustering in such way that training blocks lie in
low-rank subspaces, we can design a dictionary applicable for image de-noising
and obtain results near the state of the art local methods. In the present
paper, we suggest a method based on global clustering of image constructing
blocks. As the type of clustering plays an important role in clustering-based
de-noising methods, we address two questions about the clustering. The first,
which parts of the data should be considered for clustering? and the second,
what data clustering method is suitable for de-noising.? Then clustering is
exploited to learn an over complete dictionary. By obtaining sparse
decomposition of the noisy image blocks in terms of the dictionary atoms, the
de-noised version is achieved. In addition to our framework, 7 popular
dictionary learning methods are simulated and compared. The results are
compared based on two major factors: (1) de-noising performance and (2)
execution time. Experimental results show that our dictionary learning
framework outperforms its competitors in terms of both factors.Comment: 9 pages, 8 figures, Journal of Information Systems and
Telecommunications (JIST
- …