Journal of Fourier Analysis and Applications

, Volume 15, Issue 4, pp 488–501 | Cite as

Painless Reconstruction from Magnitudes of Frame Coefficients

  • Radu Balan
  • Bernhard G. Bodmann
  • Peter G. Casazza
  • Dan Edidin


The goal of this paper is to develop fast algorithms for signal reconstruction from magnitudes of frame coefficients. This problem is important to several areas of research in signal processing, especially speech recognition technology, as well as state tomography in quantum theory. We present linear reconstruction algorithms for tight frames associated with projective 2-designs in finite-dimensional real or complex Hilbert spaces. Examples of such frames are two-uniform frames and mutually unbiased bases, which include discrete chirps. The number of operations required for reconstruction with these frames grows at most as the cubic power of the dimension of the Hilbert space. Moreover, we present a very efficient algorithm which gives reconstruction on the order of d operations for a d-dimensional Hilbert space.


Frames Reconstruction without phase Projective 2-designs 

Mathematics Subject Classification (2000)

42C15 05B20 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Appleby, D.M.: Symmetric informationally complete-positive operator valued measures and the extended Clifford group. J. Math. Phys. 46(5), 052107 (2005) CrossRefMathSciNetGoogle Scholar
  2. 2.
    Balan, R., Casazza, P., Edidin, D.: On signal reconstruction without phase. Appl. Comput. Harmon. Anal. 20, 345–356 (2006) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Balan, R., Casazza, P., Edidin, D.: Equivalence of reconstruction from the absolute value of the frame coefficients to a sparse representation problem. IEEE Signal Process. Lett. 14, 341–343 (2007) CrossRefGoogle Scholar
  4. 4.
    Bandyopadhyay, S., Boykin, P.O., Roychowdhury, V., Vatan, F.: A new proof for the existence of mutually unbiased bases. Algorithmica 34(4), 512–528 (2002). Quantum computation and quantum cryptography MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bodmann, B.G.: Optimal linear transmission by loss-insensitive packet encoding. Appl. Comput. Harmon. Anal. 22, 274–285 (2007) MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bodmann, B.G., Paulsen, V.I.: Frames, graphs and erasures. Linear Algebra Appl. 404, 118–146 (2005) MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Boykin, P.O., Sitharam, M., Tiep, P.H., Wocjan, P.: Mutually unbiased bases and orthogonal decompositions of Lie algebras. Quantum Inf. Comput. 7, 371–382 (2007) MATHMathSciNetGoogle Scholar
  8. 8.
    Calderbank, A.R., Cameron, P.J., Kantor, W.M., Seidel, J.J.: Z 4-Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. Lond. Math. Soc. (3) 75(2), 436–480 (1997) MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Casazza, P., Kovačević, J.: Equal-norm tight frames with erasures. Adv. Comput. Math. 18, 387–430 (2003) MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Casazza, P.G., Kutyniok, G.: Frames of subspaces. In: Wavelets, Frames and Operator Theory. Contemp. Math., vol. 345, pp. 87–113. Am. Math. Soc., Providence (2004) Google Scholar
  11. 11.
    Casazza, P.G., Fickus, M.: Fourier transforms of finite chirps. EURASIP J. Appl. Signal Process. 2006, 1–7 (2006). Frames and overcomplete representations in signal processing, communications, and information theory MathSciNetGoogle Scholar
  12. 12.
    Casazza, P.G., Kutyniok, G.: Robustness of fusion frames under erasures of subspaces and of local frame vectors. In: Grinberg, E.L., Larson, D., Jorgensen, P.E.T., (eds.) Radon Transforms, Geometry, and Wavelets, New Orleans, LA, 2006. Contemp. Math., vol. 464, pp. 149–160. Am. Math. Soc., Providence (2008) Google Scholar
  13. 13.
    Casazza, P.G., Kutyniok, G., Li, S.: Fusion frames and distributed processing. Appl. Comput. Harmon. Anal. 25, 114–132 (2008) MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Cameron, P.J., Seidel, J.J.: Quadratic forms over GF(2). Indag. Math. 35, 1–8 (1973) MathSciNetGoogle Scholar
  15. 15.
    Chaturvedi, S.: Aspects of mutually unbiased bases in odd-prime-power dimension. Phys. Rev. A 65, 0044301 (2002) CrossRefGoogle Scholar
  16. 16.
    Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedic. 6(3), 363–388 (1977) MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Finkelstein, J.: Pure-state informationally complete and “really” complete measurements. Phys. Rev. A 70, 052107 (2004) CrossRefMathSciNetGoogle Scholar
  18. 18.
    Flammia, S.T., Silberfarb, A., Caves, C.M.: Minimal informationally complete measurements for pure states. Found. Phys. 35(12), 1985–2006 (2005) MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Godsil, C., Roy, A.: Equiangular lines, mutually unbiased bases and spin models. Eur. J. Comb. 30, 246–262 (2009) MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Goyal, V.K., Kovačević, J., Kelner, J.A.: Quantized frame expansions with erasures. Appl. Comput. Harmon. Anal. 10, 203–233 (2001) MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Hayes, M.H., Lim, J.S., Oppenheim, A.V.: Signal reconstruction from phase and magnitude. IEEE Trans. Acoust. Speech Signal Process. 28(6), 672–680 (1980) MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Hoggar, S.G.: t-designs in projective spaces. Eur. J. Comb. 3, 233–254 (1982) MATHMathSciNetGoogle Scholar
  23. 23.
    Howard, S.D., Calderbank, A.R., Moran, W.: The finite Heisenberg-Weyl groups in radar and communications. EURASIP J. Appl. Signal Process. 2006, 1–12 (2006). Special issue on “Frames and overcomplete representations in signal processing, communications, and information theory” MathSciNetGoogle Scholar
  24. 24.
    Holmes, R., Paulsen, V.I.: Optimal frames for erasures. Linear Algebra Appl. 377, 31–51 (2004) MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Kovačević, J., Dragotti, P.L., Goyal, V.K.: Filter bank frame expansions with erasures. IEEE Trans. Inf. Theory 48, 1439–1450 (2002) MATHCrossRefGoogle Scholar
  26. 26.
    Klappenecker, A., Rötteler, M.: Mutually unbiased bases are complex projective 2-designs. In: Proc. Int. Symp. on Inf. Theory, pp. 1740–1744. IEEE Press, New York (2005) Google Scholar
  27. 27.
    Levenshtein, V.I.: On designs in compact metric spaces and a universal bound on their size. Discrete Math. 192, 251–271 (1998) MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Lemmens, P.W.H., Seidel, J.J.: Equiangular lines. J. Algebra 24, 494–512 (1973) MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Lyubich, Yu.I.: On tight projective designs. E-print: math/0703526 (2007)
  30. 30.
    Nawab, H., Quatieri, T.F., Lim, J.S.: Signal reconstruction from the short-time Fourier transform magnitude. In: Proceedings of ICASSP’82, vol. 7, pp. 1046–1048 (1982) Google Scholar
  31. 31.
    Neumaier, A.: Combinatorial configurations in terms of distances. Memorandum 81-09 (Wiskunde), Eindhoven Univ. Technol. (1981) Google Scholar
  32. 32.
    Renes, J.M., Blume-Kohout, R., Scott, A.J., Caves, C.M.: Symmetric informationally complete quantum measurements. J. Math. Phys. 45(6), 2171–2180 (2004) MATHCrossRefMathSciNetGoogle Scholar
  33. 33.
    Scott, A.J.: Tight informationally complete quantum measurements. J. Phys. A Math. Gen. 39(43), 13507–13530 (2006) MATHCrossRefGoogle Scholar
  34. 34.
    Strohmer, T., Heath, R.: Grassmannian frames with applications to coding and communications. Appl. Comput. Harmon. Anal. 14, 257–275 (2003) MATHCrossRefMathSciNetGoogle Scholar
  35. 35.
    van Lint, J.H., Seidel, J.J.: Equilateral point sets in elliptic geometry. Indag. Math. 28, 335–348 (1966) Google Scholar
  36. 36.
    Vale, R., Waldron, S.: Tight frames and their symmetries. Constr. Approx. 21(1), 83–112 (2005) MATHMathSciNetGoogle Scholar
  37. 37.
    Wootters, W.K., Fields, B.D.: Optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2), 363–381 (1989) CrossRefMathSciNetGoogle Scholar

Copyright information

© Birkhäuser Boston 2009

Authors and Affiliations

  • Radu Balan
    • 1
  • Bernhard G. Bodmann
    • 2
  • Peter G. Casazza
    • 3
  • Dan Edidin
    • 3
  1. 1.Mathematics Department and CSCAMMUniversity of MarylandCollege ParkUSA
  2. 2.Department of MathematicsUniversity of HoustonHoustonUSA
  3. 3.Department of MathematicsUniversity of MissouriColumbiaUSA

Personalised recommendations