CN102055482A - Data transmission method - Google Patents

Data transmission method Download PDF

Info

Publication number
CN102055482A
CN102055482A CN2010105362956A CN201010536295A CN102055482A CN 102055482 A CN102055482 A CN 102055482A CN 2010105362956 A CN2010105362956 A CN 2010105362956A CN 201010536295 A CN201010536295 A CN 201010536295A CN 102055482 A CN102055482 A CN 102055482A
Authority
CN
China
Prior art keywords
binary data
coding
bit binary
adopts
adopt
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.)
Granted
Application number
CN2010105362956A
Other languages
Chinese (zh)
Other versions
CN102055482B (en
Inventor
李建成
任天鹏
王宏义
庄钊文
唐朝京
许拔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Kunpeng Information Technology Co ltd
Original Assignee
National University of Defense Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN 201010536295 priority Critical patent/CN102055482B/en
Publication of CN102055482A publication Critical patent/CN102055482A/en
Application granted granted Critical
Publication of CN102055482B publication Critical patent/CN102055482B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Dc Digital Transmission (AREA)

Abstract

The invention provides a data encoding method applied to a label end in a passive radio frequency identification system. According to the technical scheme, binary data 0 and binary data 1 are encoded in same length, wherein if the binary data 1 is encoded in the manner of jumping the middle phase, the binary data 0 is encoded in the manner of not jumping the middle phase, and if the binary data 0 is encoded in the manner of jumping the middle phase, the binary data 1 is encoded in the manner of not jumping the middle phase. Through the data encoding method provided by the invention, the phase jump probability between the encoding waveforms of two adjacent binary data in the encoding process can be reduced so as to solve the problem that the phase jump probability between the encoding waveforms of two adjacent binary data is relatively high in the traditional encoding method.

Description

A kind of data transmission method
 
Technical field
The invention belongs to the radio-frequency (RF) identification communication technical field, be specifically related to a kind of data-encoding scheme that is applied in the radio-frequency recognition system.
Background technology
Radio-frequency (RF) identification (Radio Frequency Identification, RFID) communication technology is a kind of non-contact automatic identification technology; Radio-frequency recognition system mainly is made of label, read write line and computer network system.Read write line communicates by radiofrequency signal and label, obtains the identifying information of storing on the label, by computer network system the label information that reads is managed and communication simultaneously.
Radio-frequency recognition system can be divided into two classes: passive radio frequency identification system and active radio-frequency recognition system, both main distinctions are in tab end.The labeling requirement of passive radio frequency identification system is obtained energy from the radiofrequency signal that the read write line emission comes, and the label of active radio-frequency recognition system self can provide energy.
In passive radio frequency identification system, the radiofrequency signal of read write line after with encoded and modulation sends to label, and label is modulated to backward scattered radiofrequency signal after with the data message coding of answering, and sends to then read write line.In the radio-frequency (RF) identification international standard, such as among the ISO 18000-6A/B/C, the mode that label was encoded before data message is sent to read write line is FM0 or Miller coding normally.But have phase hit between the coding waveforms of any two binary data in the FM0 coding, jumping probability is 100%; Have phase hit between the coding waveforms of two adjacent binary data 0 in the Miller coding, jumping probability is 25%.The frequent saltus step of phase place will cause spectrum energy to be revealed, and signal spectrum broadens.
Summary of the invention
Main purpose of the present invention is, a kind of data-encoding scheme that is applied to tab end in the passive radio frequency identification system is provided, can reduce phase hit probability between the coding waveforms of two adjacent in coding binary data, with the phase hit probability problem of higher between the coding waveforms that solves adjacent two binary data that exist in the existing coding method.
Technical scheme 1 of the present invention is, a kind of data-encoding scheme is applied to the tab end of passive radio frequency identification system, it is characterized in that, comprises the steps:
Suppose S 1The high level of not saltus step of expression intermediate phase, S 2The trailing edge of expression intermediate phase saltus step, S 3The rising edge of expression intermediate phase saltus step, S 4The low level of not saltus step of expression intermediate phase.
Binary data 0 and binary data 1 are adopted the equal length coding; And
If initial two bits of armed binary data sequence are 00, then adopt S 1S 1Coding, namely first bit 0 adopts S 1Coding, second bit 0 also adopts S 1Coding;
If initial two bits of armed binary data sequence are 01, then adopt S 1S 2Coding, namely first bit 0 adopts S 1Coding, second bit 1 adopts S 2Coding;
If initial two bits of armed binary data sequence are 10, then adopt S 2S 4Coding, namely first bit 1 adopts S 2Coding, second bit 0 adopts S 4Coding;
If initial two bits of armed binary data sequence are 11, then adopt S 2S 3Coding, namely first bit 1 adopts S 2Coding, second bit 1 adopts S 3Coding; And
If above-mentioned armed K bit binary data be 0(for sake of convenience, suppose that follow-up armed binary data is positioned at the K position of armed binary data sequence, and K〉2), and
If the K-1 bit binary data is 0, then:
If K-2 position and K-1 bit binary data are 00 and adopt S 1S 1Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 1S 4Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 4S 1Coding, then K bit binary data 0 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 4S 4Coding, then K bit binary data 0 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 10 and adopt S 2S 4Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 10 and adopt S 3S 1Coding, then K bit binary data 0 adopts S 1Coding;
If the K-1 bit binary data is 1, then:
If K-1 bit binary data 1 adopts S 2Coding, then K bit binary data 0 adopts S 4Coding;
If K-1 bit binary data 1 adopts S 3Coding, then K bit binary data 0 adopts S 1Coding.
If above-mentioned armed K bit binary data is 1, and
If the K-1 bit binary data is 0, then:
If K-1 bit binary data 0 adopts S 1Coding, then K bit binary data 1 adopts S 2Coding;
If K-1 bit binary data 0 adopts S 4Coding, then K bit binary data 1 adopts S 3Coding;
If the K-1 bit binary data is 1, then:
If K-1 bit binary data 1 adopts S 2Coding, then K bit binary data 1 adopts S 3Coding;
If K-1 bit binary data 1 adopts S 3Coding, then K bit binary data 1 adopts S 2Coding.
If in above-mentioned embodiment, the location swap of binary data 0 and binary data 1 then forms a kind of technical scheme 2 of coding method.
The invention has the beneficial effects as follows: adopt the coded system of phase hit and not saltus step of phase place to combine, controlled the phase hit probability between the waveform in the binary data sequence coding, made that the probability of the phase hit between the binary data waveform of coding back only is 12.5%; Compare with FM0, Miller coding method, exist the probability of phase hit to reduce by 87.5% and 50% respectively between the coding waveforms of coding back binary data; Under the identical prerequisite of data rate, the signal spectrum energy is more concentrated, and frequency spectrum is narrower.
Description of drawings
The binary data coding baseband signalling schematic diagram that Fig. 1 provides for the embodiment of the invention;
The binary data coding state transition diagram that Fig. 2 provides for technical scheme 1 of the present invention;
Fig. 3 is a baseband signalling sequence schematic diagram behind the binary data coding in a kind of embodiment of technical solution of the present invention 1;
Fig. 4 is the baseband signalling sequence schematic diagram of FM0 coding;
Fig. 5 is the baseband signalling sequence schematic diagram of Miller coding;
Fig. 6 is the binary data coding base-band signal spectrum comparison diagram that three kinds of coding methods obtain.
Embodiment
Below in conjunction with drawings and Examples coding method of the present invention is described in detail.
The binary data coding baseband signalling schematic diagram that Fig. 1 provides for the embodiment of the invention, the abscissa of wherein every width of cloth figure is a time shaft, ordinate is an amplitude axis.The high level S of the not saltus step of (a) expression intermediate phase among the figure 1, (b) the trailing edge S of expression intermediate phase saltus step 2, (c) the rising edge S of expression intermediate phase saltus step 3, (d) the low level S of not saltus step of expression intermediate phase 4 Technical scheme 1 provided by the invention is that binary data 1 is used S 2Or S 3Coding, binary data 0 is used S 1Or S 4Coding; 2 of technical schemes are that binary data 0 is used S 2Or S 3Coding, binary data 1 is used S 1Or S 4Coding.
The binary data coding state transition diagram that Fig. 2 provides for technical scheme 1 of the present invention, wherein:
If ◇ is the current S that is in 1State:
1) if next-door neighbour's previous state is in S 1State, when then receiving binary data 0, state transitions is to S 4, there is phase hit in state transitions; When receiving binary data 1, state transitions is to S 2, state transitions does not have phase hit.
2) if next-door neighbour's previous state is not in S 1State, when then receiving binary data 0, state transitions is to S 1, state transitions does not have phase hit; When receiving binary data 1, state transitions is to S 2, state transitions does not have phase hit.
If ◇ is the current S that is in 2State:
When receiving binary data 0, state transitions is to S 4, state transitions does not have phase hit;
When receiving binary data 1, state transitions is to S 3, state transitions does not have phase hit.
If ◇ is the current S that is in 3State:
When receiving binary data 0, state transitions is to S 1, state transitions does not have phase hit.
When receiving binary data 1, state transitions is to S 2, state transitions does not have phase hit.
If ◇ is the current S that is in 4State:
1) if next-door neighbour's previous state is in S 4State, when then receiving binary data 0, state transitions is to S 1, there is phase hit in state transitions; When receiving binary data 1, state transitions is to S 3, state transitions does not have phase hit;
2) if next-door neighbour's previous state is not in S 4State, when then receiving binary data 0, state transitions is to S 4, state transitions does not have phase hit; When receiving binary data 1, state transitions is to S 3, state transitions does not have phase hit;
In the state, has only the current S of being in above-mentioned 4 1And S 4May have phase hit between the waveform of binary data coding during state, jumping probability is 25%.Therefore in the whole cataloged procedure between the coding waveforms of binary data the phase hit probability be 12.5%.
Fig. 3 is baseband signalling sequence schematic diagram behind the binary data coding in a kind of specific embodiment of technical solution of the present invention 1, this specific embodiment is encoded according to the method that technical scheme 1 provides, wherein: if the last position binary data 1 of binary data sequence 00, namely (1) shown in the figure 00 then adopts S 1S 1Or S 4S 4Coding.If last position binary data 0, namely (0) shown in the figure 00 then adopts S 1S 4Or S 4S 1Coding; Binary data sequence 01 adopts S 1S 2Or S 4S 3Coding; Binary data sequence 10 adopts S 2S 4Or S 3S 1Coding; Binary data sequence 11 adopts S 2S 3Or S 3S 2Coding.Obviously, the phase hit probability of (T constantly) is 12.5% between the coding waveforms of two binary numbers.
Fig. 4 is the baseband signalling sequence schematic diagram of FM0 coding, and wherein: binary data sequence 00 adopts S 2S 2Or S 3S 3Coding; Binary data sequence 01 adopts S 2S 1Or S 3S 4Coding; Binary data sequence 10 adopts S 1S 3Or S 4S 2Coding; Binary data sequence 11 adopts S 1S 4Or S 4S 1Coding.Obviously, between the FM0 coding waveforms of two binary numbers (constantly T) necessarily to have phase hit, the probability of saltus step be 100%.
Fig. 5 is the baseband signalling sequence schematic diagram of Miller coding, and wherein: binary data sequence 00 adopts S 1S 4Or S 4S 1Coding; Binary data sequence 01 adopts S 1S 2Or S 4S 3Coding; Binary data sequence 10 adopts S 2S 4Or S 3S 1Coding; Binary data sequence 11 adopts S 2S 3Or S 3S 2Coding.Obviously, after binary data sequence carried out Miller coding, have only (T constantly) phase place generation saltus step between the coding waveforms of binary data sequence 00, other situations comprise that saltus step does not take place (T constantly) phase place between the coding waveforms of binary data sequence 01,10,11.So the probability of (T constantly) phase hit is 25% between the coding waveforms of Miller when coding binary data.
Fig. 6 is the binary data coding base-band signal spectrum comparison diagram that three kinds of coding methods obtain, comprise digital coding base-band signal spectrum 601 of the present invention, FM0 coded baseband signal frequency spectrum 602 and Miller coded baseband signal frequency spectrum 603, wherein abscissa is a numerical frequency, and ordinate is the normalization spectrum amplitude.Because with respect to FM0 and Miller coding, the probability of the coding waveforms phase hit of binary data reduces respectively 87.5% and 50% when using coding method of the present invention, so signal spectrum is narrower, energy is more concentrated.

Claims (2)

1. data transmission method is applied to the tab end of passive radio frequency identification system, it is characterized in that, comprises the steps:
Suppose S 1The high level of not saltus step of expression intermediate phase, S 2The trailing edge of expression intermediate phase saltus step, S 3The rising edge of expression intermediate phase saltus step, S 4The low level of not saltus step of expression intermediate phase;
Binary data 0 and binary data 1 are adopted the equal length coding; And
If initial two bits of armed binary data sequence are 00, then adopt S 1S 1Coding;
If initial two bits of armed binary data sequence are 01, then adopt S 1S 2Coding;
If initial two bits of armed binary data sequence are 10, then adopt S 2S 4Coding;
If initial two bits of armed binary data sequence are 11, then adopt S 2S 3Coding; And
If above-mentioned armed K bit binary data is 0, K〉2, and
If the K-1 bit binary data is 0, then:
If K-2 position and K-1 bit binary data are 00 and adopt S 1S 1Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 1S 4Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 4S 1Coding, then K bit binary data 0 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 00 and adopt S 4S 4Coding, then K bit binary data 0 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 10 and adopt S 2S 4Coding, then K bit binary data 0 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 10 and adopt S 3S 1Coding, then K bit binary data 0 adopts S 1Coding;
If the K-1 bit binary data is 1, then:
If K-1 bit binary data 1 adopts S 2Coding, then K bit binary data 0 adopts S 4Coding;
If K-1 bit binary data 1 adopts S 3Coding, then K bit binary data 0 adopts S 1Coding;
If above-mentioned armed K bit binary data is 1, and
If the K-1 bit binary data is 0, then:
If K-1 bit binary data 0 adopts S 1Coding, then K bit binary data 1 adopts S 2Coding;
If K-1 bit binary data 0 adopts S 4Coding, then K bit binary data 1 adopts S 3Coding;
If the K-1 bit binary data is 1, then:
If K-1 bit binary data 1 adopts S 2Coding, then K bit binary data 1 adopts S 3Coding;
If K-1 bit binary data 1 adopts S 3Coding, then K bit binary data 1 adopts S 2Coding.
2. data-encoding scheme is applied to the tab end of passive radio frequency identification system, it is characterized in that, comprises the steps:
Suppose S 1The high level of not saltus step of expression intermediate phase, S 2The trailing edge of expression intermediate phase saltus step, S 3The rising edge of expression intermediate phase saltus step, S 4The low level of not saltus step of expression intermediate phase;
Binary data 0 and binary data 1 are adopted the equal length coding; And
If initial two bits of armed binary data sequence are 11, then adopt S 1S 1Coding;
If initial two bits of armed binary data sequence are 10, then adopt S 1S 2Coding;
If initial two bits of armed binary data sequence are 01, then adopt S 2S 4Coding;
If initial two bits of armed binary data sequence are 00, then adopt S 2S 3Coding; And
If above-mentioned armed K bit binary data is 1, K〉2, and
If the K-1 bit binary data is 1, then:
If K-2 position and K-1 bit binary data are 11 and adopt S 1S 1Coding, then K bit binary data 1 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 11 and adopt S 1S 4Coding, then K bit binary data 1 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 11 and adopt S 4S 1Coding, then K bit binary data 1 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 11 and adopt S 4S 4Coding, then K bit binary data 1 adopts S 1Coding;
If K-2 position and K-1 bit binary data are 01 and adopt S 2S 4Coding, then K bit binary data 1 adopts S 4Coding;
If K-2 position and K-1 bit binary data are 01 and adopt S 3S 1Coding, then K bit binary data 1 adopts S 1Coding;
If the K-1 bit binary data is 0, then:
If K-1 bit binary data 0 adopts S 2Coding, then K bit binary data 1 adopts S 4Coding;
If K-1 bit binary data 0 adopts S 3Coding, then K bit binary data 1 adopts S 1Coding;
If above-mentioned armed K bit binary data is 0, and
If the K-1 bit binary data is 1, then:
If K-1 bit binary data 1 adopts S 1Coding, then K bit binary data 0 adopts S 2Coding;
If K-1 bit binary data 1 adopts S 4Coding, then K bit binary data 0 adopts S 3Coding;
If the K-1 bit binary data is 0, then:
If K-1 bit binary data 0 adopts S 2Coding, then K bit binary data 0 adopts S 3Coding;
If K-1 bit binary data 0 adopts S 3Coding, then K bit binary data 0 adopts S 2Coding.
CN 201010536295 2010-11-09 2010-11-09 Data transmission method Active CN102055482B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010536295 CN102055482B (en) 2010-11-09 2010-11-09 Data transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010536295 CN102055482B (en) 2010-11-09 2010-11-09 Data transmission method

Publications (2)

Publication Number Publication Date
CN102055482A true CN102055482A (en) 2011-05-11
CN102055482B CN102055482B (en) 2013-04-03

Family

ID=43959471

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010536295 Active CN102055482B (en) 2010-11-09 2010-11-09 Data transmission method

Country Status (1)

Country Link
CN (1) CN102055482B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107453838A (en) * 2016-11-24 2017-12-08 天地融科技股份有限公司 Data frame hair delivery method and dispensing device
CN110036596A (en) * 2016-11-04 2019-07-19 美商新思科技有限公司 Phase-shift coding for signal transition minimized

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060226245A1 (en) * 2005-04-12 2006-10-12 Holtek Semiconductor Inc. Encoding format for passive radio frequency identification (RFID) system
CN101616109A (en) * 2008-06-27 2009-12-30 中兴通讯股份有限公司 A kind of data transmission method
CN101620663A (en) * 2008-07-02 2010-01-06 中兴通讯股份有限公司 Data transmitting method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060226245A1 (en) * 2005-04-12 2006-10-12 Holtek Semiconductor Inc. Encoding format for passive radio frequency identification (RFID) system
CN101616109A (en) * 2008-06-27 2009-12-30 中兴通讯股份有限公司 A kind of data transmission method
CN101620663A (en) * 2008-07-02 2010-01-06 中兴通讯股份有限公司 Data transmitting method

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110036596A (en) * 2016-11-04 2019-07-19 美商新思科技有限公司 Phase-shift coding for signal transition minimized
CN110036596B (en) * 2016-11-04 2022-09-09 美商新思科技有限公司 Phase shift encoding method for signal transition minimization and encoder and decoder
CN107453838A (en) * 2016-11-24 2017-12-08 天地融科技股份有限公司 Data frame hair delivery method and dispensing device
CN107453838B (en) * 2016-11-24 2020-08-21 天地融科技股份有限公司 Data frame header sending method and sending device

Also Published As

Publication number Publication date
CN102055482B (en) 2013-04-03

Similar Documents

Publication Publication Date Title
CN209994396U (en) Integrated circuit for decoding a data stream carried by a modulated signal
CN101673195B (en) Information transmission method, system and device in radio frequency identification
CN102257767B (en) Method for configuring physical layer of low frequency band based on wireless magnetic field communication, and computer-readable recording medium including program for executing the method
CN101989329B (en) Data encoding method applying in radio frequency identification system
CN101620664A (en) Method for transmitting data information from reader to label
CN101743697A (en) Label identification method, label anti-confliction method and RFID tag
CN102545926A (en) Communication system for recognizing type of noise source
CN102055482B (en) Data transmission method
CN102129586B (en) Information encoding method, method and device for transmitting information from reader-writer to label
CN106508106B (en) For RF identification read write line to label communication means
CN104331733A (en) Ultrahigh-frequency RFID label and anti-interference method thereof
CN102682250B (en) A kind of battery assist type RFID label chip signal reflex method
CN106508105B (en) For RF identification read write line to label information transferring method
CN102043936A (en) Information transmission method and system in radio frequency identification system
CN101136051A (en) Method for transmitting information from reader used for recognizing radio frequency to label
US8432255B2 (en) Secondary data channels in RFID systems
CN101616109B (en) Data transmission method for reader to marker in radios frequency identification
US10069539B2 (en) Communication device, communication system, and communication method
CN103004168A (en) Data transceiver and data-transceiving method for bio-implantable medical devices
US20130135085A1 (en) Transponder unit, system and method for contactless data transmission
CN106375255B (en) PR_ASK modulator approach based on FPGA
CN101136052A (en) Method for transmitting information from reader used for recognizing radio frequency to label
CN101136058A (en) Method for transmitting information from reader used for recognizing radio frequency to label
CN102522998A (en) TYPEB full rate decoding circuit suitable for NRZ coded signal
CN102946255A (en) Data coding method for passive radio-frequency identification system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CP01 Change in the name or title of a patent holder

Address after: 300459, No. 399, Xiang Xiang Road, Tanggu hi tech Zone, Tianjin Binhai New Area

Patentee after: Tianjin Institute of advanced technology

Address before: 300459, No. 399, Xiang Xiang Road, Tanggu hi tech Zone, Tianjin Binhai New Area

Patentee before: TIANJIN BINHAI CIVIL-MILITARY INTEGRATED INNOVATION INSTITUTE

CP01 Change in the name or title of a patent holder
TR01 Transfer of patent right

Effective date of registration: 20200804

Address after: 300459, No. 399, Xiang Xiang Road, Tanggu hi tech Zone, Tianjin Binhai New Area

Patentee after: TIANJIN BINHAI CIVIL-MILITARY INTEGRATED INNOVATION INSTITUTE

Address before: 410073 Hunan province Changsha Kaifu District, Deya Road No. 109

Patentee before: NATIONAL University OF DEFENSE TECHNOLOGY

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20201023

Address after: 8-9 / F, building 9, Xin'an venture Plaza, 399 Huixiang Road, Tanggu marine science and Technology Park, Binhai New Area, Tianjin 300459

Patentee after: Tianjin Kunpeng Information Technology Co.,Ltd.

Address before: 300459, No. 399, Xiang Xiang Road, Tanggu hi tech Zone, Tianjin Binhai New Area

Patentee before: Tianjin Institute of advanced technology

TR01 Transfer of patent right