CN105356995B - A kind of two-way restoration methods of synchronous code and circuit - Google Patents
A kind of two-way restoration methods of synchronous code and circuit Download PDFInfo
- Publication number
- CN105356995B CN105356995B CN201510829148.0A CN201510829148A CN105356995B CN 105356995 B CN105356995 B CN 105356995B CN 201510829148 A CN201510829148 A CN 201510829148A CN 105356995 B CN105356995 B CN 105356995B
- Authority
- CN
- China
- Prior art keywords
- code
- synchronous code
- data
- synchronous
- synchronization code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L7/00—Arrangements for synchronising receiver with transmitter
- H04L7/04—Speed or phase control by synchronisation signals
- H04L7/041—Speed or phase control by synchronisation signals using special codes as synchronising signal
Abstract
The present invention discloses a kind of two-way restoring circuit of synchronous code, including data buffer and bi-directional synchronization code restorer；Data buffer first input end receives the data for storage, second input terminal receives bi-directional synchronization code restorer and generates the address date for accessing data buffer, and address date is exported to bi-directional synchronization code restorer, bi-directional synchronization code restorer reads the synchronous code data of appropriate address, write recovery or the synchronous code of generation, are sequentially read out data packet.Through confirming that the synchronous code correctly identified carries out counting in reverse again after the present invention is based on interference, counting in reverse synchronous code is generated, effectively prevents interference signal, is counted with clock again stable after interference, improves the accuracy that synchronous code counts.
Description
Technical field
The present invention relates to technical field of data transmission, and in particular to a kind of two-way restoration methods of synchronous code and circuit.
Background technology
Data transmission procedure is the moving process that data-signal is transferred to another place by channel by a place, is believed
Road can be wired or wireless, and wire channel and wireless channel are all inevitably by other signals
Interference：For example, the thermal noise in line, the noise that shoves of electric switch, the particle noise that solar windstorm includes is set with other
For to interference noise of this equipment etc..
The transmission of data and receiving is carried out by certain form, in particular, be exactly data be often divided into it is equal in magnitude
Several data packets, then packet-by-packet transmit.Unique field that each data packet can be different from transmission data with one represents
The beginning of data packet, the data flow received is decomposited data packet by receiving terminal by the mark of this unique field, so as to subsequent
Other processing.This unique field is called synchronous code.
Data can be caused damage and the loss of synchronous code during transmitting in the channel by various interference.Synchronous code
After impaired or loss, to be resynchronized.Resynchronisation generally comprises synchronous code and re-recognizes, and confirms and confirms again.In this way, from same
Step code is damaged or loses, and to before confirming completion again, data flow is before being damaged or lose by known form and with synchronous code
On the basis of the last one good synchronous code, by fixed length counting come decomposition data, formation data packet.Due to interference appearance or after
It renewing, counting clock is often inaccurate, so, the data packet decomposited is often mistake before synchronous code confirms completion again
Accidentally.As shown in Figure 1, channel signal can occur very to become after being interfered, at the same track the clock signal of channel signal also by
To influence；Some positions of identification synchronous code cannot recognize that for the empty synchronous code for representing the position；Count synchronization code is to be based on
What the previous synchronous code identified predicted, in case current location can not identify；When synchronous code cannot be identified correctly, by
Influence is received in the clock of tracking channel signal, deviation occurs count synchronization code for synchronous code position sometimes and correctly；To count
The data packet that synchronous CDMA solves is it some times happens that mistake.In Fig. 1, data packet 3,4,5,6,7,8 includes wrong data.
Invention content
In view of the above-mentioned problems, the present invention discloses a kind of bi-directional synchronization code restoration methods and circuit, pass through the side of two-way counting
Formula effectively avoids the influence of interference, improves synchronous code counting precision.
To solve the above problems, the designing scheme of the present invention is：A kind of two-way restoring circuit of synchronous code, including data buffer storage
Device and bi-directional synchronization code restorer；Data buffer first input end receives the data for storage, and the second input terminal receives double
The address date for accessing data buffer is generated to synchronous code restorer, and address date is exported to bi-directional synchronization code and is restored
Device, bi-directional synchronization code restorer read the synchronous code of the synchronous code data of appropriate address, write recovery or generation, are sequentially read out
Data packet.
A kind of two-way restoration methods of synchronous code, include the following steps：
Step 1: interference causes synchronous code to lose or be damaged in transmission process, restore synchronous code to method of counting using preceding：
Code position is synchronized based on the last one identified, synchronous code should occur but it is unidentified go out position artificially generate one it is same
The mark that code is walked as decomposition data packet is i.e. preceding to count synchronization code, is indicated with dotted line in figure, is obtained by confirming, confirming again
Correctly synchronous code position；
Step 2: synchronous code is restored using backward method of counting：Confirm the synchronization code position obtained again later based on interference,
Counting in reverse is counted with the direction opposite with data write-in direction and generates backward count synchronization code, indicated in figure with solid line；
The method of back forecast has effectively hidden the clock being disturbed, and is counted with clock again stable after interference,
The accuracy of synchronous code counting can be improved.
Step 3: if forward direction count synchronization code is identical with the position of backward count synchronization code, restore to synchronize in the position
Code；If forward direction count synchronization code is different with the position of backward count synchronization code, restore same in the rear position to count synchronization code
Walk code；
Step 4: according to the data buffer address where the synchronous code tick lables restored in step 3, packet-by-packet read
It is data cached and export.
Advantageous effect：Through confirming that the synchronous code correctly identified carries out counting in reverse again after the present invention is based on interference,
Counting in reverse synchronous code is generated, effectively prevents interference signal, is counted with clock again stable after interference, improves and synchronizes
The accuracy that code counts.
Description of the drawings
Fig. 1 confirms schematic diagram again for conventional synchronization code；
Fig. 2 is the two-way restoration methods schematic diagram of synchronous code；
Fig. 3 is the two-way restoring circuit schematic diagram of synchronous code.
Specific embodiment
A kind of two-way restoring circuit of synchronous code, as shown in figure 3, including data buffer and bi-directional synchronization code restorer；Number
The data for storage are received according to buffer first input end, the second input terminal receives the generation of bi-directional synchronization code restorer and accesses number
It is exported according to the address date of buffer, and by address date to bi-directional synchronization code restorer, bi-directional synchronization code restorer reads phase
The synchronous code of the synchronous code data of address, write recovery or generation is answered, is sequentially read out data packet.
A kind of two-way restoration methods of synchronous code, include the following steps：
Step 1: interference causes synchronous code to lose or be damaged in transmission process, restore synchronous code to method of counting using preceding：
Code position is synchronized based on the last one identified, synchronous code should occur but it is unidentified go out position artificially generate one it is same
The mark that code is walked as decomposition data packet is i.e. preceding to count synchronization code, as shown in phantom in Figure 2, is obtained by confirming, confirming again
Correctly synchronous code position；
Step 2: synchronous code is restored using backward method of counting：Confirm the synchronization code position obtained again later based on interference,
Counting in reverse is counted with the direction opposite with data write-in direction and generates backward count synchronization code, as illustrated in solid line in figure 2；
The method of back forecast has effectively hidden the clock being disturbed, and is counted with clock again stable after interference,
The accuracy of synchronous code counting can be improved.Compared with Fig. 1, only data packet 3,4,5 includes wrong data in Fig. 2.
Step 3: if forward direction count synchronization code is identical with the position of backward count synchronization code, restore to synchronize in the position
Code；If forward direction count synchronization code is different with the position of backward count synchronization code, restore same in the rear position to count synchronization code
Walk code；
Step 4: according to the data buffer address where the synchronous code tick lables restored in step 3, packet-by-packet read
It is data cached and export.
Claims (2)
1. a kind of two-way restoration methods of synchronous code, it is characterised in that include the following steps：
Step 1: interference causes synchronous code to lose or be damaged in transmission process, restore synchronous code to method of counting using preceding：It is based on
Identify the last one synchronize code position, synchronous code should occur but it is unidentified go out position artificially generate a synchronous code
Mark as decomposition data packet is i.e. preceding to count synchronization code, and correctly synchronous code position is obtained by confirming, confirming again；
Step 2: synchronous code is restored using backward method of counting：Confirm the synchronization code position obtained again later based on interference, reversely
It counts, i.e., is counted with the direction opposite with data write-in direction and generate backward count synchronization code；
Step 3: if forward direction count synchronization code is identical with the position of backward count synchronization code, restore synchronous code in the position；If
Forward direction count synchronization code is different with the position of backward count synchronization code, then restores synchronous code in the rear position to count synchronization code；
Step 4: according to the data buffer address where the synchronous code tick lables restored in step 3, caching is packet-by-packet read
Data simultaneously export.
2. the two-way restoring circuit of synchronous code used by the two-way restoration methods of synchronous code according to claim 1, feature
It is：The two-way restoring circuit of the synchronous code includes data buffer and bi-directional synchronization code restorer；Data buffer first
Input terminal receives the data for storage, and the second input terminal receives bi-directional synchronization code restorer and generates the ground for accessing data buffer
Location data, and address date is exported to bi-directional synchronization code restorer, bi-directional synchronization code restorer reads the synchronization of appropriate address
The synchronous code of code data, write recovery or generation, is sequentially read out data packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510829148.0A CN105356995B (en) | 2015-11-24 | 2015-11-24 | A kind of two-way restoration methods of synchronous code and circuit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510829148.0A CN105356995B (en) | 2015-11-24 | 2015-11-24 | A kind of two-way restoration methods of synchronous code and circuit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105356995A CN105356995A (en) | 2016-02-24 |
| CN105356995B true CN105356995B (en) | 2018-06-26 |
Family
ID=55332875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510829148.0A Expired - Fee Related CN105356995B (en) | 2015-11-24 | 2015-11-24 | A kind of two-way restoration methods of synchronous code and circuit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105356995B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1101472A (en) * | 1993-04-28 | 1995-04-12 | 美国电话电报公司 | Method and apparatus for adaptive clock recovery |
| CN1183867A (en) * | 1995-05-05 | 1998-06-03 | Gpt有限公司 | Retiming arrangement for SDH data transmission system |
| CN1301100A (en) * | 1999-12-17 | 2001-06-27 | 米特尔公司 | Clock resetting phase-locked loops |
| CN1507239A (en) * | 2002-12-10 | 2004-06-23 | 深圳市中兴通讯股份有限公司 | E2 interface device and method for synchronous digital transmission system |
| CN1540911A (en) * | 2003-04-25 | 2004-10-27 | 中兴通讯股份有限公司 | Circuit for recovering timing data and implementing method |
| CN1619992A (en) * | 2003-11-18 | 2005-05-25 | 华为技术有限公司 | Method of searching synchronous cade in network communication and its device |
| CN1226839C (en) * | 2001-09-27 | 2005-11-09 | 连宇通信有限公司 | Method for improving handover performance in synchonism CDMA mobile communication system |
| CN101018051A (en) * | 2006-02-01 | 2007-08-15 | 恩益禧电子股份有限公司 | Clock and data recovery circuit |
| EP2333673A1 (en) * | 2009-12-07 | 2011-06-15 | STMicroelectronics (Research & Development) Limited | Signal sampling and transfer. |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090243681A1 (en) * | 2008-03-26 | 2009-10-01 | Rambus Inc. | Embedded Source-Synchronous Clock Signals |
-
2015
- 2015-11-24 CN CN201510829148.0A patent/CN105356995B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1101472A (en) * | 1993-04-28 | 1995-04-12 | 美国电话电报公司 | Method and apparatus for adaptive clock recovery |
| CN1183867A (en) * | 1995-05-05 | 1998-06-03 | Gpt有限公司 | Retiming arrangement for SDH data transmission system |
| CN1301100A (en) * | 1999-12-17 | 2001-06-27 | 米特尔公司 | Clock resetting phase-locked loops |
| CN1226839C (en) * | 2001-09-27 | 2005-11-09 | 连宇通信有限公司 | Method for improving handover performance in synchonism CDMA mobile communication system |
| CN1507239A (en) * | 2002-12-10 | 2004-06-23 | 深圳市中兴通讯股份有限公司 | E2 interface device and method for synchronous digital transmission system |
| CN1540911A (en) * | 2003-04-25 | 2004-10-27 | 中兴通讯股份有限公司 | Circuit for recovering timing data and implementing method |
| CN1619992A (en) * | 2003-11-18 | 2005-05-25 | 华为技术有限公司 | Method of searching synchronous cade in network communication and its device |
| CN101018051A (en) * | 2006-02-01 | 2007-08-15 | 恩益禧电子股份有限公司 | Clock and data recovery circuit |
| EP2333673A1 (en) * | 2009-12-07 | 2011-06-15 | STMicroelectronics (Research & Development) Limited | Signal sampling and transfer. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105356995A (en) | 2016-02-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10887211B2 (en) | Indirect packet classification timestamping system and method | |
| CN105897330A (en) | Signal synchronization method used for UWB high-precision positioning system | |
| CN105610652B (en) | Method and device for acquiring data transmission delay | |
| CN102355382A (en) | Method for analyzing and triggering controller area network (CAN) bus | |
| AU2019203465B2 (en) | Link-fault tolerance in a distributed antenna system | |
| CN102708086A (en) | Elastic buffer structure and method applied to universal serial bus 3.0 (USB 3.0) | |
| CN101997670A (en) | Data receiving device, data receiving method and program | |
| CN101719867B (en) | Method and system for clock recovery in packet switching network | |
| CN105356995B (en) | A kind of two-way restoration methods of synchronous code and circuit | |
| ATE501558T1 (en) | METHOD FOR SYNCHRONIZING APPLICABLE CLOCK SIGNALS IN A SYNCHRONOUS COMMUNICATIONS NETWORK, CORRESPONDING TRANSMITTING AND RECEIVING DEVICES, COMPUTER PROGRAM PRODUCT AND COMPUTER-READABLE STORAGE MEANS | |
| CN103346873A (en) | Method and device for time synchronization | |
| CN106494466B (en) | The data apparatus for changing and its data costume changing method of train operation monitoring | |
| CN103501353A (en) | Data relay transmission method, device and system | |
| CN202904568U (en) | Elastic buffer structure applied to universal serial bus (USB) 3.0 | |
| CN108111896A (en) | A kind of captioning synchronization method and device | |
| CN105843768B (en) | A kind of single line communication time-after-time programmable memory method for burn-recording and the burning device based on this method | |
| CN109257158B (en) | Peer-to-peer sampling synchronization method and system for optical difference communication | |
| CN104735036B (en) | A kind of data earth-filling method and device | |
| CN107040784A (en) | A kind of video buffer processing method, system and device | |
| CN102655502B (en) | Precise fractional frequency division based data insertion method adapted to any data code stream | |
| CN105843759B (en) | A kind of multi-serial communication method based on HDLC | |
| CN103346855A (en) | Signal timing sequence restoration method and device | |
| CN109450517A (en) | RDSS communications control method and system | |
| CN104050128A (en) | High-speed clock data restoring circuit for USB (Universal Serial Bus) 2.0 | |
| CN110401813B (en) | Dynamic information network transmission mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200630 Address after: Room 2719, building 6, Sanqing Qisheng Plaza, Yingxiu Road, high tech Zone, Jinan City, Shandong Province Patentee after: Shandong Xinyi Electronic Technology Co.,Ltd. Address before: 250100 16, 1-1601A, 2 tower, Shun Tai Plaza, 2000 Shun Hua Road, Ji'nan high tech Zone, Ji'nan, Shandong. Co-patentee before: Dong Chuanyou Patentee before: SHANDONG SHENGKAI ELECTRONIC SCIENCE & TECHNOLOGY Co.,Ltd. Co-patentee before: Guo Yong |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180626 Termination date: 20211124 |