1,390 research outputs found
The Bj\"orling problem for minimal surfaces in a Lorentzian three-dimensional Lie group
In this paper we will show the existence and uniqueness of the solution of
the Bj\"orling problem for minimal surfaces in a 3-dimensional Lorentzian Lie
group.Comment: 16 page
Minimal surfaces in 4-dimensional Lorentzian Damek-Ricci spaces
In this paper we will construct a Weierstrass type representation for minimal
surfaces in 4-dimensional Lorentzian Damek-Ricci spaces and we give some
examples of such surfaces.Comment: 10 page
A Single-Channel Architecture for Algebraic Integer Based 88 2-D DCT Computation
An area efficient row-parallel architecture is proposed for the real-time
implementation of bivariate algebraic integer (AI) encoded 2-D discrete cosine
transform (DCT) for image and video processing. The proposed architecture
computes 88 2-D DCT transform based on the Arai DCT algorithm. An
improved fast algorithm for AI based 1-D DCT computation is proposed along with
a single channel 2-D DCT architecture. The design improves on the 4-channel AI
DCT architecture that was published recently by reducing the number of integer
channels to one and the number of 8-point 1-D DCT cores from 5 down to 2. The
architecture offers exact computation of 88 blocks of the 2-D DCT
coefficients up to the FRS, which converts the coefficients from the AI
representation to fixed-point format using the method of expansion factors.
Prototype circuits corresponding to FRS blocks based on two expansion factors
are realized, tested, and verified on FPGA-chip, using a Xilinx Virtex-6
XC6VLX240T device. Post place-and-route results show a 20% reduction in terms
of area compared to the 2-D DCT architecture requiring five 1-D AI cores. The
area-time and area-time complexity metrics are also reduced by 23% and
22% respectively for designs with 8-bit input word length. The digital
realizations are simulated up to place and route for ASICs using 45 nm CMOS
standard cells. The maximum estimated clock rate is 951 MHz for the CMOS
realizations indicating 7.60810 pixels/seconds and a 88
block rate of 118.875 MHz.Comment: 8 pages, 6 figures, 5 table
Information Theory and Image Understanding: An Application to Polarimetric SAR Imagery
This work presents a comprehensive examination of the use of information
theory for understanding Polarimetric Synthetic Aperture Radar (PolSAR) images
by means of contrast measures that can be used as test statistics. Due to the
phenomenon called `speckle', common to all images obtained with coherent
illumination such as PolSAR imagery, accurate modelling is required in their
processing and analysis. The scaled multilook complex Wishart distribution has
proven to be a successful approach for modelling radar backscatter from forest
and pasture areas. Classification, segmentation, and image analysis techniques
which depend on this model have been devised, and many of them employ some kind
of dissimilarity measure. Specifically, we introduce statistical tests for
analyzing contrast in such images. These tests are based on the chi-square,
Kullback-Leibler, R\'enyi, Bhattacharyya, and Hellinger distances. Results
obtained by Monte Carlo experiments reveal the Kullback-Leibler distance as the
best one with respect to the empirical test sizes under several situations
which include pure and contaminated data. The proposed methodology was applied
to actual data, obtained by an E-SAR sensor over surroundings of
Wessling, Bavaria, Germany.Comment: 15 pages, 11 figure
Multiplierless Approximate 4-point DCT VLSI Architectures for Transform Block Coding
Two multiplierless algorithms are proposed for 4x4 approximate-DCT for
transform coding in digital video. Computational architectures for 1-D/2-D
realisations are implemented using Xilinx FPGA devices. CMOS synthesis at the
45 nm node indicate real-time operation at 1 GHz yielding 4x4 block rates of
125 MHz at less than 120 mW of dynamic power consumption.Comment: 5 pages, 1 figure, corrected Figure 1 (published paper in EL is
incorrect
Multi-Beam RF Aperture Using Multiplierless FFT Approximation
Multiple independent radio frequency (RF) beams find applications in
communications, radio astronomy, radar, and microwave imaging. An -point FFT
applied spatially across an array of receiver antennas provides -independent
RF beams at multiplier complexity. Here, a low-complexity
multiplierless approximation for the 8-point FFT is presented for RF
beamforming, using only 26 additions. The algorithm provides eight beams that
closely resemble the antenna array patterns of the traditional FFT-based
beamformer albeit without using multipliers. The proposed FFT-like algorithm is
useful for low-power RF multi-beam receivers; being synthesized in 45 nm CMOS
technology at 1.1 V supply, and verified on-chip using a Xilinx Virtex-6 Lx240T
FPGA device. The CMOS simulation and FPGA implementation indicate bandwidths of
588 MHz and 369 MHz, respectively, for each of the independent receive-mode RF
beams.Comment: 8 pages, 3 figures, 2 tables, sfg correcte
A Discrete Tchebichef Transform Approximation for Image and Video Coding
In this paper, we introduce a low-complexity approximation for the discrete
Tchebichef transform (DTT). The proposed forward and inverse transforms are
multiplication-free and require a reduced number of additions and bit-shifting
operations. Numerical compression simulations demonstrate the efficiency of the
proposed transform for image and video coding. Furthermore, Xilinx Virtex-6
FPGA based hardware realization shows 44.9% reduction in dynamic power
consumption and 64.7% lower area when compared to the literature.Comment: 13 pages, 5 figures, 2 table
VLSI Computational Architectures for the Arithmetic Cosine Transform
The discrete cosine transform (DCT) is a widely-used and important signal
processing tool employed in a plethora of applications. Typical fast algorithms
for nearly-exact computation of DCT require floating point arithmetic, are
multiplier intensive, and accumulate round-off errors. Recently proposed fast
algorithm arithmetic cosine transform (ACT) calculates the DCT exactly using
only additions and integer constant multiplications, with very low area
complexity, for null mean input sequences. The ACT can also be computed
non-exactly for any input sequence, with low area complexity and low power
consumption, utilizing the novel architecture described. However, as a
trade-off, the ACT algorithm requires 10 non-uniformly sampled data points to
calculate the 8-point DCT. This requirement can easily be satisfied for
applications dealing with spatial signals such as image sensors and biomedical
sensor arrays, by placing sensor elements in a non-uniform grid. In this work,
a hardware architecture for the computation of the null mean ACT is proposed,
followed by a novel architectures that extend the ACT for non-null mean
signals. All circuits are physically implemented and tested using the Xilinx
XC6VLX240T FPGA device and synthesized for 45 nm TSMC standard-cell library for
performance assessment.Comment: 8 pages, 2 figures, 6 table
Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
Video processing systems such as HEVC requiring low energy consumption needed
for the multimedia market has lead to extensive development in fast algorithms
for the efficient approximation of 2-D DCT transforms. The DCT is employed in a
multitude of compression standards due to its remarkable energy compaction
properties. Multiplier-free approximate DCT transforms have been proposed that
offer superior compression performance at very low circuit complexity. Such
approximations can be realized in digital VLSI hardware using additions and
subtractions only, leading to significant reductions in chip area and power
consumption compared to conventional DCTs and integer transforms. In this
paper, we introduce a novel 8-point DCT approximation that requires only 14
addition operations and no multiplications. The proposed transform possesses
low computational complexity and is compared to state-of-the-art DCT
approximations in terms of both algorithm complexity and peak signal-to-noise
ratio. The proposed DCT approximation is a candidate for reconfigurable video
standards such as HEVC. The proposed transform and several other DCT
approximations are mapped to systolic-array digital architectures and
physically realized as digital prototype circuits using FPGA technology and
mapped to 45 nm CMOS technology.Comment: 30 pages, 7 figures, 5 table
Fast Matrix Inversion and Determinant Computation for Polarimetric Synthetic Aperture Radar
This paper introduces a fast algorithm for simultaneous inversion and
determinant computation of small sized matrices in the context of fully
Polarimetric Synthetic Aperture Radar (PolSAR) image processing and analysis.
The proposed fast algorithm is based on the computation of the adjoint matrix
and the symmetry of the input matrix. The algorithm is implemented in a general
purpose graphical processing unit (GPGPU) and compared to the usual approach
based on Cholesky factorization. The assessment with simulated observations and
data from an actual PolSAR sensor show a speedup factor of about two when
compared to the usual Cholesky factorization. Moreover, the expressions
provided here can be implemented in any platform.Comment: 7 pages, 1 figur
- …