carry skip

基本解釋

The carry skip adder optimal block sizes can minimize critical path delay.
優(yōu)化方塊分配的進(jìn)位跳躍加法器可以縮短關(guān)鍵路徑的延時(shí)。
A new type of optimal block distribution algorithm of two level carry-skip adder was described to determine optimal block distribution sizes.
提出了一種新的獲得二級(jí)進(jìn)位跳躍加法器優(yōu)化方塊分配的算法。
On the basis we design an adder by the adoption of carry skip algorithm with carry strength signals and implement, through logic synthesis and layout.
首先介紹了常用并行加法器的設(shè)計(jì)方法，并在此基礎(chǔ)上采用帶進(jìn)位強(qiáng)度的跳躍進(jìn)位算法，通過邏輯綜合和布局布線設(shè)計(jì)出了一個(gè)加法器。