Word-parallel coprocessor architecture for digital nearest Euclidean distance search

@article{Akazawa2013WordparallelCA,
  title={Word-parallel coprocessor architecture for digital nearest Euclidean distance search},
  author={Toshinobu Akazawa and Seiryu Sasaki and Hans Jx00FCrgen Mattausch},
  journal={2013 Proceedings of the ESSCIRC (ESSCIRC)},
  year={2013},
  pages={267-270}
}
The reported digital, word-parallel and scalable coprocessor architecture for nearest Euclidean distance (ED) search is based on mapping the distance into time domain onto an equivalent clock number. Area-efficient sequential square calculation and a minimization algorithm of the clock number necessary for the search are applied for practical efficiency. Experimental concept verification was done with an 180nm CMOS design implementing 32 reference vectors with 16 components and 8 bit per… CONTINUE READING
4 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Masahiro Yasuda

  • S. Sasaki
  • and H. J. Mattausch., ESSCIRC’2012, pp. 185-188
  • 2012
Highly Influential
4 Excerpts

Makoto Ikeda

  • Y. Oike
  • and Kunihiro Asada., CICC’2004, pp. 295- 298
  • 2004

H

  • Y. Yano, T. Koide
  • J. Mattausch., SSDM’2002, pp. 254-255
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…