A digital signal processing circuit formed on a single integrated chip includes a multiplier for multiplying a multiplicand and multiplier signal to produce a multiple bit product signal having higher order bits delayed more than lower order bits; a first delay circuit for concatenating and delaying the multiplier and multiplicand signals to produce a delayed concatenated signal having higher order bits delayed more than lower order bits; a first selector for selectively supplying either the product signal, the delayed concatenated signal, or a concatenated signal formed from the multiplier and multiplicand signals, as a first selected signal; an adder for adding an input signal to the first selected signal to produce a summed signal; a second delay circuit for delaying a summed signal by a predetermined amount to produce a first delayed summand signal; a third delay circuit for delaying the summand signal to produce a second delayed summand signal having higher order bits delayed more than lower order bits; a second selector for selectively supplying either the first or second delayed summand signal to the adder as the input signal; a fourth delay circuit for delaying the summed signal by a predetermined amount to produce a first delayed summed signal; a fifth delay circuit for delaying the summed signal to produce a second delayed summed signal having lower order bits delayed more than higher order bits; and a third selector for selectively supplying either the first or second delayed summed signal as an output of the processing circuit.
[1]
Narendra Jussien,et al.
Local search with constraint propagation and conflict-based heuristics
,
2000,
Artif. Intell..
[2]
Thomas Schiex,et al.
Valued Constraint Satisfaction Problems: Hard and Easy Problems
,
1995,
IJCAI.
[3]
Michel Gendreau,et al.
A View of Local Search in Constraint Programming
,
1996,
CP.
[4]
Editors
,
1986,
Brain Research Bulletin.
[5]
Ugo Montanari,et al.
Networks of constraints: Fundamental properties and applications to picture processing
,
1974,
Inf. Sci..
[6]
Pierre Hansen,et al.
Variable Neighborhood Search
,
2018,
Handbook of Heuristics.
[7]
Thomas Schiex,et al.
Reversible DAC and Other Improvements for Solving Max-CSP
,
1998,
AAAI/IAAI.
[8]
Javier Larrosa,et al.
Exploiting the Use of DAC in MAX-CSP
,
1996,
CP.
[9]
Paul Shaw,et al.
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
,
1998,
CP.
[10]
Matthew L. Ginsberg,et al.
Limited Discrepancy Search
,
1995,
IJCAI.
[11]
Patrice Boizumault,et al.
Resource allocation in a mobile telephone network: A constructive repair algorithm
,
2001,
RAIRO Oper. Res..
[12]
Yves Crama,et al.
Local Search in Combinatorial Optimization
,
2018,
Artificial Neural Networks.