CN104243392A - Novel self-adaption modulation algorithm - Google Patents
Novel self-adaption modulation algorithm Download PDFInfo
- Publication number
- CN104243392A CN104243392A CN201410478876.7A CN201410478876A CN104243392A CN 104243392 A CN104243392 A CN 104243392A CN 201410478876 A CN201410478876 A CN 201410478876A CN 104243392 A CN104243392 A CN 104243392A
- Authority
- CN
- China
- Prior art keywords
- point
- constellation
- sigma
- llr
- kth
- 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
- 230000005540 biological transmission Effects 0.000 claims description 16
- 230000003044 adaptive effect Effects 0.000 claims description 13
- 238000000034 method Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 6
- 230000007704 transition Effects 0.000 claims description 5
- 238000013459 approach Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 6
- 238000010295 mobile communication Methods 0.000 description 3
- 238000007476 Maximum Likelihood Methods 0.000 description 2
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
The invention discloses a novel self-adaption modulation algorithm used for modulating signals received by the receiving end and calculating the LLR. The novel self-adaption modulation algorithm comprises the steps that (1), a point x1<1>, closest to yk, on a constellation set xi<1> is found; (2), the distance D1<1> between the yk and the point x1<1> is calculated; (3), the p0th point, closest to the yk, on the constellation set xi<1> is supposed to be x1<P0>, the p0 is increased progressively from two, the point x1<P0> is sought in the constellation set constantly, and the distance D1<P0> between the point yk and the point x1<P0> is calculated until that the difference between D1<P0> and D1<1> is greater than Rth, wherein Rth is a defined threshold value in a receiver, and comparison is needed p0 times additionally; (4), the position range of the yk is determined; (5), the first p1 D1<P1> is calculated in sequence according to the steps (2) and (3) in the constellation set xi<1>; (6), the LLR is calculated according to the formula. The algorithm takes complexity and performance balance into consideration at the same time, remedies the situation that the complexity of an optimal modulation algorithm is over high, and also solves the problem that a Max-log algorithm is possibly poor in performance.
Description
Technical field
The present invention relates to mobile communication system wireless transmission link technology, in particular, relate to a kind of adaptive demodulation algorithm balancing complexity and performance.
Background technology
Day by day in short supply along with radio spectrum resources, and the exponential growth of multi-medium data amount in wireless network, how effectively to improve spectrum utilization efficiency is the technological difficulties that third generation mobile communication system wireless transmission link technology must solve.Optimizing physical level coded modulation technology is the important channel realizing spectral efficient under limited bandwidth transmission, and the object of its research maximally utilises transfer resource, selects optimum transmission mechanism, to approach shannon limit.
Bit Interleaved Coded Modulation technology (BICM Bit-interleaved Coded Modulation) is as a kind of combined coding modulation scheme, by introducing interleaver between coding and modulation, make coding can independent design with modulation, so have simplicity of design, realize advantage easily, and its performance is similar to multilevel Codes, so be not only widely used in various business communication system, but also it is the key technology in wireless mobile communications link of future generation.
Quadrature amplitude modulation (Quadrature Amplitude Modulation) is a kind of method two kinds of amplitude-modulated signals (ASK and PSK) being convergeed to a channel, therefore can double extremely efficient bandwidth.Quadrature amplitude modulation is used to pulse amplitude modulation, particularly applies at wireless network.Quadrature amplitude modulated (QAM) signal has the carrier wave of two same frequencys, but phase 90 degree (1/4th cycles, from integration term).A signal is I signal, and another signal is Q signal.From mathematical angle, a signal can be expressed as sine, another is expressed as cosine.Two kinds of modulated carrier waves are mixed when launching.After arriving destination, carrier wave is separated, and then data are extracted respectively mixes mutually with raw modulation information.This modulation system usually have binary system QAM (4QAM), quaternary QAM (l6QAM), octal system QAM (64QAM) ... corresponding spacing wave vector end-points distribution map is called planisphere, have 4 respectively, 16,64 ... individual constellation point.
At transmitting terminal, information bit sequence, after encoder and interleaver, obtains bit sequence b={b to be modulated
0..., b
k... b
k, wherein b
kfor a kth bit, sequence b again through the number of constellation point be M=2
mqAM digital modulator produce N=K/m transmission symbol x:x={x
0..., x
k..., x
n-1, wherein N is number of symbols, and m is order of modulation, and M is the number of constellation point, x
kfor a kth transmission symbol.Be the QAM modulation of M for constellation point number, if point-to-point transmission beeline is d, then the coordinate of each point can be expressed as
Consider additive white Gaussian noise (AWGN) channel, channel model be expressed as:
y
k=x
k+n
k
Wherein y
kfor kth sends signal, x
kfor a kth Received signal strength, n
kfor multiple Gaussian noise, its average is zero, and variance is
At receiving terminal, need to carry out demodulation according to Received signal strength, calculate log-likelihood LLR
i,k, be specially, definition log-likelihood LLR is
Suppose to send signal equiprobability, utilize bayesian criterion, log-likelihood formula is converted into maximum-likelihood criterion:
Wherein, p (y
k| x
k) be channel transition probability, b
i,kfor i-th bit in a kth symbol,
with
represent b in constellation point respectively
i,kequal the assemble of symbol of 0,1.
Because noise is Gaussian Profile, channel transition probability is
so the demodulation formula of optimum is:
As can be seen from formula, the LLR calculating each bit needs M subtraction, M time square, M+1 division, M exponential depth, M sub-addition and 1 logarithm operation.Because exponent arithmetic complexity is high within hardware, so usually adopt following Max-log algorithm:
According to mathematical formulae:
lLR formula can be converted into:
For this kind of algorithm, still need M subtraction, M time square, compare for M-2 time and a division.Compared to optimal algorithm, complexity has had larger lifting.
Should be noted that and work as
time larger, the difference between distinct symbols is less, adopts Max-log algorithm to bring performance loss.
Above-mentioned traditional optimal demodulation algorithm can obtain optimum performance in theory, but due to its inner index operation too much, especially when order of modulation is higher, cause its algorithm complex too high.And Max-log algorithm complex is lower, but for the poor scene of channel circumstance, its approximate inequality has larger error, so can bring larger performance loss.
Summary of the invention
For the technical problem existed in above-mentioned prior art, the invention provides a kind of NEW ADAPTIVE demodulating algorithm, consider the balance of complexity and performance simultaneously, compensate for the situation that optimal demodulation algorithm complex is too high, also solve the situation of the poor-performing that Max-log algorithm may occur.
For achieving the above object, the technical solution adopted in the present invention is as follows:
A kind of NEW ADAPTIVE demodulating algorithm, carries out demodulation for the signal received receiving terminal, calculates log-likelihood
Wherein:
For channel transition probability, b
i,kfor i-th bit in a kth symbol,
with
represent b in constellation point respectively
i,kequal the assemble of symbol of 0,1, y
k=x
k+ n
kfor kth sends signal, x
kfor a kth Received signal strength, n
kfor multiple Gaussian noise, its average is zero, and variance is
bit sequence b={b to be modulated
0..., b
k... b
k, wherein b
kfor a kth bit, sequence b again through the number of constellation point be M=2
mqAM digital modulator produce N=K/m transmission symbol x:x={x
0..., x
k..., x
n-1, wherein N is number of symbols, and m is order of modulation, and M is the number of constellation point, x
kfor a kth transmission symbol, be the QAM modulation of M for constellation point number, if point-to-point transmission beeline is d, then the coordinate of each point can be expressed as
It is as follows that described adaptive demodulation algorithm comprises step:
1) find respectively
with y in constellation set
knearest point
2) calculation level y
kto point
distance
3) establish
distance y in constellation set
knearest p
0individual point is
p
0increase progressively from 2, planisphere is constantly found a little
and calculation level y
kto point
distance
until meet
rear stopping calculates, wherein R
thfor the threshold value defined in receiver, need p altogether
0compare for+1 time;
4) y is determined
kposition range;
5) for
constellation set, according to step 2), 3) calculate p successively
1individual
6) according to following formulae discovery LLR:
Described step 1) concrete grammar as follows:
constellation set has
individual, on planisphere, find y successively
kthe grid at place,
constellation set needs
secondaryly to compare, according to the interval division of grid, can determine
For
constellation set
individual, on planisphere, adopt plane binary chop method to find y successively
kthe grid at place.
Described step 3) in threshold value R
thcan free setting.
Described step 4), according to fixed constellation point, reduce next closest approach scope, determine y
kposition range, according to from the close-by examples to those far off calculating and the distance of constellation point, thus significantly reduce number of comparisons.
NEW ADAPTIVE demodulation method proposed by the invention, compared with prior art, has following technique effect:
1. abandoning traditional needs calculates the distance of Received signal strength to all constellation point, but calculates beeline successively dynamically;
2. have employed the method compared and determine the constellation point that distance Received signal strength is nearest;
3. set threshold value to stop the calculating of beeline, threshold value can free setting;
4. algorithm can adapt to different channel circumstances automatically, reaches the balance of complexity and performance.
Accompanying drawing explanation
By reading the detailed description done non-limiting example with reference to the following drawings, other features, objects and advantages of the present invention will become more obvious:
Fig. 1 is the system model figure of the inventive method;
Fig. 2 is the inventive method one embodiment schematic diagram;
Fig. 3 (a) and Fig. 3 (b) are the algorithm schematic diagram of p0 when getting different value respectively.
Embodiment
Below in conjunction with specific embodiment, the present invention is described in detail.Following examples will contribute to those skilled in the art and understand the present invention further, but not limit the present invention in any form.It should be pointed out that to those skilled in the art, without departing from the inventive concept of the premise, some distortion and improvement can also be made.These all belong to protection scope of the present invention.
Fig. 1 is that the system model of the inventive method and specific algorithm are described in further detail.Specifically comprise:
At transmitting terminal, information bit sequence, after encoder and interleaver, obtains bit sequence b={b to be modulated
0..., b
k... b
k, wherein b
kfor a kth bit, sequence b again through the number of constellation point be M=2
mqAM digital modulator produce N=K/m transmission symbol x:x={x
0..., x
k..., x
n-1, wherein N is number of symbols, and m is order of modulation, and M is the number of constellation point, x
kfor a kth transmission symbol.Be the QAM modulation of M for constellation point number, if point-to-point transmission beeline is d, then the coordinate of each point can be expressed as
Consider additive white Gaussian noise (AWGN) channel, channel model be expressed as:
y
k=x
k+n
k
Wherein y
kfor kth sends signal, x
kfor a kth Received signal strength, n
kfor multiple Gaussian noise, its average is zero, and variance is
At receiving terminal, need to carry out demodulation according to Received signal strength, calculate log-likelihood LLR
i,k, be specially, definition log-likelihood LLR is
Suppose to send signal equiprobability, utilize bayesian criterion, log-likelihood formula is converted into maximum-likelihood criterion:
Wherein, p (y
k| x
k) be channel transition probability, b
i,kfor i-th bit in a kth symbol,
with
represent b in constellation point respectively
i,kequal the assemble of symbol of 0,1.
The following detailed description of adaptive demodulation algorithm of the present invention.
1, find respectively
with y in constellation set
knearest point
method can be adopted as follows:
constellation set has
individual, on planisphere, adopt plane dichotomy to find y successively
kthe grid at place,
constellation set needs
secondaryly to compare.According to the interval division of grid, can determine
For the example that Fig. 2 provides, ask the 1st LLR that bit is corresponding, by y
kreal part compare with 0: Re (y
k) > 0, then by y
kreal part compare with 4d: Re (y
k) < 4d, then by y
kreal part compare with 2d: Re (y
k) > 2d.In like manner by y
kimaginary part be defined as 2d < Im (y
k) < 4d, now can determine
now compare 3+2=5 time altogether.
2, calculation level y
kto point
distance
3, establish
distance y in constellation set
knearest p
0individual point is
p
0increase progressively from 2, planisphere is constantly found a little
and calculation level y
kto point
distance
until meet
rear stopping calculates, wherein R
thfor the threshold value defined in receiver, need p altogether
0secondaryly to compare.
Work as y
kwhen being positioned at position shown in Fig. 2, for p
0=2,3,4,5 time points
must be one of following four points:
As shown in Fig. 3 (a).In order to determine p
0point when=2
only need to carry out comparing for twice, septal line was point
slope is respectively ± two straight lines of 1, and for p
0two points of=3,4, only need compare Re (y
k) and
once, and remaining point is p
0point when=4
determine that these four points compare 3 times altogether, average each point compares 0.75 time.
For p
0=6,7,8,9 time points
must be one of following four points:
as shown in Fig. 3 (b), according to above-mentioned Re (y
k) and
comparison, can p be determined
0=6,7 time points
be the left side in four points or right side, now once compare again and can determine all four points: compare Im (y
k) and
4, through comparing for m-1+2+1+1=m+3 time at most above, y is determined in detail
kposition range, for p
0the point of > 9
do not need to compare and can find.
5, for
constellation set, calculates p according to step 2 successively to step 3 method
1individual
wherein p
1with p
0may be unequal.
6, according to following formulae discovery LLR:
Below with two kinds of methods of prior art, done comparing of one effect to method provided by the present invention:
Analysis of complexity
Work as p
0=p
1when=1, the present invention program and Max-log algorithm very similar, but complexity is different, and the present invention needs 2m-2 time to compare, 2 subtractions, 2 times squares, and a division arithmetic, and it is compared as follows table:
? | Relatively | Addition | Subtraction | Square | Division | Index | Logarithm |
Max-log algorithm | M-2 | 0 | M+1 | M | 1 | 0 | 0 |
Algorithm of the present invention | 2m-2 | 0 | 2 | 2 | 1 | 0 | 0 |
Can be found out by contrast, algorithm complex of the present invention is lower than Max-log algorithm.
And for other situations, the contrast of three kinds of complexities is as following table:
Can find out that algorithm complex of the present invention is lower than optimal algorithm, and with Max-log algorithm compare needs according to p
1and p
0occurrence judge, on the whole algorithm of the present invention decrease subtraction and square number of times, but add number of comparisons, addition, the number of times of division and index.Work as p
1and p
0time less, algorithm complex of the present invention is better, and works as p
1and p
0time larger, algorithm complex is high, but the performance brought advantageously.Concrete condition needs to select threshold value R according to actual needs
thsize.
Although content of the present invention has done detailed introduction by above-described embodiment, will be appreciated that above-mentioned description should not be considered to limitation of the present invention.After those skilled in the art have read foregoing, for multiple amendment of the present invention and substitute will be all apparent.Therefore, protection scope of the present invention should be limited to the appended claims.
Claims (5)
1. a NEW ADAPTIVE demodulating algorithm, carries out demodulation for the signal received receiving terminal, calculates log-likelihood
Wherein:
For channel transition probability, b
i,kfor i-th bit in a kth symbol,
with
represent b in constellation point respectively
i,kequal the assemble of symbol of 0,1, y
k=x
k+ n
kfor kth sends signal, x
kfor a kth Received signal strength, n
kfor multiple Gaussian noise, its average is zero, and variance is
bit sequence b={b to be modulated
0..., b
k... b
k, wherein b
kfor a kth bit, sequence b again through the number of constellation point be M=2
mqAM digital modulator produce N=K/m transmission symbol x:x={x
0..., x
k..., x
n-1, wherein N is number of symbols, and m is order of modulation, and M is the number of constellation point, x
kfor a kth transmission symbol, be the QAM modulation of M for constellation point number, if point-to-point transmission beeline is d, then the coordinate of each point is expressed as
It is characterized in that, it is as follows that described adaptive demodulation algorithm comprises step:
1) find respectively
with y in constellation set
knearest point
2) calculation level y
kto point
distance
3) establish
distance y in constellation set
knearest p
0individual point is
p
0increase progressively from 2, planisphere is constantly found a little
and calculation level y
kto point
distance
until meet
rear stopping calculates, wherein R
thfor the threshold value defined in receiver, need p altogether
0compare for+1 time;
4) y is determined
kposition range;
5) for
constellation set, according to step 2), 3) calculate p successively
1individual
6) according to following formulae discovery LLR:
2. NEW ADAPTIVE demodulating algorithm according to claim 1, is characterized in that, described step 1) concrete grammar as follows:
constellation set has
individual, on planisphere, find y successively
kthe grid at place,
constellation set needs at most
secondaryly to compare, according to the interval division of grid, can determine
3. NEW ADAPTIVE demodulating algorithm according to claim 2, is characterized in that, for
constellation set
individual, on planisphere, adopt plane binary chop method to find y successively
kthe grid at place.
4. NEW ADAPTIVE demodulating algorithm according to claim 1, is characterized in that, described step 3) in threshold value R
thcan free setting.
5. NEW ADAPTIVE demodulating algorithm according to claim 1, is characterized in that, described step 4), according to fixed constellation point, reduce next closest approach scope, determine y
kposition range, according to from the close-by examples to those far off calculating and the distance of constellation point.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410478876.7A CN104243392B (en) | 2014-09-18 | 2014-09-18 | NEW ADAPTIVE demodulating algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410478876.7A CN104243392B (en) | 2014-09-18 | 2014-09-18 | NEW ADAPTIVE demodulating algorithm |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104243392A true CN104243392A (en) | 2014-12-24 |
CN104243392B CN104243392B (en) | 2017-10-31 |
Family
ID=52230760
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410478876.7A Expired - Fee Related CN104243392B (en) | 2014-09-18 | 2014-09-18 | NEW ADAPTIVE demodulating algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104243392B (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106533620A (en) * | 2016-11-10 | 2017-03-22 | 重庆邮电大学 | Log-likelihood-ratio-threshold-based adaptive demodulation method for high-order QAM modulation symbol |
CN109756275A (en) * | 2017-11-03 | 2019-05-14 | 深圳市中兴微电子技术有限公司 | A kind of demodulation method and demodulating equipment |
WO2020259356A1 (en) * | 2019-06-26 | 2020-12-30 | 华为技术有限公司 | Communication method and communication apparatus |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1418421A (en) * | 2001-01-16 | 2003-05-14 | 皇家菲利浦电子有限公司 | Bit interleaved coded modulation (BICM) mapping |
US20040001564A1 (en) * | 2002-06-24 | 2004-01-01 | Albert Chan | Reduced complexity receiver for space-time- bit-interleaved coded modulation |
US20040258177A1 (en) * | 2003-06-13 | 2004-12-23 | Ba-Zhong Shen | Multi-dimensional space Gray code maps for multi-dimensional phase modulation as applied to LDPC (Low Density Parity Check) coded modulation |
CN103532571A (en) * | 2012-07-05 | 2014-01-22 | 联芯科技有限公司 | Log-MAP decoding method and decoder |
CN104009822A (en) * | 2014-05-14 | 2014-08-27 | 上海交通大学 | Novel demodulation correcting method for estimating narrowband-containing interference based on non-ideal channel |
-
2014
- 2014-09-18 CN CN201410478876.7A patent/CN104243392B/en not_active Expired - Fee Related
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1418421A (en) * | 2001-01-16 | 2003-05-14 | 皇家菲利浦电子有限公司 | Bit interleaved coded modulation (BICM) mapping |
US20040001564A1 (en) * | 2002-06-24 | 2004-01-01 | Albert Chan | Reduced complexity receiver for space-time- bit-interleaved coded modulation |
US20040258177A1 (en) * | 2003-06-13 | 2004-12-23 | Ba-Zhong Shen | Multi-dimensional space Gray code maps for multi-dimensional phase modulation as applied to LDPC (Low Density Parity Check) coded modulation |
CN103532571A (en) * | 2012-07-05 | 2014-01-22 | 联芯科技有限公司 | Log-MAP decoding method and decoder |
CN104009822A (en) * | 2014-05-14 | 2014-08-27 | 上海交通大学 | Novel demodulation correcting method for estimating narrowband-containing interference based on non-ideal channel |
Non-Patent Citations (2)
Title |
---|
JI ZHAO 等: "《Performance analysis of bit-cooperative coded modulation with turbo codes》", 《GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)-WIRELESS COMMUNICATIONS SYMPOSIUM, 2013 IEEE》 * |
徐琳 等: "《LDPC码联合BICM-ID系统的研究》", 《中国优秀硕士学位论文全文数据库(电子期刊)》 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106533620A (en) * | 2016-11-10 | 2017-03-22 | 重庆邮电大学 | Log-likelihood-ratio-threshold-based adaptive demodulation method for high-order QAM modulation symbol |
CN106533620B (en) * | 2016-11-10 | 2019-09-10 | 重庆邮电大学 | The adaptive demodulation method of high-order QAM modulation symbol based on log-likelihood ratio thresholding |
CN109756275A (en) * | 2017-11-03 | 2019-05-14 | 深圳市中兴微电子技术有限公司 | A kind of demodulation method and demodulating equipment |
CN109756275B (en) * | 2017-11-03 | 2021-10-15 | 深圳市中兴微电子技术有限公司 | Demodulation method and demodulation device |
WO2020259356A1 (en) * | 2019-06-26 | 2020-12-30 | 华为技术有限公司 | Communication method and communication apparatus |
US12088444B2 (en) | 2019-06-26 | 2024-09-10 | Huawei Technologies Co., Ltd. | Communication method and communication apparatus |
Also Published As
Publication number | Publication date |
---|---|
CN104243392B (en) | 2017-10-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN101132388B (en) | Receiving method and device for receiving coded signal assisted by signal channel condition information | |
CN108880750B (en) | Decoding and demodulating apparatus and method, receiving apparatus and method, and communication system | |
EP3442189B1 (en) | Coding and modulation apparatus using non-uniform constellation | |
CN102710581B (en) | Soft solution mapping method | |
US20110158333A1 (en) | Radio communication system, radio communication method, and communication device | |
CN113965438B (en) | Method for solving soft information in 16APSK high-order modulation mode | |
US8503552B2 (en) | Method and digital communication device for receiving data using QAM symbols | |
CN109076039A (en) | Use the coding and modulating device of multidimensional non-uniform constellation | |
US8718205B1 (en) | Hard and soft bit demapping for QAM non-square constellations | |
Alvarado et al. | High SNR bounds for the BICM capacity | |
CN106101045A (en) | A kind of OFDM full duplex based on phase noise Gauss albefaction polarization self-interference removing method | |
CN103166901B (en) | A kind of 32APSK modulation and demodulation Soft Inform ation computational methods thereof | |
US8457256B2 (en) | Channel-adaptive likelihood determination | |
CN104009822A (en) | Novel demodulation correcting method for estimating narrowband-containing interference based on non-ideal channel | |
CN104243392A (en) | Novel self-adaption modulation algorithm | |
CN101237434B (en) | A soft judgement method for Graham M-PSK modulation | |
CN106452652B (en) | A kind of MPI suppression method based on chaos wireless communication system | |
CN103209151A (en) | General constellation demodulation method and system | |
CN113364717B (en) | 32APSK soft information calculation method suitable for DVBS2 modulation | |
CN102739576B (en) | Soft bit digital demodulating method and device of planisphere based on complex number space | |
CN101938333B (en) | Gray code pi/ M-MPSK modulating soft bit information calculation method | |
CN103209156A (en) | Improved dual carrier demodulation method based on mixed decision | |
CN103560861A (en) | Constellation mapping method | |
CN111131107B (en) | Self-adaptive soft demodulation method based on 5G downlink shared channel state | |
Sergienko | Dpsk-qam combination as a signal set for spectrally efficient noncoherent communication |
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 | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171031 |
|
CF01 | Termination of patent right due to non-payment of annual fee |