SEARCH ENGINEERING RESEARCH PAPERS

fibonacci codes IEEE PAPER



Meta-Fibonacci sequences, binary trees and extremal compact codes
free download

Abstract We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci

Fibonacci Codes for Crosstalk Avoidance
free download

Abstract: In the deep sub micrometer CMOS process technology, the interconnect resistance, length, and interwire capacitance are increasing significantly, which contribute to large on-chip interconnect propagation delay. Data transmitted over interconnect

Fibonacci connection between Huffman codes and Wythoff array
free download

Abstract. A non-decreasing sequence of positive integer weights P={p1,, p2, pn} is called k- ordered if an intermediate sequence of weights produced by Huffman algorithm for initial

CROSSTALK AVOIDANCE USING FIBONACCI CODES
free download

Abstract: In the deep sub micrometer CMOS process technology, the interconnect resistance, length, and inter-wire capacitance are increasing significantly, which contribute to large on-chip interconnect propagation delay. Data transmitted over interconnect

On Chip Crosstalk Avoidance Using Low Power Unique Fibonacci Codes
free download

Abstract: Cross talk has become a limiting factor for circuit performance in Deep Sub-Micron designs. As the crosstalk in an on-chip bus is highly dependent on the data patterns transmitted on the bus. In order to minimize the effect of crosstalk on wired communication

The (non-) existence of perfect codes in Fibonacci cubes
free download

Abstract The Fibonacci cube Gn is obtained from the n-cube Qn by removing all the vertices that contain two consecutive 1s. It is proved that Gn admits a perfect code if and only if n= 3.

Fibonacci-Like Polynomials Produced by m-ary Huffman Codes for Absolutely Ordered Sequences
free download

Abstract. A non-decreasing sequence of positive integer weights P={p1, p2,, pn}(n= N*(m- 1)+ 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial

request paper NFF4, RF4, CRF4



A Fibonacci coding Technique to avoid Crosstalk on On-chip data bus
free download

Output: 1 2 0 .. m m cc c Table 4: Different coding technique code words Data- word Fibonacci codeword 4 NFF 4 TS NFF 4 RF 4 CRF 010 101 011 110 111 000 001 010 0010 1000 0100 1001 1010 0000 0001 0010 0010 1010 1110 0111 1101 1101 1100 1110

Studies on the Design of Encoder for Crosstalk Avoidance Codes Based on Fibonacci Binary Numeral System: Extension to Layout Design using VLSI 45nm CAD
free download

5.2.3. Complement Redundant Fibonacci (CRF) Coding Technique44-46 5.3. Developing an encoder for generating NFF, RF and CRF codewords4


FREE ENGINEERING RESEARCH PAPERS