CN108600139A - The Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate - Google Patents
The Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate Download PDFInfo
- Publication number
- CN108600139A CN108600139A CN201810281483.5A CN201810281483A CN108600139A CN 108600139 A CN108600139 A CN 108600139A CN 201810281483 A CN201810281483 A CN 201810281483A CN 108600139 A CN108600139 A CN 108600139A
- Authority
- CN
- China
- Prior art keywords
- decoded state
- decoded
- update
- state
- distance values
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0046—Code rate detection or code type detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
- H04L27/2338—Demodulator circuits; Receiver circuits using non-coherent demodulation using sampling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
A kind of Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate belong to field of communication technology, include the following steps：It inputs the inphase quadrature component I and Q of GMSK signals and carries out Laurent decomposition；The four road signals obtained after decomposition are sampled；The distance for calculating list entries odd bits obtains 8 distance values；8 distance values are divided into four groups, updating decoded state according to minimum value obtains 4 kinds of new decoded states；The distance for calculating list entries even bit obtains 8 distance values；8 distance values are divided into four groups, updating decoded state according to minimum value obtains 4 kinds of new decoded states；The shortest path all the way of four tunnel path lengths is selected as output decoded state；Obtain sequence of symhols.The present invention can simplify that receiver, anti-noise ability are strong, the bit error rate is low, and the GMSK signals demodulation of different chip rates can also be realized while not changing matched filter parameter.
Description
Technical field
The present invention relates to fields of communication technology, and in particular to a kind of Viterbi solutions of the GMSK signals of arbitrary information rate
Code method.
Background technology
GMSK signals in the field of wireless communication, as a kind of more satisfactory modulation system, due to its outstanding frequency spectrum
Characteristic has been widely used in the fields such as forces station, gsm system, gprs system, DTV, satellite communication.Simultaneously
Possess than PSK modulation system in the nonlinear channel of the C class A amplifier As of amplitude limiting characteristic since its perseverance envelope trait makes it have
Outstanding performance.
Special cases of the GMSK as Continuous Phase Modulation (CPM) signal, optimum receiver by coherent demodulation and it is maximum seemingly
So detection is realized.But the complexity of optimum receiver is too big, therefore the research of many real systems is all based on incoherent solution
It adjusts.For coherent demodulation, the bit error rate of non-coherent demodulation is high.Using multiple symbols differential detection algorithm, it by using
Complicated noncoherent receiver is to reach the performance close to relevant detection, but the bit error rate cannot be close to the error code of optimum receiver
Performance.And method among the above, which all can not achieve, is decoded the GMSK signals of arbitrary velocity.
Invention content
In view of the deficiencies of the prior art, problem solved by the invention is to solve receiver too complex and incoherent solution
The defects of adjusting bit error rate performance low and can not realizing the decoding of the GMSK signals of arbitrary information rate.
In order to solve the above technical problems, the technical solution adopted by the present invention is a kind of GMSK signals of arbitrary information rate
Viterbi coding/decoding methods, include the following steps：
S1 inputs the inphase quadrature component I and Q of GMSK signals and carries out Laurent decomposition；
S2 samples the four road signals obtained after decomposition；
S3, the distance for calculating list entries odd bits obtain 8 distance values；
8 distance values are divided into four groups by S4, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S5, the distance for calculating list entries even bit obtain 8 distance values；
8 distance values are divided into four groups by S6, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S7 selects the shortest path all the way of four tunnel path lengths as output decoded state；
S8 obtains sequence of symhols.
In S1, the inphase quadrature component I and Q of the input GMSK signals simultaneously carries out Laurent decomposition, including walks as follows
Suddenly：
(1) it calculates Laurent and decomposes two required matched filter parameters；
(2) two-way orthogonal signalling I, Q of GMSK are decomposed into four road signal I0`, I1 respectively by two matched filters
`、Q0`、Q1`。
In S2, the described pair of four road signals obtained after decomposing sample, including：
According to the size of chip rate, the four road signals obtained after decomposition are sampled, I0`, I1`, Q0`, Q1` are obtained
Sample Hou tetra- road signal I0, I1, Q0, Q1.
In S3, the distance for calculating list entries odd bits obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=Q0-I1+D1,n-1、d12=Q0+I1+D2,n-1、d21=Q0+
I1+D3,n-1、d22=Q0-I1+D4,n-1、d31=-Q0+I1+D1,n-1、d32=-Q0-I1+D2,n-1、d41=Q0-I1+D3,n-1、d42
=-Q0+I1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
In S4, it is described 8 distance values are divided into four groups decoded state are updated according to minimum value obtain new 4 kinds of decodings shapes
State, including：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
In S5, the distance for calculating list entries even bit obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=I0-Q1+D1,n-1、d12=I0+Q1+D2,n-1、d21=I0+
Q1+D3,n-1、d22=I0-Q1+D4,n-1、d31=-I0+Q1+D1,n-1、d32=-I0-Q1+D2,n-1、d41=I0-Q1+D3,n-1、d42
=-I0+Q1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
In S6,8 distance values is divided into four groups, 4 kinds of new decoded states is obtained according to minimum value update decoded state,
Including：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
In S7, the shortest path all the way of four tunnel path lengths of selecting is used as output decoded state, including：
Compare DmThe size of four data, by the L corresponding to minimum valuemAs final decoded state.
It is described to show that sequence of symhols includes in S8：
It is the segment encode metadata in sequence of symhols by decoded state sequence L obtained in the previous step, decodes a hop count
Restart to decode lower one piece of data after, obtains entire sequence of symhols.
Technical solution using the present invention can simplify that receiver structure, anti-noise ability are strong, the bit error rate is low, can also be not
The GMSK signals demodulation of different chip rates is realized while changing matched filter parameter.
Description of the drawings
Fig. 1 is the flow diagram of the present invention；
Fig. 2 is to decode block diagram to the Viterbi of the GMSK signals of arbitrary information rate；
Fig. 3 is Viterbi state decoding figures.
Specific implementation mode
The specific implementation mode of the present invention is further described below in conjunction with the accompanying drawings, but is not the limit to the present invention
It is fixed.
Fig. 1 shows a kind of Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate, includes the following steps：
S1 inputs the inphase quadrature component I and Q of GMSK signals and carries out Laurent decomposition；
S2 samples the four road signals obtained after decomposition；
S3, the distance for calculating list entries odd bits obtain 8 distance values；
8 distance values are divided into four groups by S4, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S5, the distance for calculating list entries even bit obtain 8 distance values；
8 distance values are divided into four groups by S6, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S7 selects the shortest path all the way of four tunnel path lengths as output decoded state；
S8 obtains sequence of symhols.
In S1, the inphase quadrature component I and Q of the input GMSK signals simultaneously carries out Laurent decomposition, as shown in Fig. 2,
Include the following steps：
(1) it calculates Laurent and decomposes two required matched filter parameters；
(2) two-way orthogonal signalling I, Q of GMSK are decomposed into four road signal I0`, I1 respectively by two matched filters
`、Q0`、Q1`。
In specific implementation, sets the parameter of the filter of generation to MIF formats, imported in the filter kernel in FPGA
The MIF formats, obtain matched filter.The two-way orthogonal signalling of GMSK are obtained four by the two matched filters respectively again
Road signal I0`, I1`, Q0`, Q1`.The generation formula of filter coefficient is：
Wherein,
Define the impulse phase function ψ (t) of broad sense
In S2, the described pair of four road signals obtained after decomposing sample, including：
According to the size of chip rate, the four road signals obtained after decomposition are sampled, I0`, I1`, Q0`, Q1` are obtained
Sample Hou tetra- road signal I0, I1, Q0, Q1.
In specific implementation, the input clock signal of next step can be used as by the clock signal extracted to realize to four
The resampling of circuit-switched data.
In S3, the distance for calculating list entries odd bits obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=Q0-I1+D1,n-1、d12=Q0+I1+D2,n-1、d21=Q0+
I1+D3,n-1、d22=Q0-I1+D4,n-1、d31=-Q0+I1+D1,n-1、d32=-Q0-I1+D2,n-1、d41=Q0-I1+D3,n-1、d42
=-Q0+I1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
In specific implementation, the size for storing a value is needed, when being realized on FPGA, therefore, to assure that the value calculated
It does not overflow.
The calculation formula of distance value is between each code element：
This expression can be by introducing real symbols αnSimplify, it is 1 or -1 to enable its value,
It is then possible to obtain
As shown in Figure 3, it is assumed that the first two symbol, then there are four types of states, each state has two paths again, therefore often calculates
One symbol corresponds to eight paths.
In S4, it is described 8 distance values are divided into four groups decoded state are updated according to minimum value obtain new 4 kinds of decodings shapes
State, including：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
In specific implementation, in FPGA realizations, influence the problems such as in order to avoid arithmetic time delay need to ensure the path of selection
Decoding sequence with output is same path.
In S5, the distance for calculating list entries even bit obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=I0-Q1+D1,n-1、d12=I0+Q1+D2,n-1、d21=I0+
Q1+D3,n-1、d22=I0-Q1+D4,n-1、d31=-I0+Q1+D1,n-1、d32=-I0-Q1+D2,n-1、d41=I0-Q1+D3,n-1、d42
=-I0+Q1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
It is identical with S3 in specific implementation.
In S6,8 distance values is divided into four groups, 4 kinds of new decoded states is obtained according to minimum value update decoded state,
Including：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new explanation
Code state is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if
Dm,n=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
In specific implementation, as the implementation process in S4.
In S7, the shortest path all the way of four tunnel path lengths of selecting is used as output decoded state, including：
Compare DmThe size of four data, by the L corresponding to minimum valuemAs final decoded state.
In specific implementation, there are four the sizes and corresponding four road decoding sequence of path values, compare four road strength values, select
Wherein minimum value, and the decoding sequence under its corresponding path is exported as final decoding output state.
It is described to obtain sequence of symhols in S8, including：
It is the segment encode metadata in sequence of symhols by decoded state sequence L obtained in the previous step, decodes a hop count
Restart to decode lower one piece of data after, obtains entire sequence of symhols.
In specific implementation, the size of segmentation can be gone to divide according to oneself, but each section at least decodes four symbol widths
GMSK signals.
Technical solution using the present invention can simplify that receiver structure, anti-noise ability are strong, the bit error rate is low, can also be not
The GMSK signals decoding of different chip rates is realized while changing matched filter parameter.
Detailed description is made that embodiments of the present invention above in association with attached drawing, but the present invention be not limited to it is described
Embodiment.To those skilled in the art, without departing from the principles and spirit of the present invention, these are implemented
Mode carries out various change, modification, replacement and modification and still falls in protection scope of the present invention.
Claims (9)
1. a kind of Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate, it is characterised in that：Include the following steps：
S1 inputs the inphase quadrature component I and Q of GMSK signals and carries out Laurent decomposition；
S2 samples the four road signals obtained after decomposition；
S3, the distance for calculating list entries odd bits obtain 8 distance values；
8 distance values are divided into four groups by S4, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S5, the distance for calculating list entries even bit obtain 8 distance values；
8 distance values are divided into four groups by S6, and updating decoded state according to minimum value obtains 4 kinds of new decoded states；
S7 selects the shortest path all the way of four tunnel path lengths as output decoded state；
S8 obtains sequence of symhols.
2. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1, it is characterised in that：
In S1, the inphase quadrature component I and Q of the input GMSK signals simultaneously carries out Laurent decomposition, includes the following steps：
(1) it calculates Laurent and decomposes two required matched filter parameters；
(2) two-way orthogonal signalling I, Q of GMSK are decomposed into four road signal I0`, I1`, Q0 respectively by two matched filters
`、Q1`。
3. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S2, the described pair of four road signals obtained after decomposing sample, including：
According to the size of chip rate, the four road signals obtained after decomposition are sampled, obtain I0`, I1`, Q0`, Q1` sampling
Hou tetra- road signal I0, I1, Q0, Q1.
4. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S3, the distance for calculating list entries odd bits obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=Q0-I1+D1,n-1、d12=Q0+I1+D2,n-1、d21=Q0+I1+
D3,n-1、d22=Q0-I1+D4,n-1、d31=-Q0+I1+D1,n-1、d32=-Q0-I1+D2,n-1、d41=Q0-I1+D3,n-1、d42=-Q0
+I1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
5. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S4, it is described by 8 distance values be divided into four groups according to minimum value update decoded state obtain 4 kinds of new decoded states, wrap
It includes：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new decoding shape
State is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if Dm,n
=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new decoding shape
State is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if Dm,n
=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
6. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S5, the distance for calculating list entries even bit obtains 8 distance values, including：
D is carried out to the value of the odd bits of I0, I1, Q0, Q111=I0-Q1+D1,n-1、d12=I0+Q1+D2,n-1、d21=I0+Q1+
D3,n-1、d22=I0-Q1+D4,n-1、d31=-I0+Q1+D1,n-1、d32=-I0-Q1+D2,n-1、d41=I0-Q1+D3,n-1、d42=-I0
+Q1+D4,n-1Operation obtains 8 distance values, DnFor the value currently calculated.
7. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S6,8 distance values is divided into four groups, 4 kinds of new decoded states are obtained according to minimum value update decoded state, including：
Compare dm,1With dm,2Two value sizes, value it is small be assigned to Dm,n, wherein m=1,2,3,4；
As m=1, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 1 }, if Dm,n=dm,2, more new decoding shape
State is Lm,q={ L2,q-1, 1 }, as m=2, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 1 }, if Dm,n
=dm,2, update decoded state is Lm,q={ L4,q-1,1}；
As m=3, if Dm,n=dm,1, update decoded state is Lm,q={ L1,q-1, 0 }, if Dm,n=dm,2, more new decoding shape
State is Lm,q={ L2,q-1, 0 }, as m=4, if Dm,n=dm,1, update decoded state is Lm,q={ L3,q-1, 0 }, if Dm,n
=dm,2, update decoded state is Lm,q={ L4,q-1,0}；
Finally obtain updated four kinds of decoded state Lm。
8. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：In S7, the shortest path all the way of four tunnel path lengths of selecting is used as output decoded state, including：
Compare DmThe size of four data, by the L corresponding to minimum valuemAs final decoded state.
9. the Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate according to claim 1 or 2, feature exist
In：It is described to obtain sequence of symhols in S8, including：
It is the segment encode metadata in sequence of symhols by decoded state sequence L obtained in the previous step, after decoding one piece of data
Restart to decode lower one piece of data, obtains entire sequence of symhols.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810281483.5A CN108600139B (en) | 2018-04-02 | 2018-04-02 | Viterbi decoding method of GMSK signal with arbitrary information rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810281483.5A CN108600139B (en) | 2018-04-02 | 2018-04-02 | Viterbi decoding method of GMSK signal with arbitrary information rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108600139A true CN108600139A (en) | 2018-09-28 |
| CN108600139B CN108600139B (en) | 2021-06-18 |
Family
ID=63624133
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810281483.5A Active CN108600139B (en) | 2018-04-02 | 2018-04-02 | Viterbi decoding method of GMSK signal with arbitrary information rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108600139B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060274862A1 (en) * | 2005-06-06 | 2006-12-07 | Lui Gee L | Quaternary precoded continuous phase modulation soft bit metric demodulator |
| CN101599772A (en) * | 2008-06-04 | 2009-12-09 | 联发科技股份有限公司 | The method and apparatus of restituted signal |
| CN102368758A (en) * | 2011-09-01 | 2012-03-07 | 南京航空航天大学 | New improvement scheme about gaussian minimum shift keying (GMSK) modulation technology |
| CN102594755A (en) * | 2012-02-27 | 2012-07-18 | 西安电子科技大学 | Incoherent soft-output detection method based on continuous phase modulation |
| US20180091340A1 (en) * | 2016-09-23 | 2018-03-29 | Apple Inc. | Most likely estimation systems and methods for coded gmsk |
-
2018
- 2018-04-02 CN CN201810281483.5A patent/CN108600139B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060274862A1 (en) * | 2005-06-06 | 2006-12-07 | Lui Gee L | Quaternary precoded continuous phase modulation soft bit metric demodulator |
| CN101599772A (en) * | 2008-06-04 | 2009-12-09 | 联发科技股份有限公司 | The method and apparatus of restituted signal |
| CN102368758A (en) * | 2011-09-01 | 2012-03-07 | 南京航空航天大学 | New improvement scheme about gaussian minimum shift keying (GMSK) modulation technology |
| CN102594755A (en) * | 2012-02-27 | 2012-07-18 | 西安电子科技大学 | Incoherent soft-output detection method based on continuous phase modulation |
| US20180091340A1 (en) * | 2016-09-23 | 2018-03-29 | Apple Inc. | Most likely estimation systems and methods for coded gmsk |
Non-Patent Citations (2)
| Title |
|---|
| RICHARD H.-H. YANG,ET AL.: "《Low complexity receiver for continuous phase modulation using 3RC-TL phase shaping pulses》", 《2015 INTERNATIONAL SYMPOSIUM ON INTELLIGENT SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ISPACS)》 * |
| 张剑等: "《GMSK 信号的后解码相干解调》", 《电讯技术》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108600139B (en) | 2021-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103248593B (en) | Offset estimation and removing method and system | |
| EP2380321B1 (en) | Feedforward receiver and method for reducing inter-symbol interference by using coupling between bits or symbols | |
| KR101828790B1 (en) | Frequency shift keying signal receiving method and device | |
| EP3621259B1 (en) | Method and device for fsk/gfsk demodulation | |
| Bohra et al. | Bit error rate analysis in simulation of digital communication systems with different modulation schemes | |
| US20220103407A1 (en) | Fsk radio-frequency demodulators | |
| CN104393885B (en) | A kind of reception terminal for unmanned plane ground-to-air wideband communication system and method thereof | |
| CN102368758B (en) | About a kind of new improvement project of GMSK modulation technology | |
| CN107104917A (en) | Parallel processing TDS OFDM time synchronization methods | |
| CN108600139A (en) | The Viterbi coding/decoding methods of the GMSK signals of arbitrary information rate | |
| CN103281276A (en) | Optimal demodulation device and demodulation method for CPM signal | |
| CN104378125A (en) | Land-to-air wideband communication method for unmanned aerial vehicle | |
| Marriwala et al. | 8-QAM software defined radio based approach for channel encoding and decoding using forward error correction | |
| CN104363193B (en) | A kind of receiving terminal method for unmanned plane ground-to-air wideband communication system | |
| EP2950493B1 (en) | Bit likelihood calculation device and bit likelihood calculation method | |
| US5928377A (en) | Method and apparatus for data transmission through manipulation of encoding formats | |
| CN104393912A (en) | Ground-air broadband communication system and method for unmanned aerial vehicle | |
| CN104333393A (en) | Receiving terminal and receiving terminal method for air-ground narrow-band communication system of unmanned aerial vehicle | |
| CN113765838A (en) | DPSK signal demodulation method, device, equipment and storage medium | |
| CN103326988A (en) | Flexible demodulation method for orthogonal amplitude modulation | |
| CN107395541B (en) | The signal-timing method and system of continuous phase modulated signal | |
| CN104468441A (en) | Signal coding and modulating method and device for digital interphone, signal demodulating and decoding method and device for digital interphone | |
| Zhou et al. | A Low-Complexity Implementation Scheme for PCM/FM Based on MLSD | |
| 周游 et al. | Reduced-state noncoherent MLSD method for CPM in aeronautical telemetry | |
| CN103595666B (en) | For detecting the method for the symbol in signal of communication, equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |