CN112187291B - Tail biting Turbo coding and decoding communication method based on transform domain - Google Patents
Tail biting Turbo coding and decoding communication method based on transform domain Download PDFInfo
- Publication number
- CN112187291B CN112187291B CN202011149927.3A CN202011149927A CN112187291B CN 112187291 B CN112187291 B CN 112187291B CN 202011149927 A CN202011149927 A CN 202011149927A CN 112187291 B CN112187291 B CN 112187291B
- Authority
- CN
- China
- Prior art keywords
- information
- tail biting
- domain
- decoding
- symbol
- 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.)
- Active
Links
- 230000000669 biting effect Effects 0.000 title claims abstract description 42
- 238000004891 communication Methods 0.000 title claims abstract description 22
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000009466 transformation Effects 0.000 claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 11
- 230000008569 process Effects 0.000 claims abstract description 7
- 238000006243 chemical reaction Methods 0.000 claims abstract description 4
- 238000001514 detection method Methods 0.000 claims abstract description 4
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000013507 mapping Methods 0.000 claims description 5
- 230000010287 polarization Effects 0.000 claims description 4
- 230000007704 transition Effects 0.000 claims description 4
- 230000010363 phase shift Effects 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 17
- 238000010586 diagram Methods 0.000 description 6
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
- H03M13/2996—Tail biting
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention provides a method for coding and decoding a communication by tail biting Turbo based on a transform domain, which carries out tail biting Turbo coding on symbol information of a target user to obtain a data block, generates a transform domain set, synchronously generates the same pseudo-random code to complete the transformation of a limited domain, sends a modulated signal into a channel to be transmitted according to the modulation after the modulation is completed at a target transmitting end, sequentially carries out inverse transformation corresponding to the inverse transform domain set on the received signal according to the inverse sequence of the pseudo-random code at a receiving end to complete the demodulation process, obtains a symbol sequence through maximum posterior probability detection and demodulation, and carries out tail biting decoding operation to obtain a reliable estimation result for the transmitting end. The invention realizes time-varying, high-mobility and low-interception communication through the conversion sequence among pseudo-random code control domains of a receiving and transmitting end; based on the tail biting Turbo coding and decoding technology, the reliable transmission of the data information can be completed by utilizing the tail biting property and breaking through the limit of the code length.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a tail biting Turbo coding and decoding technology which is an error control coding technology and is suitable for wireless safety communication by combining a transform domain with the tail biting Turbo coding and decoding technology.
Background
The orthogonal time-frequency expansion (OTFS) technology is a two-dimensional expansion mode, and is formed by a discrete Fourier transform and a multi-carrier multiplexing system, a transmitting end firstly transforms a time-frequency domain into a time-Doppler domain, modulates the time-Doppler domain, and finally maps modulation symbols in the time-Doppler domain into the time-frequency domain for transmission. OTFS can be seen as an improved technique over OFDM that improves transmission performance under highly dynamic conditions by converting the conventional time-frequency domain to the delay-doppler domain.
The early channel coding technology cannot absolutely guarantee the reliability of communication in a practical communication system because the channel coding technology has a large distance from the shannon limit and can obtain better performance only under the condition of long code length. In order to realize wireless high-quality communication, a channel coding technology needs to be found, on one hand, a distance close enough to the shannon limit can be obtained, and on the other hand, the reliable transmission of data information can be completed by breaking through the limit of the code length.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a transform domain-based tail biting Turbo coding and decoding communication method, which ensures higher-quality physical layer wireless safety communication.
The technical scheme adopted by the invention for solving the technical problems comprises the following steps:
step 1: assuming K target users, the corresponding input symbol message is b k ，k＝1,2,…,K；
Step 2: for symbol information b input by kth target user k Performing tail biting Turbo coding;
step 3: tail biting code output c k Through serial-parallel conversion, individual data blocks are obtained, each block of data contains LxR xMbits symbol message, wherein L represents sub-carrierThe number of waves, R, represents the number of symbols of each subcarrier, M is the symbol mapping to obtain M-PSK order;
step 4: generating a transform domain set in advance, wherein the transform domain set comprises a time-frequency domain, a delay-Doppler domain, a space domain, a polarization domain, a wavelet transform domain and a fractional Fourier transform domain, and defining the transform of each domain;
step 5: synchronously generating the same pseudo-random code at the target transmitting end and the target receiving end, controlling the length of the pseudo-random code, and completing the transformation of a limited domain;
step 6: at a target transmitting end, each information symbol is modulated to a certain domain in a transformation domain set according to the generated pseudo-random code, and after modulation is completed, a modulated signal is sent into a channel for transmission;
step 7: the receiving end sequentially executes corresponding inverse transformation in the inverse transformation domain set according to the inverse sequence of the pseudo-random code to complete the demodulation process;
step 8: the symbol sequence c 'after demodulation of the received signal is obtained through maximum a posteriori probability (MAP) detection and M-PSK demodulation' k For c' k And performing tail biting decoding operation to obtain a reliable estimation result of the transmitting end.
The tail biting Turbo coding in the step 2 comprises the following steps:
step 2.1: the pre-coding process comprises the following steps:
setting the initial state of the register to 0, taking the symbol information of the user as input, dividing the symbol information of the user into three paths according to the coding block diagram shown in fig. 1 (a), and directly outputting the symbol information of the user by the first path, wherein the symbol information is expressed as c u ,c u ＝b k The second path inputs the information of the user into a convolution encoder, and the exclusive-or operation is completed according to the structure of the convolution encoder to obtain a check code c 1p 、c 1p′ The third path firstly interweaves the user information, namely, after the user information is rearranged according to the address in an interweaving table (the rearranged address is stored in the interweaving table), the interweaved information is input into the same convolution encoder, and the exclusive-or operation is completed according to the structure of the convolution encoder to obtain the check code c 2p 、c 2p′ Finally, the three paths of information are processed according to (c u 、c 1p 、c 1p′ 、c 2p 、c 2p′ ) When one frame of coding is finished, the state S of the register after one frame of coding is finished is obtained K ；
Step 2.2: according to the state S of the register after one-time encoding K And information bit data length, lookup table 1:
TABLE 1
Wherein S is K For the state of the register after precoding, N represents a frame data length, N mod 7 represents a data length to be compared with 7, and an initial state S of biting the tail after coding is obtained c ；
Step 2.3: an efficient encoding process;
setting the initial state of the register to S c The symbol message of the user is encoded again according to the initial state, except for the difference of the initial state, the encoding mode is identical to the pre-encoding mode, and the state of the register returns to S after the encoding is completed c Obtaining the tail biting code output c k 。
The length of the pseudo-random code is not less than 2.
The limited number of times of the limited number of times domain is not less than 2.
The tail biting decoding operation in the step 8 comprises the following steps:
1): get c' k The last symbols u k Will u k Before the first symbol, a new frame is formed, denoted d k ＝[c′ k ,u k ]；
2): for d k Performing Turbo decoding, adopting MAP decoding algorithm, and decoding as follows:
2.1 Finding out each information bit b from the received data k.t The probability of being "1" and "0" or "+1" and "-1" is equivalent to the calculation of the information sequence d received k Lower b k.t Log-likelihood ratio of (2)Value LLR:
wherein d k To receive the information sequence b k.t Transmitting data corresponding to a transmitting end at the time t; p (b) k.t ＝+1|d k ) To obtain d k Time b k.t Probability of = +1, p (b) k.t ＝-1|d k To obtain d k Time b k.t Probability of = -1;
step 2.2) according to the bayesian criterion, formula (1) is rewritten as:
wherein,represent all of the groups represented by b k.t =1 causes->A set of state transitions;
step 2.3) using probability theory knowledge transformation to:
wherein d is k Dividing into three parts, taking time t as dividing line, and dividing d k Divided into portions d received before time t k.j＞t Part d received at time t k.j＝t Part d received after time t k.j＜t Three segments altogether, p (b|a) represents a state transition from state a to state B;
therefore, the key to equation (3) is to find α t (s)，β t (s)，γ t (s',s)；
Wherein alpha is t The calculation formula of(s) is:
initializing:
β t the calculation formula of(s) is:
initializing:
γ t the calculation formula of (s', s) is:
calculated according to the current received code word and the prior information (a-priority)
Step 2.4) obtaining alpha t (s)，β t (s)，γ t (s', s) likelihood ratio taken into equation (2):
step 2.5) updating the external information by continuous iteration until the iteration termination condition is met, and then terminating:
the decision is made by equation (10).
The invention has the beneficial effects that the time-varying, high-mobility and low-interception communication is realized by combining the transform domain technology and through the transform sequence between the pseudo-random code control domains of the receiving and transmitting end; based on the tail biting Turbo coding and decoding technology, the reliable transmission of the data information can be completed by utilizing the tail biting property and breaking through the limit of the code length.
Drawings
Fig. 1 (a) is a block diagram of Turbo coding, and fig. 1 (b) is a block diagram of Turbo decoding.
Fig. 2 (a) is a block diagram of tail biting Turbo coding, and fig. 2 (b) is a block diagram of tail biting Turbo decoding.
Fig. 3 is a block diagram of a transform domain based tail biting Turbo coding and decoding communication system.
Detailed Description
The invention will be further illustrated with reference to the following figures and examples, which include but are not limited to the following examples.
Inspired by OTFS technology, the domain to which OTFS originally relates is extended, not only limited to the delay-doppler domain and the time-frequency domain, but also different domains can be added, so that a transform domain technology is proposed. The transform domain technique may be defined as a modulation technique that first requires the generation of a set of transform domains, which may include: time-frequency domain, delay-doppler domain, spatial domain, polarization domain, wavelet transform domain, and so on. Second, a set of pseudo-random codes needs to be generated, by which each information symbol is selectively modulated into a domain in the set of transform domains, the random codes being generated synchronously at the target transmitting end and the target receiving end. At the target receiving end, the demodulation sequence is known, the data information is easily demodulated, and at the non-target receiving end, the real-time demodulation becomes very difficult due to the change of the demodulation sequence, so that the wireless communication safety is ensured.
The Turbo code is also called as parallel cascade convolution code (Parallel Concatenated Convolutional Code, PCCC), which is used as a channel coding technology, and iterative decoding is performed at the receiving end by utilizing the idea of soft input and soft output so as to achieve the performance approaching Shannon limit. And adding tail biting treatment in Turbo coding and decoding, and utilizing the tail biting property can break through the limitation of code length to finish the reliable transmission of information. Therefore, the method is widely applied to high-reliability wireless communication as a channel coding mode. In practical application, the tail biting Turbo coding and decoding technology is combined with the transform domain technology, so that the safe data transmission in a high-mobility scene can be supported, and meanwhile, the reliable transmission of information can be ensured.
According to the tail biting Turbo coding and decoding technology based on the transformation domain, provided that K target users are total, the message sent to each user by a transmitter is a random sequence of 0 or 1, and the message sequence sent to the kth user is marked as b k ＝[0 1 0 0 1 0 1 0 0 0……0 1 0 1 0 0 0 1 0 0]K=1, 2, …, K, the message data frame length in this example is 256, and it is assumed that QPSK is used for mapping, i.e. m=4, and 8 subcarriers are used for transmission, each carrier transmits 16bit information, and the noise present in the channel defaults to gaussian white noise. As shown in fig. 3, the present invention provides a transform domain-based tail biting Turbo coding and decoding communication technology, and the specific implementation manner is as follows:
step one: according to FIG. 2 (a), the data information sent by K target users is encoded by tail biting Turbo, wherein 1/5 code rate is adopted to ensure the reliability of communication, the initial state of the register is set to 0, and the data output after the tail biting Turbo encoding is finished can be assumed to be c k ＝[1 0 0 1 0 0 1 0 1 0……1 0 0 1 0 1 0 1 1 1]K=1, 2, …, K. Here c k Is 5 times the length of the information before encoding.
Step two: a set of transform domains is generated including a time-frequency domain (000), a delay-doppler domain (001), a spatial domain (010), a polarization domain (011), a wavelet transform domain (100), and a fractional fourier transform domain (101).
Step three: the same pseudo-random code is generated synchronously at the target transmitting end and the target receiving end, wherein the generated pseudo-random code is [001 000], namely the transmitting end firstly transforms information data to the delay-Doppler domain (001), and here, we assume that an information code block is transmitted through 8 carriers, each carrier transmits 16bit information, and 8 x 8 modulated symbol code blocks x are obtained after QPSK mapping, wherein each element is denoted as x [ l, r ], and the modulated code block is in the delay-Doppler domain (001).
Step four: information data is transformed from the delay-doppler domain (001) to the time-frequency domain (000) by an ISFFT transform according to the order of the pseudo-random codes:
step five: x [ p, q ] is transformed by Heisenberg]The transmitted baseband signal s (t) converted to the transmitting end can be expressed asWherein g tx (T) is a transmit pulse function, Δf is the subcarrier frequency spacing, T is the symbol period, Δf=1/T.
Step six: assuming that the impulse response of the time-varying channel is h (τ, v), where τ is the time delay and v is the doppler shift, the receiver received signal r (t) is expressed as: r (t) = ≡≡h (τ, ν) s (t- τ) e j2πν(t-τ) dτdν+w (t). w (t) is a Gaussian white noise with an average value of 0. Assuming that the number of multipath signals is p=4, h (τ, ν) is rewritten as
Step seven: the cross blurring function A is calculated by a matched filter at a receiving end grx,r (τ, ν), defining a Wigner transformation:wherein g rx And (t) is a receive pulse function. The signal is first received via Wigner transform according to the inverse sequence of the pseudo-random code: />Transform to the time-frequency domain (000).
Step eight: continuing Y [ p, q ] of time-frequency domain (000) in order]Conversion to the delay-Doppler domain (001) y [ l, r by SFFT]：
Step nine: the modulation symbols x l r are recovered from y l r by MAP detection.
Step ten: mapping pairs x [ l, r according to constellation points]QPSK demodulation is carried out to obtain recovered data c 'before tail biting Turbo decoding' k
Step eleven: get c' k The last symbol (assuming the number of symbols taken is 10) is placed before the first one to form a new frame, denoted d k ＝[1 0 1 0 0 1 0 1 1 1 1 0 0 1 0 0 1 0 1 0……1 0 1 0 0 1 0 1 1 1 1 0 0 1 0 0 1 0 1 0]。
Step twelve: and (3) calculating:
wherein,for input bit b k.t Is a priori information of (a), the information average energy is E b The code rate is R.
Step thirteen: alpha is obtained through multiple iterations t (s)，β t (s)，γ t (s', s) and thus the sequence d can be calculated k Lower b k.t Log Likelihood Ratio (LLR):
step fourteen: l (b) k.t |d k ) Is carried into the following formula of the device,
and obtaining decoded results and outputting the decoded results.
Claims (5)
1. A tail biting Turbo coding and decoding communication method based on a transform domain is characterized by comprising the following steps:
step 1: assuming K target users, the corresponding input symbol message is b k ，k＝1,2,…,K；
Step 2: for symbol information b input by kth target user k Performing tail biting Turbo coding;
step 3: tail biting code output c k Obtaining a plurality of data blocks through serial-parallel conversion, wherein each data block comprises LxRxMbits symbol information, wherein L represents the number of subcarriers, R represents the number of symbols of each subcarrier, and M is symbol mapping to obtain M-PSK (phase shift keying) order;
step 4: generating a transform domain set in advance, wherein the transform domain set comprises a time-frequency domain, a delay-Doppler domain, a space domain, a polarization domain, a wavelet transform domain and a fractional Fourier transform domain, and defining the transform of each domain;
step 5: synchronously generating the same pseudo-random code at the target transmitting end and the target receiving end, controlling the length of the pseudo-random code, and completing the transformation of a limited domain;
step 6: at a target transmitting end, each information symbol is modulated to a certain domain in a transformation domain set according to the generated pseudo-random code, and after modulation is completed, a modulated signal is sent into a channel for transmission;
step 7: the receiving end sequentially executes corresponding inverse transformation in the inverse transformation domain set according to the inverse sequence of the pseudo-random code to complete the demodulation process;
step 8: the symbol sequence c 'after demodulation of the received signal is obtained through maximum a posteriori probability (MAP) detection and M-PSK demodulation' k For c' k And performing tail biting decoding operation to obtain a reliable estimation result of the transmitting end.
2. The transform domain based tail biting Turbo coding and decoding communication method as defined in claim 1, wherein: the tail biting Turbo coding in the step 2 comprises the following steps:
step 2.1: the pre-coding process comprises the following steps:
will be registeredThe initial state of the device is set to 0, the symbol information of the user is taken as input, the symbol information of the user is divided into three paths, the symbol information of the user is directly output by the first path, and the symbol information is expressed as c u ,c u ＝b k The second path inputs the information of the user into a convolution encoder, and the exclusive-or operation is completed according to the structure of the convolution encoder to obtain a check code c 1p 、c 1p′ The third path firstly interweaves the user information, namely, after the user information is rearranged according to the address in the interweaving table, the interweaved information is input into the same convolution encoder, and the exclusive-or operation is completed according to the structure of the convolution encoder to obtain the check code c 2p 、c 2p′ Finally, the three paths of information are processed according to (c u 、c 1p 、c 1p′ 、c 2p 、c 2p′ ) When one frame of coding is finished, obtaining the state S of the register after the precoding is finished K ；
Step 2.2: according to the state S of the register after one-time encoding K And information bit data length, lookup table 1:
TABLE 1
Wherein S is K For the state of the register after precoding, N represents a frame data length, N mod 7 represents a data length to be compared with 7, and an initial state S of biting the tail after coding is obtained c ；
Step 2.3: an efficient encoding process;
setting the initial state of the register to S c The symbol message of the user is encoded again according to the initial state, except for the difference of the initial state, the encoding mode is identical to the pre-encoding mode, and the state of the register returns to S after the encoding is completed c Obtaining the tail biting code output c k 。
3. The transform domain based tail biting Turbo coding and decoding communication method as defined in claim 1, wherein: the length of the pseudo-random code is not less than 2.
4. The transform domain based tail biting Turbo coding and decoding communication method as defined in claim 1, wherein: the limited number of times of the limited number of times domain is not less than 2.
5. The transform domain based tail biting Turbo coding and decoding communication method as defined in claim 1, wherein: the tail biting decoding operation in the step 8 comprises the following steps:
1): get c' k The last symbols u k Will u k Before the first symbol, a new frame is formed, denoted d k ＝[c′ k ,u k ]；
2): for d k Performing Turbo decoding, adopting MAP decoding algorithm, and decoding as follows:
2.1 Finding out each information bit b from the received data k.t The probability of being "1" and "0" or "+1" and "-1" is equivalent to the calculation of the information sequence d received k Lower b k.t Log likelihood ratio LLR of (2):
wherein d k To receive the information sequence b k.t Transmitting data corresponding to a transmitting end at the time t; p (b) k.t ＝+1|d k ) To obtain d k Time b k.t Probability of = +1, p (b) k.t ＝-1|d k To obtain d k Time b k.t Probability of = -1, p (b) k,t ＝0|d k ) To obtain d k Time b k,t Probability of =0;
step 2.2) according to the bayesian criterion, formula (1) is rewritten as:
wherein,represent all of the groups represented by b k.t =1 causes->A set of state transitions that are associated with a single state,
step 2.3) using probability theory knowledge transformation to:
wherein d is k Dividing into three parts, taking time t as dividing line, and dividing d k Divided into portions d received before time t k.j＞t Part d received at time t k.j＝t Part d received after time t k.j＜t Three segments total, p (B|A) represents the probability of transition from state A to state B;
therefore, the key to equation (3) is to find α t (s)，β t (s)，γ t (s',s)；
Wherein alpha is t The calculation formula of(s) is:
initializing:
β t the calculation formula of(s) is:
initializing:
γ t the calculation formula of (s', s) is:
calculated according to the current received code word and the prior information (a-priority)
Step 2.4) obtaining alpha t (s)，β t (s)，γ t (s', s) likelihood ratio taken into equation (2):
step 2.5) updating the external information by continuous iteration until the iteration termination condition is met, and then terminating:
the decision is made by equation (10).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011149927.3A CN112187291B (en) | 2020-10-24 | 2020-10-24 | Tail biting Turbo coding and decoding communication method based on transform domain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011149927.3A CN112187291B (en) | 2020-10-24 | 2020-10-24 | Tail biting Turbo coding and decoding communication method based on transform domain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112187291A CN112187291A (en) | 2021-01-05 |
| CN112187291B true CN112187291B (en) | 2024-03-29 |
Family
ID=73922735
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011149927.3A Active CN112187291B (en) | 2020-10-24 | 2020-10-24 | Tail biting Turbo coding and decoding communication method based on transform domain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112187291B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115133965B (en) * | 2021-03-24 | 2023-09-15 | 维沃移动通信有限公司 | Information sending method and equipment |
| CN114095041B (en) * | 2022-01-19 | 2022-04-26 | 北京理工大学 | Low-code-rate coding method and device for short frame burst and storage medium |
| CN115134044A (en) * | 2022-05-25 | 2022-09-30 | 中山智联未来科技有限公司 | Ultra-long distance wireless transmission method, system and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083512A (en) * | 2006-06-02 | 2007-12-05 | 中兴通讯股份有限公司 | Dual-binary system tailbaiting Turbo code coding method and apparatus |
| EP1906536A2 (en) * | 2006-09-28 | 2008-04-02 | Broadcom Corporation | Tail-biting turbo code for arbitrary number of information bits |
| CN106603457A (en) * | 2016-12-09 | 2017-04-26 | 中国电力科学研究院 | Broadband power line carrier communication physical layer signal processing method based on OFDM |
| CN110022159A (en) * | 2019-03-12 | 2019-07-16 | 西北工业大学 | A kind of LDPC code decoding algorithm of fast convergence |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8433986B2 (en) * | 2008-06-11 | 2013-04-30 | Icoding Technology Inc | Method and apparatus for low latency turbo code encoding |
-
2020
- 2020-10-24 CN CN202011149927.3A patent/CN112187291B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083512A (en) * | 2006-06-02 | 2007-12-05 | 中兴通讯股份有限公司 | Dual-binary system tailbaiting Turbo code coding method and apparatus |
| EP1906536A2 (en) * | 2006-09-28 | 2008-04-02 | Broadcom Corporation | Tail-biting turbo code for arbitrary number of information bits |
| CN106603457A (en) * | 2016-12-09 | 2017-04-26 | 中国电力科学研究院 | Broadband power line carrier communication physical layer signal processing method based on OFDM |
| CN110022159A (en) * | 2019-03-12 | 2019-07-16 | 西北工业大学 | A kind of LDPC code decoding algorithm of fast convergence |
Non-Patent Citations (3)
| Title |
|---|
| Tail-Biting Theory for Turbo Codes;Ying Wang;《 2006 IEEE Annual Wireless and Microwave Technology Conference》;全文 * |
| 一种低时延Turbo码的编码器设计与实现;李超;《舰船电子对抗》;全文 * |
| 一种咬尾双二进制Turbo码并行译码方案;王琼;王伦;杨太海;;电讯技术(12);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112187291A (en) | 2021-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112187291B (en) | Tail biting Turbo coding and decoding communication method based on transform domain | |
| CN112290957B (en) | Orthogonal time-frequency expansion tail biting Turbo coding and decoding communication method | |
| KR100911424B1 (en) | Method and apparatus for determining the log-likelihood ratio with precoding | |
| JP4272665B2 (en) | Apparatus, method, and computer program for estimating channel of OFDM transmission system | |
| US20060250944A1 (en) | Apparatus and method for transmitting bit-interleaved coded modulation signals in an orthogonal frequency division multiplexing system | |
| WO2011088734A1 (en) | Offset modulation orthogonal frequency division multiplexing (ofdm) and multi-access transmission method with cyclic prefix (cp) | |
| EA016617B1 (en) | Apparatus and method for coded orthogonal frequency- division multiplexing | |
| JP2016506661A (en) | Digital communication system | |
| KR20180013411A (en) | Apparatus for receiving signal based on faster-than-nyquist and method for using the same | |
| Al-Rawi et al. | Exploiting error-control coding and cyclic-prefix in channel estimation for coded OFDM systems | |
| Necker et al. | Totally blind channel estimation for OFDM over fast varying mobile channels | |
| KR100769671B1 (en) | MB-OFDM transmitter and receiver and signal processing method thereof | |
| CN101345731B (en) | Multi-user OFDM modulation method based on imbedded training sequence and LDPC code | |
| CN107919937B (en) | Decoding method and device based on overlapping multiplexing and modulation and demodulation method and system | |
| JP5122459B2 (en) | Method and system for data diversity transmission | |
| CN110166386B (en) | Underwater acoustic communication balanced decoding method based on recursive chaotic code | |
| CN109639301A (en) | A kind of FTN equalization methods based on reliability estimating | |
| CN105187354B (en) | A method of ofdm communication signal peak-to-average ratio is inhibited based on PTS technology | |
| Mathews et al. | Performance of turbo coded FBMC based MIMO systems | |
| LIU et al. | Coded orthogonal time frequency space modulation | |
| CN116319203B (en) | Finite field resource construction method for distinguishing users and multiple access system | |
| Yammine et al. | Improved performance of coded OFDM-MFSK using combined alphabets and extended mapping | |
| CN111884983B (en) | Multi-carrier signal index modulation and demodulation method based on constellation diagram optimization | |
| Ucan et al. | Channel-parameter estimation for turbo trellis coded modulation in OFDM systems | |
| Singh et al. | Implementation of OFDM and Pulsed-OFDM |
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 |