Pages that link to "Item:Q1825661"
From MaRDI portal
The following pages link to Computational complexity of optimum multiuser detection (Q1825661):
Displayed 8 items.
- Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel (Q469620) (← links)
- Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection (Q1411378) (← links)
- A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
- Optimizing revenue in CDMA networks under demand uncertainty (Q2462173) (← links)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340) (← links)
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection (Q4997173) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Adaptive Multiuser Detection (Q5227623) (← links)