Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Haridimos T. Vergos"'
Publikováno v:
2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME).
Publikováno v:
Circuits, Systems, and Signal Processing. 34:1041-1056
A Hamming distance comparator (also known as $$k$$k-order comparator) compares its two operands and outputs an agreement if they differ in less than $$k$$k corresponding bits. In this paper, we introduce novel architectures for the design of Hamming
Autor:
George Blanas, Haridimos T. Vergos
Publikováno v:
ICECS
The power signature of an intellectual property (IP) core during its test has been proposed as a watermark that can reveal if it is used without proper authorization within a System on Chip (SoC). In this paper we show that the classic application of
Autor:
Haridimos T. Vergos
Publikováno v:
Integration. 45:388-394
Novel architectures for end-around inverted carry adders are proposed in this manuscript, which use a sparse carry computation unit for deriving only some of the carries in log"2n prefix levels, while all the rest are computed in an extra one. When u
Autor:
D. Bakalis, Haridimos T. Vergos
Publikováno v:
Microprocessors and Microsystems. 36:409-419
Multi-modulus architectures, that is, architectures that can deal with more than one modulo cases, are very useful for reconfigurable processors and fault-tolerant systems that are based on the residue number system (RNS). Two novel architectures are
Publikováno v:
Circuits, Systems, and Signal Processing. 30:1445-1461
Novel architectures for designing modulo 2 n +1 subtractors and combined adders/subtractors are proposed in this manuscript. Both the normal and the diminished-one representations of the operands are considered. Unit gate estimates and CMOS VLSI impl
Publikováno v:
Integration. 44:163-174
Modulo 2^n+/-1 squarers are useful components for designing special purpose digital signal processors that internally use a residue number system and for implementing the modulo exponentiators and multiplicative inverses required in cryptographic alg
Autor:
Haridimos T. Vergos, D. Bakalis
Publikováno v:
Journal of Circuits, Systems and Computers. 19:911-930
It is shown that a diminished-1 adder, with minor modifications, can be also used for the modulo 2n + 1 addition of two n-bit operands in the weighted representation, if the sum of its input operands is decreased by one. This modified diminished-1 ad
Publikováno v:
Integration. 43:42-48
In this manuscript novel architectures for modulo 2^n+1 multi-operand addition and residue generation are introduced. The proposed arithmetic components consist of a translation stage, an inverted end-around-carry carry-save-adder tree and an enhance
Publikováno v:
Integration. 42:149-157
In this manuscript, we introduce novel carry lookahead (CLA) and parallel-prefix architectures for the design of modulo 2^n+1 adders with operands in the diminished-1 number representation. The proposed architectures are based on the use of Ling carr