8,876 research outputs found
Design of optimal correlation filters for hybrid vision systems
Research is underway at the NASA Johnson Space Center on the development of vision systems that recognize objects and estimate their position by processing their images. This is a crucial task in many space applications such as autonomous landing on Mars sites, satellite inspection and repair, and docking of space shuttle and space station. Currently available algorithms and hardware are too slow to be suitable for these tasks. Electronic digital hardware exhibits superior performance in computing and control; however, they take too much time to carry out important signal processing operations such as Fourier transformation of image data and calculation of correlation between two images. Fortunately, because of the inherent parallelism, optical devices can carry out these operations very fast, although they are not quite suitable for computation and control type operations. Hence, investigations are currently being conducted on the development of hybrid vision systems that utilize both optical techniques and digital processing jointly to carry out the object recognition tasks in real time. Algorithms for the design of optimal filters for use in hybrid vision systems were developed. Specifically, an algorithm was developed for the design of real-valued frequency plane correlation filters. Furthermore, research was also conducted on designing correlation filters optimal in the sense of providing maximum signal-to-nose ratio when noise is present in the detectors in the correlation plane. Algorithms were developed for the design of different types of optimal filters: complex filters, real-value filters, phase-only filters, ternary-valued filters, coupled filters. This report presents some of these algorithms in detail along with their derivations
A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden Code's Coding Gain
This paper presents a low-ML-decoding-complexity, full-rate, full-diversity
space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna
multiple-input multiple-output (MIMO) system, with coding gain equal to that of
the best and well known Golden code for any QAM constellation. Recently, two
codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer
and Sari), which enjoy a lower decoding complexity relative to the Golden code,
but have lesser coding gain. The STBC presented in this paper has
lesser decoding complexity for non-square QAM constellations, compared with
that of the Golden code, while having the same decoding complexity for square
QAM constellations. Compared with the Paredes-Gershman-Alkhansari and
Sezginer-Sari codes, the proposed code has the same decoding complexity for
non-rectangular QAM constellations. Simulation results, which compare the
codeword error rate (CER) performance, are presented.Comment: Submitted to IEEE Globecom - 2008. 6 pages, 3 figures, 1 tabl
Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying
Using the spatial modulation approach, where only one transmit antenna is
active at a time, we propose two transmission schemes for two-way relay channel
using physical layer network coding with space time coding using Coordinate
Interleaved Orthogonal Designs (CIOD's). It is shown that using two
uncorrelated transmit antennas at the nodes, but using only one RF transmit
chain and space-time coding across these antennas can give a better performance
without using any extra resources and without increasing the hardware
implementation cost and complexity. In the first transmission scheme, two
antennas are used only at the relay, Adaptive Network Coding (ANC) is employed
at the relay and the relay transmits a CIOD Space Time Block Code (STBC). This
gives a better performance compared to an existing ANC scheme for two-way relay
channel which uses one antenna each at all the three nodes. It is shown that
for this scheme at high SNR the average end-to-end symbol error probability
(SEP) is upper bounded by twice the SEP of a point-to-point fading channel. In
the second transmission scheme, two transmit antennas are used at all the three
nodes, CIOD STBC's are transmitted in multiple access and broadcast phases.
This scheme provides a diversity order of two for the average end-to-end SEP
with an increased decoding complexity of for an arbitrary
signal set and for square QAM signal set.Comment: 9 pages, 7 figure
Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems
This paper (Part of the content of this manuscript has been accepted for
presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low
maximum likelihood (ML) decoding complexity, full-rate and full-diversity
space-time block codes (STBCs), which also offer large coding gain, for the 2
transmit antenna, 2 receive antenna () and the 4 transmit antenna, 2
receive antenna () MIMO systems. Presently, the best known STBC for
the system is the Golden code and that for the system is
the DjABBA code. Following the approach by Biglieri, Hong and Viterbo, a new
STBC is presented in this paper for the system. This code matches
the Golden code in performance and ML-decoding complexity for square QAM
constellations while it has lower ML-decoding complexity with the same
performance for non-rectangular QAM constellations. This code is also shown to
be \emph{information-lossless} and \emph{diversity-multiplexing gain} (DMG)
tradeoff optimal. This design procedure is then extended to the
system and a code, which outperforms the DjABBA code for QAM constellations
with lower ML-decoding complexity, is presented. So far, the Golden code has
been reported to have an ML-decoding complexity of the order of for
square QAM of size . In this paper, a scheme that reduces its ML-decoding
complexity to is presented.Comment: 28 pages, 5 figures, 3 tables, submitted to IEEE Journal of Selected
Topics in Signal Processin
Generalized Silver Codes
For an transmit, receive antenna system (
system), a {\it{full-rate}} space time block code (STBC) transmits complex symbols per channel use. The well known Golden code is an
example of a full-rate, full-diversity STBC for 2 transmit antennas. Its
ML-decoding complexity is of the order of for square -QAM. The
Silver code for 2 transmit antennas has all the desirable properties of the
Golden code except its coding gain, but offers lower ML-decoding complexity of
the order of . Importantly, the slight loss in coding gain is negligible
compared to the advantage it offers in terms of lowering the ML-decoding
complexity. For higher number of transmit antennas, the best known codes are
the Perfect codes, which are full-rate, full-diversity, information lossless
codes (for ) but have a high ML-decoding complexity of the order
of (for , the punctured Perfect codes are
considered). In this paper, a scheme to obtain full-rate STBCs for
transmit antennas and any with reduced ML-decoding complexity of the
order of , is presented. The codes constructed are
also information lossless for , like the Perfect codes and allow
higher mutual information than the comparable punctured Perfect codes for . These codes are referred to as the {\it generalized Silver codes},
since they enjoy the same desirable properties as the comparable Perfect codes
(except possibly the coding gain) with lower ML-decoding complexity, analogous
to the Silver-Golden codes for 2 transmit antennas. Simulation results of the
symbol error rates for 4 and 8 transmit antennas show that the generalized
Silver codes match the punctured Perfect codes in error performance while
offering lower ML-decoding complexity.Comment: Accepted for publication in the IEEE Transactions on Information
Theory. This revised version has 30 pages, 7 figures and Section III has been
completely revise
Distinguished representations, base change, and reducibility for unitary groups
We show the equality of the local Asai L-functions defined via the
Rankin-Selberg method and the Langlands-Shahidi method for a square integrable
representation of GL(n,E). As a consequence we characterise reducibility of
certain induced representations of U(n,n), and the image of the base change map
from U(n) to GL(n,E) in terms of GL(n,F)-distinguishedness.Comment: 13 page
Design of coupled mace filters for optical pattern recognition using practical spatial light modulators
Spatial light modulators (SLMs) are being used in correlation-based optical pattern recognition systems to implement the Fourier domain filters. Currently available SLMs have certain limitations with respect to the realizability of these filters. Therefore, it is necessary to incorporate the SLM constraints in the design of the filters. The design of a SLM-constrained minimum average correlation energy (SLM-MACE) filter using the simulated annealing-based optimization technique was investigated. The SLM-MACE filter was synthesized for three different types of constraints. The performance of the filter was evaluated in terms of its recognition (discrimination) capabilities using computer simulations. The correlation plane characteristics of the SLM-MACE filter were found to be reasonably good. The SLM-MACE filter yielded far better results than the analytical MACE filter implemented on practical SLMs using the constrained magnitude technique. Further, the filter performance was evaluated in the presence of noise in the input test images. This work demonstrated the need to include the SLM constraints in the filter design. Finally, a method is suggested to reduce the computation time required for the synthesis of the SLM-MACE filter
- …