Explicit Constructions of Memoryless Crosstalk Avoidance Codes via C-transform
نویسندگان
چکیده
One of the main problems in deep sub-micron designs of high speed buses is the propagation delay due to the crosstalk effect. To alleviate the crosstalk effect, there are several types of crosstalk avoidance codes proposed in the literature. In this technical brief, we develop explicit constructions of two types of memoryless crosstalk avoidance codes: forbidden overlap codes (FOCs) and forbidden transition codes (FTCs). Our constructions for both FOCs and FTCs have the largest set of codewords. To the best of our knowledge, this is the first explicit construction of a FOC that has the largest set of codewords. Our approach is based on the C-transform developed for routing optical packets in optical queues. We show such an approach can also be used for constructing limited-weight No Adjacent Transition (NAT) codes. keywords: crosstalk, bus encoding, Zeckendorf’s theorem
منابع مشابه
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
Coupled switched capacitance causes crosstalk in ultra deep submicron/nanometer VLSI fabrication, which leads to power dissipation, delay faults, and logical malfunctions. We present the first memoryless transition bus-encoding technique for power minimization, errorcorrection, and elimination of crosstalk simultaneously. To accomplish this, we generalize balanced sampling plans avoiding adjace...
متن کاملEmpirical and Strong Coordination via Soft Covering with Polar Codes
We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequences of actio...
متن کاملCapacity Achieving Codes From Randomness Condensers
We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool used in our constructions is the notion of randomness extractors and lossless condensers that are regarded as central tools in theoretical compu...
متن کاملStrongly universal hashing and identification codes via channels
This paper shows that-almost strongly universal classes of hash functions can yield better explicit constructions of identiication codes via channels (ID codes) and identiication plus transmission codes (IT codes) than the previous explicit constructions of Verd u and Wei.
متن کاملCoding for Reliable On-Chip Buses: A Class of Fundamental Bounds and Practical Codes
A reliable high-speed bus employing low-swing signaling can be designed by encoding the bus to prevent crosstalk and provide error correction. Coding for on-chip buses requires additional bus wires and codec circuits. In this paper, fundamental bounds on the number of wires required to provide joint crosstalk avoidance and error correction using memoryless codes are presented. The authors propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013