Multiplierless Approximation of Transforms With Adder Constraint

IEEE Signal Processing Letters - United States
doi 10.1109/lsp.2002.804419
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

The Approximation of Laplace-Stieltjes Transforms With Finite Order

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

Volume Data Approximation Using Wavelet Transforms.

The Journal of the Institute of Television Engineers of Japan
1992English

An Approximation Algorithm for MAX-2-SAT With Cardinality Constraint

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

The Inverse Eigenproblem of Centrosymmetric Matrices With a Submatrix Constraint and Its Approximation

SIAM Journal on Matrix Analysis and Applications
Analysis
2005English

An Approximation Method of Fuzzy Numbers Based on Extended Fuzzy Transforms

2018English

Approximation of Finite Hilbert and Hadamard Transforms by Using Equally Spaced Nodes

Mathematics
Mathematics
2020English

Enhanced Self Checking Carry Select Adder Using Dynamic Logic Based Full Adder

International Journal of Recent Technology and Engineering
EngineeringManagement of TechnologyInnovation
2020English

Distributed Constraint Satisfaction With Multiply Sectioned Constraint Networks

International Journal of Information and Decision Sciences
ManagementStrategyComputer Science ApplicationsInnovationManagement of TechnologyInformation Systems
2014English

Custom-Optimized Multiplierless Implementations of DSP Algorithms

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy