摘要
The branch-and-bound principle was applied to solve the equivalent nonlinear integer programming problem. A recursive formula for fast metric update was obtained by exploiting the intrinsic characteristic of the objective function. The impacts of reordering the data sequence and selective detection were addressed. By suggesting a preferred order and selective detection method, the detector complexity was greatly reduced while giving up little performance loss.
原文 | English |
---|---|
文章編號 | 1228212 |
頁(從 - 到) | 198 |
頁數 | 1 |
期刊 | IEEE International Symposium on Information Theory - Proceedings |
DOIs | |
出版狀態 | Published - 29 6月 2003 |
事件 | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, 日本 持續時間: 29 6月 2003 → 4 7月 2003 |