Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2023
Decoder Reduction Approximation Scheme for Booth Multipliers
IEEE Transactions on Computers (ITCO), Volume 73, Issue 3Pages 735–746https://doi.org/10.1109/TC.2023.3343093Existing approximate Booth multipliers fail to keep up with modern approximate multipliers such as truncation-based approximate logarithmic multipliers. This paper introduces a new approximation scheme for Booth multipliers that can operate with ...
- research-articleJanuary 2016
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
IEEE Transactions on Computers (ITCO), Volume 65, Issue 1Pages 161–172https://doi.org/10.1109/TC.2015.2409842We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates. Our algorithm is capable of handling errors in approximation down to size <...
- research-articleJuly 2015
Multiplicative Division Employing Independent Factors
IEEE Transactions on Computers (ITCO), Volume 64, Issue 7Pages 2012–2019https://doi.org/10.1109/TC.2014.2346206We introduce a division procedure where a normalized quotient approximation is derived as a product of four independent closed form factors. Specific derivations of the method for IEEE-754 standard binary single and double precision division are developed ...
- research-articleJuly 2015
An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation
IEEE Transactions on Computers (ITCO), Volume 64, Issue 7Pages 1805–1818https://doi.org/10.1109/TC.2014.2346178Response time analysis is required both for on-line admission of applications in dynamic systems and as an integral part of design tools for complex distributed real-time systems. We consider sporadic tasks with fixed-priorities and arbitrary deadlines to ...
- research-articleMarch 2015
Approximation Algorithms for Min-Max Cycle Cover Problems
IEEE Transactions on Computers (ITCO), Volume 64, Issue 3Pages 600–613https://doi.org/10.1109/TC.2013.2295609As a fundamental optimization problem, the vehicle routing problem has wide application backgrounds and has been paid lots of attentions in past decades. In this paper we study its applications in data gathering and wireless energy charging for wireless ...
-
- research-articleDecember 2014
Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks
IEEE Transactions on Computers (ITCO), Volume 63, Issue 12Pages 2933–2947https://doi.org/10.1109/TC.2013.171The constrained relay node placement problem in a wireless sensor network seeks the deployment of a minimum number of relay nodes (RNs) in a set of candidate locations in the network to satisfy specific requirements, such as connectivity or ...
- research-articleFebruary 2014
Flow Problems in Multi-Interface Networks
IEEE Transactions on Computers (ITCO), Volume 63, Issue 2Pages 361–374https://doi.org/10.1109/TC.2012.214In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the ...
- research-articleOctober 2013
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
IEEE Transactions on Computers (ITCO), Volume 62, Issue 10Pages 1932–1944https://doi.org/10.1109/TC.2012.124To deploy a wireless sensor network for the purpose of large-scale monitoring, in this paper, we propose a heterogeneous and hierarchical wireless sensor network architecture. The architecture consists of sensor nodes, gateway nodes, and mobile sinks. ...
- research-articleSeptember 2013
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks
IEEE Transactions on Computers (ITCO), Volume 62, Issue 9Pages 1684–1693https://doi.org/10.1109/TC.2012.170For a given undirected (edge) weighted graph $(G=(V,E))$, a terminal set $(S \subseteq V)$ and a root $(r \in S)$, the rooted $(k)$-vertex connected minimum Steiner network ($(kVSMN_{r})$) problem requires to construct a minimum-cost subgraph of $(G)$ ...
- research-articleJuly 2012
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks
IEEE Transactions on Computers (ITCO), Volume 61, Issue 7Pages 954–968https://doi.org/10.1109/TC.2011.123For an undirected and weighted graph G=(V,E) and a terminal set S\subseteq V, the 2-connected Steiner minimal network (SMN) problem requires to compute a minimum-weight subgraph of G in which all terminals are 2-connected to each other. This problem has ...
- research-articleMay 2012
Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
IEEE Transactions on Computers (ITCO), Volume 61, Issue 5Pages 738–744https://doi.org/10.1109/TC.2011.61Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a ...
- research-articleFebruary 2012
FFT Implementation with Fused Floating-Point Operations
IEEE Transactions on Computers (ITCO), Volume 61, Issue 2Pages 284–288https://doi.org/10.1109/TC.2010.271This paper describes two fused floating-point operations and applies them to the implementation of fast Fourier transform (FFT) processors. The fused operations are a two-term dot product and an add-subtract unit. The FFT processors use "butterfly” ...
- research-articleOctober 2011
Offset DMR: A Low Overhead Soft Error Detection and Correction Technique for Transform-Based Convolution
IEEE Transactions on Computers (ITCO), Volume 60, Issue 10Pages 1511–1516https://doi.org/10.1109/TC.2011.80A novel concurrent soft error detection and correction scheme is introduced for parallel hardware implementations of transform-based convolution. The proposed technique is based on the structure of radix-2 Fast Fourier Transforms (FFT) of length 2^{n} ...
- research-articleMarch 2011
Elementary Functions Hardware Implementation Using Constrained Piecewise-Polynomial Approximations
IEEE Transactions on Computers (ITCO), Volume 60, Issue 3Pages 418–432https://doi.org/10.1109/TC.2010.127A novel technique for designing piecewise-polynomial interpolators for hardware implementation of elementary functions is investigated in this paper. In the proposed approach, the interval where the function is approximated is subdivided in equal length ...
- research-articleFebruary 2009
An Efficient Rounding Boundary Test for {\rm pow}(x, y) in Double Precision
IEEE Transactions on Computers (ITCO), Volume 58, Issue 2Pages 197–207https://doi.org/10.1109/TC.2008.202The correct rounding of the function pow: (x, y)\mapstox^{y} is currently based on Ziv's iterative approximation process. In order to ensure its termination, cases when x^{y} falls on a rounding-boundary must be filtered out. Such rounding-boundaries ...
- research-articleFebruary 2009
A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
IEEE Transactions on Computers (ITCO), Volume 58, Issue 2Pages 279–286https://doi.org/10.1109/TC.2008.167Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we ...
- research-articleNovember 2008
Efficient Approximate Wordlength Optimization
IEEE Transactions on Computers (ITCO), Volume 57, Issue 11Pages 1561–1570https://doi.org/10.1109/TC.2008.87In this paper, the problem of bounding the performance of good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate optimization problem, a lower bounding curve on ...
- research-articleOctober 2008
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
IEEE Transactions on Computers (ITCO), Volume 57, Issue 10Pages 1331–1345https://doi.org/10.1109/TC.2008.58Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute intensive kernels of these applications are often specified as Cyclo-Static ...
- research-articleMay 2008
Hardware Implementation Trade-Offs of Polynomial Approximations and Interpolations
IEEE Transactions on Computers (ITCO), Volume 57, Issue 5Pages 686–701https://doi.org/10.1109/TC.2007.70847This paper examines the hardware implementation tradeoffs when evaluating functions via piecewise polynomial approximations and interpolations for precisions up to 24 bits. In polynomial approximations, polynomials are evaluated using stored ...
- research-articleDecember 2007
Approximation Algorithms for Sensor Deployment
IEEE Transactions on Computers (ITCO), Volume 56, Issue 12Pages 1681–1695https://doi.org/10.1109/TC.2007.1063We develop an integer linear programming formulation to find a minimum cost deployment of sensors that provides the desired coverage of a target point set and propose a greedy heuristic for this problem. Our formulation permits heterogeneous multimodal ...