Advertisement

Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems

  • Valentin Gies
  • Thierry M. Bernard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3429)

Abstract

Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients to support regional computations. Asynchronism implies using combinatorial multi-input operators having an important hardware cost. To reduce it, we propose to use a connection network having a connectivity level greater than the mesh being mapped. This solution allows to use only 2-inputs asynchronous operators having a reduced hardware cost in each pixel. Examples and results will be presented on the examples of the regional sum algorithm computed over a 4-connectivity squared mesh connected with a 6-connectivity interconnection network, and the regional sum computed over a 6-connectivity squared mesh connected with a 8-connectivity interconnection network.

Keywords

Span Tree Interconnection Network Hardware Cost Single Instruction Multiple Data Full Adder 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Moini, A.: Vision Chips. Kluwer Academic Publishers, Dordrecht (2000) (ISBN: 0-7923-8664-7)Google Scholar
  2. 2.
    Paillet, F., Mercier, D., Bernard, T.: Second generation programmable artificial retina. In: IEEE ASIC/SOC Conf, pp. 304–309 (1999)Google Scholar
  3. 3.
    Li, H., Stout, Q.: Reconfigurable Massively Parallel Computers. Prentice-Hall, Englewood Cliffs (1991)Google Scholar
  4. 4.
    Komuro, T., Kagami, S., Ishikawa, M.: A dynamically reconfigurable simd processor for a vision chip. IEEE Journal of Solid-State Circuits 39, 265–268 (2004)CrossRefGoogle Scholar
  5. 5.
    Merigot, A.: Associative nets: A graph-based parallel computing net. IEEE Transactions on Computers 46, 558–571 (1997)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Dulac, D., Mohammadi, S., Merigot, A.: Implementation and evaluation of a parallel architecture using asynchronous communications. In: CAMP, pp. 106–111 (1995)Google Scholar
  7. 7.
    Ducourthial, B., Merigot, A.: Graph embedding in the associative mesh model. Technical Report TR-96-02 (1996)Google Scholar
  8. 8.
    Ducourthial, B., Mérigot, A.: Parallel asynchronous computations for image analysis. Proceedings of the IEEE 90, 1218–1228 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Valentin Gies
    • 1
  • Thierry M. Bernard
    • 1
  1. 1.ENSTAParisFrance

Personalised recommendations