Pages that link to "Item:Q5355699"
From MaRDI portal
The following pages link to On the complexity of sphere decoding in digital communications (Q5355699):
Displayed 7 items.
- A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
- Effect of one redundant parity-check equation on the stopping distance (Q2317393) (← links)
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems (Q2425858) (← links)
- The Diagonal Reduction Algorithm Using Fast Givens (Q2799575) (← links)
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection (Q4997173) (← links)