The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
안전성이 뛰어난 지능형 자동차를 구현하려면 고속 충돌 감지가 중요합니다. 충돌 감지에서는 차량 표면의 개별 지점과 실제 환경의 장애물 간의 매칭 작업을 수행하기 위해 높은 컴퓨팅 성능이 필요합니다. 최고의 성능을 달성하기 위해 대략적 표현과 미세 표현이라는 두 가지 표현을 기반으로 계층적 매칭 방식이 제안됩니다. 차량은 미세한 표현(미세한 직사각형 고체), 직사각형 입체의 집합이기도 한 거친 표현은 미세한 표현을 확대하여 생성됩니다. 거친 표현에서 장애물 이산점과 직사각형 솔리드 사이에 충돌이 발생하는 경우(거친 직사각형 고체), 그러면 거친 고체에 포함된 미세한 직사각형 고체만 확인하는 것으로 충분합니다. 결과적으로, 다른 미세한 직사각형 솔리드에 대한 검사는 생략될 수 있습니다. 계층적 매칭 작업을 병렬로 수행하기 위해 HCAM(Hierarchically-Content-Addressable Memory)이 제안되었습니다. 서로 다른 거친 솔리드에 포함된 미세한 직사각형 솔리드와 병렬로 매칭 작업을 수행할 필요가 없기 때문에 미세한 솔리드가 매칭 단위에 매핑됩니다. 결과적으로 성능 저하 없이 매칭 유닛의 수를 줄일 수 있다. 동일한 실행 시간 조건에서 HCAM의 면적은 계층적 매칭 방식을 사용하지 않은 기존 CAM에 비해 46.4%로 감소되었습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Masanori HARIYAMA, Kazuhiro SASAKI, Michitaka KAMEYAMA, "Collision Detection VLSI Processor for Intelligent Vehicles Using a Hierarchically-Content-Addressable Memory" in IEICE TRANSACTIONS on Electronics,
vol. E82-C, no. 9, pp. 1722-1729, September 1999, doi: .
Abstract: High-speed collision detection is important to realize a highly-safe intelligent vehicle. In collision detection, high-computational power is required to perform matching operation between discrete points on surfaces of a vehicle and obstacles in real-world environment. To achieve the highest performance, a hierarchical matching scheme is proposed based on two representations: the coarse representation and the fine representation. A vehicle is represented as a set of rectangular solids in the fine representation (fine rectangular solids), and the coarse representation, which is also a set of rectangular solids, is produced by enlarging the fine representation. If collision occurs between an obstacle discrete point and a rectangular solid in the coarse representation (coarse rectangular solid), then it is sufficient to check the only fine rectangular solids contained in the coarse one. Consequently, checks for the other fine rectangular solids can be omitted. To perform the hierarchical matching operation in parallel, a hierarchically-content-addressable memory (HCAM) is proposed. Since there is no need to perform matching operation in parallel with fine rectangular solids contained in different coarse ones, the fine ones are mapped onto a matching unit. As a result, the number of matching units can be reduced without decreasing the performance. Under the condition of the same execution time, the area of the HCAM is reduced to 46.4% in comparison with that of the conventional CAM in which the hierarchical matching scheme is not used.
URL: https://global.ieice.org/en_transactions/electronics/10.1587/e82-c_9_1722/_p
부
@ARTICLE{e82-c_9_1722,
author={Masanori HARIYAMA, Kazuhiro SASAKI, Michitaka KAMEYAMA, },
journal={IEICE TRANSACTIONS on Electronics},
title={Collision Detection VLSI Processor for Intelligent Vehicles Using a Hierarchically-Content-Addressable Memory},
year={1999},
volume={E82-C},
number={9},
pages={1722-1729},
abstract={High-speed collision detection is important to realize a highly-safe intelligent vehicle. In collision detection, high-computational power is required to perform matching operation between discrete points on surfaces of a vehicle and obstacles in real-world environment. To achieve the highest performance, a hierarchical matching scheme is proposed based on two representations: the coarse representation and the fine representation. A vehicle is represented as a set of rectangular solids in the fine representation (fine rectangular solids), and the coarse representation, which is also a set of rectangular solids, is produced by enlarging the fine representation. If collision occurs between an obstacle discrete point and a rectangular solid in the coarse representation (coarse rectangular solid), then it is sufficient to check the only fine rectangular solids contained in the coarse one. Consequently, checks for the other fine rectangular solids can be omitted. To perform the hierarchical matching operation in parallel, a hierarchically-content-addressable memory (HCAM) is proposed. Since there is no need to perform matching operation in parallel with fine rectangular solids contained in different coarse ones, the fine ones are mapped onto a matching unit. As a result, the number of matching units can be reduced without decreasing the performance. Under the condition of the same execution time, the area of the HCAM is reduced to 46.4% in comparison with that of the conventional CAM in which the hierarchical matching scheme is not used.},
keywords={},
doi={},
ISSN={},
month={September},}
부
TY - JOUR
TI - Collision Detection VLSI Processor for Intelligent Vehicles Using a Hierarchically-Content-Addressable Memory
T2 - IEICE TRANSACTIONS on Electronics
SP - 1722
EP - 1729
AU - Masanori HARIYAMA
AU - Kazuhiro SASAKI
AU - Michitaka KAMEYAMA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Electronics
SN -
VL - E82-C
IS - 9
JA - IEICE TRANSACTIONS on Electronics
Y1 - September 1999
AB - High-speed collision detection is important to realize a highly-safe intelligent vehicle. In collision detection, high-computational power is required to perform matching operation between discrete points on surfaces of a vehicle and obstacles in real-world environment. To achieve the highest performance, a hierarchical matching scheme is proposed based on two representations: the coarse representation and the fine representation. A vehicle is represented as a set of rectangular solids in the fine representation (fine rectangular solids), and the coarse representation, which is also a set of rectangular solids, is produced by enlarging the fine representation. If collision occurs between an obstacle discrete point and a rectangular solid in the coarse representation (coarse rectangular solid), then it is sufficient to check the only fine rectangular solids contained in the coarse one. Consequently, checks for the other fine rectangular solids can be omitted. To perform the hierarchical matching operation in parallel, a hierarchically-content-addressable memory (HCAM) is proposed. Since there is no need to perform matching operation in parallel with fine rectangular solids contained in different coarse ones, the fine ones are mapped onto a matching unit. As a result, the number of matching units can be reduced without decreasing the performance. Under the condition of the same execution time, the area of the HCAM is reduced to 46.4% in comparison with that of the conventional CAM in which the hierarchical matching scheme is not used.
ER -