No description available.

<p>För att snabba upp addering av tal, vilket är en vital del inom signalbehandling finns olika algoritmer. En sådan algoritm är Brent Kungs vilken har en tidsfördröjning proportionell mot log2(N). </p><p>I rapporten jämförs några olika varianter av adderare med avseende på grinddjup, vilket är proportionelltmot propageringstiden. En modulgenerator för Brent Kung-adderare implementeras med Skill-kod i Cadence. Modulgeneratorn kan genera adderare av obegränsad ordlängd och är även teknologi oberoende. Brent Kung-adderarens fysiska begränsningar studeras och förslag ges på lämpliga förbättringar.</p> / <p>To speed up the addition of numbers, which is a vital part of signal processing there are different types of algorithms. One of those algorithms is the Brent Kung-adder, which has a time delay proportional to log2(N). </p><p>In the report comparison of different adders has been done, taking into account grind-depth which is proportional to the propagation time. A module generator for the Brent Kung adder is implemented with skill-code in the program Cadence. The module generator can generate adders of infinite word length and is independent of the technology used. The physical limitations of Brent Kung adders are being studied and proposals for improvements are given in the report.</p>

För att snabba upp addering av tal, vilket är en vital del inom signalbehandling finns olika algoritmer. En sådan algoritm är Brent Kungs vilken har en tidsfördröjning proportionell mot log2(N). I rapporten jämförs några olika varianter av adderare med avseende på grinddjup, vilket är proportionelltmot propageringstiden. En modulgenerator för Brent Kung-adderare implementeras med Skill-kod i Cadence. Modulgeneratorn kan genera adderare av obegränsad ordlängd och är även teknologi oberoende. Brent Kung-adderarens fysiska begränsningar studeras och förslag ges på lämpliga förbättringar. / To speed up the addition of numbers, which is a vital part of signal processing there are different types of algorithms. One of those algorithms is the Brent Kung-adder, which has a time delay proportional to log2(N). In the report comparison of different adders has been done, taking into account grind-depth which is proportional to the propagation time. A module generator for the Brent Kung adder is implemented with skill-code in the program Cadence. The module generator can generate adders of infinite word length and is independent of the technology used. The physical limitations of Brent Kung adders are being studied and proposals for improvements are given in the report.

<p>Fast addition is essential in many DSP algorithms. Various structures have been introduced to speed up the time critical carry propagation. For high throughput applications, however, it may be necessary to introduce pipelining. In this report the power consumption of four different adder structures, with varying word length and different number of pipeline cuts, is compared. </p><p>Out of the four adder structures compared, the Kogge-Stone parallel prefix adder proves to be the best choice most of the time. The Brent-Kung parallel prefix adder is also a good choice, but the maximal throughput does not reach as high as the maximal throughput of the Kogge-Stone parallel prefix adder.</p>

Fast addition is essential in many DSP algorithms. Various structures have been introduced to speed up the time critical carry propagation. For high throughput applications, however, it may be necessary to introduce pipelining. In this report the power consumption of four different adder structures, with varying word length and different number of pipeline cuts, is compared. Out of the four adder structures compared, the Kogge-Stone parallel prefix adder proves to be the best choice most of the time. The Brent-Kung parallel prefix adder is also a good choice, but the maximal throughput does not reach as high as the maximal throughput of the Kogge-Stone parallel prefix adder.