{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:19:11Z","timestamp":1648973951195},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0020-0190(87)90138-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"225-231","source":"Crossref","is-referenced-by-count":0,"title":["Time efficient systolic architecture for matrix vector multiplication"],"prefix":"10.1016","volume":"24","author":[{"given":"M.","family":"Zubair","sequence":"first","affiliation":[]},{"given":"B.B.","family":"Madan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90138-4_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The area-time complexity of binary multiplication","volume":"28","author":"Brent","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(87)90138-4_BIB2","first-page":"36","article-title":"Why systolic architectures","author":"Kung","year":"1982","journal-title":"IEEE Comput. Magazine"},{"key":"10.1016\/0020-0190(87)90138-4_BIB3","series-title":"Proc. Symp. on Sparse Matrix Computations and their Applications","first-page":"256","article-title":"Systolic arrays (for VLSI)","author":"Kung","year":"1978"},{"key":"10.1016\/0020-0190(87)90138-4_BIB4","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/0020-0190(87)90138-4_BIB5","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"key":"10.1016\/0020-0190(87)90138-4_BIB6","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1972"},{"key":"10.1016\/0020-0190(87)90138-4_BIB7","series-title":"Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI circuits","author":"Vuillemin","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:52:45Z","timestamp":1553579565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0020019087901384"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90138-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}