Abstract
This paper tackles a power minimization problem of interleave-division multiple-access (IDMA) systems over a fading multiple-access channel. The problem is minimizing the total power received by the receiver while keeping the bit error rates (BERs) of all users below a predefined value. The original formulation of the problem has highly nonlinear and implicitly defined functions, which render most existing optimization methods incapable. A new formulation is proposed in this paper, whose solution can effectively be obtained by a branch-and-bound (B&B) technique. An algorithm is devised based on B&B, and its effectiveness is also demonstrated by numerical experiments of systems with a moderate numbers of users. © 2008 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 3525-3537 |
| Journal | IEEE Transactions on Vehicular Technology |
| Volume | 57 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2008 |
Research Keywords
- Branch-and-bound (B&B)
- Code-division multiple access (CDMA)
- Interleave-division multiple access IDMA)
- Iterative multiuser detection (MUD)
- Optimization
- Power llocation
Fingerprint
Dive into the research topics of 'A branch-and-bound method for power minimization of IDMA'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver