An FPGA acceleration for the kd-tree search in photon mapping

Takuya Kuhara, Takaaki Miyajima, Masato Yoshimi, Hideharu Amano

研究成果: Conference contribution

6 被引用数 (Scopus)


Photon mapping is a kind of rendering techniques which enables depicting complicated light concentrations for 3D graphics. Searching kd-tree of photons with k-near neighbor search (k-NN) requires a large amount of computations. As k-NN search includes high degree of parallelism, the operation can be accelerated by GPU and recent multi-core microprocessors. However, memory access bottleneck will limit their computation speed. Here, as an alternative approach, an FPGA implementation of k-NN search operation in kd-tree is proposed. In the proposed design, we maximized the effective throughput of the block RAM by connecting multiple Query Modules to both ports of RAM. Furthermore, an implementation of the discovery process of the max distance which is not depending on the number of Estimate-Photons is proposed. Through the implementation on Spartan6, Virtex6 and Virtex7, it appears that 26 fundamental modules can be mounted on Virtex7. As a result, the proposed module achieved the throughput of approximately 282 times as that of software execution at maximum.

ホスト出版物のタイトルReconfigurable Computing
ホスト出版物のサブタイトルArchitectures, Tools, and Applications - 9th International Symposium, ARC 2013, Proceedings
出版ステータスPublished - 2013 4月 3
イベント9th International Symposium on Applied Reconfigurable Computing, ARC 2013 - Los Angeles, CA, United States
継続期間: 2013 3月 252013 3月 27


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7806 LNCS


Other9th International Symposium on Applied Reconfigurable Computing, ARC 2013
国/地域United States
CityLos Angeles, CA

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)


「An FPGA acceleration for the kd-tree search in photon mapping」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。