Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form

@article{Papailiopoulos2008EfficientCO,
  title={Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form},
  author={Dimitris S. Papailiopoulos and George N. Karystinos},
  journal={2008 42nd Annual Conference on Information Sciences and Systems},
  year={2008},
  pages={1086-1090}
}
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of it, then it can be maximized in polynomial time. An algorithm for the efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary hyperspherical coordinates are introduced and the multi-dimensional space is partitioned into… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
14 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-2 of 2 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Efficient computation of the binary vector that maximizes a rank - deficient quadratic form , ” to appear in

  • A. P. Liavas
  • Proc . IEEE ICASSP
  • 2008

and K

  • V. Pauli, L. Lampe, R. Schober
  • Fukuda, “Multiplesymbol differential detection…
  • 2007
3 Excerpts

Digital Communications

  • J. G. Proakis
  • McGraw-Hill
  • 2000

Similar Papers

Loading similar papers…