Results 1 - 10 of 59,201

Fading relay channels: Performance limits and space-time signal design

by Rohit U. Nabar, Helmut Bölcskei, Felix W. Kneubühler - IEEE J. SELECT. AREAS COMMUN , 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract - Cited by 445 (4 self) - Add to MetaCart
of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of co-located antennas as well as appropriate power control rules

Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information

by Emmanuel J. Candès, Justin Romberg, Terence Tao , 2006
"... This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result of this pa ..."
Abstract - Cited by 2632 (50 self) - Add to MetaCart
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result

Matching pursuits with time-frequency dictionaries

by Stephane G. Mallat, Zhifeng Zhang - IEEE Transactions on Signal Processing , 1993
"... Abstract-We introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions. These waveforms are chosen in order to best match the signal structures. Matching pursuits are general procedures t ..."
Abstract - Cited by 1671 (13 self) - Add to MetaCart
to compute adaptive signal representations. With a dictionary of Gabor functions a matching pursuit defines an adaptive time-frequency transform. We derive a signal energy distribution in the time-frequency plane, which does not include interference terms, unlike Wigner and Cohen class distributions. A

Predictive reward signal of dopamine neurons

by Wolfram Schultz - Journal of Neurophysiology , 1998
"... Schultz, Wolfram. Predictive reward signal of dopamine neurons. is called rewards, which elicit and reinforce approach behav-J. Neurophysiol. 80: 1–27, 1998. The effects of lesions, receptor ior. The functions of rewards were developed further during blocking, electrical self-stimulation, and drugs ..."
Abstract - Cited by 747 (12 self) - Add to MetaCart
Schultz, Wolfram. Predictive reward signal of dopamine neurons. is called rewards, which elicit and reinforce approach behav-J. Neurophysiol. 80: 1–27, 1998. The effects of lesions, receptor ior. The functions of rewards were developed further during blocking, electrical self-stimulation, and drugs

Uncertainty principles and ideal atomic decomposition

by David L. Donoho, Xiaoming Huo - IEEE Transactions on Information Theory , 2001
"... Suppose a discrete-time signal S(t), 0 t<N, is a superposition of atoms taken from a combined time/frequency dictionary made of spike sequences 1ft = g and sinusoids expf2 iwt=N) = p N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every d ..."
Abstract - Cited by 583 (20 self) - Add to MetaCart
Suppose a discrete-time signal S(t), 0 t<N, is a superposition of atoms taken from a combined time/frequency dictionary made of spike sequences 1ft = g and sinusoids expf2 iwt=N) = p N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every

A Signal Processing Approach To Fair Surface Design

by Gabriel Taubin , 1995
"... In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fai ..."
Abstract - Cited by 654 (15 self) - Add to MetaCart
, or fairing, to low-pass filtering. We describe a very simple surface signal low-pass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimization-based fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm

Space-time block codes from orthogonal designs

by Vahid Tarokh, Hamid Jafarkhani, A. R. Calderbank - IEEE Trans. Inform. Theory , 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract - Cited by 1524 (42 self) - Add to MetaCart
Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

by D. Needell, J. A. Tropp - California Institute of Technology, Pasadena , 2008
"... Abstract. Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery alg ..."
Abstract - Cited by 770 (13 self) - Add to MetaCart
with the sampling matrix. For compressible signals, the running time is just O(N log 2 N), where N is the length of the signal. 1.

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

by Edward Ashford Lee, David G. Messerschmitt - IEEE TRANSACTIONS ON COMPUTERS , 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract - Cited by 598 (37 self) - Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake

Analysis of relative gene expression data using real-time quantitative

by Kenneth J. Livak, Thomas D. Schmittgen - PCR and 2 ���CT method. Methods 25 , 2001
"... of the target gene relative to some reference group The two most commonly used methods to analyze data from real-time, quantitative PCR experiments are absolute quantifica-such as an untreated control or a sample at time zero tion and relative quantification. Absolute quantification deter- in a time ..."
Abstract - Cited by 2666 (6 self) - Add to MetaCart
time-course study. mines the input copy number, usually by relating the PCR signal Absolute quantification should be performed in situ-to a standard curve. Relative quantification relates the PCR signal ations where it is necessary to determine the absolute of the target transcript in a treatment group
Results 1 - 10 of 59,201