Learn More
The 1-bit full adder circuit is a very important component in the design of application specific integrated circuits. This paper presents a novel low-power multiplexer-based 1-bit full adder that uses 12 transistors (MBA-12T). In addition to reduced transition activity and charge recycling capability, this circuit has no direct connections to the(More)
Based on an algorithm derived from the New Chinese Remainder Theorem I, we present three new residue-to-binary converters for the residue number system (2 1 2 2 + 1) designed using 2 -bit or -bit adders with improvements on speed, area, or dynamic range compared with various previous converters. The 2 -bit adder based converter is faster and requires about(More)
The explosive growth of 802.11-based wireless LANs has attracted interest in providing higher data rates and greater system capacities. Among the IEEE 802.11 standards, the 802.11a standard based on OFDM modulation scheme has been defined to address high-speed and large-system-capacity challenges. Hardware implementations are often used to meet the(More)
Due to the bufferless nature of OBS networks, random burst losses may occur, even at low traffic loads. For optical burstswitched (OBS) networks in which TCP is implemented at a higher layer, these random burst losses may be mistakenly interpreted by the TCP layer as congestion in the network, leading to serious degradation of the TCP performance. In this(More)
In this paper, we evaluate the performance of a burst retransmission scheme in which the bursts lost due to contentions in an OBS network are retransmitted at the OBS layer. The retransmission scheme aims to reduce burst loss probability in OBS networks. We develop an analytical model for obtaining the burst loss probability over an OBS network that uses(More)
The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the(More)
The number comparison is a difficult and fundamental operation for residue number systems (RNS). Previous algorithms use either some redundant modulus or big modulo operations. In this paper, based on the New Chinese Remainder Theorem II, we present a new comparison algorithm using smaller modulo operations and no redundant modulus.