Theoretical Lower Bounds for Parallel Pipelined Shift-And-Add Constant Multiplications With N-Input Arithmetic Operators

Eurasip Journal on Advances in Signal Processing - Germany
doi 10.1186/s13634-017-0466-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Tensor-Rank and Lower Bounds for Arithmetic Formulas

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2013English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

New Lower Bounds for Arithmetic, Geometric, Harmonic Mean Inequalities and Entropy Upper Bound

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2017English

Lower and Upper Bounds for the Time Constant of First-Passage Percolation

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Isometric $N$-Jordan Weighted Shift Operators

Turkish Journal of Mathematics
Mathematics
2016English

Digital Tomosynthesis Parallel Imaging Computational Analysis With Shift and Add and Back Projection Reconstruction Algorithms

International Journal of Computational Biology and Drug Design
Drug DiscoveryComputer Science Applications
2010English

Models of Arithmetic and Upper Bounds for Arithmetic Sets

Journal of Symbolic Logic
PhilosophyLogic
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy