{"title":"具有自动插入管道级的数据路径倍增器","authors":"C. Asato, C. Ditzen, S. Dholakia","doi":"10.1109/CICC.1989.56815","DOIUrl":null,"url":null,"abstract":"The architecture of an N-×M-bit, pipelined, datapath multiplier compiler. The architecture allows the total delay through the multiplier to be broken into the individual delays through each column of the array. The algorithm that determines where pipeline stage columns should be inserted is efficient because it uses a simple model for the column delays. Since pipeline stages are inserted only where necessary, the compiler can produce an optimized multiplier that can be easily integrated into a fully pipelined system. Set-up and output delay times can also be used by the compiler to allow the designer to integrate the multiplier into a fully pipelined datapath","PeriodicalId":165054,"journal":{"name":"1989 Proceedings of the IEEE Custom Integrated Circuits Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A datapath multiplier with automatic insertion of pipeline stages\",\"authors\":\"C. Asato, C. Ditzen, S. Dholakia\",\"doi\":\"10.1109/CICC.1989.56815\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The architecture of an N-×M-bit, pipelined, datapath multiplier compiler. The architecture allows the total delay through the multiplier to be broken into the individual delays through each column of the array. The algorithm that determines where pipeline stage columns should be inserted is efficient because it uses a simple model for the column delays. Since pipeline stages are inserted only where necessary, the compiler can produce an optimized multiplier that can be easily integrated into a fully pipelined system. Set-up and output delay times can also be used by the compiler to allow the designer to integrate the multiplier into a fully pipelined datapath\",\"PeriodicalId\":165054,\"journal\":{\"name\":\"1989 Proceedings of the IEEE Custom Integrated Circuits Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1989 Proceedings of the IEEE Custom Integrated Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICC.1989.56815\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1989 Proceedings of the IEEE Custom Integrated Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICC.1989.56815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A datapath multiplier with automatic insertion of pipeline stages
The architecture of an N-×M-bit, pipelined, datapath multiplier compiler. The architecture allows the total delay through the multiplier to be broken into the individual delays through each column of the array. The algorithm that determines where pipeline stage columns should be inserted is efficient because it uses a simple model for the column delays. Since pipeline stages are inserted only where necessary, the compiler can produce an optimized multiplier that can be easily integrated into a fully pipelined system. Set-up and output delay times can also be used by the compiler to allow the designer to integrate the multiplier into a fully pipelined datapath