{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:36Z","timestamp":1759190796142,"version":"3.44.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0167-9260(02)00020-2","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T17:20:56Z","timestamp":1039540856000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bit-level two's complement matrix multiplication"],"prefix":"10.1016","volume":"33","author":[{"given":"Radhika S.","family":"Grover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijia","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1994","series-title":"Computer Arithmetic Systems: Algorithms, Architecture and Implementations","author":"Omondi","key":"10.1016\/S0167-9260(02)00020-2_BIB1"},{"issue":"3","key":"10.1016\/S0167-9260(02)00020-2_BIB2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/71.139208","article-title":"On mapping of uniform dependence algorithms into lower dimensional processor arrays","volume":"3","author":"Shang","year":"1992","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB3","doi-asserted-by":"crossref","unstructured":"Z. Yang, W. Shang, J.A.B. Fortes, Conflict-free scheduling of nested loop algorithms on lower dimensional processor arrays, Proceedings of the Sixth IEEE International Parallel Processing Symposium, Beverly Hills, CA, March 1992, pp. 156\u2013164.","DOI":"10.1109\/IPPS.1992.223054"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB4","doi-asserted-by":"crossref","unstructured":"W. Shang, B.W. Wah, Dependence analysis and architecture design for bit-level algorithms, Proceedings of International Conference on Parallel Processing, Vol. 1, 1993, pp. 30\u201338.","DOI":"10.1109\/ICPP.1993.68"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB5","doi-asserted-by":"crossref","unstructured":"R. Grover, W. Shang, Q. Li, A comparison of FPGA implementations of bit-level and word-level matrix multipliers, Proceedings of the Tenth International Conference on Field-Programmable Logic and Applications, FPL 2000, Villach, Austria, August 2000, pp. 422\u2013431.","DOI":"10.1007\/3-540-44614-1_45"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB6","unstructured":"R. Grover, W. Shang, Q. Li, An improved architecture for bit-level matrix multiplication, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. IV, PDPTA \u20192000, Las Vegas, Nevada, June 2000, pp. 2257\u20132264."},{"key":"10.1016\/S0167-9260(02)00020-2_BIB7","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/T-C.1973.223648","article-title":"A two's complement parallel array multiplication algorithm","volume":"C-22","author":"Baugh","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00020-2_BIB8","doi-asserted-by":"crossref","unstructured":"A.D. Booth, A signed binary multiplication technique, Quart. J. Mech. Appl. Math. (4) (1951) 236\u2013240.","DOI":"10.1093\/qjmam\/4.2.236"},{"issue":"2","key":"10.1016\/S0167-9260(02)00020-2_BIB9","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","article-title":"A suggestion for a fast multiplier","volume":"13","author":"Wallace","year":"1964","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00020-2_BIB10","unstructured":"L. Dadda, Some schemes for parallel multiplier, Alta Frequenza, Vol. 34, March 1965, pp. 349\u2013356."},{"issue":"11","key":"10.1016\/S0167-9260(02)00020-2_BIB11","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1109\/12.61047","article-title":"Fast multiplication without carry-propagate addition","volume":"39","author":"Ercegovac","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(02)00020-2_BIB12","unstructured":"P.F. Stelling, V.G. Oklobdzija, Optimal designs for multipliers and multiply-accumulators, Proceedings of the 15th IMACS World Congress Scientific Computation, Modeling, and Applied Mathematics, August 1997, pp. 739\u2013744."},{"key":"10.1016\/S0167-9260(02)00020-2_BIB13","unstructured":"Xilinx Inc., Virtex 2.5V Field Programmable Gate Array Data Book (v2.4), 2000."},{"year":"1988","series-title":"Dependence Analysis for Supercomputing","author":"Banerjee","key":"10.1016\/S0167-9260(02)00020-2_BIB14"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB15","unstructured":"R. Grover, W. Shang, Q. Li, Two's complement bit-level matrix multiplication, Technical Report No. coen00-02, Department of Computer Engineering, Santa Clara University, Santa Clara, CA 95053, September 2000."},{"year":"1986","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","key":"10.1016\/S0167-9260(02)00020-2_BIB16"},{"key":"10.1016\/S0167-9260(02)00020-2_BIB17","unstructured":"C.W. Li, B.W. Wah, Optimal bit-level processor arrays for matrix multiplication, Proceedings of the 11th International Conference on Systems Engineering, University of Nevada, NV, July 1996, pp. 596\u2013601."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926002000202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926002000202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:10:55Z","timestamp":1759137055000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926002000202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0167926002000202"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(02)00020-2","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bit-level two's complement matrix multiplication","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(02)00020-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}