✦ LIBER ✦

Efficient state encoding algorithm based on hypercube construction

✍ Scribed by Park, S.-S.; Kyung, C.-M.; Hwang, S.-H.

Book ID: 114448178
Publisher: The Institution of Electrical Engineers
Year: 1995
Tongue: English
Weight: 599 KB
Volume: 142
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19951752

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Perfect Load

An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors

✍ Gene Eu Jan; Yuan-Shin Hwang 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 111 KB

An efficient permutation-based parallel

An efficient permutation-based parallel algorithm for range-join in hypercubes

✍ Hong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Routing algorithms on the bus-based hype

Routing algorithms on the bus-based hypercube network

✍ Lee-juan Fan; Chang-biau Yang; Shyue-horng Shiau 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 804 KB

Efficient quantum algorithms to construc

Efficient quantum algorithms to construct arbitrary Dicke states

✍ Kaushik Chakraborty,Byung-Soo Choi,Arpita Maitra… 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 372 KB

Efficient mapping and implementation of

Efficient mapping and implementation of matrix algorithms on a hypercube

✍ Vladimir Cherkassky; Ross Smith 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 864 KB

An Efficient Algorithm for Gray-to-Binar

An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes

✍ C.T. Ho; M.T. Raghunath; S.L. Johnsson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Both Gray code and binary code are frequently used in mapping arrays into hypercube architectures. While the former is preferred when communication between adjacent array elements is needed, the latter is preferred for FFT-type communication. When different phases of computations have different type