{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:19:37Z","timestamp":1694632777035},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[1985]]},"DOI":"10.1109\/tcom.1985.1096255","type":"journal-article","created":{"date-parts":[[2008,6,19]],"date-time":"2008-06-19T15:17:54Z","timestamp":1213888674000},"page":"1309-1314","source":"Crossref","is-referenced-by-count":9,"title":["Synchronous Tandem Algorithm for 32-kbit\/s ADPCM"],"prefix":"10.1109","volume":"33","author":[{"given":"M.","family":"Taka","sequence":"first","affiliation":[]},{"given":"R.","family":"Maruta","sequence":"additional","affiliation":[]},{"given":"A.","family":"Le Guyader","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1982.1171867"},{"key":"ref11","first-page":"969","article-title":"A low noise ADPCM-log PCM code converter","author":"murakami","year":"1979","journal-title":"Proc IEEE ISCAS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057548"},{"key":"ref13","first-page":"778","article-title":"Subjective performance evaluation of the 32 kbit\/s ADPCM algorithm","author":"suyderhoud","year":"1984","journal-title":"Proc IEEE Globecom"},{"key":"ref14","first-page":"786","article-title":"Objective test results of the 32 kbit\/s coder","author":"belfield","year":"1984","journal-title":"Proc IEEE Globecom"},{"key":"ref15","first-page":"1508","article-title":"Prevention of predictor mistracking in ADPCM coders","author":"miller","year":"1984","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1980.1170967"},{"key":"ref3","first-page":"239","article-title":"32 kb\/s ADPCM-DLQ coding for network applications","author":"petr","year":"1982","journal-title":"Proc IEEE Globecom"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1977.1162974"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1984.1164350"},{"key":"ref8","first-page":"774","article-title":"Overview of the 32 kbit\/s ADPCM algorithm","author":"daumer","year":"1984","journal-title":"Proc IEEE Globecom"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1979.1163283"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095504"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1982.1171868"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096255"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/23991\/01096255.pdf?arnumber=1096255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:42:02Z","timestamp":1638200522000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1096255\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":15,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcom.1985.1096255","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}