Invention Grant
US08326909B2 Arithmetic or logical operation tree computation 有权
算术或逻辑运算树计算

  • Patent Title: Arithmetic or logical operation tree computation
  • Patent Title (中): 算术或逻辑运算树计算
  • Application No.: US11722085
    Application Date: 2005-12-13
  • Publication No.: US08326909B2
    Publication Date: 2012-12-04
  • Inventor: Bruno Ballarin
  • Applicant: Bruno Ballarin
  • Applicant Address: NL Eindhoven
  • Assignee: NXP B.V.
  • Current Assignee: NXP B.V.
  • Current Assignee Address: NL Eindhoven
  • Priority: EP04300918 20041217
  • International Application: PCT/IB2005/054202 WO 20051213
  • International Announcement: WO2006/064461 WO 20060622
  • Main IPC: G06F7/38
  • IPC: G06F7/38
Arithmetic or logical operation tree computation
Abstract:
A method of computing at least a first and a second tree of arithmetic or logical operations on a microprocessor comprising at least n parallel processing elements. The method comprises: a) executing (in 48) n arithmetic or logical operations of a first iteration of the first tree in parallel using the n processing elements, then b) executing (in 66) m arithmetic or logical operations in parallel between the results of the first iteration, using m processing elements chosen from the n processing element used for the computation of the first iteration, the other n−m processing element being unused for the computation of the second iteration. In parallel with the computation of the second iteration of the first tree, the method comprises executing (in 66) k arithmetic or logical operations of the second tree in parallel using k processing elements chosen from the n−m processing elements unused for the computation of the second iteration of the first tree.
Public/Granted literature
Information query
Patent Agency Ranking
0/0