Invention Grant
US07693921B2 Reducing computational complexity in determining the distance from each of a set of input points to each of a set of fixed points 有权
确定从一组输入点到一组固定点中的每一个的距离的计算复杂度

  • Patent Title: Reducing computational complexity in determining the distance from each of a set of input points to each of a set of fixed points
  • Patent Title (中): 确定从一组输入点到一组固定点中的每一个的距离的计算复杂度
  • Application No.: US11161843
    Application Date: 2005-08-18
  • Publication No.: US07693921B2
    Publication Date: 2010-04-06
  • Inventor: Chanaveeragouda V Goudar
  • Applicant: Chanaveeragouda V Goudar
  • Applicant Address: US TX Dallas
  • Assignee: Texas Instruments Incorporated
  • Current Assignee: Texas Instruments Incorporated
  • Current Assignee Address: US TX Dallas
  • Agent Steven A. Shaw; W. James Brady; Frederick J. Telecky, Jr.
  • Main IPC: G06F7/00
  • IPC: G06F7/00
Reducing computational complexity in determining the distance from each of a set of input points to each of a set of fixed points
Abstract:
An aspect of the present invention takes advantage of the fact that the coordinates of fixed points do not change, and thus the energy (sum of squares of the coordinates defining the vector) of each fixed point is computed and stored. The energy of each variable input point may also be computed. The distance between each pair of fixed and input points is computed based on the respective energies and the dot product.
Information query
Patent Agency Ranking
0/0