Spelling suggestions: "subject:"computer arithmetic"" "subject:"computer rithmetic""
21 |
Wallace and Dadda Multipliers implemented using carry lookahead addersChu, Wesley Donald 15 April 2014 (has links)
In a previous paper it was shown that the use of carry lookahead adders can reduce the delay it takes to compute the product with Wallace and Dadda multipliers. In this report, a more detailed analysis is provided on the use of carry lookahead adders to implement Dadda multipliers and Wallace multipliers. These two styles present different ways to use the arithmetic components and offer different benefits. Implementations of each style of multiplier are presented in this report. The performance delay and complexity of the implementations is compared and analyzed. / text
|
22 |
DESIGN OF A FLOATING-POINT PROCESSOR FOR DIGITAL SIMULATIONWiatrowski, Claude A. January 1973 (has links)
No description available.
|
23 |
Square rooting by iterative multiply-additionsIto, Masayuki, 高木, 直史, Takagi, Naofumi, Yajima, Shuzo 09 December 1996 (has links)
No description available.
|
24 |
Powering by a table look-up and a multiplication with operand modification高木, 直史, Takagi, Naofumi 11 1900 (has links)
No description available.
|
25 |
Static analysis of binary code to detect memory leaks /Khisti, Shrirang Pradip, January 2008 (has links)
Thesis (M.S.)--University of Texas at Dallas, 2008. / Includes vita. Includes bibliographical references (leaf 42)
|
26 |
High speed and low area techniques for computer arithmetic operations /Choi, Jae Hun, January 2000 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 64-70). Available also in a digital version from Dissertation Abstracts.
|
27 |
Gain distributed array computation with python /Daily, Jeffrey Alan. January 2009 (has links) (PDF)
Thesis (M.S. in computer science)--Washington State University, May 2009. / Title from PDF title page (viewed on May 26, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 41-44).
|
28 |
The implementation of a generalized table driven back end processorBroadbent, Christopher Frank January 1987 (has links)
Includes bibliographical references. / This thesis discusses the University of Cape Town implementation of a table driven back end processor. The back end processor takes as input an intermediate tree representation of a high level programming language. It produces as output an object text ready for assembly. The specifications of the input tree and the output object are supplied to the back end processor via two tables. The initial motivation for this project was the need to provide a back end processor capable of taking the DIANA tree output of the University of Cape Town front end processor and producing a corresponding P-code object. The University of Cape Town back end processor is implemented using Pascal and C in a Unix V environment.
|
29 |
An Implementation of the IEEE Standard for Binary Floating-Point Arithmetic for the Motorola 6809 MicroprocessorRosenblum, David Samuel 08 1900 (has links)
This thesis describes a software implementation of the IEEE Floating-Point Standard (IEEE Task P754), which is believed to be an effective system for reliable, accurate computer arithmetic. The standard is implemented as a set of procedures written in Motorola 6809 assembly language. Source listings of the procedures are contained in appendices.
|
30 |
Robust, low complexity and energy efficient baseband receiver design for MB-OFDM UWB. / CUHK electronic theses & dissertations collectionJanuary 2011 (has links)
Architectures of matched filter in packet detector, CFO corrector, FFT output reorder buffer and phase tracking block are optimized for low complexity. Implemented in O.13-mum CMOS technology, the proposed baseband receiver system has the core area of 2.5 mm2 and the estimated power consumption is 170 mW, which is equivalent to the energy efficiency of 88 pJ/b at 480 Mbps data rate. The implementation results verify the robustness, low complexity and power efficiency of the proposed MB-OFDM UWB baseband receiver. / As an OFDM-based system, MB-OFDM UWB is vulnerable and sensitive to carrier frequency offset (CFO). We employ multipartite table method (MTM) to implement arctangent and sin/cos functions for frequency synchronization. Compared with traditional algorithms, MTM has the advantages of low cost, low power consumption and higher processing speed. Residual phase distortion is corrected by a highly simplified phase tracking method, which also has better performance compared with traditional phase tracking scheme. / Synchronization plays the key role for the performance of the whole baseband receiver system. In this dissertation, a dual-threshold (DT) packet detection scheme is proposed for timing synchronization. Compared with traditional cross-correlation algorithm, DT has much better detection performance, especially in high noise environment. / Ultra-wideband (UWB) technology, targeting at wireless personal area networks (WPANs),brings the convenience of high-speed and short-range wireless interconnects. As a novel communication technique, multi-band orthogonal frequency division multiplexing (MB-OFDM) UWB has the features of high spectrum efficiency, multiple access capability and robustness against narrow band interference. However, its inherent high complexity and the requirement of powerful processing for good performance are the obstacles for practical application. / Fan, Wen. / Adviser: Choy Chiu-Sing. / Source: Dissertation Abstracts International, Volume: 73-04, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 105-112). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.
|
Page generated in 0.0715 seconds