Results 1  10
of
657,842
Multiplierless multiple constant multiplication
 ACM TRANS. ALGORITHMS
, 2007
"... A variable can be multiplied by a given set of fixedpoint constants using a multiplier block that consists exclusively of additions, subtractions, and shifts. The generation of a multiplier block from the set of constants is known as the multiple constant multiplication (MCM) problem. Finding the o ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
A variable can be multiplied by a given set of fixedpoint constants using a multiplier block that consists exclusively of additions, subtractions, and shifts. The generation of a multiplier block from the set of constants is known as the multiple constant multiplication (MCM) problem. Finding
Sublinear Constant Multiplication Algorithms
"... This paper explores the use of a doublebase number system (DBNS) in constant integer multiplication. The DBNS recoding technique represents constants in a multipleradix way in the hopes of minimizing computation during constant multiplication. The paper presents a proof to show that multipleradix ..."
Abstract
 Add to MetaCart
This paper explores the use of a doublebase number system (DBNS) in constant integer multiplication. The DBNS recoding technique represents constants in a multipleradix way in the hopes of minimizing computation during constant multiplication. The paper presents a proof to show that multiple
Coxeter multiarrangements with quasiconstant multiplicities
, 2008
"... We study structures of derivation modules of Coxeter multiarrangements with quasiconstant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with quasiconstant multiplicity is combinatorially computable. ..."
Abstract

Cited by 16 (14 self)
 Add to MetaCart
We study structures of derivation modules of Coxeter multiarrangements with quasiconstant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with quasiconstant multiplicity is combinatorially computable.
Watermarking Multiple Constant Multiplications Solutions
"... Abstract — Multiplications and multipliers dominate area, power, and speed requirements of modern designs. A standard technique to reduce these requirements is to use combinations of shifts and additions to execute multiplications. The approach is particularly effective when multiple constant multip ..."
Abstract
 Add to MetaCart
Abstract — Multiplications and multipliers dominate area, power, and speed requirements of modern designs. A standard technique to reduce these requirements is to use combinations of shifts and additions to execute multiplications. The approach is particularly effective when multiple constant
TimeMultiplexed MultipleConstant Multiplication
"... This paper studies areaefficient arithmetic circuits to multiply a fixedpoint input value selectively by one of several preset fixedpoint constants. We present an algorithm that generates a class of solutions to this timemultiplexed multipleconstant multiplication problem by “fusing” singleco ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper studies areaefficient arithmetic circuits to multiply a fixedpoint input value selectively by one of several preset fixedpoint constants. We present an algorithm that generates a class of solutions to this timemultiplexed multipleconstant multiplication problem by “fusing” singleconstant
MULTIPLE CONSTANT MULTIPLICATION WITH TERNARY ADDERS
"... ABSTRACT The scaling operation, i. e., the multiplication with a single constant is a frequently used operation in many kinds of numeric algorithms. The multiple constant multiplication (MCM) is a generalization where a variable is multiplied by several constants. This kind of operation is heavily ..."
Abstract
 Add to MetaCart
ABSTRACT The scaling operation, i. e., the multiplication with a single constant is a frequently used operation in many kinds of numeric algorithms. The multiple constant multiplication (MCM) is a generalization where a variable is multiplied by several constants. This kind of operation is heavily
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
Normalization for cDNA microarray data: a robust composite method addressing single and multiple slide systematic variation
, 2002
"... There are many sources of systematic variation in cDNA microarray experiments which affect the measured gene expression levels (e.g. differences in labeling efficiency between the two fluorescent dyes). The term normalization refers to the process of removing such variation. A constant adjustment is ..."
Abstract

Cited by 718 (9 self)
 Add to MetaCart
There are many sources of systematic variation in cDNA microarray experiments which affect the measured gene expression levels (e.g. differences in labeling efficiency between the two fluorescent dyes). The term normalization refers to the process of removing such variation. A constant adjustment
Abstract Efficient BitSerial Constant Multiplication for FPGAs
"... This paper describes how to realize placeeffective synchronous bitserial constant multiplications, which can be efficiently used for a block of constants (Multiple Constant Multiplication). The architecture combines traditional concepts and new approaches, which leads to the possibility of simulta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes how to realize placeeffective synchronous bitserial constant multiplications, which can be efficiently used for a block of constants (Multiple Constant Multiplication). The architecture combines traditional concepts and new approaches, which leads to the possibility
Efficient BitSerial Constant Multiplication for FPGAs
"... This paper describes how to realize placeeffective synchronous bitserial constant multiplications, which can be efficiently used for a block of constants (Multiple Constant Multiplication). The architecture combines traditional concepts and new approaches, which leads to the possibility of simulta ..."
Abstract
 Add to MetaCart
This paper describes how to realize placeeffective synchronous bitserial constant multiplications, which can be efficiently used for a block of constants (Multiple Constant Multiplication). The architecture combines traditional concepts and new approaches, which leads to the possibility
Results 1  10
of
657,842