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
Kertas kerja ini mencadangkan aplikasi teknik pemultipleksan pembahagian kod kepada sistem VLSI yang bebas daripada masalah sambungan. Kami menggunakan ortogonal rawak pseudo m-pembawa jujukan sebagai pembawa maklumat boleh ganda untuk mencapai penghantaran data yang cekap. Menggunakan sifat ortogon bagi m-jujukan, kita boleh memultiplekskan beberapa aktiviti pengiraan ke dalam satu litar, dan melaksanakan secara selari menggunakan penghantaran data berganda dengan sambungan yang dikurangkan. Juga, rawak daripada m-jujukan menawarkan toleransi yang tinggi terhadap gangguan (jamming), dan penindasan julat isyarat dinamik sambil mengekalkan nisbah isyarat-ke-bunyi (SNR) yang mencukupi. Kami menunjukkan contoh aplikasi litar pengkomputeran multipleks, rangkaian saraf dan pemprosesan imej spektrum penyebaran untuk menunjukkan kelebihannya.
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.
Salinan
Yasushi YUMINAKA, Kazuhiko ITOH, Yoshisato SASAKI, Takafumi AOKI, Tatsuo HIGUCHI, "A Code-Division Multiplexing Technique for Efficient Data Transmission in VLSI Systems" in IEICE TRANSACTIONS on Electronics,
vol. E82-C, no. 9, pp. 1669-1677, September 1999, doi: .
Abstract: This paper proposes applications of a code-division multiplexing technique to VLSI systems free from interconnection problems. We employ a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier to achieve efficient data transmission. Using orthogonal property of m-sequences, we can multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. Also, randomness of m-sequences offers the high tolerance to interference (jamming), and suppression of dynamic range of signals while maintaining a sufficient signal-to-noise ratio (SNR). We demonstrate application examples of multiplex computing circuits, neural networks, and spread-spectrum image processing to show the advantages.
URL: https://global.ieice.org/en_transactions/electronics/10.1587/e82-c_9_1669/_p
Salinan
@ARTICLE{e82-c_9_1669,
author={Yasushi YUMINAKA, Kazuhiko ITOH, Yoshisato SASAKI, Takafumi AOKI, Tatsuo HIGUCHI, },
journal={IEICE TRANSACTIONS on Electronics},
title={A Code-Division Multiplexing Technique for Efficient Data Transmission in VLSI Systems},
year={1999},
volume={E82-C},
number={9},
pages={1669-1677},
abstract={This paper proposes applications of a code-division multiplexing technique to VLSI systems free from interconnection problems. We employ a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier to achieve efficient data transmission. Using orthogonal property of m-sequences, we can multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. Also, randomness of m-sequences offers the high tolerance to interference (jamming), and suppression of dynamic range of signals while maintaining a sufficient signal-to-noise ratio (SNR). We demonstrate application examples of multiplex computing circuits, neural networks, and spread-spectrum image processing to show the advantages.},
keywords={},
doi={},
ISSN={},
month={September},}
Salinan
TY - JOUR
TI - A Code-Division Multiplexing Technique for Efficient Data Transmission in VLSI Systems
T2 - IEICE TRANSACTIONS on Electronics
SP - 1669
EP - 1677
AU - Yasushi YUMINAKA
AU - Kazuhiko ITOH
AU - Yoshisato SASAKI
AU - Takafumi AOKI
AU - Tatsuo HIGUCHI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Electronics
SN -
VL - E82-C
IS - 9
JA - IEICE TRANSACTIONS on Electronics
Y1 - September 1999
AB - This paper proposes applications of a code-division multiplexing technique to VLSI systems free from interconnection problems. We employ a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier to achieve efficient data transmission. Using orthogonal property of m-sequences, we can multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. Also, randomness of m-sequences offers the high tolerance to interference (jamming), and suppression of dynamic range of signals while maintaining a sufficient signal-to-noise ratio (SNR). We demonstrate application examples of multiplex computing circuits, neural networks, and spread-spectrum image processing to show the advantages.
ER -