The IUP Journal of Telecommunications
Design and Implementation of Crosstalk Avoidance Using Bit-Stuffing Algorithms in VLSI Circuits
Article Details
| Pub. Date | : Feb, 2018 |
|---|---|
| Product Name | : The IUP Journal of Telecommunications |
| Product Type | : Article |
| Product Code | : IJTC31802 |
| Author Name | : B Jyothi and B Obulesu |
| Availability | : YES |
| Subject/Domain | : Science & Technology |
| Download Format | : PDF Format |
| No. of Pages | : 17 |
Price
Download
Abstract
Crosstalk is one of the major problems in VLSI circuits of high-speed buses. To eliminate this problem, several types of coding techniques have been proposed in the literature. The paper aims at avoiding the opposite transition on any two adjacent wires. Sequential bit-stuffing algorithm and parallel bit-stuffing algorithm are studied. The problem in parallel bit-stuffing algorithm is that the code rates for even-numbered wires are significantly lower than those of odd-numbered wires. To solve the uneven rate problem, the paper considers parallel bit-stuffing algorithm with rate balancing, where padding of additional bits on odd-numbered wire with the help of 2 ' 2 crossbar switch with bar state and cross state is done. By doing so, even-numbered code rate becomes equal to odd-numbered code rate, then code rates become balanced. Parallel bit-stuffing algorithm with rate balancing not only achieves higher coding rate but also lowers power consumption.
Description
Crosstalk is one of the major problems in VLSI circuits of high-speed buses. To eliminate this problem, several types of coding techniques have been proposed in the literature. The paper aims at avoiding the opposite transition on any two adjacent wires. Sequential bit-stuffing algorithm and parallel bit-stuffing algorithm are studied. The problem in parallel bit-stuffing algorithm is that the code rates for even-numbered wires are significantly lower than those of odd-numbered wires. To solve the uneven rate problem, the paper considers parallel bit-stuffing algorithm with rate balancing, where padding of additional bits on odd-numbered wire with the help of 2 ' 2 crossbar switch with bar state and cross state is done. By doing so, even-numbered code rate becomes equal to odd-numbered code rate, then code rates become balanced. Parallel bit-stuffing algorithm with rate balancing not only achieves higher coding rate but also lowers power consumption.
Keywords
Telecommunications Journal, Bit-stuffing, Rate balancing, High-speed switching, Crosstalk.
| Click here to upload your Articles |
Journals
Magazines
- HRM Review
- Marketing Mastermind
- Global CEO
- The IUPs World of IOT
Articles of the Month
ISBN: 978-81-314-2793-4Price: ₹250
Payment by D.D. favouring
"ICFAI A/c IUP", Hyderabad
Reach us at
info@iupindia.in
Tel: +91 8498843633