WO1982004515A1 - Bit synchronization adjuster - Google Patents
Bit synchronization adjuster Download PDFInfo
- Publication number
- WO1982004515A1 WO1982004515A1 PCT/GB1982/000161 GB8200161W WO8204515A1 WO 1982004515 A1 WO1982004515 A1 WO 1982004515A1 GB 8200161 W GB8200161 W GB 8200161W WO 8204515 A1 WO8204515 A1 WO 8204515A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- bit
- synchronization
- data processing
- processing system
- codeword
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B14/00—Transmission systems not characterised by the medium used for transmission
- H04B14/02—Transmission systems not characterised by the medium used for transmission characterised by the use of pulse modulation
- H04B14/04—Transmission systems not characterised by the medium used for transmission characterised by the use of pulse modulation using pulse code modulation
- H04B14/044—Sample and hold circuits
-
- 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
- H04L7/042—Detectors therefor, e.g. correlators, state machines
-
- 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
- H04L7/046—Speed or phase control by synchronisation signals using special codes as synchronising signal using a dotting sequence
Definitions
- This invention relates to a data processing system of the kind (hereinafter referred to as the kind set forth) in which there is a transmission of data of a code format having a pattern that provides a plurality of reversals 1011010 etc. from which it is desirable to maintain bit synchronization for the incoming data once initial synchronization is obtained.
- This desideratum is achieved according to the present invention by a data processing system of the kind set forth wherein after a first synchronization codeword is recognized at least a part of any following synchronization codeword is sampled at least twice per bit and compared with the known structure of the bits of known synchronization codeword to enable the bit structure of best fit with the known bit structure to be accepted by the system to derive the best sample instant of the transmission of said data.
- the best fit may conveniently be a running total or summation of least errors when compared with the structure.
- the codewords are sampled not twice but three times of which one time is both early and late of the other times and comparison is performed with the known structure of the synchronization codeword.
- the said one time is taken substantially at the position corresponding to the optimum sampling time obtained from the previous synchronization.
- One satisfactory analysis of a 32 bit synchronization codeword is to take three samples, of which the inner is both early and late of the two other samples by say l/8th of a bit width.
- Other spacings than 1/8th may be used to advantage but owing to drift error it should not come too close to the value of the said error. For example where the drift error is about 1/13th of a bit width, the sample spacing should exceed that value.
- Figure 1 shows seven bits of a 32 bit synchronization codeword.
- Figure 2 is a functional block diagram of one bit synchronization adjuster
- Figure 3 is a flow diagram of operations to be performed by the memory and microprocessor of Figure 2.
- the substantially centrally placed sample is conveniently called the inner sample (l) and the sample early of I (E) and the sample late of I (L). Error computation is given with relation to Figure 1 of the drawing and this is compared with the known bit structure of the synchronization codeword which is shown as K. It is readily seen from the figure that the received synchronization codeword R has blemishes due to noise and is sampled three times at I.E. and L where I is substantially centrally placed of the bit width B W the distances between I and E and I and L being in each case 1/8 B W .
- the circuitry of one data processing system operates as follows: During the reception of the codeword a number of separate sampling instants are used and repeated in the same relationship for each bit of the codeword. In this way a number of versions of the received codeword may be built-up one corresponding to each of the sampling instants used. The version of the codeword having the least errors and giving the best fit with the known structure of the code word will then
- FIG. 2 One specific embodiment of this function utilizes a microprocessor based system ( Figure 2).
- Figure 3 The flow chart associated with this function is Figure 3 and a listing is attached in the appendix A.
- a radio pager comprises a receiver board 10 having an aerial 11 by which a signal enters a radio frequency amplifier 12 a 1st mixer 13 coupled to a 1st oscillator 14 to a 1st intermediate frequency amplifier 15; from which it passes inter alia via a 2nd mixer 16 to an audio limiter 17 connected to the input/output of the microprocessor IS (MC 146805 E2) which is related to the memory of ROM (MCM65516) 19.
- the MPU will receive from the ROM a logical sequence set out in the flow sheet of Figure 2 wherein:-
Abstract
A data processing system of the kind in which there is a transmission of a code format having a pattern that provides a plurality of reversals 1011010 etc. from which it is desirable to maintain bit synchronization for the incoming data once initial synchronization is obtained. The system being characterized in this that after a first synchronization codeword is recognized at least a part of any following synchronization codeword is sampled at least twice (or three times) per bit and compared with the known structure of the bits of a known synchronization codeword to enable the bit structure of best fit with the known bit structure to be accepted by the system to sample the incoming data. The best fit may conveniently be a running total or summation of least errors when compared with the structure.
Description
BIT SYNCHRONIZATION ADJUSTER
DESCRIPTION
This invention relates to a data processing system of the kind (hereinafter referred to as the kind set forth) in which there is a transmission of data of a code format having a pattern that provides a plurality of reversals 1011010 etc. from which it is desirable to maintain bit synchronization for the incoming data once initial synchronization is obtained.
This desideratum is achieved according to the present invention by a data processing system of the kind set forth wherein after a first synchronization codeword is recognized at least a part of any following synchronization codeword is sampled at least twice per bit and compared with the known structure of the bits of known synchronization codeword to enable the bit structure of best fit with the known bit structure to be accepted by the system to derive the best sample instant of the transmission of said data.
The best fit may conveniently be a running total or summation of least errors when compared with the structure.
In a preferred embodiment the codewords are sampled not twice but three times of which one time is both early and late of the other times and comparison is performed with the known structure of the synchronization codeword.
Ideally the said one time is taken substantially at the position corresponding to the optimum sampling time obtained from the previous synchronization.
One satisfactory analysis of a 32 bit synchronization codeword, for example, is to take three samples, of which the inner is both early and late of the two other samples by say l/8th of a bit width. Other spacings than 1/8th may be used to advantage but owing to drift error it should not come too close to the value of the said error. For example where the drift error is about 1/13th of a bit width, the sample spacing should exceed that value.
The invention will be more fully understood from the following description given by way of example only with reference to the figures of the accompanying drawing in which Figure 1. shows seven bits of a 32 bit synchronization codeword. Figure 2 is a functional block diagram of one bit synchronization adjuster
of the invention and Figure 3 is a flow diagram of operations to be performed by the memory and microprocessor of Figure 2.
The substantially centrally placed sample is conveniently called the inner sample (l) and the sample early of I (E) and the sample late of I (L). Error computation is given with relation to Figure 1 of the drawing and this is compared with the known bit structure of the synchronization codeword which is shown as K. It is readily seen from the figure that the received synchronization codeword R has blemishes due to noise and is sampled three times at I.E. and L where I is substantially centrally placed of the bit width BW the distances between I and E and I and L being in each case 1/8 BW .
The error of the sampled structure from the known structure K is taken to be unity e1. Where the error is non-existent and the structure correct as in K the error is zero, eo.
The following table is then readily constructed:
B1 B2 B2 B4 B5 B6 B6 Total Errors
E eo eo eo e1 eo 3 e1 e1 e1
I eo eo eo eo 3 e1 e1 e1
L eo eo eo 2 eo eo e1
Clearly the sample or version at L has the least errors in comparison with the bit structure of K and thus L is the best fit and gives the optimum sampling instant and is subsequently accepted for use in the system.
The circuitry of one data processing system operates as follows: During the reception of the codeword a number of separate sampling instants are used and repeated in the same relationship for each bit of the codeword. In this way a number of versions of the received codeword may be built-up one corresponding to each of the sampling instants used. The version of the codeword having the least errors and giving the best fit with the known structure of the code word will then
be accepted by the system to indicate the best sampling instant. This instant and its repeat once every bit is then used to sample the incoming data.
One specific embodiment of this function utilizes a microprocessor based system (Figure 2). The flow chart associated with this function is Figure 3 and a listing is attached in the appendix A.
In Figure 2 a radio pager comprises a receiver board 10 having an aerial 11 by which a signal enters a radio frequency amplifier 12 a 1st mixer 13 coupled to a 1st oscillator 14 to a 1st intermediate frequency amplifier 15; from which it passes inter alia via a 2nd mixer 16 to an audio limiter 17 connected to the input/output of the microprocessor IS (MC 146805 E2) which is related to the memory of ROM (MCM65516) 19. The MPU will receive from the ROM a logical sequence set out in the flow sheet of Figure 2 wherein:-
101 is input first bit initialize error registers
102 is retain LSB invert initialize bit count
103 is advance timer 1/8th of a bit
104 is initialize X for three samples
105 is wait
106 i s input data
107 i s EOR wi th exnected bit
108 is add result to error register
109 is three samples in?
110 is thirty two bits in?
111 is initialize for early (E) sample selection
112 is does late (L) sample have less errors?
113 is SET accumulator and index register for late (L) timing
114 is does late (L) sample have same errors?
115 is set accumulator and index register for inner timing (I) 116 is does inner (l) sample have less errors? 117 is put next expected bit into V2SVB 118 is reset dead man timer
119 is minimum error count less than V2EROR?
120 is adjust timer according to accumulator contents
121 is set for BFLAG
122 is RETURN
Claims
1. A data processing system of the kind set forth wherein after a first synchronization codeword is recognized at least a part of any following synchronization codeword is sampled at least twice per bit and compared with the known structure of the bits of the known synchronization codeword to enable the bit structure of best fit with the known bit structure to be accepted by the system to derive the best sample instant of the transmission of said data.
2. The data processing system as claimed in claim 1 wherein the codeword is sampled not twice but three times of which one time is both early and late of the other times and comparison is performed with the known structure of the synchronization codeword.
3. The data processing system as claimed in claim 2 wherein the said one time is taken substantially at the position corresponding to the optimum sampling time obtained from the previous synchronization.
4. The data processing system as claimed in claim 2 or claim 3 wherein the samples are taken at a separation of 1/8th of a bit width.
5. The data processing system as claimed in any preceding claim wherein the said best fit is a running total or summation of least errors.
6. A data processing system constructed and arranged substantially as hereinbefore described and as shown in the figures of the accompanying drawing and the appendix.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB08118501A GB2101851A (en) | 1981-06-16 | 1981-06-16 | Bit synchronization adjuster |
GB8118501810616 | 1981-06-16 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1982004515A1 true WO1982004515A1 (en) | 1982-12-23 |
Family
ID=10522546
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB1982/000161 WO1982004515A1 (en) | 1981-06-16 | 1982-05-28 | Bit synchronization adjuster |
Country Status (4)
Country | Link |
---|---|
EP (1) | EP0081500A1 (en) |
JP (1) | JPS58501488A (en) |
GB (1) | GB2101851A (en) |
WO (1) | WO1982004515A1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0268694A1 (en) * | 1986-11-22 | 1988-06-01 | ANT Nachrichtentechnik GmbH | Method for synchronisation on signals transmitted by time division multiplexing and for the clock recovery from it |
EP0282202A2 (en) * | 1987-03-03 | 1988-09-14 | Advanced Micro Devices, Inc. | Preamble search and synchronizer circuit |
EP0306002A1 (en) * | 1987-09-01 | 1989-03-08 | Siemens Aktiengesellschaft | Process for the adaptive phase adjustment in a synchronous wide-band digital signal coupler |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2225198B (en) * | 1988-09-20 | 1993-05-05 | Texas Instruments Ltd | Improvements in or relating to digital signal processors |
US6914947B2 (en) | 2001-02-28 | 2005-07-05 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for handling time-drift |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3435424A (en) * | 1967-03-03 | 1969-03-25 | Burroughs Corp | Synchronizing system |
FR2180988A1 (en) * | 1972-04-19 | 1973-11-30 | Int Standard Electric Corp | |
US4189622A (en) * | 1975-10-17 | 1980-02-19 | Ncr Corporation | Data communication system and bit-timing circuit |
FR2460072A1 (en) * | 1979-06-22 | 1981-01-16 | Henry Michel | PCM signals regeneration unit - has de-phaser which is controlled by auxiliary regenerators in dependence on degenerated pulse and clock pulse phase difference |
GB2086106A (en) * | 1980-10-13 | 1982-05-06 | Motorola Ltd | Pager Decoding System with Intelligent Synchronisation Circuit |
-
1981
- 1981-06-16 GB GB08118501A patent/GB2101851A/en not_active Withdrawn
-
1982
- 1982-05-28 JP JP50161082A patent/JPS58501488A/en active Pending
- 1982-05-28 EP EP19820901530 patent/EP0081500A1/en not_active Withdrawn
- 1982-05-28 WO PCT/GB1982/000161 patent/WO1982004515A1/en not_active Application Discontinuation
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3435424A (en) * | 1967-03-03 | 1969-03-25 | Burroughs Corp | Synchronizing system |
FR2180988A1 (en) * | 1972-04-19 | 1973-11-30 | Int Standard Electric Corp | |
US4189622A (en) * | 1975-10-17 | 1980-02-19 | Ncr Corporation | Data communication system and bit-timing circuit |
FR2460072A1 (en) * | 1979-06-22 | 1981-01-16 | Henry Michel | PCM signals regeneration unit - has de-phaser which is controlled by auxiliary regenerators in dependence on degenerated pulse and clock pulse phase difference |
GB2086106A (en) * | 1980-10-13 | 1982-05-06 | Motorola Ltd | Pager Decoding System with Intelligent Synchronisation Circuit |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0268694A1 (en) * | 1986-11-22 | 1988-06-01 | ANT Nachrichtentechnik GmbH | Method for synchronisation on signals transmitted by time division multiplexing and for the clock recovery from it |
EP0282202A2 (en) * | 1987-03-03 | 1988-09-14 | Advanced Micro Devices, Inc. | Preamble search and synchronizer circuit |
EP0282202A3 (en) * | 1987-03-03 | 1990-04-25 | Advanced Micro Devices, Inc. | Preamble search and synchronizer circuit |
EP0306002A1 (en) * | 1987-09-01 | 1989-03-08 | Siemens Aktiengesellschaft | Process for the adaptive phase adjustment in a synchronous wide-band digital signal coupler |
Also Published As
Publication number | Publication date |
---|---|
JPS58501488A (en) | 1983-09-01 |
EP0081500A1 (en) | 1983-06-22 |
GB2101851A (en) | 1983-01-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US4506372A (en) | Method and apparatus for recognizing in a receiver the start of a telegram signal consisting of a bit impulse sequence | |
EP0148198B1 (en) | Data detector using probabilistic information in received signals | |
US4409684A (en) | Circuit for synchronizing a transmitting-receiving station to a data network of a digital communication system | |
EP0045801A4 (en) | Digital pseudo continuous tone detector. | |
EP0052900B1 (en) | Signal comparison circuit | |
WO1982004515A1 (en) | Bit synchronization adjuster | |
US4361896A (en) | Binary detecting and threshold circuit | |
US3084223A (en) | Crosstalk reduction in plural carrier multiplex systems | |
EP0035564B1 (en) | Binary coincidence detector | |
JPS6135041A (en) | Digital signal transmitter | |
JPS56122251A (en) | Synchronous control system | |
RU2018206C1 (en) | Frequency-keyed signal receiver | |
US7187720B2 (en) | Noiseless data transmission method | |
US5781064A (en) | Digital filtering system for filtering digital outputs of a four level FSK demodulator | |
SU803109A1 (en) | Telegraphic unipolar signal receiver input device | |
NO163589B (en) | PROCEDURE FOR TRANSMITTING AND RECEIVING DIGITAL INFORMATION SIGNALS. | |
SU1084854A1 (en) | Device for receiving and processing noise-type signals | |
RU2107996C1 (en) | Local emergency communication system | |
RU2109407C1 (en) | Recurrent sequence phased triggering device | |
EP0330001B1 (en) | System devices and algorithm for the error correction in digital transmissions with "BCH" coding/decoding | |
RU1786664C (en) | Multichannel device for complex signal receiving | |
JPS5710566A (en) | Decoding circuit | |
SU1764167A1 (en) | Diversity receiver for separated signals | |
SU1116547A1 (en) | Device for selecting recurrent synchronizing signal | |
SU512591A1 (en) | Recurrent clock error correcting device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Designated state(s): JP US |
|
AL | Designated countries for regional patents |
Designated state(s): AT CH DE FR NL SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1982901530 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1982901530 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1982901530 Country of ref document: EP |