{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:01Z","timestamp":1752460801194,"version":"3.41.2"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Design Automation for Embedded Systems"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1008939516542","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T12:46:35Z","timestamp":1040561195000},"page":"29-60","source":"Crossref","is-referenced-by-count":2,"title":["Synthesis for Mixed Arithmetic"],"prefix":"10.1007","volume":"5","author":[{"given":"Anne","family":"Mignotte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Michel","family":"Muller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Peyran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"250896_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"10","author":"A. Avizienis","year":"1961","unstructured":"Avizienis, A. 1961. Signed-digit number representations for fast parallel arithmetic. IRE Transactions on Electronic Computers 10: 389\u2013400. Reprinted in E. E. Swartzlander, Computer Arithmetic, Vol. 2, IEEE Computer Society Press Tutorial, 1990.","journal-title":"IRE Transactions on Electronic Computers"},{"key":"250896_CR2","unstructured":"Bender, A. 1996. Milp based task mapping for heterogeneous multiprocessor system. Proceedings of the European Design Automation Conference 96 (EDAC'96)."},{"key":"250896_CR3","unstructured":"Binh, N. N., Imai, M., and Shiomi, A. 1996. A new hw\/sw partitioning algorithm for synthesizing the highest performance pipelined asips with multiple identical fus. Proceedings of the European Design Automation Conference 96 (EDAC'96)."},{"key":"250896_CR4","unstructured":"Briggs, W. S., and Matula, D. W. 1993. A 17 \u00d7 69 multiply and add unit with redundant binary feedback and single cycle latency. In E. Sartzlander, M. J. Irwin, and G. Jullien, editors, Proceedings of the 11th Symposium on Computer Arithmetic."},{"key":"250896_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Blythe, S. A., and Walker, R. A. 1995. An exact methodology for scheduling in a 3d design space. Proceedings of the International Symposium on System Synthesis (ISSS'95).","DOI":"10.1145\/224486.224505"},{"key":"250896_CR6","doi-asserted-by":"crossref","unstructured":"Chan, P. K., Oklobdzija, V. G., Schlag, M. D. F., and Thomborson, C. D. 1991. Delay optimization of carry-skip adders and block carry-lookahead. Proceedings of the 10th IEEE Symposium on Computer Arithmetic, pp. 154\u2013164.","DOI":"10.1109\/ARITH.1991.145552"},{"key":"250896_CR7","first-page":"280","volume-title":"Proceedings of the IEEE International Conference on Computer-Aided Design","author":"F. Depuydt","year":"1991","unstructured":"Depuydt, F., Goossens, G., and De Man, H. 1991. Clustering techniques for register optimization during scheduling preprocessing. In L. Goto, Satoshi; Trevillyan, editor, Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 280\u2013283, IEEE Computer Society Press, Santa Clara, CA."},{"key":"250896_CR8","doi-asserted-by":"crossref","unstructured":"DeCastelo-Vide-Souza, Y. G., Potkonjak, M., and Parker, A. C. 1995. Optimal ilp-based approach for throughput optimization using simultaneous algorithm\/architecture matching and retiming. In Proceedings fo the 32nd Design Automation Conference.","DOI":"10.1109\/DAC.1995.250074"},{"key":"250896_CR9","doi-asserted-by":"crossref","unstructured":"Ercegovac, M. D., and Lang, T. 1990. Fast multiplication without carry propagate addition. IEEE Transactions on Computers C-39.","DOI":"10.1109\/12.61047"},{"key":"250896_CR10","doi-asserted-by":"crossref","unstructured":"Fiduccia, C. M., and Mattheyses, R. M. 1982. A linear-time heuristic for improving network partitions. Proceedings of the 19th Design Automation Conference.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"250896_CR11","doi-asserted-by":"crossref","unstructured":"Gebotys, C. H., and Elmasry, M. I. 1992. Optimal synthesis of high-performance architectures. IEEE Journal of Solid-State Circuits 27(3).","DOI":"10.1109\/4.121562"},{"key":"250896_CR12","doi-asserted-by":"crossref","unstructured":"Guyot, A., Hochet, B., and Muller, J. M. 1987. A way to build efficient carry-skip adders. IEEE Transactions on Computers C-36(10).","DOI":"10.1109\/TC.1987.1676855"},{"key":"250896_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Ed. New York: W. H. Freeman and Co."},{"key":"250896_CR14","doi-asserted-by":"crossref","unstructured":"Hwang, J., and El Gamal, A. 1992. Optimal replication for min-cut partitioning. Proceedings of ICCAD'92.","DOI":"10.1109\/ICCAD.1992.279332"},{"issue":"7","key":"250896_CR15","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/43.238029","volume":"12","author":"C-T. Hwang","year":"1993","unstructured":"Hwang, C-T., and Hsu, Y-C. 1993. Zone scheduling. IEEE Transaction on Computer Aided Design of Integrated Circuits and Systems 12(7): 926\u2013934.","journal-title":"IEEE Transaction on Computer Aided Design of Integrated Circuits and Systems"},{"issue":"4","key":"250896_CR16","first-page":"464","volume":"10","author":"C-T. Hwang","year":"1991","unstructured":"Hwang, C-T., Lee, J-H., and Hsu, Y-C. 1991. A formal approach to the scheduling problem in high level synthesis 10(4): 464\u2013475.","journal-title":"A formal approach to the scheduling problem in high level synthesis"},{"key":"250896_CR17","unstructured":"Hennessy, J. L., and Patterson, D. A. 1990. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers."},{"key":"250896_CR18","volume-title":"Computer Arithmetic Algorithms","author":"I. Koren","year":"1993","unstructured":"Koren, I. 1993. Computer Arithmetic Algorithms. Englewood Cliffs, NJ: Prentice Hall."},{"key":"250896_CR19","doi-asserted-by":"crossref","unstructured":"Kernighan, B. W., and Lin, S. 1970. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"250896_CR20","unstructured":"Kring, C., and Newton, A. R. 1991. A cell-replicating approach to mincut-based circuit partitioning. Proceedings of ICCAD'91."},{"key":"250896_CR21","unstructured":"Karkowski, I., and Otten, R. H. J. M. 1996. An automatic hardware\/software partitioner based on the possibilistic programming. Proceedings of the European Design and Test Conference 96 (EDTC'96)."},{"issue":"5","key":"250896_CR22","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/12.280811","volume":"43","author":"P. Kornerup","year":"1994","unstructured":"Kornerup, P. 1994. Digit-set conversions: Generalizations and applications. IEEE Transactions on Computers 43(5): 622\u2013629.","journal-title":"IEEE Transactions on Computers"},{"key":"250896_CR23","doi-asserted-by":"crossref","unstructured":"Lehman, M., and Burla, N. 1961. Skip techniques for high-speed carry propagation in binary arithmetic units. IRE Transactions on Electronic Computers, p. 691.","DOI":"10.1109\/TEC.1961.5219274"},{"key":"250896_CR24","doi-asserted-by":"crossref","unstructured":"Leupers, R., and Marwedel, P. 1995. Time-constrained code compaction for dsps. Proceedings of International Symposium on System Synthesis (ISSS'95).","DOI":"10.1145\/224486.224498"},{"key":"250896_CR25","unstructured":"Lyu, C. N., and Matula, D. W. 1995. Redundant binary booth recoding. In S. Knowles and W. H. McAsllister, editors, Proceedings of the 12th Symposium on Computer Arithmetic."},{"key":"250896_CR26","unstructured":"Landwehr, B., Marwedel, P., and Dmer, R. 1994. Oscar: Optimum simultaneous scheduling allocation and resource binding based on integer programming. Proceedings of the EuroDAC'94."},{"key":"250896_CR27","unstructured":"Mazenc, C. 1993. Syst\u00e8mes de repr\u00e9sentation des nombres et arithm\u00e9tiques sur machines parall\u00e8les. PhD Thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon."},{"issue":"1","key":"250896_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1147\/rd.341.0059","volume":"34","author":"R. K. Montoye","year":"1990","unstructured":"Montoye, R. K., Hokonek, E., and Runyan, S. L. 1990. Design of the floating-point execution unit of the IBM risc system\/6000. IBM Journ. of Res. and Dev. 34(1): 59\u201370.","journal-title":"IBM Journ. of Res. and Dev."},{"key":"250896_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2646-6","volume-title":"Elementary Functions, Algorithms and Implementation (to appear)","author":"J. M. Muller","year":"1997","unstructured":"Muller, J. M. 1997. Elementary Functions, Algorithms and Implementation (to appear). Boston: Birkhauser."},{"key":"250896_CR30","unstructured":"Mignotte, A., Muller, J. M., and Peyran, O. 1995. Mixed arithmetic and operations. Research report 95\u201317, LIP, Ecole Normale Sup\u00e9erieure de Lyon."},{"key":"250896_CR31","doi-asserted-by":"crossref","unstructured":"Mignotte, A., and Peyran, O. 1997. Reducing the complexity of an ilp formulation for synthesis. 10th International Symposium on System Synthesis (ISSS'97), pp. 58\u201364, Antwerp, Belgium.","DOI":"10.1109\/ISSS.1997.621676"},{"key":"250896_CR32","unstructured":"Niemann, R., and Marwedel, P. 1996. Hardware\/software partitioning using integer programming. Proceedings of the European Design and Test Conference 96 (EDTC'96)."},{"key":"250896_CR33","unstructured":"Peichen, P., Dong, S.-K., and Liu, C. L. 1993. Optimal graph constraint reduction for symbolic layout compaction. Proceedings of the 30th Design Automation Conference."},{"key":"250896_CR34","unstructured":"Peyran, O. 1997. Synthse d'architectures intgres utilisant des arithmetiques redondantes. PhD thesis, INPG."},{"key":"250896_CR35","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/0743-7315(92)90017-H","volume":"16","author":"S. Prakash","year":"1992","unstructured":"Prakash, S., and Parker, A. C. 1992. Sos: Synthesis of application-specific heterogeneous multiprocessor systems. Journal of Parallel and Distributed Computing 16: 338\u2013351.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"250896_CR36","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TEC.1960.5219822","volume":"EC-9","author":"J. Sklansky","year":"1990","unstructured":"Sklansky, J. 1990. Conditional-sum addition logic. IRE Transactions on Electronic Computers EC-9: 226\u2013231, Reprinted in E. E. Swartzlander, Computer Arithmetic, Vol. 1, IEEE Computer Society Press Tutorial.","journal-title":"IRE Transactions on Electronic Computers"},{"key":"250896_CR37","doi-asserted-by":"crossref","unstructured":"Schwiegershausen, M., and Pirsch, P. 1995. A system level design methodology for the optimization of heterogeneous multiprocessors. Proceedings of the International Symposium on System Level Synthesis 95 (ISSS'95).","DOI":"10.1145\/224486.224536"},{"key":"250896_CR38","doi-asserted-by":"crossref","unstructured":"Tomiyama, H., and Yasuura, H. 1996. Optimal code placement of embedded software for instruction caches. Proceedings of the European Design and Test Conference (EDTC'96)","DOI":"10.1109\/EDTC.1996.494132"}],"container-title":["Design Automation for Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008939516542.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008939516542\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008939516542.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:16:22Z","timestamp":1752459382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008939516542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["250896"],"URL":"https:\/\/doi.org\/10.1023\/a:1008939516542","relation":{},"ISSN":["0929-5585","1572-8080"],"issn-type":[{"type":"print","value":"0929-5585"},{"type":"electronic","value":"1572-8080"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}