Results 1 - 10
of
115
Sparse Matrix-Vector Multiply on the Texas Instruments C6678 Digital Signal Processor
"... is TI’s most recently-released Digital Signal Processor (DSP). Although its original purpose was voice and video encoding and decoding, it may have the potential to become a practical coprocessor for scientific computing. In this paper, we evaluate the C6678 in terms of its programming methodology, ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
units as compared with the GPUs. In this paper we describe our kernel and the programming techniques required to optimize its performance. Keywords—high performance computing; sparse matrix vector (SpMV); linear algebra; digital signal processor (DSP); graphical processor unit (GPU); very long
Whom You Know Matters: Venture Capital Networks and Investment Performance,
- Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract
-
Cited by 138 (8 self)
- Add to MetaCart
from a small subset of their portfolio companies, namely those that they exit via an IPO or a sale to another company (M&A). 13 All else equal, the more successful exits a fund has, the larger will be its IRR. Thus, we take as our main proxy for VC fund performance the fraction of the fund
An Optimized Coefficient Update Processor for High-Throughput Adaptive Equalizers
"... A processor for the adaptation of the coefficients in high throughput adaptive equalizers will be presented. The accumulation operation- fundamental basis of the adaptation process- is split into two steps: A fine-grain carry-save accumulation with timesharing factor 2 collects the products of estim ..."
Abstract
- Add to MetaCart
A processor for the adaptation of the coefficients in high throughput adaptive equalizers will be presented. The accumulation operation- fundamental basis of the adaptation process- is split into two steps: A fine-grain carry-save accumulation with timesharing factor 2 collects the products
An Optimized Coefficient Update Processor for High-Throughput Adaptive Equalizers
"... A processor for the adaptation of the coeflcients in high throughput adaptive equaliz-ers will be presented. The accumulation operation- fundumental basis G $ the adaptation process- is split into two steps: A $ne-grain carry-save accumulation-with timesharing factor 2 collects the products of estim ..."
Abstract
- Add to MetaCart
A processor for the adaptation of the coeflcients in high throughput adaptive equaliz-ers will be presented. The accumulation operation- fundumental basis G $ the adaptation process- is split into two steps: A $ne-grain carry-save accumulation-with timesharing factor 2 collects the products
EXAMINATION OF WAVELET PACKET SIGNAL SETS FOR OVER-SATURATED MULTIPLE ACCESS COMMUNICATIONS
, 1996
"... ABSTRACT are user signatures. The column vectors sk of S span This paper addresses the problem of signature set de- the space IRN. The noise, n, is a Gaussian vector of sign for uncoded multiple access (MA) communication mean zero and identity covariance, and a is the noise in which user signature w ..."
Abstract
- Add to MetaCart
- in the number of users, K. saturated MA communications. The tree detector re- For the case in which the number of signal dimen-quires the set of linearly dependent user signatures sions is equal to the number of users, K = N,the MA to have tree-structured cross-correlations. This design optimal joint detection
Digital Object Identifier (DOI):
"... Cattaneo models for chemosensitive movement Numerical solution and pattern formation ..."
Abstract
- Add to MetaCart
Cattaneo models for chemosensitive movement Numerical solution and pattern formation
Usage of Shapiro and Pons Polynomials in Digital Image Watermarking
, 2003
"... USAGE OF SHAPIRO AND PONS POLYNOMIALS IN DIGITAL IMAGE WATERMARKING Byrnes et al. have shown that piecewise constant functions that take the value of the coecients of semiat and unimodular polynomials in the subintervals are compact both in time and frequency domains. As semiat and unimodular polyno ..."
Abstract
- Add to MetaCart
of Shapiro and PONS transforms are investigated it's observed that Shapiro transform spreads the signal energy almost equally among the transform domain coecients, which is not common to all transformations. Followingly, PONS transform is very similar to the Walsh transform in that it has similar
1Sub-Nyquist Radar via Doppler Focusing
"... Abstract—We investigate the problem of a monostatic pulse-Doppler radar transceiver trying to detect targets, sparsely populated in the radar’s unambiguous time-frequency region. Several past works employ compressed sensing (CS) algorithms to this type of problem, but either do not address sample ra ..."
Abstract
- Add to MetaCart
rate sampling and digital processing, imposes no restrictions on the transmitter, and uses a CS dictionary with size which does not increase with increasing number of pulses P. Furthermore, in the presence of noise, Doppler focusing enjoys a signal-to-noise ratio (SNR) improvement which scales linearly
Minimum Variance Estimation of a Sparse Vector Within the Linear Gaussian Model: An
"... Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterizat ..."
Abstract
- Add to MetaCart
Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a
APractical Lattice-based Digital Signature Schemes
"... Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case o ..."
Abstract
- Add to MetaCart
Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case
Results 1 - 10
of
115