IEICE TRANSACTIONS on Fundamentals
Multiuser Detection Useng a Hopfield Network for Asynchronous Code-Division Multiple-Access Systems
Summary :
In this paper, a multiuser receiver using a Hopfield network (Hopfield network receiver) for asynchronous codedivision multiple-access systems is proposed. We derive a novel likelihood function for the optimum demodulation of a data subsequence whose length is far shorter than that of the entire transmitted data sequence. It is shown that a novel Hopfield network receiver can be derived by exploiting the likelihood function, and the derived receiver leads to a low complexity receiver. The structure of the proposed receiver consists of a bank of correlators and a Hopfield network where the number of units is proportional to both the number of users and the length of a data sequence demodulated at a time. Computer simulation results are presented to compare the performance of the proposed receiver with those of the conventional multiuser detectors. It is shown that the proposed receiver significantly outperforms the correlation receiver, decorrelating detector and multistage detector, and provides suboptimum performnace.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.12 pp.1963-1971
- Publication Date
- 1996/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Secton on Spread Spectrum Techniques and Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Teruyuki MIYAJIMA, Takaaki HASEGAWA, "Multiuser Detection Useng a Hopfield Network for Asynchronous Code-Division Multiple-Access Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 12, pp. 1963-1971, December 1996, doi: .
Abstract: In this paper, a multiuser receiver using a Hopfield network (Hopfield network receiver) for asynchronous codedivision multiple-access systems is proposed. We derive a novel likelihood function for the optimum demodulation of a data subsequence whose length is far shorter than that of the entire transmitted data sequence. It is shown that a novel Hopfield network receiver can be derived by exploiting the likelihood function, and the derived receiver leads to a low complexity receiver. The structure of the proposed receiver consists of a bank of correlators and a Hopfield network where the number of units is proportional to both the number of users and the length of a data sequence demodulated at a time. Computer simulation results are presented to compare the performance of the proposed receiver with those of the conventional multiuser detectors. It is shown that the proposed receiver significantly outperforms the correlation receiver, decorrelating detector and multistage detector, and provides suboptimum performnace.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_12_1963/_p
Copy
@ARTICLE{e79-a_12_1963,
author={Teruyuki MIYAJIMA, Takaaki HASEGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multiuser Detection Useng a Hopfield Network for Asynchronous Code-Division Multiple-Access Systems},
year={1996},
volume={E79-A},
number={12},
pages={1963-1971},
abstract={In this paper, a multiuser receiver using a Hopfield network (Hopfield network receiver) for asynchronous codedivision multiple-access systems is proposed. We derive a novel likelihood function for the optimum demodulation of a data subsequence whose length is far shorter than that of the entire transmitted data sequence. It is shown that a novel Hopfield network receiver can be derived by exploiting the likelihood function, and the derived receiver leads to a low complexity receiver. The structure of the proposed receiver consists of a bank of correlators and a Hopfield network where the number of units is proportional to both the number of users and the length of a data sequence demodulated at a time. Computer simulation results are presented to compare the performance of the proposed receiver with those of the conventional multiuser detectors. It is shown that the proposed receiver significantly outperforms the correlation receiver, decorrelating detector and multistage detector, and provides suboptimum performnace.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Multiuser Detection Useng a Hopfield Network for Asynchronous Code-Division Multiple-Access Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1963
EP - 1971
AU - Teruyuki MIYAJIMA
AU - Takaaki HASEGAWA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1996
AB - In this paper, a multiuser receiver using a Hopfield network (Hopfield network receiver) for asynchronous codedivision multiple-access systems is proposed. We derive a novel likelihood function for the optimum demodulation of a data subsequence whose length is far shorter than that of the entire transmitted data sequence. It is shown that a novel Hopfield network receiver can be derived by exploiting the likelihood function, and the derived receiver leads to a low complexity receiver. The structure of the proposed receiver consists of a bank of correlators and a Hopfield network where the number of units is proportional to both the number of users and the length of a data sequence demodulated at a time. Computer simulation results are presented to compare the performance of the proposed receiver with those of the conventional multiuser detectors. It is shown that the proposed receiver significantly outperforms the correlation receiver, decorrelating detector and multistage detector, and provides suboptimum performnace.
ER -
English
