Abstract
In previous work, we proposed the positive diagonal values (PDV) criterion, which is an exact-ML criterion of semidefinite relaxation (SDR) optimality condition. In this paper, we apply the PDV criterion to the tree-searching based MIMO detection by two ways. The first application is node-pruning algorithm for depth first search such as sphere decoding (SD). The proposed node-pruning algorithm using PDV criterion is not based on the Euclidean distance mostly used for node-pruning algorithm, instead, it uses an absolute test in each node so that it can be worked independently with many existing node-pruning algorithms. Furthermore, the proposed node-pruning algorithm can guarantee the exact-ML performance and reduce the number of nodes visited significantly. The second application is K-best algorithm of breadth first search. The proposed K-best algorithm takes K candidates at each stage based on PDV criterion. As a result, the proposed K-best algorithm can achieve near-ML performance.
| Original language | English |
|---|---|
| Title of host publication | 2014, 8th International Conference on Signal Processing and Communication Systems, ICSPCS 2014 - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781479952557 |
| DOIs | |
| Publication status | Published - 2014 Jan 23 |
| Event | 8th International Conference on Signal Processing and Communication Systems, ICSPCS 2014 - Gold Coast, Australia Duration: 2014 Dec 15 → 2014 Dec 17 |
Other
| Other | 8th International Conference on Signal Processing and Communication Systems, ICSPCS 2014 |
|---|---|
| Country | Australia |
| City | Gold Coast |
| Period | 14/12/15 → 14/12/17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Signal Processing
- Electrical and Electronic Engineering
Cite this
}
Applications of SDR exact-ML criterion to tree-searching detection for MIMO systems. / Kim, Minjoon; Kim, Jaeseok.
2014, 8th International Conference on Signal Processing and Communication Systems, ICSPCS 2014 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. 7021135.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Applications of SDR exact-ML criterion to tree-searching detection for MIMO systems
AU - Kim, Minjoon
AU - Kim, Jaeseok
PY - 2014/1/23
Y1 - 2014/1/23
N2 - In previous work, we proposed the positive diagonal values (PDV) criterion, which is an exact-ML criterion of semidefinite relaxation (SDR) optimality condition. In this paper, we apply the PDV criterion to the tree-searching based MIMO detection by two ways. The first application is node-pruning algorithm for depth first search such as sphere decoding (SD). The proposed node-pruning algorithm using PDV criterion is not based on the Euclidean distance mostly used for node-pruning algorithm, instead, it uses an absolute test in each node so that it can be worked independently with many existing node-pruning algorithms. Furthermore, the proposed node-pruning algorithm can guarantee the exact-ML performance and reduce the number of nodes visited significantly. The second application is K-best algorithm of breadth first search. The proposed K-best algorithm takes K candidates at each stage based on PDV criterion. As a result, the proposed K-best algorithm can achieve near-ML performance.
AB - In previous work, we proposed the positive diagonal values (PDV) criterion, which is an exact-ML criterion of semidefinite relaxation (SDR) optimality condition. In this paper, we apply the PDV criterion to the tree-searching based MIMO detection by two ways. The first application is node-pruning algorithm for depth first search such as sphere decoding (SD). The proposed node-pruning algorithm using PDV criterion is not based on the Euclidean distance mostly used for node-pruning algorithm, instead, it uses an absolute test in each node so that it can be worked independently with many existing node-pruning algorithms. Furthermore, the proposed node-pruning algorithm can guarantee the exact-ML performance and reduce the number of nodes visited significantly. The second application is K-best algorithm of breadth first search. The proposed K-best algorithm takes K candidates at each stage based on PDV criterion. As a result, the proposed K-best algorithm can achieve near-ML performance.
UR - http://www.scopus.com/inward/record.url?scp=84988273919&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84988273919&partnerID=8YFLogxK
U2 - 10.1109/ICSPCS.2014.7021135
DO - 10.1109/ICSPCS.2014.7021135
M3 - Conference contribution
AN - SCOPUS:84988273919
BT - 2014, 8th International Conference on Signal Processing and Communication Systems, ICSPCS 2014 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
ER -