• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1990 Fiscal Year Final Research Report Summary

Study of Bio-Simulation on Binary-Tree Multiprocessor

Research Project

Project/Area Number 63580028
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field Informatics
Research InstitutionThe University of Tokushima

Principal Investigator

TAKAHASHI Yoshizo  The University of Tokushima Information Science and Intelligent systems protessor., 工学部, 教授 (90116830)

Project Period (FY) 1988 – 1990
Keywordsparallel processing / binary-tree computer / parallel pattern recognition / bio-simulation / parallel wire-routing / competing processor / parallel speech recognition / parallel character recognition
Research Abstract

(1) We have improved the parallel speech recognition system developed in 1989 by adding DSP (digital signal processor) to carry out computations for correlation and DP matching. With this improvement and, by removing redundant computations, We obtained more than 20 times increase in recognition speed. As it is necessary to increase the number of filter banks to attain higher recognition rate, the required computation time will be suppressed with this improvement.
(2) We have implemented a hand-printed Kanji character recognition system based on biosimulation on our binary-tree multiprocessor Coral 68K and evaluated its performance. In this system a number of processors extract many different strokes from an input Kanji character and, by communicating each other, find the character that has the disposition of the strokes as described in their individual dictionary. In our experiment more than 90% of hand-written Knaji characters composed of less than five strokes were recognized successfully. This method will be applicable to the image recognition system.
(3) The wire-routing problem is to connect all terminals in pair which are distributed on a plane with the wires which never intersect each other. When there are many terminals the computation time to find the paths of the wires becomes prohibitively large. As the wirerouting is a strongly sequential problem, the parallel processing of it has been considered very difficult. Therefore we have applied the bio-simulation to this problem and developed a new parallel processing scheme which we call parallel processing with competing processors. This algorithm is implemented on Coral 68K and a satisfactory performance was obtained.

  • Research Products

    (4 results)

All Other

All Publications (4 results)

  • [Publications] 高橋 義造,佐々木 茂高: "競合プロセッサ群による配線問題の並列処理" 情報処理学会マ-キテクチャ研究報告. 90ーARCー82. 82-7 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Yoshizo Takahashi and Shigetaka Sasaki: "Parallel Automated WireーRouting with a Number of Competing Processors" Proc.ACM International Conf.on Supercomputing. 310-317 (1990)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Yoshizo Takahashi, Shigetaka Sasaki: "Parallel Processing of Wire-Routing Problem with Competing Processors" Technical Report of IPSJ. Vol. 90, No. 29, 90-ARC-82, 82-7. 1-8 (1990)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Yoshizo Takahashi, Shigetaka Sasaki: "Parallel Automated Wire-Routing with a Number of Competing Processors" Proc. ACM International Conf. on Supercomputing. 310-317 (1990)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1993-08-12  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi