L-Bit to M-Bit Code Mapping
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 11
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.
Authors and Affiliations
Ruixing Li, Shahram Latifi, Yun Lun, Ming Lun
Keywords
Related Articles
- EP ID EP111998
- DOI 10.14569/IJACSA.2015.061116
- Views 107
- Downloads 0
Deep Learning based Object Distance Measurement Method for Binocular Stereo Vision Blind Area
Visual field occlusion is one of the causes of urban traffic accidents in the process of reversing. In order to meet the requirements of vehicle safety and intelligence, a method of target distance measurement based on d...
A Conceptual Framework for an Ontology-Based Examination System
There is an increasing reliance on the web for many software application deployments. Millions of services ranging from commerce, education, tourism and entertainment are now available on the web, making the web to be th...
Towards Evaluating Web Spam Threats and Countermeasures
Web spam is a deceiving technique that aims to get high ranks for the retrieved web pages at the top Search Engine Result Pages (SERPs). This paper provides an evaluation for the web spam threats and countermeasures. It...
Interaction Protocols in Multi-Agent Systems based on Agent Petri Nets Model
This paper deals with the modeling of interaction between agents in Multi Agents System (MAS) based on Agent Petri Nets (APN). Our models are created based on communicating agents. Indeed, an agent initiating a conversat...
Vitality Aware Cluster Head Election to Alleviate the Wireless Sensor Network for Long Time
The Wireless Sensor Networks (WSN) motivated by its unique characters such as it is capable of enduring callous ecological circumstances, and grant better scalability. The wireless sensor network is composed of insignifi...