Abstract
The paper introduces algorithms that map single and multiple multilevel structures onto the hypercube. For the case of the pyramid, which is a special multilevel structure, it is shown that a new algorithm is a compromise among existing algorithms with regard to cost and performance. Comparative analysis of the algorithms is carried out using analytical techniques and simulation results.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 115-118 |
| Number of pages | 4 |
| Journal | IEE Proceedings E: Computers and Digital Techniques |
| Volume | 140 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jan 1 1993 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Engineering(all)