Sigma-delta quantization errors and the traveling salesman problem

Advances in Computational Mathematics

Volumn 28, Issue 2, 2008, Pages 101-118

  Wang, Yang ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Frames; PCM; Peano space filling curve; Quantization; Sigma delta modulation; Traveling salesman problem

Indexed keywords

EID: 38549084687     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10444-006-9016-1     Document Type: Article

References (24)

1. Beardwood, J., Halton, J., Hammersley, J.M.: The shortest path through many points. Proc. Camb. Philos. Soc. 55, 299-327 (1959)
2. Benedetto, J., Fickus, M.: Finite normalized tight frames. Adv. Comput. Math. 18, 357-385 (2003)
3. Benedetto, J., Powell, A.M., YIlmaz, Ö.: Sigma-delta (Σ Δ) quantization and finite frames. IEEE Trans. Inform. Theory 52, 1990-2005 (2006)
4. Benedetto, J., Powell, A.M., YIlmaz, Ö.: Second order sigma-delta (Σ Δ) quantization of finite frame expansions. Appl. Comput. Harmon. Anal. 20, 126-148 (2006)
5. Bennett, W.: Spectra of quantized signals. Bell Syst. Tech. J. 27, 446-472 (1948)
6. Casazza, P.G., Kovačević, J.: Uniform tight frames with erasures. Adv. Comput. Math. 18, 387-430 (2003)
7. Daubechies, C.I., DeVore, R.: Reconstructing a bandlimited function from very coarsely quantized data: A family of stable sigma-delta modulators of arbitrary order. Ann. Math. 158(2), 679-710 (2003)
8. Duffin, R.J., Schaeffer, A.C.: A class of nonharmonic Fourier series. Trans. Am. Math. Soc. 72, 341-366 (1952)
9. Feng, D.J., Wang, L., Wang, Y.: Generation of finite tight frames by Householder transformations. Adv. Comput. Math. 24, 297-309 (2006)
10. Few, L.: The shortest path and the shortest road through n points. Mathematika 2, 141-144 (1955)
11. Gao, J., Steele, J.M.: Sums of squares of edge lengths and spacefilling curve heuristics for the traveling salesman problem. SIAM J. Discrete Math. 7(2), 314-324 (1994)
12. Goddyn, L.: Quantizers and the worst-case Euclidean traveling salesman problem. J. Comb. Theory, Ser. B 50(1), 65-81 (1990)
13. Goyal, V.K., Kovačević, J., Kelner, J.: Quantized frame expansions with erasures. Appl. Comput. Harmon. Anal. 10, 203-233 (2001)
14. N: analysis, synthesis, and algorithms. IEEE Trans. Inf. Theory 44, 16-31 (1998)
15. Gray, R.: Quantized noise spectra. IEEE Trans. Inf. Theory 36(6), 1220-1244 (1990)
16. Güntürk, S.: Approximating a bandlimited function using very coarsely quantized data. J. Am. Math. Soc. 17, 229-242 (2004)
17. Jimenez, D., Wang, L., Wang, Y.: PCM quantization errors and the white noise hypothesis. submitted to SIAM J. Math. Anal.
18. Milne, S.: Peano curves and smoothness of functions. Adv. Math. 35(2), 129-157 (1980)
19. Moran, S.: On the length of optimal TSP circuits in sets of bounded diameter. J. Comb. Theory, Ser. B 37(2), 113-141 (1984)
20. Newman, D.J.: A Problem Seminar. Springer, Berlin Heidelberg New York (1982)
21. Rath, G., Guillemot, C.: Recent advances in DFT codes based on quantized finite frame expansions with erasure channels. Elsevier J. Digit. Signal Process. 14(4), 332-354 (July 2004)
22. Snyder, T., Steele, J.M.: A priori bounds on the Euclidean traveling salesman. SIAM J. Comput. 24(3), 665-671 (1995)
23. Steele, J.M.: Probabilistic Theory and Combinatorial Optimization. SIAM, Philadelphia (1997)
24. Thao, N., Vetterli, M.: Deterministic analysis of oversampled A/D conversion and decoding improvement based on consistent estimate. IEEE Trans. Signal Process 42(3), 519-531 (1994)