{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:33:50Z","timestamp":1777646030963,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,10]]},"abstract":"\n In this article, we use the interval mathematics and targeted rounding by specific functions to establish a framework for interval quantization. The function approximation F\n Id<\/jats:sub>\n , that maps x to an interval [x\n 1<\/jats:sub>\n , x\n 2<\/jats:sub>\n ] such that x\n 1<\/jats:sub>\n is the largest floating point number less than or equal to x and x\n 2<\/jats:sub>\n is the smallest floating point number greater than or equal to x, is used to establish the sampling interval and the levels of interval quantization. We show that the interval quantization levels (N\n j<\/jats:sub>\n ) represent the specific quantization levels (n\n j<\/jats:sub>\n ), that are comparable, according to Kulisch- Miranker order and are disjoint two by two. If an interval signal X[n] intercepts a quantization interval level N\n j<\/jats:sub>\n , then the quantized signal will be X\n q<\/jats:sub>\n [n] = N\n j<\/jats:sub>\n . Moreover, for the interval quantization error (E[n] = X\n q<\/jats:sub>\n [n] \u2212 X[n]) an estimate is shown due to the quantization step and the number of levels. It is also presented the definition of interval coding, in which the number of required bits depends on the amount of quantization levels. Finally, in an example can be seen that the the interval quantization level represent the classical quantization levels and the interval error represents the classical quantization error.\n <\/jats:p>","DOI":"10.3233\/fi-2011-593","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T01:03:47Z","timestamp":1735866227000},"page":"337-363","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for Interval Quantization and Application to Interval Based Algorithms in Digital Signal Processing"],"prefix":"10.1177","volume":"112","author":[{"given":"Fabiana T.","family":"Santana","sequence":"first","affiliation":[{"name":"Federal Institute for Education, Science and Technology of Rio Grande do Norte \u2013 IFRN, Brazil. fabiana.santana@ifrn.edu.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1gner L.","family":"Santana","sequence":"additional","affiliation":[{"name":"Federal University of Rio Grande do Norte \u2013 UFRN, Brazil. fagner@ccet.ufrn.br, anamaria@dca.ufrn.br, adriao@dca.ufrn.br, regivan@dimap.ufrn.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Maria G.","family":"Guerreiro","sequence":"additional","affiliation":[{"name":"Federal University of Rio Grande do Norte \u2013 UFRN, Brazil. fagner@ccet.ufrn.br, anamaria@dca.ufrn.br, adriao@dca.ufrn.br, regivan@dimap.ufrn.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e3o D.","family":"D\u00f3ria Neto","sequence":"additional","affiliation":[{"name":"Federal University of Rio Grande do Norte \u2013 UFRN, Brazil. fagner@ccet.ufrn.br, anamaria@dca.ufrn.br, adriao@dca.ufrn.br, regivan@dimap.ufrn.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Regivan H. N.","family":"Santiago","sequence":"additional","affiliation":[{"name":"Federal University of Rio Grande do Norte \u2013 UFRN, Brazil. fagner@ccet.ufrn.br, anamaria@dca.ufrn.br, adriao@dca.ufrn.br, regivan@dimap.ufrn.br"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,10,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-593","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:34:06Z","timestamp":1777444446000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.3233\/FI-2011-593"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-593","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}