WO2009102012A1 - 復号化装置、復号化方法、復号化プログラム、受信装置、及び通信システム - Google Patents
復号化装置、復号化方法、復号化プログラム、受信装置、及び通信システム Download PDFInfo
- Publication number
- WO2009102012A1 WO2009102012A1 PCT/JP2009/052400 JP2009052400W WO2009102012A1 WO 2009102012 A1 WO2009102012 A1 WO 2009102012A1 JP 2009052400 W JP2009052400 W JP 2009052400W WO 2009102012 A1 WO2009102012 A1 WO 2009102012A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- decoding
- mutual information
- information amount
- information
- unit
- Prior art date
Links
Images
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/2975—Judging correct decoding, e.g. iteration stopping criteria
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/45—Soft decoding, i.e. using symbol reliability information
-
- 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/63—Joint error correction and other techniques
- H03M13/6337—Error control coding in combination with channel estimation
-
- 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/65—Purpose and implementation aspects
- H03M13/6502—Reduction of hardware complexity or efficient processing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
- H04L1/0051—Stopping criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
- H04L1/0053—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables specially adapted for power saving
Definitions
- the present invention relates to a decoding device, a decoding method, a decoding program, a receiving device, and a communication system.
- an error correction code that corrects a bit error in advance in the transmission device is used for the influence of distortion caused by a propagation path or disturbance due to noise in the reception device.
- a powerful error correction code with this error correction capability is a turbo code discovered in 1993, and is currently being introduced into various wireless communication systems as a code that achieves near the theoretical limit in communication systems.
- the turbo code has two identical code units in parallel on the transmission side, and can generate code bits having two independent constraint conditions by rearranging their input information via an interleaver.
- Patent Document 1 proposes a method for controlling repetition based on whether the decoded information is positive or negative in order to reduce the power consumption of the receiving apparatus. JP 2000-183758 A
- the decoding process there is a case where an error does not disappear even if the information decoding process is repeated many times (hereinafter referred to as a stack state).
- the method of controlling the iteration of the decoding process depending on whether the decoded information is positive or negative is to detect an error in the decoded information in the middle of the iteration and repeat until the error disappears. Therefore, when the receiving apparatus having the first decoding method becomes stuck, it becomes an error no matter how many times the decoding process is repeated, and the decoding process is repeated even though the information cannot be decoded. There is a drawback.
- the present invention has been made in view of the above points, and provides a decoding device, a decoding method, a decoding program, a receiving device, and a communication system that do not repeat useless decoding processing.
- the present invention has been made to solve the above-described problem, and one aspect thereof is a decoding apparatus that decodes error-correction encoded information by repeating decoding processing.
- a repetitive number determination unit configured to calculate a mutual information amount indicating a relationship between the encoded information and transmission information, and to determine a repetition number of the decoding process based on the calculated mutual information amount; According to the above configuration, the decoding apparatus determines the number of times to repeat the decoding process based on the mutual information amount, and thus does not repeat the useless decoding process.
- One aspect of the present invention further includes a storage unit that stores a relationship between the mutual information amount and the number of iterations, and the iteration number determination unit is configured to calculate the mutual information amount and the iteration number stored in the storage unit. From the relationship, the number of iterations corresponding to the calculated mutual information amount is specified, and the number of iterations is set as the number of iterations of the decoding process.
- the iteration number determination unit determines not to perform a decoding process when the calculated mutual information amount is smaller than a predetermined threshold value. According to the above configuration, the decoding apparatus does not repeat the useless decoding process because it is an error when it is determined that the mutual information amount is smaller than a predetermined threshold value and is in a stack state.
- the threshold value is a mutual information amount that does not result in a mutual information amount of 1 even after a predetermined number of iterations of decoding processing.
- the error correction coding is turbo coding.
- a mutual information amount indicating a relationship between the encoded information and transmission information And determining the number of iterations of the decoding process based on the calculated mutual information amount.
- a decoding apparatus that decodes error-correction-encoded information by repeating decoding processing is used to indicate a relationship between the encoded information and transmission information.
- the amount of information is calculated, and the number of iterations of the decoding process is determined based on the calculated amount of mutual information.
- a receiving device including a decoding device that decodes error correction encoded information included in a received signal by repeating decoding processing.
- a repetitive number determining unit that calculates a mutual information amount indicating a relationship with the transmission information of the first decoding information and determines the number of repetitions of the decoding process based on the calculated mutual information amount.
- a transmission apparatus and a reception apparatus including a decoding apparatus that decodes error correction encoded information included in a signal transmitted from the transmission apparatus by repeating decoding processing A mutual information amount indicating a relationship between the encoded information and transmission information, and determining the number of iterations for determining the number of iterations of the decoding process based on the calculated mutual information amount A part.
- the decoding apparatus since the decoding apparatus determines the number of times to repeat the decoding process based on the mutual information amount, it does not repeat the useless decoding process.
- the communication system includes a transmission device and a reception device.
- the receiving device of the communication system receives a transmission signal including information error-encoded by the transmitting device, and decodes the information by repeating the decoding process.
- the error correction code is a turbo code
- the coding rate of the turbo code is 1 ⁇ 2.
- FIG. 1 is a schematic block diagram illustrating a configuration of a transmission apparatus.
- the transmission device includes a coding device 1, a wireless transmission unit 2, and a transmission antenna 3.
- the encoding device 1 includes an interleaver 11, a first RSC (Recursive Systematic Convolutional) encoding unit 12, a second RSC encoding unit 13, and a puncturing unit 14.
- RSC Recursive Systematic Convolutional
- the input information input to the encoding device 1 is input to the interleaver 11 and the first RSC encoding unit 12 in units of bits.
- information in bit units is referred to as information bits.
- the first RSC encoder 12 generates systematic bits and parity bits 1 from the input information bits.
- the first RSC encoder 12 outputs the generated systematic bit as code bit 1 to the wireless transmitter 2.
- the first RSC encoding unit 12 outputs the generated parity bit 1 to the puncturing unit 14. Details of the configuration of the first RSC encoder 12 will be described later.
- the interleaver 11 creates information bits obtained by rearranging the input information bits and outputs the information bits to the second RSC encoder 13.
- the second RSC encoding unit 13 generates systematic bits and parity bits 2 from the information bits input from the interleaver 11.
- the second RSC encoding unit 13 outputs the generated parity bit 2 to the puncturing unit 14.
- the second RSC encoding unit 13 does not output the generated systematic bit and does not transmit it to the receiving device.
- the puncturing unit 14 thins out the parity bit 1 input from the first RSC encoding unit 12 and the parity bit 2 input from the second RSC encoding unit 13 according to the coding rate. In this embodiment, since the coding rate is 1 ⁇ 2, the puncturing unit 14 generates code bit 2 corresponding to code bit 1. Specifically, the puncturing unit 14 alternately thins out the parity bit 1 input from the first RSC encoding unit 12 and the parity bit 2 input from the second RSC encoding unit 13. A sign bit 2 is generated and output to the wireless transmission unit 2.
- the wireless transmission unit 2 transmits information bits (hereinafter referred to as transmission bits) input from the encoding device 1 to the reception device. Specifically, the wireless transmission unit 2 converts the code bit 1 and the code bit 2 input from the puncturing unit 14 into an analog signal by digital / analog conversion, respectively, and transmits the transmission signal 1 and the transmission signal 2. Are up-converted to a radio frequency signal and transmitted to the receiving device via the transmitting antenna 3.
- transmission bits information bits
- FIG. 2 is a schematic block diagram showing the configuration of the first RSC encoder 12.
- the first RSC encoder 12 shown in FIG. 2 generates an RSC code having a constraint length of 4.
- the RSC encoding unit 12 includes adders (121-1 to 121-3) that calculate exclusive ORs and shift registers (122-1 to 122-3).
- the first RSC encoding unit 12 generates a systematic bit and a parity bit 1 from the input information bits according to the operation of the circuit every clock, and outputs them to the radio transmission unit 2 and the puncturing unit 14, respectively.
- systematic bits correspond to information bits
- parity bits are bits generated by performing convolution by exclusive OR of a plurality of information bits in order to perform error correction of information bits.
- the second RSC encoding unit 13 has the same function as the first RSC encoding unit 12.
- the second RSC encoding unit 13 generates systematic bits and parity bits 2 from the information bits input from the interleaver 11 and outputs only the generated parity bits 2 to the puncturing unit 14.
- FIG. 1 and FIG. 2 show a transmission apparatus using a known turbo encoding and its first RSC encoding unit, respectively.
- FIG. 3 is a schematic block diagram showing the configuration of the receiving apparatus according to this embodiment.
- the receiving device includes a receiving antenna 4, a wireless receiving unit 5, and a decoding device 6.
- the decoding device 6 includes an LLR (Log Likelihood Ratio) calculation unit 60, an iteration count determination unit 61, a storage unit 62, a first interleaver 63, a depuncturing unit 64, and a first MAP estimation unit. 65, a deinterleaver 66, a second interleaver 67, a second MAP estimation unit 68, an iterative control unit 69, a first adder 601-1 and a second adder 601-2.
- LLR Log Likelihood Ratio
- the reception antenna 4 receives a signal transmitted from the transmission device and outputs the signal to the wireless reception unit 5.
- the wireless reception unit 5 down-converts a reception signal input from the reception antenna 4 from a radio frequency signal to a baseband signal, and then decodes reception information converted into a digital signal by analog / digital conversion in bit units. To the converter 6.
- reception information bits the reception information in bit units is referred to as reception information bits.
- reception information bit 1 transmitted by the transmission apparatus is referred to as reception information bit 1
- reception information bit corresponding to the transmission signal 2 is referred to as reception information bit 2.
- the LLR calculation unit 60 of the decoding device 6 measures the variance of the reception information bit 1 and the variance of the reception information bit 2 from the reception information bits input from the radio reception unit 5, and calculates the log likelihood ratio, respectively. To do.
- a specific calculation method performed by the LLR calculation unit will be described.
- the definition of the log likelihood ratio is expressed by equation (1).
- Equation (1) l (k) represents the log likelihood ratio of the kth bit, x (k) represents the kth transmission bit (0 or 1), and y represents a vector in which measured reception information bits are arranged. ing. Further, in the expression (1), p (y
- x (k) 1) and p (y
- x (k) 0) indicate that the bit value of the transmission bit x (k) is 1 and 0, respectively. Represents the probability density function of the bit value of the vector y. In Equation (1), assuming that the probability density function is a Gaussian distribution, the log likelihood ratio is Equation (2).
- Equation (2) is a case where the modulation scheme is BPSK (Binary Phase Shift Keying), but the present invention is not limited to this, and other modulation schemes may be used. Calculation formulas for other modulation schemes will be described later.
- BPSK Binary Phase Shift Keying
- the LLR calculation unit 60 measures the variance ⁇ 2 of the received information bits and calculates the log likelihood ratio using Equation (2).
- the LLR calculation unit 60 outputs the calculated log likelihood ratio to the iteration number determination unit 61.
- the LLR calculation unit 60 calculates a log likelihood ratio (hereinafter referred to as LLR1) calculated from the reception information bit 1 and a log likelihood ratio (hereinafter referred to as LLR2) calculated from the reception information bit 2, respectively.
- LLR1 log likelihood ratio
- LLR2 log likelihood ratio
- the iteration number determination unit 61 calculates a mutual information amount indicating a relationship with the transmission information based on the log likelihood ratio input from the LLR calculation unit 60, and determines the iteration number of the decoding process based on the mutual information amount.
- FIG. 4 is an explanatory diagram showing the relationship between the number of iterations and the input / output characteristics of the mutual information.
- the vertical axis in FIG. 4 is the mutual information amount input to the decoding process (hereinafter referred to as input mutual information amount), and the horizontal axis is the mutual information amount output from the decoding process (hereinafter referred to as output mutual information amount).
- input mutual information amount the mutual information amount input to the decoding process
- output mutual information amount the mutual information amount output from the decoding process
- the mutual information amount is obtained by quantifying the information amount obtained with respect to transmission information when reception information is obtained in information theory.
- the mutual information amount is 0, information on transmission information is obtained from reception information. Is not obtained at all, and when the mutual information amount is 1, it means that information on transmission information is completely obtained from received information.
- FIG. 4 shows that the input mutual information amount with which the output mutual information amount becomes 1 decreases as the number of iterations of the decoding process increases, and the error correction capability increases as the number of iterations increases.
- the output mutual information amount is 1 when the decoding process is repeated twice, but when the input mutual information is 0.65 or more, the output mutual information amount is 1 when the decoding process is repeated eight times. It becomes when the input mutual information is 0.55 or more.
- the decoding apparatus 6 can grasp the input / output relationship of the mutual information amount before decoding, and the number of iterations and the presence or absence of the decoding process Can be determined.
- the storage unit 62 of the encoding device 6 stores the relationship between the number of iterations and the mutual information amount as shown in Table 1.
- the value of the input mutual information amount is a value when the output mutual information amount becomes 1 for each iteration of the decoding process in FIG.
- the output mutual information amount is 1 when the input mutual information amount is 0.575 or more and the decoding processing iteration number is two.
- the output mutual information amount is 1 when the input mutual information amount is 0.65 or more. Therefore, Table 1 shows that when the input mutual information value is 0.575 to 0.65, an output mutual information value of 1 can be obtained by repeating the decoding process at least four times. ing.
- the upper limit of the number of iterations of the decoding process determined by the iteration number determination unit 61 is determined in advance, and the upper limit of the input mutual information whose output mutual information amount does not become 1 even when the decoding process of the determined number of iterations is performed is a threshold value.
- the maximum number of decoding processing iterations is eight.
- the output mutual information amount does not become 1 when the number is 0.55 or less
- the upper limit threshold is 0.55.
- the iteration number determination unit 61 determines that the number of iterations is 0, that is, does not perform a decoding process on received information.
- the iteration number determination unit 61 calculates the mutual information amount from the log likelihood ratio calculated by the LLR calculation unit 60 using Expression (3).
- I is the mutual information values represented by a real number between 0 and 1
- K B is the number of transmission bits to be transmitted in one transmission opportunity (a natural number).
- l k is the log-likelihood ratio of the k-th transmission bit, calculated by the LLR calculation unit 60, and input to the iteration number determination unit 61.
- the mutual information amount I related to transmission information when receiving information is obtained is defined by Equation (4) using a log likelihood ratio.
- Equation (4) l is a log likelihood ratio of a real number
- x is transmission information of a real number.
- the log likelihood ratio follows a Gaussian distribution, and therefore Equation (4) becomes Equation (5).
- Equation (6) E [x] is an operator that calculates the expected value of x.
- the average value and variance of the log likelihood ratio are 1: 2.
- p (x + 1
- l) is (1 + exp ( ⁇ l)) ⁇ 1 in consideration of following a Gaussian distribution.
- equation (6) becomes equation (3).
- the iteration number determination unit 61 identifies the iteration number corresponding to the calculated mutual information amount I from the relationship between the mutual information amount and the iteration number stored in the storage unit 62 (Table 1), and decodes the iteration number. Is determined as the number of iterations. For example, when the calculated mutual information value is 0.7, the iteration number determination unit 61 sets the number of iterations to 2 because the input mutual information value in Table 1 is 0.65 to 0.75. If the calculated mutual information value is 0.6, the input mutual information value in Table 1 is 0.575 to 0.65, so the number of iterations is determined to be 4.
- the iteration number determination unit 61 determines that an error has occurred and that the received information is not decoded. Specifically, when the calculated mutual information amount is 0.5, the iteration number determination unit 61 determines the iteration number as 0 because the value of the input mutual information amount in Table 1 is ⁇ 0.55. The received information is not decoded, and it is considered an error.
- the iteration number determination unit 61 outputs the determined iteration number to the iteration control unit 69. In addition, the iteration number determination unit 61 outputs the LLR 1 input from the LLR calculation unit 60 to the first interleaver 63 and the first MAP estimation unit 65, and outputs LLR 2 to the depuncturing unit 64.
- the interleaver 63 rearranges the LLR 1 input from the iteration number determination unit 61 in the same manner as the interleaver 11 in FIG. 1 and outputs the result to the second MAP estimation unit 68.
- the depuncturing unit 64 applies the log likelihood ratio corresponding to the parity bit 1 to the first MAP estimation unit 65 for the LLR 2 input from the iteration number determination unit 61, and the log likelihood corresponding to the parity bit 2.
- the ratio is output to the second MAP estimation unit 68.
- the depuncturing unit 64 alternately outputs the log likelihood ratio corresponding to the code bit 2 to the first MAP estimation unit 65 and the second MAP estimation unit 68.
- the depuncturing unit 64 adds 0 which is a dummy bit to the MAP estimation unit 65 that does not output the log likelihood ratio corresponding to the code bit 2 or the second MAP estimation unit 68.
- the first MAP estimator 65 receives the LLR1 input from the iteration count determination unit 61, the log likelihood ratio corresponding to the parity bit 1 input from the depuncturing unit 64, and the advance input from the deinterleaver 66. Based on the information, a maximum a posteriori probability (MAP) is estimated and error correction is performed.
- MAP maximum a posteriori probability
- the prior information input from the deinterleaver 66 is the reliability of the information bits obtained from the second MAP estimation unit 68, and the reliability is not obtained the first time, and thus becomes 0.
- the first MAP estimation unit 65 outputs the log likelihood ratio subjected to the error correction to the first adder 601-1.
- the first adder 601-1 subtracts the prior information input from the deinterleaver 66 from the log likelihood ratio input from the first MAP estimation unit 65, and the logarithm by the first MAP estimation unit 65
- the change in likelihood ratio is output to second interleaver 67.
- the second interleaver 67 rearranges the log likelihood ratio input from the first adder 601-1 in the same way as the interleaver 11 in FIG. 1, and outputs the result to the second MAP estimation unit 68. To do.
- the second MAP estimation unit 68 includes the rearranged LLR1 input from the first interleaver 63, the log likelihood ratio corresponding to the parity bit 2 input from the depuncturing unit 64, and the second interleaver.
- the maximum a posteriori probability (MAP) is estimated based on the prior information input from 67, and error correction is performed.
- the second MAP estimation unit 68 outputs the log likelihood ratio subjected to the error correction to the iterative control unit 69.
- the iterative control unit 69 When the log likelihood ratio is input from the MAP estimation unit 67, the iterative control unit 69 counts the number of error correction processes and increases the number by one. The iterative control unit 69 repeats the error correction process until the number of error correction processes reaches the number of iterations input from the iteration number determining unit 61. When the number of error correction processes counted reaches the number of iterations input from the iteration count determining unit 61, the iteration control unit 69 outputs the decoded information and completes the decoding.
- the iteration control unit 69 sets the log likelihood ratio input from the second MAP estimation unit 68 to the second To the adder 601-2.
- the second adder 601-2 subtracts the prior information input from the second interleaver 67 from the log likelihood ratio input from the iterative control unit 69, and the log likelihood generated by the second MAP estimation unit 68.
- the change in the degree ratio is output to the deinterleaver 66.
- the deinterleaver 66 rearranges the log likelihood ratio corresponding to the sign bit 2 input from the second adder 601-2 in the reverse order to the interleaver 11, that is, information obtained by the interleaver 11 rearranging. Are rearranged to return to the original rearrangement and output to the first MAP estimation unit 65.
- FIG. 5 is a flowchart showing the operation of the receiving apparatus in this embodiment.
- the information bits input to the encoding device 1 are input to the interleaver 11 and the first RSC encoder 12.
- the first RSC encoder 12 generates systematic bits and parity bits 1 from the input information bits.
- the first RSC encoding unit 12 outputs the generated systematic bit as the code bit 1 to the wireless transmission unit 2 (S101). Also, the first RSC encoder 12 outputs the generated parity bit 1 to the puncturing unit 14 (S102).
- the interleaver 11 creates information bits obtained by rearranging the input information bits and outputs the information bits to the second RSC encoder 13 (S103).
- the second RSC encoding unit 13 generates systematic bits and parity bits 2 from the information bits input from the interleaver 11.
- the second RSC encoding unit 13 outputs the generated parity bit 2 to the puncturing unit 14 (S104).
- the puncturing unit 14 generates a code bit 2 from the parity bit 1 input from the first RSC encoding unit 12 and the parity bit 2 input from the second RSC encoding unit 13 and outputs the code bit 2 to the wireless transmission unit 2 (S105).
- the radio transmission unit 2 up-converts the code bit 1 input from the first RSC encoding unit 12 and the code bit 2 input from the puncturing unit 14 to a radio frequency, and receives the reception device via the transmission antenna 3. (S106).
- FIG. 6 is a flowchart showing the operation of the transmission apparatus according to this embodiment.
- the radio reception unit 5 down-converts the reception signal input from the reception antenna 4 from the radio frequency and outputs the received signal as reception information bits to the decoding device 6 (S201).
- the LLR calculation unit 60 measures the variance of the information based on the reception information bits input from the radio reception unit 5, and calculates a log likelihood ratio (S202).
- the iteration number determination unit 61 calculates the mutual information amount from the log likelihood ratio input from the LLR calculation unit 60, and determines the iteration number of the decoding process based on the mutual information amount (S203).
- the first MAP estimation unit 65 is configured such that the first MAP estimation unit 65 is a log likelihood ratio corresponding to the sign bit 1 input from the iteration number determination unit 61 and a parity bit 1 input from the depuncturing unit 64.
- the maximum a posteriori probability (MAP) is estimated based on the log-likelihood ratio corresponding to and the prior information input from the deinterleaver 66, and error correction is performed (S204).
- the second MAP estimation unit 68 includes a log likelihood ratio corresponding to the sign bit 2 input from the first interleaver 63, a log likelihood ratio corresponding to the parity bit 2 input from the depuncturing unit 64, and Based on the prior information input from the second interleaver 67, the maximum posterior probability (MAP) is estimated and error correction is performed (S205).
- MAP maximum posterior probability
- the iterative control unit 69 counts the number of error correction processes (S206). The iteration control unit 69 determines whether or not the counted number of error correction processes has reached the number of iterations determined by the iteration number determination unit 61 (S207). When the number of error correction processes counted reaches the number of iterations determined by the iteration number determination unit 61, the iteration control unit 69 decodes the log likelihood ratio input from the second MAP estimation unit 68. Output the data and complete the decoding (S208).
- the iteration control unit 69 outputs the log likelihood ratio input from the second MAP estimation unit 68 when the counted number of error correction processes does not reach the number of iterations determined by the iteration number determination unit 61.
- the first MAP estimation unit 65 repeats the error correction process (S204).
- the decoding device 6 calculates the mutual information amount obtained by decoding the received information, and the calculated mutual information amount is 1, that is, transmitted from the received information.
- the number of iterations of the decoding process is determined so that the information regarding the information is completely obtained.
- the decoding device 6 can perform the number of times necessary to set the mutual information amount to 1, and can completely obtain information on the transmission information, and the processing amount and processing can be performed without reducing the reliability of the decoding processing.
- the delay can be reduced, that is, useless decoding processing is not repeated.
- the decoding device 6 does not have a mutual information amount of 1 obtained by decoding the received information, that is, the mutual information amount of the received information is smaller than a predetermined threshold value. If it is, it is considered an error and the decoding process is not performed. As a result, the decoding device 6 avoids the mutual information amount not being set to 1 due to the decoding process, and does not repeat the useless decoding process. Since the encoding apparatus 6 does not consume unnecessary power consumption by not repeating a useless decoding process, the power consumption can be reduced.
- Equation (2) assumes that the modulation method is BPSK, but the present invention is not limited to this.
- the modulation method may be QPSK (Quaternary Phase Shift Keying).
- Expression (2) becomes Expression (7).
- Equation (7) k ′ is an index of the received signal.
- the coding rate is 1 ⁇ 2 coding, but the present invention is not limited to this.
- the transmission apparatus does not include the puncturing unit 14 and transmits the code bit 1, the parity bit 1, and the parity bit 2 from the wireless transmission unit 2, thereby setting the coding rate to 1/3.
- the receiving device does not include the depuncturing unit 64.
- the encoding device 6 includes the LLR calculation unit 60.
- the wireless reception unit 5 may include the LLR calculation unit 60, for example.
- the log likelihood ratio is calculated when the equalization unit performs demodulation from the equalized signal. Then, it may be input to the iteration number determination unit.
- the equalization unit calculates a log likelihood ratio from a pilot signal used for channel estimation, and outputs the calculated log likelihood ratio to the iteration number determination unit.
- the iteration number determination unit determines the number of iterations of the decoding process from the log likelihood ratio input from the equalization unit.
- the wireless reception unit 5 may have other functions according to the transmission method.
- an OFDM (Orthogonal Frequency Division Multiplexing) transmission system has a function of removing a GI (Guard Interval) and a time frequency conversion function.
- GI Guard Interval
- an equalization function for compensating for distortion of the propagation path is provided.
- the error correction code is a turbo code, but the present invention is not limited to this, and may be another error correction code that performs decoding processing by iteration.
- the error correction code may be an LDPC (Low Density Parity Check) code, an RA (Repeat Accumulate) code, or a PA (Product Accumulate) code.
- the transmission apparatus transmits information encoded by a modulation scheme and coding rate determined in advance, and the reception apparatus mutually determines the relationship between the number of repetitions of the decoding process of the reception apparatus and the mutual information amount. The number of iterations of the decoding process in which the information amount is 1 has been determined.
- the receiving apparatus determines in advance the upper limit of the number of iterations of decoding processing, and the transmitting apparatus determines that the mutual information amount is within the number of iterations determined by the receiving apparatus from the relationship between the number of iterations of decoding processing of the receiving apparatus and the mutual information amount It is also possible to determine a modulation scheme and a decoding rate that become 1, and transmit information encoded by the determined modulation scheme and coding rate. For example, when the number of decoding processes of the receiving device is limited depending on whether or not there is real-time characteristics such as streaming, the transmitting device that distributes the streaming has a mutual information amount of 1 as the limited number of times. A signal decoded by such a modulation method and a decoding rate is transmitted. As a result, the receiving device that receives the streaming information distributed by the transmitting device can perform a decoding process so that the mutual information amount becomes 1 in the limited number of times.
- the function of each unit of the decoding device 6 or a program for realizing a part of these functions is recorded on a computer-readable recording medium of the decoding device or the receiving device, and this The decoding apparatus 6 may be controlled by causing a computer system to read and execute a program recorded on a recording medium.
- the “computer system” includes an OS and hardware such as peripheral devices.
- the “computer-readable recording medium” refers to a storage device such as a flexible medium, a magneto-optical disk, a portable medium such as a ROM or a CD-ROM, or a hard disk built in a computer system.
- the “computer-readable recording medium” dynamically holds a program for a short time, like a communication line when transmitting a program via a network such as the Internet or a communication line such as a telephone line.
- a server that holds a program for a certain time such as a volatile memory inside a computer system that serves as a server or client.
- the program may be a program for realizing a part of the functions described above, and may be a program capable of realizing the functions described above in combination with a program already recorded in a computer system.
- the present invention is suitable for use in a decoding device, a decoding method, a decoding program, a receiving device, a communication system, and similar techniques, and can perform decoding without repeating unnecessary decoding processing.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
本願は、2008年02月14日に、日本に出願された特願2008-033252号に基づき優先権を主張し、その内容をここに援用する。
このターボ復号処理は、復号処理を何度も反復することで実現される。特許文献1には、受信装置の低消費電力化のために、復号した情報が肯定的か否定的かで反復を制御する方法が提案されている。
よって、前期復号化方法を備える受信装置は、スタック状態になってしまうと、復号処理を何回反復しても誤りとなり、情報を復号できないにもかかわらず、無駄な復号処理を反復してしまうという欠点がある。
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する反復回数決定部を備える。
上記構成によると、復号化装置は、相互情報量に基づいて復号処理の反復回数を決定するので、無駄な復号処理を反復しない。
上記構成によると、復号化装置は、相互情報量が予め定めた閾値より小さい値であって、スタック状態になると判定する場合には、誤りとするので、無駄な復号処理を反復しない。
以下、図面を参照しながら本発明の実施形態について詳しく説明する。本実施形態において、通信システムは、送信装置と受信装置を備える。ここで、該通信システムの受信装置は、送信装置が誤り訂正符号化した情報を含む送信信号を受信し、該情報を、復号処理を反復することにより復号する。なお、本実施形態では、前記誤り訂正符号はターボ符号であり、該ターボ符号の符号化率は、1/2とする。
符号装置1は、インターリーバ11、第1のRSC(Recursive Systematic Convolutional:再帰組織的畳み込み)符号部12、第2のRSC符号部13、パンクチャリング部14を備える。
第1のRSC符号化部12は、前記入力された情報ビットから、組織ビットとパリティビット1とを生成する。第1のRSC符号化部12は、該生成した組織ビットを符号ビット1として無線送信部2に出力する。また、第1のRSC符号化部12は、前記生成したパリティビット1をパンクチャリング部14に出力する。第1のRSC符号化部12の構成の詳細については、後述する。
第2のRSC符号化部13は、インターリーバ11から入力された情報ビットから、組織ビットとパリティビット2を生成する。第2のRSC符号化部13は、前記生成したパリティビット2をパンクチャリング部14に出力する。なお、第2のRSC符号化部13は、該生成した組織ビットは出力せず、受信装置に送信しない。
図2に示す第1のRSC符号部12は、拘束長4のRSC符号を生成する。RSC符号部12は、排他的論理和を計算する加算器(121-1~121-3)とシフトレジスタ(122-1~122-3)とを備える。
前記第1のRSC符号部12は、入力された情報ビットから、1クロック毎に回路の動作に従って組織ビットとパリティビット1とを生成し、それぞれ、無線送信部2とパンクチャリング部14とに出力する。ここで、組織ビットは、情報ビットに対応し、パリティビットは、情報ビットの誤り訂正を行うために複数の情報ビットを排他的論理和による畳み込みを行って生成するビットである。
なお、第2のRSC符号部13も第1のRSC符号部12と同じ機能を有する。第2のRSC符号部13は、インターリーバ11から入力された情報ビットから、組織ビットとパリティビット2とを生成し、該生成したパリティビット2のみパンクチャリング部14に出力する。なお、図1と図2とは、それぞれ、公知のターボ符号化を用いる送信装置とその第1のRSC符号部とを示すものである。
復号化装置6は、LLR(Log Likelihood Ratio:対数尤度比)計算部60、反復回数決定部61、記憶部62、第1のインターリーバ63、デパンクチャリング部64、第1のMAP推定部65、デインターリーバ66、第2のインターリーバ67、第2のMAP推定部68、反復制御部69、第1の加算器601-1、第2の加算器601-2を備える。
以下、LLR計算部が行う具体的な計算方法を説明する。対数尤度比の定義は式(1)で表される。
式(1)において、確率密度関数がガウス分布であると仮定すると、対数尤度比は式(2)になる。
なお、相互情報量とは、情報理論において受信情報を得たときに送信情報に関して得られる情報量を数値化したものであり、相互情報量が0の場合には、受信情報から送信情報に関する情報を全く得ていないことを意味し、相互情報量が1の場合には、受信情報から送信情報に関する情報を完全に得ていることを意味している。
なお、反復回数決定部61は、入力相互情報量が閾値である0.55より小さい値の場合には、誤りとし、反復回数を0、つまり、受信情報の復号処理をしないと決定する。
以上より、式(6)は、式(3)となる。
例えば、反復回数決定部61は、前記計算した相互情報量の値が0.7の場合、表1中の入力相互情報量の値が0.65~0.75であるから反復回数を2と決定し、前記計算した相互情報量の値が0.6の場合、表1中の入力相互情報量の値が0.575~0.65であるから反復回数を4と決定する。
具体的には、反復回数決定部61は、前記計算した相互情報量が0.5の場合、表1中の入力相互情報量の値が~0.55であるから反復回数を0と決定し、受信情報の復号処理を実施せず、誤りとする。
具体的には、デパンクチャリング部64は、前記符号ビット2に相当する対数尤度比を、交互に第1のMAP推定部65と第2のMAP推定部68とに出力する。このとき、デパンクチャリング部64は、前記符号ビット2に相当する対数尤度比を出力しないMAP推定部65、又は、第2のMAP推定部68に対しダミービットである0を付加する。
第1のMAP推定部65は、前記誤り訂正を行った対数尤度比を第1の加算器601-1に出力する。
第2のインターリーバ67は、第1の加算器601-1から入力された対数尤度比に対し、図1のインターリーバ11と同じ並び替えをして、第2のMAP推定部68に出力する。
第2のMAP推定部68は、前記誤り訂正を行った対数尤度比を反復制御部69に出力する。
反復制御部69は、前記数えた誤り訂正処理の回数が反復回数決定部61から入力された反復回数に達すると、復号化された情報として出力し、復号化を完了する。
反復制御部69は、前記数えた誤り訂正処理の回数が反復回数決定部61から入力された反復回数に達しない場合、第2のMAP推定部68から入力された対数尤度比を、第2の加算器601-2に出力する。
第1のRSC符号化部12は、前記入力された情報ビットから、組織ビットとパリティビット1とを生成する。第1のRSC符号化部12は、該生成した組織ビットを符号ビット1として、無線送信部2に出力する(S101)。また、第1のRSC符号化部12は、前記生成したパリティビット1をパンクチャリング部14に出力する(S102)。
第2のRSC符号部13は、インターリーバ11から入力された情報ビットから、組織ビットとパリティビット2を生成する。第2のRSC符号化部13は、該生成したパリティビット2をパンクチャリング部14に出力する(S104)。
無線送信部2は、第1のRSC符号化部12から入力された符号ビット1と、パンクチャリング部14から入力された符号ビット2を無線周波数にアップコンバートし、送信アンテナ3を介して受信装置に送信をする(S106)。
LLR計算部60は、無線受信部5から入力された受信情報ビットに基づき該情報の分散を計測し、対数尤度比を計算する(S202)。
反復回数決定部61は、LLR計算部60から入力された対数尤度比から相互情報量を計算し、該相互情報量に基づき復号処理の反復回数を決定する(S203)。
反復制御部69は、前記数えた誤り訂正処理の回数が、反復回数決定部61が決定した反復回数に達すると、第2のMAP推定部68から入力された対数尤度比を復号した情報として出力し、復号を完了する(S208)。
一方、反復制御部69は、前記数えた誤り訂正処理の回数が、反復回数決定部61が決定した反復回数に達しない場合、第2のMAP推定部68から入力された対数尤度比を出力し、第1のMAP推定部65は、誤り訂正処理を反復する(S204)。
また、本実施形態によれば、復号化装置6は、受信情報を復号化処理することで得られる相互情報量が1とならない、つまり、受信情報の相互情報量が予め定めた閾値より小さい値であるときは、誤りとし、復号化処理を行わない。これにより、復号化装置6は、復号化処理により相互情報量が1とならずにスタック状態となってしまうことを回避し、無駄な復号処理を反復しない。
符号化装置6は、無駄な復号処理を反復しないことにより、該処理に係る消費電力を消費しないので、消費電力を削減することができる。
例えば、前記等化部は、伝搬路推定に用いるパイロット信号から対数尤度比を計算し、該計算した対数尤度比を反復回数決定部に出力する。反復回数決定部は、前記等化部から入力された対数尤度比から復号処理の反復回数を決定する。
例えば、誤り訂正符号は、LDPC(Low Density Parity Check:低密度パリティ検査)符号や、RA(Repeat Accumulate)符号、PA(Product Accumulate)符号であってもよい。
例えば、ストリーミングのようなリアルタイム性があるか否かなどにより受信装置の復号処理の回数が制限される場合に、該ストリーミングを配信する送信装置は、該制限された回数で相互情報量が1となるような変調方式や復号化率により復号化した信号を送信する。これにより、該送信装置が配信したストリーミングの情報を受信する受信装置は、前記制限された回数で相互情報量が1となるような復号処理をすることができる。
また、「コンピュータ読み取り可能な記録媒体」とは、フレキシブルディスク、光磁気ディスク、ROM、CD-ROM等の可搬媒体、コンピュータシステムに内蔵されるハードディスク等の記憶装置のことをいう。さらに「コンピュータ読み取り可能な記録媒体」とは、インターネット等のネットワークや電話回線等の通信回線を介してプログラムを送信する場合の通信線のように、短時刻の間、動的にプログラムを保持するもの、その場合のサーバやクライアントとなるコンピュータシステム内部の揮発性メモリのように、一定時刻プログラムを保持しているものも含むものとする。また上記プログラムは、前述した機能の一部を実現するためのものであってもよく、さらに前述した機能をコンピュータシステムにすでに記録されているプログラムとの組み合わせで実現できるものであってもよい。
Claims (9)
- 復号処理を反復することによって、誤り訂正符号化された情報を復号する復号化装置において、
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する反復回数決定部を備える復号化装置。 - さらに、相互情報量と反復回数との関係を記憶する記憶部を備え、
前記反復回数決定部は、前記記憶部が記憶する相互情報量と反復回数との関係から、前記計算した相互情報量に対応する反復回数を特定し、該反復回数を前記復号処理の反復回数とすることを特徴とする請求項1に記載の復号化装置。 - 前記反復回数決定部は、前記計算した相互情報量が予め定めた閾値より小さい値の場合には、復号処理を行わないと決定することを特徴とする請求項1又は請求項2に記載の復号化装置。
- 前記閾値は、予め定めた反復回数の復号処理をしても相互情報量が1とならない相互情報量であることを特徴とする請求項3に記載の復号化装置。
- 前記誤り訂正符号化は、ターボ符号化であることを特徴とする請求項1乃至請求項4のいずれか一の項に記載の復号化装置。
- 復号処理を反復することによって、誤り訂正符号化された情報を復号する復号化方法において、
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する過程を有することを特徴とする復号化方法。 - 復号処理を反復することによって、誤り訂正符号化された情報を復号する復号化装置のコンピュータに、
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する手段として機能させる復号化プログラム。 - 復号処理を反復することによって、受信信号に含まれる誤り訂正符号化された情報を復号する復号化装置を具備する受信装置おいて、
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する反復回数決定部を備えることを特徴とする受信装置。 - 送信装置と、復号処理を反復することによって、送信装置から送信された信号に含まれる誤り訂正符号化された情報を復号する復号化装置を具備する受信装置とを備える通信システムおいて、
前記符号化された情報の送信情報との関係を示す相互情報量を計算し、該計算した相互情報量に基づいて前記復号処理の反復回数を決定する反復回数決定部を備えることを特徴とする通信システム。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA2715161A CA2715161A1 (en) | 2008-02-14 | 2009-02-13 | Decoding device, decoding method, decoding program, reception device, and communication system |
EP09709527.7A EP2249481A4 (en) | 2008-02-14 | 2009-02-13 | DECODING DEVICE, DECODING PROCESS, DECODING PROGRAM, RECEIVING DEVICE AND COMMUNICATION SYSTEM |
CN2009801049192A CN101946415A (zh) | 2008-02-14 | 2009-02-13 | 解码装置、解码方法、解码程序、接收装置以及通信系统 |
US12/867,209 US20100318876A1 (en) | 2008-02-14 | 2009-02-13 | Decoding device, decoding method, decoding program, reception device, and communication system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2008-033252 | 2008-02-14 | ||
JP2008033252A JP4863519B2 (ja) | 2008-02-14 | 2008-02-14 | 復号化装置、復号化方法、復号化プログラム、受信装置、及び通信システム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2009102012A1 true WO2009102012A1 (ja) | 2009-08-20 |
Family
ID=40957043
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2009/052400 WO2009102012A1 (ja) | 2008-02-14 | 2009-02-13 | 復号化装置、復号化方法、復号化プログラム、受信装置、及び通信システム |
Country Status (6)
Country | Link |
---|---|
US (1) | US20100318876A1 (ja) |
EP (1) | EP2249481A4 (ja) |
JP (1) | JP4863519B2 (ja) |
CN (1) | CN101946415A (ja) |
CA (1) | CA2715161A1 (ja) |
WO (1) | WO2009102012A1 (ja) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9215017B2 (en) * | 2013-06-18 | 2015-12-15 | Samsung Electronics Co., Ltd. | Computing system with decoding sequence mechanism and method of operation thereof |
CN109861693B (zh) * | 2017-11-30 | 2021-03-30 | 华为技术有限公司 | 一种译码处理的方法及译码处理装置 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000183758A (ja) | 1998-12-10 | 2000-06-30 | Sony Internatl Europ Gmbh | 復号装置及び復号方法、並びに符号化装置及び符号化方法 |
JP2000513555A (ja) * | 1998-04-18 | 2000-10-10 | サムソン エレクトロニクス カンパニー リミテッド | 通信システムのチャネル符号/復号装置及び方法 |
JP2004229169A (ja) * | 2003-01-27 | 2004-08-12 | Hitachi Kokusai Electric Inc | ターボ復号方法およびターボ復号を有する受信装置 |
JP2007006382A (ja) * | 2005-06-27 | 2007-01-11 | Matsushita Electric Ind Co Ltd | 受信装置および反復復号方法 |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0998087A1 (en) * | 1998-10-30 | 2000-05-03 | Lucent Technologies Inc. | Multilevel transmission system and method with adaptive mapping |
JP2001186023A (ja) * | 1999-12-27 | 2001-07-06 | Mitsubishi Electric Corp | 通信装置および通信方法 |
US20010052104A1 (en) * | 2000-04-20 | 2001-12-13 | Motorola, Inc. | Iteration terminating using quality index criteria of turbo codes |
KR100713331B1 (ko) * | 2000-12-23 | 2007-05-04 | 삼성전자주식회사 | 부호분할다중접속 이동통신시스템의 반복복호 중지 장치 및 방법 |
JP2002198937A (ja) * | 2000-12-26 | 2002-07-12 | Canon Inc | 通信装置、通信方法、符号化装置、符号化方法、復号装置、復号方法及び記憶媒体 |
JP2003018019A (ja) * | 2001-06-29 | 2003-01-17 | Hitachi Kokusai Electric Inc | ディジタル無線通信システムの復号装置 |
US7013116B2 (en) * | 2002-06-26 | 2006-03-14 | Lucent Technologies Inc. | MIMO systems having a channel decoder matched to a MIMO detector |
DE102005010006B4 (de) * | 2005-03-04 | 2006-12-07 | Infineon Technologies Ag | Verfahren und Vorrichtung zum Terminieren einer iterativen Turbo-Dekodierung |
US7661038B2 (en) * | 2006-10-09 | 2010-02-09 | Intel Corporation | Link adaptation for retransmission error-control technique transmissions |
US7992070B2 (en) * | 2006-12-27 | 2011-08-02 | Nec Laboratories America, Inc. | Bit-interleaved LDPC-coded modulation for high-speed optical transmission |
-
2008
- 2008-02-14 JP JP2008033252A patent/JP4863519B2/ja not_active Expired - Fee Related
-
2009
- 2009-02-13 CA CA2715161A patent/CA2715161A1/en not_active Abandoned
- 2009-02-13 CN CN2009801049192A patent/CN101946415A/zh active Pending
- 2009-02-13 US US12/867,209 patent/US20100318876A1/en not_active Abandoned
- 2009-02-13 WO PCT/JP2009/052400 patent/WO2009102012A1/ja active Application Filing
- 2009-02-13 EP EP09709527.7A patent/EP2249481A4/en not_active Withdrawn
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000513555A (ja) * | 1998-04-18 | 2000-10-10 | サムソン エレクトロニクス カンパニー リミテッド | 通信システムのチャネル符号/復号装置及び方法 |
JP2000183758A (ja) | 1998-12-10 | 2000-06-30 | Sony Internatl Europ Gmbh | 復号装置及び復号方法、並びに符号化装置及び符号化方法 |
JP2004229169A (ja) * | 2003-01-27 | 2004-08-12 | Hitachi Kokusai Electric Inc | ターボ復号方法およびターボ復号を有する受信装置 |
JP2007006382A (ja) * | 2005-06-27 | 2007-01-11 | Matsushita Electric Ind Co Ltd | 受信装置および反復復号方法 |
Non-Patent Citations (3)
Title |
---|
"Proceedings of the 2002 45th Midwest Symposium on Circuits and Systems, 2000. (MWSCAS-2002), Vol.3, 4-7 August 2002", vol. 3, August 2002, article IBRAHIM A. AL-MOHANDES ET AL.: "A New Efficient Dynamic-Iterative Technique for Turbo Decoders", pages: III-180 - III-183, XP010635527 * |
"Proceedings of the 8th International Conference, Advanced Communication Technology, 2006. (ICACT 2006), Vol.2, 20-22 February 2006", vol. 2, 20 February 2006, article BYOUG-SUP SHIM ET AL.: "A New Stopping Criterion for Turbo codes", pages: 1107 - 1111, XP008139591 * |
See also references of EP2249481A4 * |
Also Published As
Publication number | Publication date |
---|---|
CN101946415A (zh) | 2011-01-12 |
US20100318876A1 (en) | 2010-12-16 |
JP2009194638A (ja) | 2009-08-27 |
CA2715161A1 (en) | 2009-08-20 |
JP4863519B2 (ja) | 2012-01-25 |
EP2249481A1 (en) | 2010-11-10 |
EP2249481A4 (en) | 2013-07-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10998922B2 (en) | Turbo product polar coding with hard decision cleaning | |
US8209579B2 (en) | Generalized multi-threshold decoder for low-density parity check codes | |
US8443265B2 (en) | Method and apparatus for map decoding and turbo decoder using the same | |
JP7464521B2 (ja) | Ldpcコード化データを処理する方法および装置 | |
EP1596501A1 (en) | Apparatus and method for encoding and decoding block low density parity check codes with a variable coding rate | |
WO2017086414A1 (en) | Quantized belief propagation decoding of ldpc codes with mutual information-maximizing lookup tables | |
WO2016070573A1 (zh) | 数据校验方法及装置 | |
KR20070079448A (ko) | 다중 안테나 시스템에서 반복 검출 및 복호 수신 장치 및방법 | |
KR20090092197A (ko) | 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서 채널부호/복호 방법 및 장치 | |
JP2009044732A (ja) | 送信装置及び送信方法 | |
JP2010212757A (ja) | 符号化装置、受信装置、無線通信システム、パンクチャパターン選択方法及びそのプログラム | |
US9490938B1 (en) | Systems and methods for performing iterative interference cancellation | |
TWI433471B (zh) | (n,k)方塊碼之軟輸入軟輸出解碼裝置 | |
KR20210030848A (ko) | 통신 또는 방송 시스템에서 데이터 복호화 방법 및 장치 | |
Salija et al. | Optimum energy efficient error control techniques in wireless systems: a survey | |
JP7350176B2 (ja) | マルチレベルポーラ符号化変調送信及び受信のための方法及びデバイス | |
JP2012502508A (ja) | 埋め込み符号化を用いて不均一誤りを防止するためのシステムおよび方法 | |
Arshad et al. | Implementation and analysis of convolutional codes using MATLAB | |
KR20070118835A (ko) | 다중 안테나 시스템에서 반복 검출 및 복호 수신 성능을향상시키기 위한 장치 및 방법 | |
JP4863519B2 (ja) | 復号化装置、復号化方法、復号化プログラム、受信装置、及び通信システム | |
US8665970B2 (en) | Method and arrangement related to blind detection | |
WO2017176147A1 (en) | Device and method for adjusting transmission size in case of decoding failures | |
WO2021084890A1 (ja) | 無線通信システム及び無線通信方法 | |
KR101279283B1 (ko) | 블록 부호를 사용하는 통신 시스템에서 신호 송수신 장치및 방법 | |
CN112994842B (zh) | 一种软比特的量化方法、装置、解调器及计算机存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200980104919.2 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 09709527 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12867209 Country of ref document: US Ref document number: 2715161 Country of ref document: CA |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2009709527 Country of ref document: EP |