- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Maximum likelihood detection for DS-CDMA using Gr\{o}bner bases" (in Japanese) |
|---|---|
| Authors | Shunsuke Horii 、Tota Suko 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2010 |
| Format | Conference |
| Category | Others |
| Jounal Name | Proceedings of the 33th Symposium on Information Theory and its Applications |
| Jounal Page | pp.489-493 |
| Published Year | 2010 |
| Published Month | 12 |
| Abstract （English） |
Maximum likelihood (ML) multiuser detection for the direct sequence code division multiple access (DSCDMA) channel is known to be NP-hard, i.e., its computational complexity increase exponentially with the number of users. Since the ML multiuser detection can be regarded as an integer quadratic programming, some optimization algorithms have been used to tackle the problem. Conti and Traverso have proposed an efficient algorithm to solve integer programming based on the Grobner bases. Conti- Traverso algorithm is originally used to solve the integer linear programming, we can not apply the algorithm to the multiuser detection problem in a straight-forward manner. On the other hand, Ikegami et. al. extended the Conti-Traverso algorithm to solve the integer linear programming with modulo arithmetic conditions. In this paper, we transform the ML multiuser detection problem into the integer linear programming with modulo arithmetic conditions and propose the multiuser detection algorithm based on the extended Conti-Traverso algorithm. |
| Note （English） |
1 |
| Manuscript |
 Download
|
| Presentation |
