CN104022848A - Coding and decoding method for no-rate TCM codes approximate to channel capacity - Google Patents
Coding and decoding method for no-rate TCM codes approximate to channel capacity Download PDFInfo
- Publication number
- CN104022848A CN104022848A CN201410275787.2A CN201410275787A CN104022848A CN 104022848 A CN104022848 A CN 104022848A CN 201410275787 A CN201410275787 A CN 201410275787A CN 104022848 A CN104022848 A CN 104022848A
- Authority
- CN
- China
- Prior art keywords
- sequence
- channel
- symbol
- transmitting terminal
- coding
- 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
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention discloses a coding and decoding method for no-rate TCM codes approximate to the channel capacity. The method mainly solves the problem that existing TCM codes can not select proper code rates in a self-adaptation mode to be transmitted according to changes of the actual channel states. The method comprises the realizing steps that an information sequence u generates a coding sequence c through coding of a coder; by changing the signal mapping relation, a transmitting end continuously modulates the coding sequence c so as to generate continuous symbol information and sends the information to a channel; a receiving end carries out decoding after receiving part of the information, if decoding fails, and decoding is carried out again by receiving more information until correct decoding is realized. The simulation result shows that the method improves the transmission efficiency of the TCM codes in the time-varying channel; moreover, under the linear coding structure, the transmission rate of the TCM codes can be approximate to the Shannon limit, the TCM codes can select the proper code rates in the self-adaptation mode to be transmitted under the circumstance that the sending end does not know the state information of the channel so as to adapt to an adaptive link rate.
Description
Technical field
The invention belongs to digital communication technology field, relate to a kind of channel decoding method, can be used for making TCM code to select adaptively suitable code check to transmit the in the situation that of transmitting terminal unknown channel state information.
Background technology
Trellis-coded modulation TCM technology is a kind of code modulating method based on convolution code being proposed by Ungerboeck nineteen eighty-two, it utilizes the memory of state and suitable mapping to increase the distance between codeword sequence, because convolution code can be regarded grid code as, therefore this system is just called Trellis-coded modulation.Its basic thought is: by the convolution code and 2 of code check R=m/ (m+1)
m+1system planisphere combines, in the situation that not reducing band efficiency and power utilization, with the complicated coding gain that exchanges for of equipment.Use the convolution code of this technology modulation to be called TCM code.Generally, the optional range of code rates of TCM code can be regarded the set of several fixedly centrifugal pumps as.Because TCM code is relevant with code check in the number of receiving terminal receiving symbol information, therefore when selecting a certain code check, unavoidably there will be following problem: when the information of the actual reception of receiving terminal more than realize correct decoding during the essential information receiving, can cause the waste of transmission information, now should use a certain higher code check to make TCM code performance best, but because the optional code check value of TCM code is limited, in most cases in optional code check set, can not find the best code check that is applicable to current channel; When the information of the actual reception of receiving terminal be less than realize correct decoding during the essential information receiving, cannot realize reliable decoding, now need to use a certain lower code check to make TCM code performance best, but still there will be as above similarly problem.Therefore, how making TCM code select adaptively suitable code check to transmit the in the situation that of transmitting terminal unknown channel state information, is a problem that needs solution.
Summary of the invention
The object of the invention is to the deficiency for above-mentioned prior art, a kind of coding and decoding method without speed TCM code that approaches channel capacity is proposed, so that TCM code can select adaptively suitable code check to transmit the in the situation that of transmitting terminal unknown channel state information, realize transmitting, improve the efficiency of transmission of TCM code in time varying channel.
The scheme that realizes the object of the invention is: on the coded modulation basis of TCM code, introduce the design philosophy of Rateless, complete the realization without speed TCM code.Its technical step is as follows:
(1) select the encoder for convolution codes of code check R=m/ (m+1), with this encoder to information sequence u=(u
1, u
2..., u
i..., u
l) encode, obtain coded sequence: c=(c
1, c
2..., c
i..., c
l), u wherein
ibe i individual 2
mthe information symbol of system, c
ibe i individual 2
m+1the coded identification of system, 1≤i≤L, L is the Gridding length of coding;
(2) transmitting terminal is by changing signal map relation, and constantly coded sequence c is modulated to produce endlessly symbolic information and is sent to channel, until receiving terminal receives abundant information to complete correct decoding:
(2a) make n represent the number of times that transmitting terminal is modulated coded sequence c, initialization n=1, and modelled signal mapping relations Φ
n;
(2b), at transmitting terminal, adopt signal map to be related to Φ
n, by coded sequence c=(c
1, c
2..., c
l) be mapped to 2
m+1on system planisphere, obtain modulated symbols sequence x
n=(x
n, 1, x
n, 2..., x
n,L), and by modulated symbols sequence x
nbe divided into M part:
represent i part, 1≤i≤M, 1≤M≤L;
(2c) make t represent that the lower transmitting terminal of this modulation sends the number of times of symbol sebolic addressing, initialization t=1 to channel;
(2d) transmitting terminal is to symbol sebolic addressing x
nmore than deleting, only retain the t part of this sequence,
, then sending it to channel, channel output adds the sequence of making an uproar
, the symbol sebolic addressing that receiving terminal receives under this modulation is
(2e) receiving terminal is according to the current all y=of receiving sequence (y
1, y
2..., y
n), use Viterbi decoding algorithm to carry out decoding;
If (2f) decode results is entirely true, export decode results, and declare that decoding finishes, if decode results is wrong, observe the lower transmitting terminal of this time modulation and to channel, send the size of the number of times t of symbol sebolic addressing, if t=M, the frequency n=n+1 that makes transmitting terminal modulate coded sequence c, changes signal map and is related to Φ
n, return to step (2b); If t<M, makes t=t+1, return to step (2d).
Tool of the present invention has the following advantages:
1) in the situation that of transmitting terminal unknown channel state information, can select adaptively suitable code check to transmit.The transmission code rate of existing TCM code is the code check R=m/ (m+1) of its encoder, its optional range of code rates can be regarded the set of several fixedly centrifugal pumps as, for a certain channel, in this set, not necessarily there is the best code check that is applicable to this channel, therefore existing TCM code differs and finds surely suitable code check, and of the present invention without speed TCM code due at transmitting terminal by changing signal map relation, constantly coded sequence c is modulated to produce endlessly symbolic information and is sent to channel, until receiving abundant information, receiving terminal completes correct decoding, therefore in how many meetings of the actual receiving symbol information of receiving terminal, the variation with actual channel state changes, thereby can according to the state self-adaption of actual channel select suitable code check to transmit,
2), under linear coding structure, its transmission rate can be approached capacity limit.The transmission code rate of existing TCM code is the code check R=m/ (m+1) of its encoder, therefore its transmission rate scope can be regarded the set of some centrifugal pumps as, cannot be along with the variation of channel status gradual change, thereby cannot approach capacity limit, and of the present invention without speed TCM code receiving terminal always receiving symbol information until correct decoding, because transmission code rate is relevant with the number of receiving terminal receiving symbol, therefore its transmission rate can be along with the variation of channel status gradual change, under linear coding structure, can approach capacity limit.
Accompanying drawing explanation
Fig. 1 is the general flow chart of realizing of the present invention;
Fig. 2 be in the present invention without speed TCM code in the remaining exemplary plot of deleting of transmitting terminal;
Fig. 3 is the comparison diagram of the simulation curve without speed TCM code of the present invention and Shannon limit.
Embodiment
Referring to accompanying drawing, technical scheme of the present invention and effect are described further.
With reference to figure 1, performing step of the present invention is as follows:
Step 1, selects the encoder for convolution codes of code check R=m/ (m+1), with this encoder to information sequence u=(u
1, u
2..., u
i..., u
l) encode, obtain coded sequence: c=(c
1, c
2..., c
i..., c
l), u wherein
ibe i individual 2
mthe information symbol of system, c
ibe i individual 2
m+1the coded identification of system, 1≤i≤L, L is the Gridding length of coding.
Step 2, makes n represent the number of times that transmitting terminal is modulated coded sequence c, initialization n=1, and modelled signal mapping relations Φ
n.
Step 3, at transmitting terminal, to coded sequence, c modulates, and to the modulated symbols sequence x obtaining
nmore than deleting, then send and deleted remaining symbol sebolic addressing to channel:
(3a) adopt signal map to be related to Φ
n, by coded sequence c=(c1
,c
2..., c
l) be mapped to 2
m+1on system planisphere, obtain modulated symbols sequence x
n=(x
n, 1, x
n, 2..., x
n,L), and by modulated symbols sequence x
nbe divided into M part:
represent i part, 1≤i≤M, 1≤M≤L.
(3b) make t represent that the lower transmitting terminal of this modulation sends the number of times of symbol sebolic addressing, initialization t=1 to channel;
(3c) transmitting terminal is to symbol sebolic addressing x
nmore than deleting, only retain the t part of this sequence,
, then sending it to channel, channel output adds the sequence of making an uproar
, the symbol sebolic addressing that receiving terminal receives under this modulation is
More than deleting described in this step, Fig. 2 is with L=16, and M=4's is example without speed TCM code, has provided and has deleted remaining exemplary plot, and this figure has four lines, and this represents the modulated symbols sequence x obtaining after the n time modulation
n=(x
n, 1, x
n, 2..., x
n,k..., x
n, 16) be sent out altogether four times, be about to modulated symbols sequence x
nbe divided into four parts
and only send this time for the t time to modulated symbols sequence x
nthe symbol sebolic addressing obtaining after more than deleting
x wherein
n,krepresent symbol sebolic addressing x
nin k symbol, 1≤k≤16,1≤t≤M.Every a line has 16 unit, comprising 4 solid unit, and 12 hollow unit, and k unit represents symbol x
n,k.If k the unit that t is capable is solid unit, be illustrated in symbol sebolic addressing
in comprise symbol x
n,kif k the unit that t is capable is hollow unit, be illustrated in symbol sebolic addressing
in do not comprise symbol x
n,k.Therefore, according to Fig. 2, can obtain, this deletes the symbol sebolic addressing obtaining after remaining for 4 times and is followed successively by:
Step 4, receiving terminal is according to the current all y=of receiving sequence (y
1, y
2..., y
n), use Viterbi decoding algorithm to carry out decoding:
(4a) make s
0initial condition during presentation code device coding, and initialization: make the j=0 of chronomere, enter initial condition s
0all length be that the metric in the part path of j section branch is 0, all length that enter other state are that the metric in part path of j section branch is for infinitely great;
(4b) to each state s, select and store part path and a part path metric value that has minimum metric, claim this part path for staying routing footpath;
(4c) make the j=j+1 of chronomere, according to the following step, calculate the tolerance that j enters all branches of each state s constantly:
(4c1) suppose that certain branch is s ' at the state of previous moment, incoming symbol u '
jafter, the coding that obtains this branch by grid coding is exported c '
jand the s that gets the hang of;
(4c2), for this branch, adopt respectively signal map to be related to Φ
1, Φ
2..., Φ
i..., Φ
n, output c ' will encode
jbe mapped to 2
m+1on system planisphere, obtain successively symbol χ
1, χ
2..., χ
i..., χ
n, wherein, Φ
irepresent the signal map relation that transmitting terminal adopts when coded sequence c is carried out to the i time modulation, χ
irepresent to adopt signal map to be related to Φ
ioutput c ' will encode
jbe mapped to 2
m+1the symbol obtaining on system planisphere, 1≤i≤n, n represents the number of times that transmitting terminal is modulated coded sequence c so far;
(4c3) the coded identification c constantly exporting at j for encoder
j, transmitting terminal sends symbol x
1, j, x
2j, ..., x
i,j..., after xn, j, the symbol that receiving terminal receives is followed successively by y
1, j, y
2, j..., y
i,j..., y
n, j,wherein, x
i,jbe illustrated in the coded identification c of transmitting terminal to j encoder output constantly
jthe modulated symbols obtaining while carrying out the i time modulation, y
i,jrepresent x
i,jby the output after channel, 1≤i≤n, n represents the number of times that transmitting terminal is modulated coded sequence c so far;
(4c4) the modulated symbols χ corresponding according to this branch
1, χ
2..., χ
i..., χ
nsymbol y with the j corresponding reception of receiving terminal constantly
1, j, y
2, j..., y
i,j..., y
n,j, 1≤i≤n, in conjunction with formula
obtain this branch metric Ω, and if receiving terminal do not receive symbol y
i,j, order || y
i,j-χ
i||
2=0.
(4d) j is entered constantly to the tolerance of all branches and the tolerance addition of staying routing footpath of the previous moment being connected with these branches of each state s, calculate its part path metric, then by the method for step (4b), obtaining the routing footpath of staying that j enters each state s constantly stores, and leave out other all paths, make the routing footpath of staying that constantly enters each state s at j all extend Liao Yige branch;
(4e) size of the j of observing time unit, if j<L, wherein L is the Gridding length of coding, return to step (4c), if j=L, staying of more all states selected path metric, picks out a path that has minimum metric, export in chronological order again the binary bit sequence of inputting in all branches in this path, obtain decode results.
Step 5, if decode results is entirely true, export decode results, and declare that decoding finishes, if decode results is wrong, observes the lower transmitting terminal of this time modulation and to channel, send the size of the number of times t of symbol sebolic addressing, if t=M, frequency n=the n+1 that makes transmitting terminal modulate coded sequence c, changes signal map and is related to Φ
n, return to step (3a); If t<M, makes t=t+1, return to step (3c).
Effect of the present invention can further illustrate by accompanying drawing 3:
With R=3/4, L=3's is example without speed TCM code, adopts 16QAM modulation to carry out emulation, and the comparison diagram of its simulation curve and Shannon limit is shown in Fig. 3, wherein, the code check that R is convolution coder, L is the Gridding length of coding.
As can be seen from Figure 3:
1) when-10dB≤SNR < 10dB, this transmission rate η without speed TCM code is all less than 3bits/symbol; When SNR>10dB, this transmission rate η without speed TCM code is greater than 3bits/symbol.And for the existing TCM code of R=3/4, owing to adopting 16QAM modulation, its transmission rate η is 3bits/symbol in theory.Therefore, can find out, compare with isostructural existing TCM code, when-10dB≤SNR < 10dB, this transmission code rate without speed TCM code is along with the difference of channel status has reduction in various degree; When SNR>10dB, this transmission code rate without speed TCM code has had suitable raising.Therefore, of the present inventionly without speed TCM code, realized according to the variation of actual channel state and selected adaptively suitable code check to transmit.
2) with Shannon, be limited to reference, when transmission rate η≤1bits/symbol, this simulation curve without speed TCM code overlaps completely with Shannon limit; When 1bits/symbol < η < 2.5bits/symbol, without the simulation curve of speed TCM code, approach Shannon limit.Can find out, within the scope of above-mentioned transmission rate, this transmission rate without speed TCM code is approached Shannon limit.
Claims (3)
1. the coding and decoding method without speed TCM code that approaches channel capacity, comprises the steps:
(1) select the encoder for convolution codes of code check R=m/ (m+1), with this encoder to information sequence u=(u
1, u
2..., u
i..., u
l) encode, obtain coded sequence: c=(c
1, c
2..., c
i..., c
l), u wherein
ibe i individual 2
mthe information symbol of system, c
ibe i individual 2
m+1the coded identification of system, 1≤i≤L, L is the Gridding length of coding;
(2) transmitting terminal is by changing signal map relation, and constantly coded sequence c is modulated to produce endlessly symbolic information and is sent to channel, until receiving terminal receives abundant information to complete correct decoding:
(2a) make n represent the number of times that transmitting terminal is modulated coded sequence c, initialization n=1, and modelled signal mapping relations Φ
n;
(2b), at transmitting terminal, adopt signal map to be related to Φ
n, by coded sequence c=(c
1, c
2..., c
l) be mapped to 2
m+1on system planisphere, obtain modulated symbols sequence x
n=(x
n, 1, x
n, 2..., x
n,L), and by modulated symbols sequence x
nbe divided into M part:
represent i part, 1≤i≤M, 1≤M≤L;
(2c) make t represent that the lower transmitting terminal of this modulation sends the number of times of symbol sebolic addressing, initialization t=1 to channel;
(2d) transmitting terminal is to symbol sebolic addressing x
nmore than deleting, only retain the t part of this sequence,
send it to channel, channel output adds the sequence of making an uproar again
the symbol sebolic addressing that receiving terminal receives under this modulation is
(2e) receiving terminal is according to the current all y=of receiving sequence (y
1, y
2..., y
n), use Viterbi decoding algorithm to carry out decoding;
If (2f) decode results is entirely true, export decode results, and declare that decoding finishes, if decode results is wrong, observe the lower transmitting terminal of this time modulation and to channel, send the size of the number of times t of symbol sebolic addressing, if t=M, the frequency n=n+1 that makes transmitting terminal modulate coded sequence c, changes signal map and is related to Φ
n, return to step (2b); If t<M, makes t=t+1, return to step (2d).
2. method according to claim 1, wherein the described receiving terminal of step (2e) is according to all y=of receiving sequence (y at present
1, y
2..., y
n), use Viterbi decoding algorithm to carry out decoding, carry out as follows:
(2e1) make s
0initial condition during presentation code device coding, and initialization: make the j=0 of chronomere, enter initial condition s
0all length be that the metric in the part path of j section branch is 0, all length that enter other state are that the metric in part path of j section branch is for infinitely great;
(2e2) to each state s, select and store part path and a part path metric value that has minimum metric, claim this part path for staying routing footpath;
(2e3) make the j=j+1 of chronomere, calculate the tolerance that j enters all branches of each state s constantly;
(2e4) j is entered constantly to the tolerance of all branches and the tolerance addition of staying routing footpath of the previous moment being connected with these branches of each state s, calculate its part path metric, then by the method for step (2e2), obtaining the routing footpath of staying that j enters each state s constantly stores, and leave out other all paths, make the routing footpath of staying that constantly enters each state s at j all extend Liao Yige branch;
(2e5) size of the j of observing time unit, if j<L, wherein L is the Gridding length of coding, return to step (2e3), if j=L, staying of more all states selected path metric, picks out a path that has minimum metric, export in chronological order again the binary bit sequence of inputting in all branches in this path, obtain decode results.
3. method according to claim 2, constantly the get the hang of a certain branch metric of s of the calculating j described in step (2e3), concrete steps are as follows:
(2e31) suppose that certain branch is s ' at the state of previous moment, incoming symbol u
j' after, the coding that obtains this branch by grid coding is exported c
j' and the s that gets the hang of;
(2e32), for this branch, adopt respectively signal map to be related to Φ
1, Φ
2..., Φ
i..., Φ
n, output c will encode
j' be mapped to 2
m+1on system planisphere, obtain successively symbol χ
1, χ
2..., χ
i..., χ
n, wherein, Φ
irepresent the signal map relation that transmitting terminal adopts when coded sequence c is carried out to the i time modulation, χ
irepresent to adopt signal map to be related to Φ
ioutput c ' will encode
jbe mapped to 2
m+1the symbol obtaining on system planisphere, 1≤i≤n, n represents the number of times that transmitting terminal is modulated coded sequence c so far;
(2e33) the coded identification c constantly exporting at j for encoder
j, transmitting terminal sends symbol x
1, j, x
2, j..., x
i,j..., x
n,jafter, the symbol that receiving terminal receives is followed successively by y
1, j, y
2, j..., y
i,j..., y
n,j, wherein, x
i,jbe illustrated in the coded identification c of transmitting terminal to j encoder output constantly
jthe modulated symbols obtaining while carrying out the i time modulation, y
i,jrepresent x
i,jby the output after channel, 1≤i≤n, n represents the number of times that transmitting terminal is modulated coded sequence c so far;
(2e34) the modulated symbols χ corresponding according to this branch
1, χ
2..., χ
i..., χ
nsymbol y with the j corresponding reception of receiving terminal constantly
1, j,y
2, j..., y
i,j..., y
n,j, 1≤i≤n, in conjunction with formula
obtain this branch metric Ω, and if receiving terminal do not receive symbol y
i,j, order || y
i,j-χ
i||
2=0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410275787.2A CN104022848B (en) | 2014-06-19 | 2014-06-19 | Coding and decoding method for no-rate TCM codes approximate to channel capacity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410275787.2A CN104022848B (en) | 2014-06-19 | 2014-06-19 | Coding and decoding method for no-rate TCM codes approximate to channel capacity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104022848A true CN104022848A (en) | 2014-09-03 |
| CN104022848B CN104022848B (en) | 2017-04-19 |
Family
ID=51439437
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410275787.2A Expired - Fee Related CN104022848B (en) | 2014-06-19 | 2014-06-19 | Coding and decoding method for no-rate TCM codes approximate to channel capacity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104022848B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112291762A (en) * | 2020-06-11 | 2021-01-29 | 珠海市杰理科技股份有限公司 | Data receiving and transmitting method, device, equipment and system in Bluetooth communication |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794590A (en) * | 2005-10-27 | 2006-06-28 | 中国科学院研究生院 | Coding-decoding method for integrated source and channel variable-length symbol Turbo |
| CN101124764A (en) * | 2004-12-22 | 2008-02-13 | 高通股份有限公司 | Method and apparatus for using multiple modulation schemes for a single packet |
| CN101123439A (en) * | 2007-07-10 | 2008-02-13 | 华为技术有限公司 | A coding modulation and decoding method and device for grid coding and modulation code |
| CN102457356A (en) * | 2010-11-01 | 2012-05-16 | 马维尔国际贸易有限公司 | Methods and systems for encoding and decoding in trellis coded modulation systems |
| US20120183020A1 (en) * | 2011-01-14 | 2012-07-19 | Toshiaki Koike-Akino | Non-Coherent Space-Time Trellis-Coded Modulations for Network-Coded Wireless Relay Communications |
-
2014
- 2014-06-19 CN CN201410275787.2A patent/CN104022848B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101124764A (en) * | 2004-12-22 | 2008-02-13 | 高通股份有限公司 | Method and apparatus for using multiple modulation schemes for a single packet |
| CN1794590A (en) * | 2005-10-27 | 2006-06-28 | 中国科学院研究生院 | Coding-decoding method for integrated source and channel variable-length symbol Turbo |
| CN101123439A (en) * | 2007-07-10 | 2008-02-13 | 华为技术有限公司 | A coding modulation and decoding method and device for grid coding and modulation code |
| CN102457356A (en) * | 2010-11-01 | 2012-05-16 | 马维尔国际贸易有限公司 | Methods and systems for encoding and decoding in trellis coded modulation systems |
| US20120183020A1 (en) * | 2011-01-14 | 2012-07-19 | Toshiaki Koike-Akino | Non-Coherent Space-Time Trellis-Coded Modulations for Network-Coded Wireless Relay Communications |
Non-Patent Citations (1)
| Title |
|---|
| 王俊 等: "Turbo-TCM编码调制系统的量化性能", 《空间电子技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112291762A (en) * | 2020-06-11 | 2021-01-29 | 珠海市杰理科技股份有限公司 | Data receiving and transmitting method, device, equipment and system in Bluetooth communication |
| CN112291762B (en) * | 2020-06-11 | 2024-01-30 | 珠海市杰理科技股份有限公司 | Data receiving and transmitting method, device, equipment and system in Bluetooth communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104022848B (en) | 2017-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108736899B (en) | A kind of polarization code coding/decoding method and device | |
| CN106230489B (en) | Polarization code encoding modulation method suitable for any high order modulation | |
| CN101453221B (en) | Mapper based on bit weaving code modulation system and mapping process thereof | |
| JP6138153B2 (en) | Method and system for mapping bit strings | |
| CN105634712A (en) | SCMA (sparse code multiple access) simple codebook design method under Gauss channel | |
| CN106561013B (en) | The method of multi-user's superposition transmission and the base station for using the method | |
| CN101321034A (en) | System and method for encoding and decoding in wireless communication systems | |
| CN110418220B (en) | Generalized frequency division multiplexing system, and method and device for generating optical fiber signals | |
| CN107819545A (en) | The repeating method and device of polarization code | |
| CN101123439A (en) | A coding modulation and decoding method and device for grid coding and modulation code | |
| Seidl et al. | Aspects of polar-coded modulation | |
| CN106254030B (en) | Two-way coding and decoding method without rate Spinal code | |
| CN106100697A (en) | Low-voltage power line carrier communication system and method | |
| CN102647202B (en) | Data transmission method and system based on MDFH (Message Driven Frequency Hopping) | |
| CN104022848A (en) | Coding and decoding method for no-rate TCM codes approximate to channel capacity | |
| CN102244561B (en) | Relay transmission method applied to multiple access relay network | |
| CN101534127A (en) | Encoding and decoding method for improving decoding efficiency by pilot frequency information and device thereof | |
| CN110445554A (en) | A kind of incoherent underwater acoustic communication method and system based on the actual channel statistics of fading | |
| CN101764667B (en) | Wireless transmitting apparatus and method and wireless communication system | |
| CN108631931A (en) | A kind of method and device of construction polarization code sequence | |
| EP3910800B1 (en) | Wireless communication system, wireless communication device, transmitting device, and receiving device | |
| CN208316741U (en) | High efficient detection device based on polarization code | |
| CN104410596B (en) | A kind of modulation and demodulation method of enhanced sextuple 32PSK | |
| CN104486276B (en) | A kind of modulation and demodulation method of enhanced sextuple 64PSK | |
| CN104301069A (en) | Interweaving and de-interweaving method and device based on congruence class interweaving mapping sequence |
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: 20170419 Termination date: 20180619 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |