CN1015855B - Reliable group transmission mode of informations - Google Patents
Reliable group transmission mode of informationsInfo
- Publication number
- CN1015855B CN1015855B CN 87104848 CN87104848A CN1015855B CN 1015855 B CN1015855 B CN 1015855B CN 87104848 CN87104848 CN 87104848 CN 87104848 A CN87104848 A CN 87104848A CN 1015855 B CN1015855 B CN 1015855B
- Authority
- CN
- China
- Prior art keywords
- sequence
- data
- grouping information
- receiving end
- communication systems
- 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
Links
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention discloses an efficient reliable transmission mode for grouping information, which is suitable for hopping frequency communication systems, burst communication systems, secrecy communication systems, etc. In general, frame synchronization, destination addresses, data, etc. in grouping information are transferred in segments, and therefore, the efficiency is low. For realizing reliable transfer in the present invention, the destination addresses at the sending end determine a sequence set {Ci}; any bit ai of data is replaced with a sequence bi, wherein bi=ai+Ci; then, the sequence is sent to the receiving end after being disturbed by positions and data. The receiving end performs relevant judgment to the Ci sequence; both positive correlation and negative correlation are counted. If a count value exceeds a threshold value, the grouping information is considered to belong to a local machine, and the frame synchronization is obtained.
Description
The invention provides a kind of grouping information transfer approach, communication systems such as being applicable to frequency hopping, bursting and maintaining secrecy.
In the existing transfer approach, the frame swynchronization code of grouping information, destination address, synchrodata etc. all are that the branch section transmits.Referring to Fig. 1.Among the figure, 1 is the frame swynchronization code section, and 2 is the destination address section, and 3 is data segments.In the course of work, enough high for guaranteeing detection probability, false alarm probability is enough little, and the figure place of frame swynchronization code can not be big; And for guaranteeing when the error rate is big (as 10
-1) can make the correct probability of acceptance of address and data enough high, must carry out redundancy encoding to them again, this causes decrease in efficiency.
The objective of the invention is to avoid weak point of the prior art and a kind of transfer approach is provided, do not need special frame swynchronization code section and destination address section; And when data bit data and the correct probability of acceptance equate with existing method, needed redundancy will be not more than existing method.That is to say that the present invention only needs the bit length of original data segment, just can transmit same grouping information with the identical correct probability of acceptance.
Coding method of the present invention is such: will need the K Bit data that transmits, and be encoded to (L, K) packeting error-correcting code (L is a code length, and K is an information digit).If M=NL is a positive integer.To (L, K) the arbitrary bit length a in the sign indicating number
i(I≤i≤L) replaces sequence b
i=a
i 
C
iC in the formula
iFor N bit sequence, have 2
NKind.Consider a
iDesirable 0 or 1, use C
iJust can not re-use its antitone sequence C afterwards
i, so available sequences is 2
N-1This L b sequence (I≤i≤L) according to certain rules in addition the position upset.As (L, K) the pairing N bit sequence in a certain position of sign indicating number can transmit at the 5.9.13...... equipotential of M bit data section, and the rest may be inferred by analogy.The total M! of upset method Kind.
Through the resulting M bit of above-mentioned processing, carry out by turn transmitting to receiving end after mould two adds computing with the good M bit sequence of another auto-correlation and cross-correlation performance again, establish the total H kind of the M position correlated series that meets the demands.
The address total amount of coded system is 2 like this
(N-1) L* M! * H kind.The address amount that has is huge.
The known N bit sequence of making a start and adopting of receiving end, mode is upset in M position correlated series and position, a is a random data, it may get 0 or 1, that transmit so make a start may be the occurrence number G of C or C, after receiving M bit synchronization sequence, add as long as carry out mould two again with known M position correlated series, the occurrence number G of C or C is detected in the position known to each then.When G surpasses threshold value, then accepted, obtain frame synchronization.The data that behind majority-logic decoding and error-correcting decoding, can obtain making a start.
According to the given error rate, detection and false alarm probability, suitably select N, L, G can satisfy the communication system requirement.
Fig. 1 is existing packet transmission method.Fig. 2 is the code pattern of making a start, and it comprises that data go into 1, encoder 9, sequencer 2, address memory 7, correlated series generator 3, shift register 4, switch arrays 6 modular two addition devices 5 and output to receiving terminal sequence 8.Fig. 3 is the receiving end calcspar, and it is by sending sequence 1, modular two addition device 2 correlated serieses 3, address code memory 12, shift register 4, switch arrays 5, correlator 6, counter 7, majority-logic decoding device 8, error correcting deocder 9, frame-synchronizing impulse forms device 10, frame-synchronizing impulse goes out 11, and data go out 13 and form.
Below in conjunction with Fig. 2 the cataloged procedure of making a start is described.The K bit data I that need to transmit, in encoder 9, be encoded to (L, K) sign indicating number after, send into N bit sequence generator 2, by the instruction of address code memory, export C respectively
iOr C
iTo switch arrays 6.Switch arrays 6 are under the control of address code, with C
iOr C
iDeposit the relevant position of M bit shift register 4 in, realize upsetting.Correlated series generator 3 produces M sequence in the corresponding M position correlated series and 4 and carries out in modular two addition device 5 after mould two adds under the control of address code memory 7, sending out the sequence of delivering to receiving end is 8.
Fig. 3 is the receiving end calcspar.The sequence 1 of coming by making a start is carried out mould two with the M position correlated series that is produced by correlated series generator 3 under 12 controls of address code memory and is deposited M bit shift register 4 in after adding in modular two addition device 2.Under 12 controls of address code memory, switch arrays 5 are selected each N bit sequence C respectively
iPerhaps C
iDeliver to correlator 6.Correlator 6 send a pulse signal to counter 7 after obtaining the judgement of positive correlation or negative correlation, and counter 7 forms 10 1 high level of device to frame-synchronizing impulse after full G the pulse of meter, make it to produce frame-synchronizing impulse 11.Lock-out pulse 11 starts majority-logic decoding 8, carries out majority-logic decoding, and decoder is exported in the error correcting deocder 9 again and deciphered, and obtains data 13.
To sum up state, adopt method of the present invention, only use the Baud Length of data segments, can realize comprising the transmission and the reception of the grouping information of frame swynchronization code, destination address and data, efficient is high and transmission is reliable, very with practical value.
Claims (3)
1, a kind of grouping information transfer approach is characterized in that making a start and encodes with following manner, promptly by different destination addresses, chooses arrangement set { C
i, with each a of data
iRespectively with sequence C
iOr C
iCarrying out mould two adds afterwards to the receiving end transmission, by receiving end each C to receiving
iThe sequence judgement of being correlated with is all delivered to counter to positive and negative coherent pulse and is counted, and the counting threshold value surpasses the information that given thresholding is promptly thought this machine, and obtains frame synchronization.
2, it is characterized in that above-mentioned b by the described grouping information transfer approach of claim 1
iSequence is carried out the position by the mode of destination address decision and is upset.
3, by the described grouping information transfer approach of claim 1, it is characterized in that above-mentioned b
iSequence is carried out data perturbation by the mode of destination address decision.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 87104848 CN1015855B (en) | 1987-07-13 | 1987-07-13 | Reliable group transmission mode of informations |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 87104848 CN1015855B (en) | 1987-07-13 | 1987-07-13 | Reliable group transmission mode of informations |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1030678A CN1030678A (en) | 1989-01-25 |
| CN1015855B true CN1015855B (en) | 1992-03-11 |
Family
ID=4815035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 87104848 Expired CN1015855B (en) | 1987-07-13 | 1987-07-13 | Reliable group transmission mode of informations |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1015855B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9615029D0 (en) * | 1996-07-17 | 1996-09-04 | British Telecomm | Internet call centre |
-
1987
- 1987-07-13 CN CN 87104848 patent/CN1015855B/en not_active Expired
Also Published As
| Publication number | Publication date |
|---|---|
| CN1030678A (en) | 1989-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU595070B2 (en) | A communication system and stations for such a system | |
| US3648237A (en) | Apparatus and method for obtaining synchronization of a maximum length pseudorandom sequence | |
| CN102651655B (en) | Realization method of fast frequency hopping communication | |
| Hui | Pattern code modulation and optical decoding-A novel code-division multiplexing technique for multifiber networks | |
| US3836726A (en) | Data transmission method and apparatus | |
| CA1284193C (en) | Encoding and decoding system for electronic data communication system | |
| KR19980703104A (en) | Method and apparatus for data encoding and communication over noisy media | |
| US4633247A (en) | Remote control system for selectively activating and inactivating equipment | |
| CN101702639B (en) | Check value calculation method and device of cyclic redundancy check | |
| GB1361353A (en) | Data transmission system | |
| CA2103744A1 (en) | Adaptive data rate packet communications system | |
| GB2094110A (en) | A method and apparatus for locating a discontinuity in a data transmission | |
| GB2075309B (en) | Processing binary data framing | |
| CN1015855B (en) | Reliable group transmission mode of informations | |
| US6415412B2 (en) | Signal used in the transmission of data in a communication system | |
| CN100361428C (en) | Method and device for diversity transmission of encoded information | |
| US4622685A (en) | RTS/DCD simulator | |
| CN101345529B (en) | Pulse group digital coding and decoding method for multi-channel multi-ary | |
| US3646273A (en) | Multiplex communication system and method for modifying system behavior | |
| CN1868138A (en) | System for data collection through an alternate current supply network | |
| US3234364A (en) | Generator of parity check bits | |
| US3008003A (en) | Spiral error checking system | |
| SU388362A1 (en) | DISCRETE INFORMATION TRANSFORMATION SYSTEM WITH EXCESS | |
| Jabri et al. | Adaptive-rate transmission with coding and interleaving for a further improvement in the throughput of meteor-burst communication systems | |
| US3427400A (en) | Data transmission of variable block lengths over half duplex networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C13 | Decision | ||
| GR02 | Examined patent application | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |