2,150 research outputs found
A Comparative Performance of Discrete Wavelet Transform Implementations Using Multiplierless
Using discrete wavelet transform (DWT) in high-speed signal-processing applications imposes a high degree of care to hardware resource availability, latency, and power consumption. In this chapter, the design aspects and performance of multiplierless DWT is analyzed. We presented the two key multiplierless approaches, namely the distributed arithmetic algorithm (DAA) and the residue number system (RNS). We aim to estimate the performance requirements and hardware resources for each approach, allowing for the selection of proper algorithm and implementation of multi-level DAA- and RNS-based DWT. The design has been implemented and synthesized in Xilinx Virtex 6 ML605, taking advantage of Virtex 6’s embedded block RAMs (BRAMs)
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
Conformal Field Theory of AdS Background with Ramond-Ramond Flux
We review a formalism of superstring quantization with manifest
six-dimensional spacetime supersymmetry, and apply it to AdS_3 x S^3
backgrounds with Ramond-Ramond flux. The resulting description is a conformal
field theory based on a sigma model whose target space is a certain supergroup
SU'(2|2).Comment: 89 pages harvmac. Added four reference
A global method for coupling transport with chemistry in heterogeneous porous media
Modeling reactive transport in porous media, using a local chemical
equilibrium assumption, leads to a system of advection-diffusion PDE's coupled
with algebraic equations. When solving this coupled system, the algebraic
equations have to be solved at each grid point for each chemical species and at
each time step. This leads to a coupled non-linear system. In this paper a
global solution approach that enables to keep the software codes for transport
and chemistry distinct is proposed. The method applies the Newton-Krylov
framework to the formulation for reactive transport used in operator splitting.
The method is formulated in terms of total mobile and total fixed
concentrations and uses the chemical solver as a black box, as it only requires
that on be able to solve chemical equilibrium problems (and compute
derivatives), without having to know the solution method. An additional
advantage of the Newton-Krylov method is that the Jacobian is only needed as an
operator in a Jacobian matrix times vector product. The proposed method is
tested on the MoMaS reactive transport benchmark.Comment: Computational Geosciences (2009)
http://www.springerlink.com/content/933p55085742m203/?p=db14bb8c399b49979ba8389a3cae1b0f&pi=1
Tools for computer graphics applications
Extensive research in computer graphics has produced a collection of basic algorithms and procedures whose utility spans many disciplines. These tools are described in terms of their fundamental aspects, implementations, applications, and availability. Programs which are discussed include basic data plotting, curve smoothing, and depiction of three dimensional surfaces. As an aid to potential users of these tools, particular attention is given to discussing their availability and, where applicable, their cost
Multi-patch methods in general relativistic astrophysics - I. Hydrodynamical flows on fixed backgrounds
Many systems of interest in general relativistic astrophysics, including
neutron stars, accreting compact objects in X-ray binaries and active galactic
nuclei, core collapse, and collapsars, are assumed to be approximately
spherically symmetric or axisymmetric. In Newtonian or fixed-background
relativistic approximations it is common practice to use spherical polar
coordinates for computational grids; however, these coordinates have
singularities and are difficult to use in fully relativistic models. We
present, in this series of papers, a numerical technique which is able to use
effectively spherical grids by employing multiple patches. We provide detailed
instructions on how to implement such a scheme, and present a number of code
tests for the fixed background case, including an accretion torus around a
black hole.Comment: 26 pages, 20 figures. A high-resolution version is available at
http://www.cct.lsu.edu/~bzink/papers/multipatch_1.pd
- …