scispace - formally typeset
Proceedings ArticleDOI

Preventing crosstalk delay using Fibonacci representation

Madhu Mutyam
- pp 685-688
Reads0
Chats0
TLDR
It is shown that m-bit crosstalk delay free binary Fibonacci codewords are used to encode /spl lfloor/log/sub 2/(F/ sub m+2/)/spl rfloor/-bit bus, where F/sub m-2/ is the (m+2)/sup th/ Fib onacci number.
Abstract
As the CMOS technology scaled down to deep sub-micron level, the crosstalk effects due to the coupling capacitance between interconnection lines has become one of the main performance limiting factors. Several methods such as those based on routing strategies, skewing the timing of signals on adjacent wires, interleaving mutually exclusive buses, precharging the bus, and bus encoding technique, have been proposed to eliminate/reduce the crosstalk delay. In this work, we propose a bus encoding technique using a variant of binary Fibonacci representation to prevent crosstalk delay and give a recursive procedure to generate crosstalk delay free binary Fibonacci codewords. We show that m-bit crosstalk delay free binary Fibonacci codewords are used to encode /spl lfloor/log/sub 2/(F/sub m+2/)/spl rfloor/-bit bus, where F/sub m+2/ is the (m+2)/sup th/ Fibonacci number. So, a 32-bit bus can be encoded using 46-bit crosstalk delay free binary Fibonacci codewords.

read more

Citations
More filters
Journal ArticleDOI

Efficient On-Chip Crosstalk Avoidance CODEC Design

TL;DR: This work presents guidelines for the CODEC design of the ldquo forbidden pattern free crosstalk avoidance coderdqui (FPF-CAC), and shows that mathematically, a mapping scheme exists based on the representation of numbers in the Fibonacci numeral system.
Proceedings ArticleDOI

Forbidden transition free crosstalk avoidance CODEC design

TL;DR: This work presents a CODEC design for the forbidden transition free crosstalk avoidance code based on the Fibonacci numeral system, and the mathematical analysis shows that all numbers can be represented by FTF vectors in the fibonacciNumeral system.
Book ChapterDOI

Energy-Efficient Communication

Journal ArticleDOI

Inter-Wire Coupling Reduction Analysis of Bus-Invert Coding

TL;DR: A theoretical analysis of BI coding for coupling reduction for uncorrelated uniformly distributed data is conducted and a set of closed-form formulas for computing the number of couplings per bus transfer for a nonpartitioned versus a partitioned bus is found.
Journal ArticleDOI

New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over $GF(2^{n})$

TL;DR: This paper provides a straightforward architecture of a non-pipelined bit-parallel multiplier using the new formula, which has lower space complexity than and comparable time complexity to previous Mastrovito multipliers' for all irreducible trinomials.
References
More filters
Journal ArticleDOI

Closed-form expressions for interconnection delay, coupling, and crosstalk in VLSIs

TL;DR: In this paper, a closed-form formula for a waveform of the RC interconnection line with practical boundary conditions is derived, and the optimum linewidth that minimizes RC delay and the trend of RC delay in the scaled-down VLSIs are discussed.
Journal ArticleDOI

Crosstalk reduction for VLSI

TL;DR: An expression for the coupled noise integral and a bound for the peak coupled noise voltage are derived which shows order of magnitude improvements in both accuracy and fidelity compared to the charge sharing model used in previous work.
Proceedings ArticleDOI

Bus encoding to prevent crosstalk delay

TL;DR: This paper finds that a 32-bit bus can be encoded with 40 wires using a code with memory or 46 wires with a memoryless code, in comparison to the 63 wires required with simple shielding.
Journal ArticleDOI

Systems of Numeration

TL;DR: In this paper, the authors present the Systems of Numeration (SNO) system, which is a generalization of the system of counting systems of numbers (SNS).
Related Papers (5)