Abstract
We investigate codes that map L bits to m bits to achieve a set of codewords which contain no consecutive n “0”s. Such codes are desirable in the design of line codes which, in the absence of clock information in data, provide reasonable clock recovery due to sufficient state changes. Two problems are tackled- (i) we derive n_min for a fixed L and m and (ii) determine m_min for a fixed L and n. Results benefit telecommunication applications where clock synchronization of received data needs to be done with minimum overhead.
Highlights
AND BACKGROUNDIn serial communications, data is transferred on a medium that carries a signal varying with time
For short distance transfer, such as communication within a digital system, we can have a clock signal between the transmitter and receiver to synchronize the clock; for example, the Serial Peripheral Interface (SPI) uses a clock signal for clock synchronization. When it comes to long distance communication, adding signaling only for clock synchronization consumes part of the bandwidth
This paper proposes an empirical method of calculating the minimum overhead to avoid a given number of consecutive
Summary
AND BACKGROUNDIn serial communications, data is transferred on a medium that carries a signal varying with time. One other example would be mapping 4-bit data to 5-bit codes such that a sequence of 3 “0”s is avoided ( This paper proposes an empirical method of calculating the minimum overhead to avoid a given number of consecutive
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
