{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T05:40:06Z","timestamp":1748497206435,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200705"},{"type":"electronic","value":"9783319200712"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20071-2_2","type":"book-chapter","created":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T07:20:48Z","timestamp":1436858448000},"page":"33-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fabric Component Based Approach to the Architecture and Design Automation of High-Performance Integer Arithmetic Circuits on FPGA"],"prefix":"10.1007","author":[{"given":"Ayan","family":"Palchaudhuri","sequence":"first","affiliation":[]},{"given":"Rajat Subhra","family":"Chakraborty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Preu$$\\beta $$er, T.B., Zabel, M., Spallek, R.G.: Accelerating computations on FPGA carry chains by operand compaction. In: 20th IEEE Symposium on Computer Arithmetic (ARITH), pp. 95\u2013102 (2011)","DOI":"10.1109\/ARITH.2011.22"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Preu$$\\beta $$er, T.B., Spallek, R.G.: Mapping basic prefix computations to fast carry-chain structures. In: International Conference on Field Programmable Logic and Applications (FPL), pp. 604\u2013608 (2009)","DOI":"10.1109\/FPL.2009.5272382"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, T., Kundarewich, P.D., Anderson, J.H.: Packing techniques for Virtex-5 FPGAs. ACM Trans. Reconfig. Technol. Syst. (TRETS), 2(18), 18:1\u201318:24 (2009)","DOI":"10.1145\/1575774.1575777"},{"key":"2_CR4","unstructured":"Xilinx Inc., Virtex-5 Libraries Guide for HDL Designs, UG621 (v 11.3) (2009). Cited 16 September 2009, http:\/\/www.xilinx.com\/support\/documentation\/sw_manuals\/xilinx11\/Virtex5_hdl.pdf"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ehliar, A.: Optimizing Xilinx designs through primitive instantiation. In: Proceedings of the 7th FPGAworld Conference, pp. 20\u201327 (2010)","DOI":"10.1145\/1975482.1975484"},{"key":"2_CR6","unstructured":"FloPoCo: Arithmetic core generator (2014). Cited 14 June 2014, http:\/\/flopoco.gforge.inria.fr\/"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dinechin, F.de, Pasca, B.: Designing custom arithmetic data paths with FloPoCo. IEEE Des. Test Comput. 28(3), 18\u201327 (2009)","DOI":"10.1109\/MDT.2011.44"},{"key":"2_CR8","unstructured":"Cosoroaba, A., Rivoallon, F.: Xilinx Inc., White paper: Virtex-5 family of FPGAs. Achieving Higher System Performance with the Virtex-5 Family of FPGAs WP245 (v1.1.1) (2006). Cited 7 July 2006, http:\/\/www.origin.xilinx.com\/support\/documentation\/white_papers\/wp245.pdf"},{"key":"2_CR9","unstructured":"Xilinx Inc., Virtex-5 FPGA user guide, UG190 (v 5.4) (2012). Cited 16 March 2012, http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug190.pdf"},{"key":"2_CR10","unstructured":"Xilinx Inc., Virtex-6 FPGA configurable logic block, UG364 (v 1.2) (2012). Cited 24 June 2009, http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug364.pdf"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Verma, A.K., Brisk, P., Ienne, J.P.: Challenges in automatic optimization of arithmetic circuits. In: 19th IEEE Symposium on Computer Arithmetic (ARITH), pp. 213\u2013218 (2009)","DOI":"10.1109\/ARITH.2009.39"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Roy, S.S., Rebeiro, C., Mukhopadhyay, D.: Theoretical modeling of the Itoh-Tsujii inversion algorithm for enhanced performance on $$k$$-LUT based FPGAs. In: Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1\u20136 (2011)","DOI":"10.1109\/DATE.2011.5763197"},{"key":"2_CR13","unstructured":"Hachtel, G.D., Somenzi, F.: Logic Synthesis and Verification Algorithms. Kluwer Academic Publisher, Dordrecht (1996)"},{"key":"2_CR14","unstructured":"Weste, N.H.E., Harris, D., Banerjee, A.: CMOS VLSI Design: A Circuits and Systems Perspective. 3rd edn. Pearson Publisher, New York (2011)"},{"issue":"11","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1109\/12.177318","volume":"41","author":"J Cortadella","year":"1992","unstructured":"Cortadella, J., Llaber\u00eda, J.: Evaluation of $$A+B=K$$ conditions without carry propagation. IEEE Trans. Comput. 41(11), 1484\u20131487 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Zicari, P., Perri, S.: A fast carry-chain adder for Virtex-5 FPGAs. In: 15th IEEE Mediterranean Electrotechnical Conference (MELECON), pp. 304\u2013308 (2010)","DOI":"10.1109\/MELCON.2010.5476275"},{"key":"2_CR17","unstructured":"Xilinx Inc., Virtex-5 FPGA XtremeDSP design considerations user guide, UG193 (v 3.5) (2012). Cited 26 January 2012, http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug193.pdf"},{"key":"2_CR18","volume-title":"Computer Arithmetic Algorithms","author":"I Koren","year":"2002","unstructured":"Koren, I.: Computer Arithmetic Algorithms, 2nd edn. A.K.Peters Ltd, Natick (2002)","edition":"2"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Kung, H.T.: A Regular layout for parallel adders. IEEE Trans. Comput. C-31(3), 260\u2013264 (1982)","DOI":"10.1109\/TC.1982.1675982"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/349194.349202","volume":"32","author":"P Sarkar","year":"2000","unstructured":"Sarkar, P.: A brief history of cellular automata. ACM Comput. Surv. (CSUR) 32(1), 80\u2013107 (2000)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Chowdhury, D.R., Chaudhuri, P.P.: Architecture for VLSI design of CA based byte error correcting code decoders. In: Proceedings of the 7th International Conference on VLSI Design, pp. 283\u2013286 (1994)","DOI":"10.1109\/ICVD.1994.282703"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Halbach, M., Hoffmann, R.: Improving cellular automata in FPGA logic. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium, pp. 258\u2013262 (2004)","DOI":"10.1109\/IPDPS.2004.1303324"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Sirakoulis, G.C., Karafyllidis, I., Thanailakis, A., Mardiris, V.: A methodology for VLSI implementation of cellular automata algorithms using VHDL. Adv. Eng. Softw. 32(3), 189\u2013202 (2000)","DOI":"10.1016\/S0965-9978(00)00085-5"},{"issue":"17","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1587\/elex.9.1391","volume":"9","author":"C Torres-Huitzil","year":"2012","unstructured":"Torres-Huitzil, C., Delgadillo-Escobar, M., Nuno-Maganda, M.: Comparison between 2D cellular automata based pseudorandom number generators. IEICE Electron. Express 9(17), 1391\u20131396 (2012)","journal-title":"IEICE Electron. Express"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhuri, P.P.: Efficient characterization of cellular automata. IEEE Proc. Comput. Digital Tech. 137(1), 81\u201387 (1990)","DOI":"10.1049\/ip-e.1990.0008"},{"key":"2_CR26","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application. vol. 1. IEEE Computer Society Press (1997)"},{"issue":"1\u20132","key":"2_CR27","first-page":"139","volume":"5","author":"D Mukhopadhyay","year":"2010","unstructured":"Mukhopadhyay, D.: Group properties of non-linear cellular automata. J. Cell. Autom. 5(1\u20132), 139\u2013155 (2010)","journal-title":"J. Cell. Autom."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Palchaudhuri, A., Chakraborty, R.S., Salman. M., Kardas, S., Mukhopadhyay, D.: Highly compact automated implementation of linear CA on FPGAs. In: Cellular Automata\u201411th International Conference on Cellular Automata for Research and Industry, pp. 388\u2013397 (2014)","DOI":"10.1007\/978-3-319-11520-7_40"},{"key":"2_CR29","unstructured":"Cattell, K., Muzio, J.: Technical Report: Tables of linear cellular automata for minimal weight primitive polynomials of degrees up to 300. Issue: 163. University of Victoria (BC), Department of Computer Science (1991)"},{"key":"2_CR30","unstructured":"Bardell, P.H., McAnney, W.H., Savir, J.: Built-In Test for VLSI: Pseudorandom Techniques, Wiley, London (1987)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Zimmermann, P.: A binary recursive GCD algorithm. In: Proceedings of ANTS\u201904, Lecture Notes in Computer Science, vol. 3076, pp. 411\u2013425. Springer, New York (2004)","DOI":"10.1007\/978-3-540-24847-7_31"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Kung, H.T.: A systolic algorithm for integer GCD computation. In: IEEE 7th Symposium on Computer Arithmetic (ARITH), pp. 118\u2013125 (1985)","DOI":"10.1109\/ARITH.1985.6158931"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Perri, S., Zicari, P., Corsonello, P.: Efficient absolute difference circuits in Virtex-5 FPGAs. In: 15th IEEE Mediterranean Electrotechnical Conference (MELECON), pp. 309\u2013313 (2010)","DOI":"10.1109\/MELCON.2010.5476276"}],"container-title":["Computational Intelligence in Digital and Network Designs and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20071-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:59:21Z","timestamp":1748494761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20071-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200705","9783319200712"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20071-2_2","relation":{},"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}