A synchronization code two-way recovery method and circuit

Abstract

The invention discloses a synchronous code bidirectional restoration circuit. The synchronous code bidirectional restoration circuit comprises a data buffer and a bidirectional synchronous code restorer, wherein a first input end of the data buffer receives the data for storage; a second input end of the data buffer receives the address data for accessing the data buffer by the bidirectional synchronous code restorer, and outputs the address data to the bidirectional synchronous code restorer; and the bidirectional synchronous code restorer reads the synchronous code data of the corresponding address, and writes the restored or generated synchronous codes, and reads data packets in order. The synchronous code bidirectional restoration method can count the synchronous codes which are determined and identified as correct synchronous codes again after being interfered, in reverse direction, and then generates the synchronous codes for counting in reverse direction so as to effectively avoid an interference signal, and can count by using a clock which becomes stable again after being interfered so as to improve the accuracy for counting the synchronous codes.

Description

technical field [0001] The invention relates to the technical field of data transmission, in particular to a synchronization code bidirectional recovery method and circuit. Background technique [0002] The data transmission process is a moving process in which data signals are transmitted from one place to another through a channel. The channel can be wired or wireless. Both wired and wireless channels are inevitably interfered by other signals: for example , thermal noise in wiring, inrush noise of electrical switches, particle noise contained in solar storms and interference noise from other equipment to this equipment, etc. [0003] The transmission and reception of data is carried out according to a certain format. Specifically, the data is often divided into several data packets of equal size, and then transmitted packet by packet. Each data packet will indicate the beginning of the data packet with a unique field different from the transmitted data, and the receiving...

AI Technical Summary

Problems solved by technology

Due to the occurrence or continuation of interference, the counting clock is often inaccurate, so the decomposed data packets are often wrong before the synchronization code reconfirmation is completed

like figure 1 As shown, the channel signal will change strangely after being disturbed, and the clock signal tracking the channel signal will also be affected; some positions of the identification synchronization code are empty, indicating that the synchronization code at this position cannot be identified; the counting synchronization code is based on the previous one The identified synchronization code is predicted in case the current position cannot be identified; when the synchronization code cannot be correctly identified, because the clock tracking the channel signal is affected, the counting synchronization code sometimes deviates from the correct synchronization code position; The data packets decomposed by counting synchronization codes sometimes have errors

Images