• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 585
  • 44
  • 39
  • 37
  • 9
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • Tagged with
  • 765
  • 765
  • 185
  • 174
  • 154
  • 135
  • 119
  • 82
  • 70
  • 66
  • 62
  • 62
  • 59
  • 54
  • 48
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Linear-size indexes for approximate pattern matching and dictionary matching

Tam, Siu-lung, 譚小龍 January 2010 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
2

Table look-up CORDIC : effective rotations through angle partitioning

Arbaugh, Jason, Todd, 1970- 08 August 2011 (has links)
Not available
3

Better algorithms for comparing trees

Fok, Chi-wai., 霍志偉. January 2010 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
4

Table look-up CORDIC: effective rotations through angle partitioning

Arbaugh, Jason, Todd 28 August 2008 (has links)
Not available / text
5

Adaptive CORDIC: using parallel angle recording to accelerate CORDIC rotations / Using parallel angle recording to accelerate CORDIC rotations

Rodrigues, Terence Keith, 1974- 29 August 2008 (has links)
This dissertation presents the Parallel Angle Recoding algorithm which is used to accelerate the calculation of CORDIC rotations. The CORDIC algorithm is used in the evaluation of a wide variety of elementary functions such as Sin, Cos, Tan, Log, Exp, etc. It is a simple and versatile algorithm, but its characteristic linear convergence causes it to suffer from long latency. It can be sped up by using the angle recoding algorithm which skips over certain intermediate CORDIC iterations to deliver the same precision while requiring 50% or fewer iterations. However because the selection of the angle constants is quite complex and must be performed off-line, its use has been limited to applications where the rotation angle is static and known a priori. This dissertation extends the low-latency advantage of the angle recoding method to dynamic situations too, where the incoming angle of rotation is allowed to take on any arbitrary value. The proposed method is called Parallel Angle Recoding and it makes use of a much simpler angle selection scheme to identify the angle constants needed by angle recoding. Because of its simplicity, it can be easily implemented in hardware without having to increase the cycle time. All the angle constants for angle recoding can be found in parallel in a single preliminary step by testing just the initial incoming rotation angle using range comparators -- there is no need to perform successive CORDIC iterations in order to identify them. With increasing precision, (N= 8, 16, 24, 32, etc.) the number of comparators which are needed by this scheme increases rapidly. The parallel angle recoding method can be re-formulated to apply to smaller groups of consecutive angle constants known as 'sections.' This limits the number of comparators that are needed, to a reasonable amount. There is an attendant savings in area and power consumption, but at the same time the evaluation of multiple sections introduces additional overhead cycles which reduces some of the gains made in latency by the Parallel Angle Recoding method. By interleaving multiple rotations and making use of a small buffer to store intermediate results, the number of overhead cycles can be reduced drastically. The Parallel Angle Recoding technique is modelled using Verilog, synthesised and mapped to a 65 nm. cell library. The latency and area characteristics that are obtained show that the method can improve the performance of the rotation mode in CORDIC, by delivering a reduced iteration count with no increase in the cycle time, and only a modest increase in power and area.
6

Efficient stabbing algorithms for a set of objects

王富利, Wang, Fu-lee. January 1999 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
7

The power of greediness: a general methodology for designing approximation algorithms

劉興業, Lau, Hing-yip. January 1999 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
8

Adaptive CORDIC using parallel angle recording to accelerate CORDIC rotations /

Rodrigues, Terence Keith, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
9

Table look-up CORDIC : effective rotations through angle partitioning /

Arbaugh, Jason Todd, January 2004 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Vita. Includes bibliographical references ( leaves 206-213). Also available in an electronic version.
10

Table look-up CORDIC effective rotations through angle partitioning /

Arbaugh, Jason, Todd, Swartzlander, Earl E. January 2004 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Earl E. Swartzlander, Jr. Vita. Includes bibliographical references. Also available from UMI.

Page generated in 0.0575 seconds