CN109687935A - Interpretation method and device - Google Patents

Interpretation method and device Download PDF

Info

Publication number
CN109687935A
CN109687935A CN201710976986.XA CN201710976986A CN109687935A CN 109687935 A CN109687935 A CN 109687935A CN 201710976986 A CN201710976986 A CN 201710976986A CN 109687935 A CN109687935 A CN 109687935A
Authority
CN
China
Prior art keywords
bit
decoding
backward
received sequence
soft information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710976986.XA
Other languages
Chinese (zh)
Other versions
CN109687935B (en
Inventor
不公告发明人
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lv Wenming
Original Assignee
Shenzhen Super Data Link Technology Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Super Data Link Technology Ltd filed Critical Shenzhen Super Data Link Technology Ltd
Priority to CN201710976986.XA priority Critical patent/CN109687935B/en
Publication of CN109687935A publication Critical patent/CN109687935A/en
Application granted granted Critical
Publication of CN109687935B publication Critical patent/CN109687935B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0052Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0047Decoding adapted to other signal detection operation
    • H04L1/005Iterative decoding, including iteration between signal detection and decoding operation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention discloses a kind of interpretation method and devices.Wherein, sequence is received this method comprises: obtaining, receives sequence and includes not lap and lap, wherein the not lap for receiving sequence includes initial position and the terminal location for receiving sequence;To decoding before being executed backward by bit from the initial position for receiving sequence, and from the terminal location for receiving sequence executed by bit forward after to decoding, wherein, to receive sequence lap bit execute before to decoding or after to decoding when, the forward direction soft decoding information or backward soft decoding information of bit to be decoded are determined according to the decoding information of the bit decoded;The Soft Inform ation of each bit is determined according to the forward direction soft decoding information of each bit for the lap for receiving sequence and backward soft decoding information.The present invention, which solves interpretation method in the related technology, and overlapping multiplexing number has exponent relation leads to the higher technical problem of decoding complexity.

Description

Decoding method and device
Technical Field
The invention relates to the field of decoding, in particular to a decoding method and a decoding device.
Background
The traditional common soft decoding method comprises MAP, Log-MAP and the like, wherein the decoding method is based on graphic decoding, and the complexity is influenced by the state number. X in an overlap multiplexing (OvXDM) system may be Time T, Frequency F, Code division C, Space S, or Hybrid H, and specifically, the OvXDM system may be divided into an overlap Time division multiplexing (OvTDM) system, an overlap Frequency division multiplexing (OvFDM) system, an overlap Code division multiplexing (OvCDM) system, an overlap Space division multiplexing (OvSDM) system, an overlap Hybrid division multiplexing (OvHDM) system, and the like, and an equivalent model schematic diagram of the overlap multiplexing system is shown in fig. 1. For the OvXDM system, when the number of overlapping multiplexing K is large, the decoding complexity increases exponentially, and a large storage capacity is required, so that the implementation in practical engineering is difficult.
Aiming at the technical problem that the decoding complexity is high due to the exponential relation between the decoding method and the overlapping multiplexing times in the related technology, no effective solution is provided at present.
Disclosure of Invention
The embodiment of the invention provides a decoding method and a decoding device, which at least solve the technical problem of higher decoding complexity caused by the exponential relation between a decoding method and the number of overlapping multiplexing in the related technology.
According to an aspect of the embodiments of the present invention, there is provided a decoding method, which is applied to a receiving end of an overlay multiplexing system, the method including: acquiring a receiving sequence, wherein the receiving sequence comprises a non-overlapping single-symbol part and an overlapping part, and the non-overlapping single-symbol part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence; performing forward decoding backward bit by bit from a start position of the received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; soft information for each bit is determined based on forward decoded soft information and backward decoded soft information for each bit of the overlapping portion of the received sequence.
Further, performing forward decoding bit by bit backward from the start position of the received sequence includes: determining a forward decoding relation of the received sequence, wherein the forward decoding relation is ri=f(r0,……,ri-1) Bit r for representing a received sequenceiAnd bit r0To ri-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; forward decoding is performed bit by bit backward from a start position of the received sequence according to a forward decoding relationship.
Further, performing backward decoding bit by bit forward from the terminal position of the received sequence comprises: determining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r for representing a received sequenceiAnd bit ri+1To rN-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; backward decoding is performed bit by bit forward from the terminal position of the received sequence according to a backward decoding relationship.
Further, determining soft information for each bit based on forward decoded soft information and backward decoded soft information for each bit of the overlapping portion of the received sequence comprises: determining bit r in a received sequenceiForward decoding soft information Lext_fw(i) Wherein i is more than or equal to 0 and less than or equal to L-1, and L is the length of the receiving sequence; determining bit r in a received sequenceiBackward decoding soft information Lext_bw(i) (ii) a Will bit riBackward decoding soft information Lext_fw(i) And forward decoding soft information Lext_bw(i) Add to obtain bit riSoft information of
Wherein L isapp(i) For a posterior log-likelihood ratio, Laprior(i) Is a prior log-likelihood ratio, Laprior(i) According to the pair bit riAnd determining the current iteration number of decoding.
According to another aspect of the embodiments of the present invention, there is also provided a decoding apparatus, which is applied to a receiving end of an overlay multiplexing system, the apparatus including: the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a receiving sequence, and the receiving sequence comprises a non-overlapping part and an overlapping part, wherein the non-overlapping part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence; a decoding unit for performing forward decoding backward bit by bit from a start position of a received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; a determining unit for determining soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the received sequence.
Further, the decoding unit performing forward decoding bit by bit backward from the start position of the received sequence includes: determining a forward decoding relation of the received sequence, wherein the forward decoding relation is ri=f(r0,……,ri-1) Bit r for representing a received sequenceiAnd bit r0To ri-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; forward decoding is performed bit by bit backward from a start position of the received sequence according to a forward decoding relationship.
Further, the decoding unit performing backward decoding bit by bit forward from the terminal position of the received sequence includes: it doesDetermining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r for representing a received sequenceiAnd bit ri+1To rN-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; backward decoding is performed bit by bit forward from the terminal position of the received sequence according to a backward decoding relationship.
Further, the determination unit includes: a first determining module for determining a bit r in the received sequenceiForward decoding soft information Lext_fw(i) Wherein i is more than or equal to 0 and less than or equal to L-1, and L is the length of the receiving sequence; a second determining module for determining a bit r in the received sequenceiBackward decoding soft information Lext_bw(i) (ii) a A calculation module for converting the bit riBackward decoding soft information Lext_fw(i) And forward decoding soft information Lext_bw(i) Add to obtain bit riSoft information of
Wherein L isapp(i) For a posterior log-likelihood ratio, Laprior(i) Is a prior log-likelihood ratio, Laprior(i) According to the pair bit riAnd determining the current iteration number of decoding.
According to another aspect of the embodiments of the present invention, there is also provided a storage medium including a stored program, wherein when the program runs, a device in which the storage medium is located is controlled to execute the decoding method of the present invention.
According to another aspect of the embodiments of the present invention, there is also provided a processor, configured to execute a program, where the program executes to perform the decoding method of the present invention.
In the embodiment of the invention, by acquiring a receiving sequence, the receiving sequence comprises a non-overlapping single-symbol part and an overlapping part, wherein the non-overlapping single-symbol part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence; performing forward decoding backward bit by bit from a start position of the received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; the soft information of each bit is determined according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the received sequence, the technical problem that the decoding complexity is higher due to the fact that the decoding method and the overlapping multiplexing times are in an exponential relation in the related technology is solved, and the technical effect of reducing the complexity of the decoding method and the correlation of the overlapping multiplexing times is achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
FIG. 1 is a schematic diagram of an equivalent convolutional coding model of an alternative overlap-and-multiplex system;
FIG. 2 is a flow chart of an alternative decoding method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of an alternative K-way overlapping multiplexed waveform arrangement in accordance with embodiments of the present invention;
FIG. 4 is a schematic diagram of an alternative Turbo-OvTDM system architecture in accordance with embodiments of the present invention;
fig. 5 is a schematic block diagram of a transmitting end of an alternative OvTDM system according to an embodiment of the present invention;
fig. 6 is a schematic block diagram of the receiving end of an alternative OvTDM system according to an embodiment of the present invention;
FIG. 7 is an alternative node state transition diagram according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of an alternative OvTDM system input-output relationship in accordance with embodiments of the present invention;
FIG. 9 is a Trellis diagram of an alternative OvTDM system in accordance with embodiments of the present invention;
fig. 10 is a schematic diagram of an alternative decoding apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Embodiments of a decoding method are provided. It should be noted that the decoding method is applied to a receiving end of an overlap multiplexing system, and the overlap multiplexing system includes a transmitting end and a receiving end.
Fig. 2 is a flowchart of an alternative decoding method according to an embodiment of the present invention, as shown in fig. 2, the method includes the following steps:
step S101, acquiring a reception sequence:
the receiving sequence is a sequence sent by a sending end of the overlapping multiplexing system acquired by a receiving end of the overlapping multiplexing system, the sending end of the overlapping multiplexing system codes an original sequence, the obtained coded sequence is a sending sequence, and after the receiving end of the overlapping multiplexing system receives the sending sequence, noise enters into the sending sequence possibly due to errors in a channel transmission process. After the receiving end of the overlapping multiplexing system acquires the receiving sequence, the receiving sequence is decoded to acquire an original sequence.
It should be noted that, since the system applied by the decoding method provided in this embodiment is an overlap multiplexing system, and due to the coding characteristics of the overlap multiplexing system, the transmission sequence has the structural characteristics of a parallelogram, fig. 3 is a schematic diagram of an alternative K-path overlap multiplexing waveform arrangement according to an embodiment of the present invention, as shown in fig. 3, the transmission sequence includes two parts, i.e., a non-overlapping part and an overlapping part, and correspondingly, the reception sequence includes two parts, i.e., a single symbol part (hereinafter referred to as a non-overlapping part) and an overlapping part, where the non-overlapping part of the reception sequence includes a start position and an end position of the reception sequence, and when performing misalignment addition, the two values of the start position and the end position are not added to other values, i.e., form a final addition result as a single symbol.
Data of a received sequence is divided into non-overlapping portions and a repetitionThe overlap portion, taking the OvXDM system shown in fig. 1 as an example, according to the characteristics of the OvXDM system, first, assuming that the number of times of overlap multiplexing is K, tap coefficients of the multiplexed waveform are respectively defined as [ h [0,h1,…,hK-1]. At this time, according to the convolution characteristic of the superposition multiplexing relationship, if the length of the real information bit sequence (original sequence) is L and the length of the OvXDM coded bit sequence (transmission sequence) is N, (where (N ═ L + K-1), then the multiplexed waveform can be expressed as the following matrix format
Wherein the size of the H matrix is N × L.
It can be seen that the original sequence is divided into two parts, a non-overlapping part and an overlapping part after being encoded by the OvXDM signal, wherein the non-overlapping part includes the header and the trailer data, for example, in the multiplexed waveform shown in fig. 3, the header data and the trailer data correspond to a in fig. 3 respectively0x0And ak-1xk-1(ii) a The overlapping portion includes data that partially overlap or completely overlap. The received sequence is also divided into a non-overlapping portion and an overlapping portion, corresponding to the transmitted sequence. Referring to fig. 3, the original sequences are superimposed to form a parallelogram, the front and rear triangular regions are incompletely overlapped portions, and the middle segment is completely overlapped data.
Step S102, forward decoding is carried out backward bit by bit from the starting position of the received sequence, and backward decoding is carried out forward bit by bit from the terminal position of the received sequence:
the received sequence is a sequence of a plurality of bits, and when the received sequence is decoded, the decoding is performed by a bit-by-bit decoding method. Soft decoding is a decoding method for obtaining soft information for each bit, and the soft information is used to indicate reliability of a decoding result of a corresponding bit. The decoding is started from the initial position of the received sequence, that is, the decoding is started from the first bit of the received sequence, and the soft decoding is carried out backward bit by bit to obtain the forward decoding soft information of at least one bit. Meanwhile, forward bit-by-bit soft decoding is carried out from the terminal position of the received sequence to obtain backward decoding soft information of at least one bit, and the forward decoding and the backward decoding are carried out simultaneously, namely after the received sequence is obtained, backward bit-by-bit soft decoding can be carried out from the starting position of the received sequence and forward bit-by-bit soft decoding can be carried out from the terminal position of the received sequence at the same time, and the backward decoding soft information of at least one bit can be obtained from the terminal position of the received sequence.
When the bits of the overlapped part of the received sequence are subjected to forward decoding or backward decoding, the forward decoding soft information or backward decoding soft information of the bits to be decoded is determined according to the decoding information of the decoded bits. The decoded information of the decoded bits is soft information, wherein the soft information is an estimate of the corresponding bit and is a probability value, and carries more information than the hard information.
Further, the step of performing forward decoding bit by bit backward from the start position of the received sequence may be: determining a forward decoding relation of the received sequence, wherein the forward decoding relation is ri=f(r0,……,ri-1) Bit r for representing a received sequenceiAnd bit r0To ri-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; performing forward decoding bit by bit backward from a start position of the received sequence according to a forward decoding relationship; the step of performing backward decoding bit by bit forward from the terminal position of the received sequence may be: determining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r for representing a received sequenceiAnd bit ri+1To rN-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; backward decoding is performed bit by bit forward from the terminal position of the received sequence according to a backward decoding relationship.
For example, the above-exemplified OvXDM system isFor example, let the output vector after OvXDM coding be Y ═ Y0,…,yN-1]TThe input vector is X ═ X1,…,xL-1]TThe encoding process of OvXDM can be expressed as Y ═ HX, i.e.
Then at this point the received sequence R may be represented as
Wherein, [ η ]01,…,ηN-1]TIs a white noise sequence.
According to the correlation characteristic shown by the coding matrix, the following relationship can be obtained
And
since the data of the start position and the data of the end position are not overlapped completely after the OvXDM signal is encoded, the head and tail data can be obtained by starting with the head and tail data. Then, according to the two formulas, the decoded information can be removed from the received information to obtain the soft information of the current time, thereby realizing the bit-by-bit decoding of the head data and the tail data respectively.
If the posterior log-likelihood ratio of each bit is set to Lapp(i),i∈[0,L-1]After forward and backward bitwise decoding, it can be expressed as
Lapp(i)=Laprior(i)+Lext_fw(i)+Lext_bw(i),i∈[0,L-1]
Wherein L isaprior(i),Lext_fw(i) And Lext_bw(i) Respectively representing the prior log-likelihood ratio of the bit, the extrinsic information obtained by forward decoding and the extrinsic information obtained by backward decoding. It should be noted that, generally, when soft information is calculated, iterative decoding may be performed, and by setting the number of iterations, soft information output each time is used as extrinsic information of next soft decoding, and the process is repeated until the number of iterations is satisfied, and the soft decoding process is ended, where L isaprior(i) 0 in the first iteration and L in the subsequent iterationsaprior(i) Is determined based on information generated from previous iterations.
Let the probability estimate of the ith bit decoding beAnd is also provided withWherein, p (x)i=+1|ri,ri+K-1) Is based on the bit r of the received sequenceiAnd bit ri+K-1Determined xiProbability of +1 value, p (x)i=-1|ri,ri+K-1) Is based on the bit r of the received sequenceiAnd bit ri+K-1Determined xiProbability of-1 value, soft informationCan be expressed as:
the estimation error v (i) can be expressed asIf the channel is set to AWGN,variance of noise is σ2The extrinsic information of the forward decoding can be represented as
At this time, the process of the present invention,is obtained according to the known forward decoding result, i.e.
WhileCorrespondingly, the outer information of the backward decoding can be expressed as
At this time, the process of the present invention,is obtained according to the known backward decoding result, i.e.While
Through the steps, in the decoding process, the information generated in the forward decoding and backward decoding processes can be fully utilized, the extrinsic information generated by the forward decoding and backward decoding can perform soft information exchange in the middle (overlapping part) of a data frame (receiving sequence), and finally, the soft information of the backward decoding in the first half part of the data frame and the soft information of the forward decoding in the second half part of the data frame can be taken and correspondingly operated, so that the finally obtained soft information of each time (each bit) of the data frame is more reliable. It should be noted that when decoding to the middle part, especially L/2 (where L is the length of the received sequence), the most decoded information can be used.
Step S103, determining soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the receiving sequence:
after forward decoding is performed backward bit by bit from a start position of a received sequence and backward decoding is performed forward bit by bit from an end position of the received sequence, soft information of each bit is determined according to the forward decoding soft information and the backward decoding soft information of each bit of an overlapping portion of the received sequence.
After bit-by-bit soft decoding is performed on the received sequence, forward decoding soft information of each bit in the received sequence can be determined, backward decoding soft information of each bit in the received sequence is determined, and the backward decoding soft information of each bit is added to the forward decoding soft information to obtain soft information of each bit.
The embodiment obtains a receiving sequence, wherein the receiving sequence comprises a non-overlapping part and an overlapping part, and the non-overlapping part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence; performing forward decoding backward bit by bit from a start position of the received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; the soft information of each bit is determined according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the received sequence, the technical problem that the decoding complexity is higher due to the fact that the decoding method and the overlapping multiplexing times are in an exponential relation in the related technology is solved, and the technical effect of reducing the complexity of the decoding method and the correlation of the overlapping multiplexing times is achieved.
The decoding method provided by the embodiment can be suitable for a single OvXDM system, and also can be suitable for a serial cascade structure, such as a Turbo-OvXDM system, an OvXDM system with pre-coding, an OvXDM system with Turbo recursion and the like; when the number of times of overlapping multiplexing K is large, the decoding complexity is improved well, and the decoding complexity is related to the length of a data frame, is not in exponential relation with the number of times of overlapping multiplexing and is not related to the number of states.
The following further describes the steps of the decoding method provided by the embodiment of the present invention with a specific scenario applied in the Turbo-OvXDM system.
The structure of the Turbo-OvTDM system is shown in FIG. 4, and the Turbo-OvTDM system is composed of two stages of overlapped codes, including P-OvTDM and S-OvTDM. P-OvTDM (Pure-OvTDM), is not shifted from each other, and is used for converting independent binary data stream into multiple data stream with overlap multiple K1. S-OvTDM (shift-OvTDM), which is commonly understood by people, is used for shifting and overlapping multi-element data streams, and the overlapping multiple is
The input information of the Turbo-OvTDM system is assumed to be x (x belongs to { +1, -1}), the length is L, and the overlapping times K of P-OvTDM are set as11, i.e. corresponding to BPSK modulation, S-OvTDM overlap K2=100。
The encoding process of the transmitting end of the Turbo-OvTDM system is as follows:
1) P-OvTDM coding
Input information x is subjected to P-OvTDM coding to form I path data; meanwhile, the input information passes through an interleaver and then P-OvTDM coding to form Q-path data. I, Q are added to form complex information.
Since here K is11, i.e. without P-OvTDM coding, corresponding to a path of data being directly input as I-path information, oneThe path data is used as Q path information after passing through the interleaver.
Wherein the input information is subjected to S/P (serial-to-parallel conversion) process and then K1Sub-overlap multiplexing and summing sigma.
2) S-OvTDM encoding
The overlapped complex information in the '1) P-OvTDM coding' is subjected to S-OvTDM coding, and the coding method is the same as the coding method of a general OvTDM system, and is not described herein again.
And finally, transmitting the signal after the two-stage coding is finished through an AWGN channel.
The decoding process of the receiving end of the Turbo-OvTDM system is as follows:
and separating the received sequence through I/Q path separation, then carrying out iterative decoding, and carrying out decision output. Specifically, after receiving the signal, the signal is preprocessed and then decoded. The pretreatment mainly comprises the following steps: synchronization process, channel estimation, equalization, etc., and the noise variance sigma is calculated in the preprocessing process2
Since the OvTDM system codes are in a parallelogram shape, for example, a schematic diagram of an alternative K-way overlapping multiplexing waveform arrangement shown in fig. 3, the decoding process can be divided into two parts, namely, decoding data of an incomplete overlapping part and decoding data of a complete overlapping part, wherein the data of the incomplete overlapping part includes head and tail data of the incomplete overlapping and head and tail data of the complete non-overlapping part. When the soft information decoding process is performed, the process can be divided into a backward decoding process and a forward decoding process. The forward decoding is to decode backward bit by bit from the start position of the data frame, and the backward decoding is to decode forward bit by bit from the end of the data frame.
The specific decoding process is as follows:
(1) calculating soft information of data of incomplete overlapping part
Since the head and tail data have K-1 bits which are not completely overlapped, only the soft information of the first K-1 data of the data frame and the soft information of the last K-1 data of the data frame are calculated in the step.
According to the above-exemplified formulas in the OvXDM system, since the head and tail data are not completely overlapped, the corresponding formulas for calculating extrinsic information need to be adjusted.
The forward decoding extrinsic information (forward decoding soft information) isI is more than or equal to 1 and less than or equal to K-1; the backward decoding extrinsic information (backward decoding soft information) isL-K≤i≤L-2。
According to the OvTDM superposition principle, the first symbol and the last symbol are not superposed at all and are not influenced by symbols at other time instants, so that the reliability is highest. The forward coding extrinsic information of the first symbol can be expressed asThe postdecoding extrinsic information of the last symbol can be expressed as
(2) Calculating soft information of data of completely overlapped parts
According to the OvTDM coding characteristic, the data of the middle part (the complete overlapping part) is the complete superposition process, so when the corresponding extrinsic information is calculated, the formula can be referred to, that is, the extrinsic information of the forward decoding is obtainedValuationWherein,backward decoding extrinsic informationValuationWherein,
(3) outputting external information
It should be noted that, generally, when calculating soft information, iterative decoding may be performed, and by setting the number of iterations, soft information output each time is used as extrinsic information of next soft decoding, and the process is repeated until the number of iterations is satisfied, and the soft decoding process is ended.
In the decoding process, the soft information of the forward and backward decoding can be fully utilized and correspondingly operated, so that the finally obtained soft information of each moment of the data frame is more reliable. Specifically, the extrinsic information generated by forward and backward decoding can be exchanged in the middle of the data frame, and finally, the soft information of the backward decoding in the first half of the data frame and the soft information of the forward decoding in the second half of the data frame can be taken; forward decoding decodes from the initial position of the data frame bit by bit backward until the data frame is finished to obtain soft information of each time of the forward decoding, backward decoding decodes from the tail end of the data frame bit by bit forward until the initial position of the data frame to obtain soft information of each time of the backward decoding, and the forward decoding soft information and the backward decoding soft information of each time are added to obtain final soft information of each time of the data frame.
The OvTDM system applied in this embodiment includes a transmitting end and a receiving end.
A schematic block diagram of a transmitting end of the OvTDM system is shown in fig. 5, and the specific processing steps are as follows:
(1) first, an envelope waveform h (t) for generating a transmission signal is designed.
(2) And (3) after the envelope waveform h (T) designed in the step (1) is subjected to specific time shift, forming the sending signal envelope waveform h (T-i multiplied by △ T) at other various moments.
(3) The symbol x to be transmittediMultiplying the envelope waveform h (T-i multiplied by △ T) generated in the step (2) at the corresponding moment to obtain a signal waveform x to be transmitted at each momentih(t-i×△T)。
(4) Carrying out x on each waveform to be transmitted formed in the step (3)ih (T-i x △ T) are superposed to form the waveform of the transmitted signal.
(5) The transmitted signal may be represented as:
the overlap multiplexing method follows the parallelogram rule, and the K-way multiplexing waveforms are arranged as shown in fig. 3.
The schematic block diagram of the receiving end of the OvTDM system is shown in fig. 6, where the transmitting end transmits a signal after coded modulation through an antenna, the signal is transmitted in a wireless channel, the receiving end performs matched filtering on the received signal, then samples and decodes the signal respectively, and finally determines to output a bit stream.
As shown in fig. 6, the receiving end processing procedure includes the following specific processing steps:
(1) firstly, a preprocessing unit carries out synchronization and channel estimation on a received signal, wherein the synchronization comprises carrier synchronization, frame synchronization, symbol time synchronization and the like.
(2) The preprocessing unit digitizes the received signal within each frame according to the sampling theorem.
(3) The received signal preprocessed by the preprocessing unit is input to the sequence detection unit. The received waveform is sliced at waveform transmission time intervals by the analysis unit memory and the comparator of the sequence detection unit.
(4) And decoding the cut waveform by a memory (including reserved path memories 1-n and European example memories 1-n) of the sequence detection unit according to a certain decoding algorithm to obtain decision output.
The decoding process of MAP, LOG-MAP, etc. is based on graph decoding, and refer to fig. 7, fig. 7 is a node state transition diagram of the overlapping time division system (K is 3), fig. 8 is a decoding process of the overlapping time division system, fig. 8 is an input-output relationship diagram of the overlapping time division system, and fig. 9 is a Trellis diagram of the overlapping time division system.
It should be noted that, according to different OvXDM system structures, some adjustments need to be correspondingly made when calculating soft information, and some special processing is correspondingly included. If an interleaving module exists, de-interleaving operation is required; if there is amplitude modulation, the corresponding soft information calculation formula needs to be re-derived, but the process of soft decoding is not changed.
The soft decoding method is suitable for an OvXDM system, a decoding process is divided into a backward decoding process and a forward decoding process, and soft information of the two decoding processes is fully utilized, so that the decoding calculated amount and complexity of the soft decoding method are related to the length of a data frame, the soft decoding method is non-exponential with the overlapping multiplexing times, the method is not influenced by state numbers, the complexity and the storage capacity of system realization are reduced, and the problems that when the overlapping multiplexing times K of the traditional OvXDM soft decoding method, such as MAP, Log-MAP and other decoding methods are large, the calculated amount and the complexity are increased exponentially, large storage capacity is needed, and engineering is difficult to realize are solved.
The decoding method provided by the application can be applied to an actual mobile communication system, can also be widely applied to any wireless communication systems such as satellite communication, microwave line-of-sight communication, scattering communication, atmospheric optical communication, infrared communication, aquatic communication and the like, and can be applied to large-capacity wireless transmission and small-capacity light-weight radio systems.
It should be noted that, although the flow charts in the figures show a logical order, in some cases, the steps shown or described may be performed in an order different than that shown or described herein.
Embodiments of a storage medium are also provided. The storage medium comprises a stored program, wherein when the program runs, the device where the storage medium is located is controlled to execute the decoding method provided by the embodiment of the invention.
Embodiments of a processor are also provided. The processor is used for running a program, wherein the program executes the decoding method provided by the embodiment of the invention when running.
The application also provides an embodiment of a decoding device.
Fig. 10 is a schematic diagram of an alternative decoding apparatus according to an embodiment of the present invention, and as shown in fig. 10, the apparatus includes an obtaining unit 10, a forward decoding unit 20, a backward decoding unit 30, and a determining unit 40.
The device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a receiving sequence, and the receiving sequence comprises a non-overlapping part and an overlapping part, wherein the non-overlapping part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence; a decoding unit for performing forward decoding backward bit by bit from a start position of a received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; a determining unit for determining soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the received sequence.
The embodiment is implemented by an obtaining unit, configured to obtain a receiving sequence, where the receiving sequence includes a non-overlapping portion and an overlapping portion, where the non-overlapping portion of the receiving sequence includes a start position and a terminal position of the receiving sequence; a decoding unit for performing forward decoding backward bit by bit from a start position of a received sequence and performing backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing forward decoding or backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits; the determining unit is used for determining the soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the received sequence, so that the technical problem that the decoding complexity is higher due to the fact that the decoding method and the overlapping multiplexing times are in an exponential relation in the related technology is solved, and the technical effect of reducing the complexity of the decoding method and the correlation of the overlapping multiplexing times is achieved.
Further, the decoding unit performing forward decoding bit by bit backward from the start position of the received sequence includes: determining a forward decoding relation of the received sequence, wherein the forward decoding relation is ri=f(r0,……,ri-1) Bit r for representing a received sequenceiAnd bit r0To ri-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; forward decoding is performed bit by bit backward from a start position of the received sequence according to a forward decoding relationship.
Further, the decoding unit performing backward decoding bit by bit forward from the terminal position of the received sequence includes: determining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r for representing a received sequenceiAnd bit ri+1To rN-1I is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence; backward decoding is performed bit by bit forward from the terminal position of the received sequence according to a backward decoding relationship.
Further, the determination unit includes: a first determining module for determining a bit r in the received sequenceiForward decoding soft information Lext_fw(i) Wherein i is more than or equal to 0 and less than or equal to L-1, and L is the length of the receiving sequence; a second determining module for determining a bit r in the received sequenceiBackward decoding ofSoft information Lext_bw(i) (ii) a A calculation module for converting the bit riBackward decoding soft information Lext_fw(i) And forward decoding soft information Lext_bw(i) Add to obtain bit riSoft information of
Wherein L isaprior(i) Is a prior log-likelihood ratio, Laprior(i) According to the pair bit riAnd determining the current iteration number of decoding.
The above-mentioned apparatus may comprise a processor and a memory, and the above-mentioned units may be stored in the memory as program units, and the processor executes the above-mentioned program units stored in the memory to implement the corresponding functions.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
The order of the embodiments of the present application described above does not represent the merits of the embodiments.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments. In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways.
The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.

Claims (10)

1. A decoding method, applied to a receiving end of an overlay multiplexing system, the method comprising:
obtaining a receiving sequence, wherein the receiving sequence comprises a single-symbol part and an overlapping part, and the single-symbol part of the receiving sequence comprises a starting position and a terminal position of the receiving sequence;
performing forward decoding backward bit by bit from a start position of the received sequence and backward decoding forward bit by bit from a terminal position of the received sequence, wherein when performing the forward decoding or the backward decoding on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits;
determining soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapped part of the receiving sequence.
2. The method of claim 1, wherein performing forward decoding bit by bit backward from a start position of the received sequence comprises:
determining a forward coding relationship for the received sequence, wherein the forward coding relationship is ri=f(r0,……,ri-1) Bit r representing the received sequenceiAnd bit r0To ri-1Wherein i is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence;
and carrying out forward decoding bit by bit backward from the starting position of the received sequence according to the forward decoding relation.
3. The method of claim 1, wherein performing backward decoding bit by bit forward from a terminal position of the received sequence comprises:
determining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r representing the received sequenceiAnd bit ri+1To rN-1Wherein i is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence;
and carrying out backward decoding from the terminal position of the received sequence to the front bit by bit according to the backward decoding relation.
4. The method of any of claims 1-3, wherein determining soft information for each bit based on forward and backward decoded soft information for each bit of the overlapping portion of the received sequence comprises:
determining a bit r in the received sequenceiForward decoding soft information Lext_fw(i) Wherein i is more than or equal to 0 and less than or equal to L-1, and L is the length of the receiving sequence;
determining a bit r in the received sequenceiBackward decoding soft information Lext_bw(i);
Will bit riBackward decoding soft information Lext_fw(i) And forward decoding soft information Lext_bw(i) Add to obtain bit riSoft information of
Wherein L isapp(i) For a posterior log-likelihood ratio, Laprior(i) Is a prior log-likelihood ratio, Laprior(i) According to the pair bit riAnd determining the current iteration number of decoding.
5. A decoding apparatus, applied to a receiving end of an overlay multiplexing system, the apparatus comprising:
an obtaining unit, configured to obtain a received sequence, where the received sequence includes a single-symbol portion and an overlapping portion, and the single-symbol portion of the received sequence includes a start position and a terminal position of the received sequence;
a decoding unit configured to perform forward decoding backward bit by bit from a start position of the received sequence and perform backward decoding forward bit by bit from a terminal position of the received sequence, wherein when the forward decoding or the backward decoding is performed on bits of an overlapping portion of the received sequence, forward decoding soft information or backward decoding soft information of bits to be decoded is determined according to decoding information of already decoded bits;
a determining unit, configured to determine soft information of each bit according to the forward decoding soft information and the backward decoding soft information of each bit of the overlapping portion of the received sequence.
6. The apparatus of claim 5, wherein the decoding unit performs forward decoding bit by bit backward from a start position of the received sequence comprises:
determining a forward coding relationship for the received sequence, wherein the forward coding relationship is ri=f(r0,……,ri-1) Bit r representing the received sequenceiAnd bit r0To ri-1Wherein i is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence;
and carrying out forward decoding bit by bit backward from the starting position of the received sequence according to the forward decoding relation.
7. The apparatus of claim 5, wherein the decoding unit performs backward decoding bit by bit forward from a terminal position of the received sequence comprises:
determining a backward decoding relation of the received sequence, wherein the backward decoding relation is ri=g(ri+1,……,rN-1) Bit r representing the received sequenceiAnd bit ri+1To rN-1Wherein i is more than or equal to 0 and less than or equal to N-1, and N is the length of the receiving sequence;
and carrying out backward decoding from the terminal position of the received sequence to the front bit by bit according to the backward decoding relation.
8. The apparatus according to any one of claims 5 to 7, wherein the determining unit comprises:
a first determining module for determining a bit r in said received sequenceiForward decoding soft information Lext_fw(i) Wherein i is more than or equal to 0 and less than or equal to L-1, and L is the length of the receiving sequence;
a second determining module for determining a bit r in said received sequenceiBackward decoding soft information Lext_bw(i);
A calculation module for converting the bit riBackward decoding soft information Lext_fw(i) And forward decoding soft information Lext_bw(i) Add to obtain bit riSoft information of
Wherein L isapp(i) For a posterior log-likelihood ratio, Laprior(i) Is a prior log-likelihood ratio, Laprior(i) According to the pair bit riAnd determining the current iteration number of decoding.
9. A storage medium, characterized in that the storage medium comprises a stored program, wherein when the program runs, a device in which the storage medium is located is controlled to execute the decoding method according to any one of claims 1 to 4.
10. A processor, characterized in that the processor is configured to run a program, wherein the program is configured to execute the decoding method according to any one of claims 1 to 4 when running.
CN201710976986.XA 2017-10-18 2017-10-18 Decoding method and device Expired - Fee Related CN109687935B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710976986.XA CN109687935B (en) 2017-10-18 2017-10-18 Decoding method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710976986.XA CN109687935B (en) 2017-10-18 2017-10-18 Decoding method and device

Publications (2)

Publication Number Publication Date
CN109687935A true CN109687935A (en) 2019-04-26
CN109687935B CN109687935B (en) 2022-09-13

Family

ID=66183517

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710976986.XA Expired - Fee Related CN109687935B (en) 2017-10-18 2017-10-18 Decoding method and device

Country Status (1)

Country Link
CN (1) CN109687935B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040161059A1 (en) * 2002-11-28 2004-08-19 Kabushiki Kaisha Toshiba Signal estimation methods and apparatus
CN101411071A (en) * 2006-01-27 2009-04-15 高通股份有限公司 MAP decoder with bidirectional sliding window architecture
CN101510813A (en) * 2008-02-15 2009-08-19 中国移动通信集团公司 Method for transmitting and processing data of communication system, communication system and communication equipment
CN101557364A (en) * 2009-05-12 2009-10-14 山东大学 Joint-iterative channel estimation and decoding method of Turbo-OvCDM system
CN103688502A (en) * 2013-07-01 2014-03-26 华为技术有限公司 Method for achieving Turbo isostatic compensation, Turbo equalizer, and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040161059A1 (en) * 2002-11-28 2004-08-19 Kabushiki Kaisha Toshiba Signal estimation methods and apparatus
CN101411071A (en) * 2006-01-27 2009-04-15 高通股份有限公司 MAP decoder with bidirectional sliding window architecture
CN101510813A (en) * 2008-02-15 2009-08-19 中国移动通信集团公司 Method for transmitting and processing data of communication system, communication system and communication equipment
CN101557364A (en) * 2009-05-12 2009-10-14 山东大学 Joint-iterative channel estimation and decoding method of Turbo-OvCDM system
CN103688502A (en) * 2013-07-01 2014-03-26 华为技术有限公司 Method for achieving Turbo isostatic compensation, Turbo equalizer, and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
SEOKHYUN YOON等: "A Parallel MAP Algorithm for Low Latency Turbo Decoding", 《IEEE COMMUNICATIONS LETTERS》 *
张曦林等: "一种高速率的重叠复用传输系统及检测译码性能", 《电子与信息学报》 *

Also Published As

Publication number Publication date
CN109687935B (en) 2022-09-13

Similar Documents

Publication Publication Date Title
CN100355201C (en) Reduced soft output information packet selection
CN101425871B (en) Multi-element error correcting code transmitting and receiving apparatus, data communication system and related method
CN107919941B (en) Modulation-demodulation method and device based on overlapping multiplexing
EP1236282A1 (en) Reduced search symbol estimation algorithm
CN100527657C (en) Iterative decoding with likelihood weighting
US20060136799A1 (en) LDPC decoding apparatus and method with low computational complexity algorithm
US11082147B2 (en) Processing method, device and system for overlap multiplexing system
JP2004343702A (en) MIMO telecommunications system, transmission symbol decoding method and transmission symbol decoding apparatus in this system
EP4176573B1 (en) A communication unit for soft-decision demodulation and method therefor
US6324224B1 (en) Apparatus and method for receiving data with bit insertion
CN102273116B (en) Systematic and parity bit soft estimation method and apparatus
CN108667561B (en) Signal processing method, signal processing device, storage medium and processor
CN112202534A (en) A high-speed transmission method based on LDPC and FQPSK joint coding and modulation
CN115694518A (en) Convolutional code decoding method and system based on GMM-HMM
JP3728171B2 (en) Reliability information calculation method
US6134696A (en) Encoding and decoding rate-1/n convolutional codes and their punctured versions
CN109687935B (en) Decoding method and device
JP6889468B2 (en) Communication system for sensor devices that can share communication resources at the same time
CN107968695B (en) Processing method, device and system of overlapping multiplexing system
CN109245846B (en) Ladder code decoding method and ladder code decoding device
CN107968697B (en) Decoding method and device for overlapping multiplexing system
US20090110125A1 (en) Maximum a posteriori probability decoder
CN107872295B (en) Soft value extraction method and device suitable for OvXDM system and OvXDM system
CN107645360B (en) OvXDM system decoding method and device and OvXDM system
JP2007529974A (en) Local erasure MAP decoder

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20190828

Address after: 518057 2nd Floor, No. 9 Software Building, Zhongxin Road, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province

Applicant after: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd.

Address before: Bantian street Longgang District of Shenzhen City, Guangdong province 518000 Jihua Road, the new world Huasai Industrial Area No. 2, building 101 (two floor) 201

Applicant before: SHENZHEN SUPER DATA LINK TECHNOLOGY Ltd.

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20220825

Address after: Group 132, East Committee of Dongping Road, Rongguang Street, Erdao District, Changchun City, Jilin Province 130000

Applicant after: Lv Wenming

Address before: 518057 2nd floor, software building, No.9, Gaoxin middle 1st Road, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province

Applicant before: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd.

GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20220913