English
Related papers

Related papers: Two New CNTFET Quaternary Full Adders for Carry-Pr…

200 papers

This paper focuses on the signal design in a Gaussian amplify-and-forward (AF) relay system with superposition coding (SC) being applied at the relay, which allows the source and relay to transmit their own information within two time…

Signal Processing · Electrical Eng. & Systems 2019-12-18 Bohai Li , He Chen , Zheng Dong , Yonghui Li , Branka Vucetic

Spectrum sharing backscatter communication systems are among the most prominent technologies for ultralow power and spectrum efficient communications. In this paper, we propose an underlay spectrum sharing backscatter communication system,…

Information Theory · Computer Science 2021-01-27 Yazan H. Al-Badarneh , Ahmed Elzanaty , Mohamed-Slim Alouini

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

Running backpropagation end to end on large neural networks is fraught with difficulties like vanishing gradients and degradation. In this paper we present an alternative architecture composed of many small neural networks that interact…

Machine Learning · Computer Science 2024-12-10 Stephen Pasteris , Chris Hicks , Vasilios Mavroudis

High resolution analog to digital converters (ADCs) are conventionally used at the receiver terminals to store an accurate digital representation of the received signal, thereby allowing for reliable decoding of transmitted messages.…

Information Theory · Computer Science 2021-12-07 Abbas Khalili , Farhad Shirani , Elza Erkip , Yonina C. Eldar

We consider the fundamental problem of constructing fast and small circuits for binary addition. We propose a new algorithm with running time $\mathcal O(n \log_2 n)$ for constructing linear-size $n$-bit adder circuits with a significantly…

Data Structures and Algorithms · Computer Science 2024-05-24 Ulrich Brenner , Anna Silvanus

We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems. This is achieved by devising new lower bounds that utilise the set of absent receivers to construct decoding chains with skipped messages. This…

Information Theory · Computer Science 2019-10-02 Lawrence Ong , Badri N. Vellambi , Jörg Kliewer

Control modular addition is a core arithmetic function, and we must consider the computational cost for actual quantum computers to realize efficient implementation. To achieve a low computational cost in a control modular adder, we focus…

Quantum Physics · Physics 2022-02-10 Kento Oonishi , Tomoki Tanaka , Shumpei Uno , Takahiko Satoh , Rodney Van Meter , Noboru Kunihiro

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

Adder Neural Network (AdderNet) provides a new way for developing energy-efficient neural networks by replacing the expensive multiplications in convolution with cheaper additions (i.e.l1-norm). To achieve higher hardware efficiency, it is…

Computer Vision and Pattern Recognition · Computer Science 2022-12-21 Ying Nie , Kai Han , Haikang Diao , Chuanjian Liu , Enhua Wu , Yunhe Wang

Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area…

Emerging Technologies · Computer Science 2018-03-20 Mahmoud Masadeh , Osman Hasan , Sofiene Tahar

Electronic devices primarily aim to offer low power consumption, high speed, and a compact area. The performance of very large-scale integration (VLSI) devices is influenced by arithmetic operations, where multiplication is a crucial…

Hardware Architecture · Computer Science 2025-06-16 Ali Ranjbar , Elham Esmaeili , Roghayeh Rafieisangari , Nabiollah Shiri

Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs) are presented which are compared with accurate RCAs and CLAs for performing a 32-bit addition. The accurate and approximate RCAs and CLAs are implemented using a…

Hardware Architecture · Computer Science 2017-10-17 P Balasubramanian , C Dang , D L Maskell , K Prasad

In this work we present simple, physics-based models for two effects that have been noted in the fully depleted CCDs that are presently used in the Dark Energy Survey Camera. The first effect is the observation that the point-spread…

Instrumentation and Methods for Astrophysics · Physics 2015-06-19 S. E. Holland , C. J. Bebek , W. F. Kolbe , J. S. Lee

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constraint variants are…

Artificial Intelligence · Computer Science 2008-06-12 Christian Schulte , Guido Tack

In this paper, we present a multiplier based on a sequence of approximated accumulations. According to a given splitting point of the carry chains, the technique herein introduced allows varying the quality of the accumulations and,…

Hardware Architecture · Computer Science 2021-05-26 Jorge Echavarria , Stefan Wildermann , Oliver Keszocze , Faramarz Khosravi , Andreas Becher , Jürgen Teich

A new subcarrier combining technique is proposed for MC -CDMA receiver in mobile Rayleigh fading channel. It exploits the structure formed by repeating spreading sequences of users on different subcarriers to simultaneously suppress…

Information Theory · Computer Science 2011-03-01 Indu Shakya , Falah H. Ali , Elias Stipidis

The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an…

Quantum Physics · Physics 2007-05-23 D. I. Kamenev , G. P. Berman , R. B. Kassman , V. I. Tsifrinovich

Subthreshold circuit designs are very much popular for some of the ultra low power applications, where the minimum energy consumption is the primary concern. But, due to the weak driving current, these circuits generally suffer from huge…

Hardware Architecture · Computer Science 2014-10-07 Dipankar Saha , Aanan Chatterjee , Sayan Chatterjee , C. K. Sarkar

This paper presents efficient algorithms, designed to leverage SIMD for performing Montgomery reductions and additions on integers larger than 512 bits. The existing algorithms encounter inefficiencies when parallelized using SIMD due to…

Cryptography and Security · Computer Science 2023-09-01 Pengchang Ren , Reiji Suda , Vorapong Suppakitpaisarn