DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, In-Cheol | - |
dc.contributor.advisor | 박인철 | - |
dc.contributor.author | Kim, Joon-Uh | - |
dc.contributor.author | 김준우 | - |
dc.date.accessioned | 2011-12-14T01:41:49Z | - |
dc.date.available | 2011-12-14T01:41:49Z | - |
dc.date.issued | 1998 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=134820&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/37037 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학과, 1998.2, [ 47 p. ] | - |
dc.description.abstract | This thesis describes a pipelined floating-point unit(FPU) for a low-power processor. The goal of this design is to achieve a low-power design and an area-optimized implementation, as it will be integrated on a single chip with a low-power processor core. It consists of two major functional units, floating-point arithmatic logic unit (ALU) and floating-point multiplier/divider(MULDIV) unit. It supports both single precision format data and double precision format data. To reduce the required power, the upper half part of datapath is disabled when calculating the single precision data. Many parts of the FPU are shared to reduce the area. For example, multiplier and divider uses the adder in ALU, and ALU consists of only one shifter and one adder, needs less area than conventional ones. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Floating-point unit(FPU) | - |
dc.subject | Low-power | - |
dc.subject | Area minimization | - |
dc.subject | 면적 최소화 | - |
dc.subject | 부동소수점 유닛 | - |
dc.subject | 저전력 | - |
dc.title | (A) design of floating-point unit for low-power processor | - |
dc.title.alternative | 저전력 프로세서를 위한 부동 소수점 유닛의 설계 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 134820/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학과, | - |
dc.identifier.uid | 000963156 | - |
dc.contributor.localauthor | Park, In-Cheol | - |
dc.contributor.localauthor | 박인철 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.