WO2007108396A1 - 通信装置、復号装置、情報伝送方法および復号方法 - Google Patents
通信装置、復号装置、情報伝送方法および復号方法 Download PDFInfo
- Publication number
- WO2007108396A1 WO2007108396A1 PCT/JP2007/055224 JP2007055224W WO2007108396A1 WO 2007108396 A1 WO2007108396 A1 WO 2007108396A1 JP 2007055224 W JP2007055224 W JP 2007055224W WO 2007108396 A1 WO2007108396 A1 WO 2007108396A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- transmission
- ldpc
- information
- processing
- column
- Prior art date
Links
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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
- H03M13/1185—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
-
- 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
-
- 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
- H03M13/1117—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule
-
- 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
- H03M13/353—Adaptation to the channel
-
- 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
- H03M13/356—Unequal error protection [UEP]
-
- 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
- H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
-
- 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/618—Shortening and extension of codes
-
- 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/635—Error control coding in combination with rate matching
- H03M13/6356—Error control coding in combination with rate matching by repetition or insertion of dummy data, i.e. rate reduction
-
- 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/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
-
- 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/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
- H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
- H03M13/6393—Rate compatible low-density parity check [LDPC] codes
-
- 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/6522—Intended application, e.g. transmission or communication standard
- H03M13/6527—IEEE 802.11 [WLAN]
-
- 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/6522—Intended application, e.g. transmission or communication standard
- H03M13/6544—IEEE 802.16 (WIMAX and broadband wireless access)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
-
- 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/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
Definitions
- Communication device decoding device, information transmission method, and decoding method
- the present invention relates to a communication apparatus that transmits and receives an error correction coded signal, and in particular, LDPC (Low-Density Parity Check) coded information is converted into MIMO ( BACKGROUND OF THE INVENTION 1.
- LDPC Low-Density Parity Check
- MIMO BACKGROUND OF THE INVENTION 1.
- the present invention relates to a communication device that transmits and receives using a multiple input (multiple input) technology, an information transmission method, a decoding device included in the communication device, and a decoding method.
- MIMO technology is a communication technology in which both transmitting and receiving communication devices use multiple antennas to transmit and receive signals, and SD M (Space Division) that transmits multiple signal sequences in parallel. Multiplexing) technology and transmit diversity technology that transmits the same signal sequence from multiple antennas (see Non-Patent Document 1 below).
- Fig. 34 shows an outline of a MIMO transmission line when both the transmitting and receiving sides use two antennas. MIMO transmission is characterized by the fact that because there are multiple transmission paths, the noise level of each transmission path may be different.
- An LDPC code is an error correction code having a correction capability approaching the transmission path capacity.
- the number of non-zero elements (column degree) in the column direction and the number of non-zero elements in the row direction of the parity check matrix are used.
- the column order size and bits of non-regular LDPC codes are small! /, And error tolerance is stronger than bits!
- LDPC codes having an LDGM (Low-Density Generation Matrix) structure such as RA (Repeat Accumulate) codes.
- LDGM Low-Density Generation Matrix
- RA Repeat Accumulate
- the LDPC code is generated using a parity check matrix (using the parity check matrix as a generation matrix), the bit length of information to be transmitted is determined depending on the size of the parity check matrix. Therefore, there is an LDPC code configured using a cyclic permutation matrix in order to make the information bit length variable. By using this cyclic permutation matrix, a variable code length can be realized with a size of V based on the size of the basic matrix for performing cyclic permutation.
- LDPC code decoding methods include, for example, a decoding method for reducing the amount of computation from a high-performance decoding method such as the Sum-Product decoding method described in Non-Patent Document 2 below, and a reduction in memory amount.
- decoding is performed by repeating predetermined row processing and column processing, a parity check is performed for each repetition, and if all the parity checks are satisfied, the repetition ends and the decoding result is returned.
- “Horizontal Shuffled BP” as an algorithm that can reduce the number of decoding iterations when decoding LDPC codes (see Non-Patent Document 3).
- “Horizontal Shuffled BPJ has the feature that it reduces the number of decoding operations by serially updating the reliability in the row direction and converges with the number of iterations.
- Patent Document 1 Japanese Patent Application Laid-Open No. 2005-277784
- Patent Document 2 Japanese Patent Laid-Open No. 2005-39585
- Non-Patent Document 1 “Proposal of SDM-COFDM system for broadband mobile communication realizing 100 Mbit / s with MIMO channel”, IEICE RCS2001-135 (2001-10), p. 37-42, October 2001
- Non-Patent Document 2 “Low Density Parity Check Code and its Decoding Method LDPC (Low Density Parity Check) Code Zsum—Product Decoding”, p. 76-99, Trikes, June 5, 2002
- Non-Patent Literature 3 F. Gulouud, Generic architecture for LDPC codes, (onnnej,, URL: http://pastel.paristech.org/archive/00000806/01/these.pd
- Non-Patent Document 4 L. Sakai, W. Matsumoto, H. Yoshida, Low Complexity Decoding Algorithm for LDPC Codes and Its Discretized Density Evolution ", ppl3-18, RCS2005-42 (2005-7) Okayama, Japan, July, 2005 .
- the LDPC code does not require a transmission line interleaver, which is necessary for a conventional error correction code that resists non-uniform noise, and has high error correction capability.
- the realization of further improvements in error correction capability remains an important issue.
- a conventional LDPC code decoder is installed in a mobile communication terminal or the like, it is difficult to reduce the size and power consumption of the device due to the large amount of computation required for the decoding process. In equipment that performs MIMO transmission, there is a strong need to reduce the amount of computation.
- the present invention has been made in view of the above, and an object of the present invention is to provide a communication device and an information transmission method that improve error correction capability (decoding capability) when an LDPC code is used.
- an object of the present invention is to obtain a communication apparatus and an information transmission method capable of LDPC code even when an information length that does not match the size of the system permutation permutation matrix is designated.
- the present invention provides a communication device that transmits and receives LDPC-encoded information using MIMO technology, and includes LDPC-encoded information.
- the transmission sort means for sorting the LDPC code bits to be configured in the descending order of the column order of the check matrix used to generate the LDPC encoded bits, and the LDPC code bits after being sorted by the transmission sort means.
- a signal transmission means for allocating and transmitting the bits in order from a transmission line having a low noise level according to the order after sorting.
- the column order is large! /, And bits are assigned to the transmission path with a low noise level for transmission / reception.
- FIG. 1 is a diagram showing a configuration example of a first embodiment of a communication device according to the present invention.
- FIG. 2 is a schematic diagram showing an example of a sorting process performed based on the column order of the parity check matrix.
- FIG. 3 is a diagram illustrating a configuration example of a first embodiment of a communication device according to the present invention.
- FIG. 4 is a flowchart of an example of the operation of the communication apparatus according to the first embodiment.
- FIG. 5 is a flowchart of an example of operation of the communication apparatus according to the first embodiment.
- FIG. 6 is a diagram showing an example of a computer simulation result of information transmission performed by applying the procedure of the first embodiment.
- FIG. 7 is a diagram showing a configuration example of a second embodiment of a communication device according to the present invention.
- FIG. 8 is a diagram showing a configuration example of a second embodiment of a communication device according to the present invention.
- FIG. 9 is a flowchart of an example of the operation of the communication apparatus according to the second embodiment.
- FIG. 10 is a flowchart of an example of operation of the communication apparatus according to the second embodiment.
- FIG. 11 is a diagram showing an example of a computer simulation result of information transmission performed by applying the procedure of the second embodiment.
- FIG. 12 is a diagram showing a configuration example of a third embodiment of the communication apparatus according to the present invention.
- FIG. 13 is a diagram illustrating a configuration example of a parity check matrix having an LDGM structure.
- FIG. 14 is a schematic diagram showing an example of processing for assigning a sign bit to a transmission line.
- FIG. 15 is a flowchart of an example of the operation of the communication apparatus according to the third embodiment.
- FIG. 16 is a diagram illustrating an example of a computer simulation result of information transmission performed by applying the procedure of the third embodiment.
- FIG. 17 is a diagram showing a configuration example of a fourth embodiment of a communication apparatus according to the present invention.
- FIG. 18 is a flowchart of an example of the operation of the communication apparatus according to the fourth embodiment. It is.
- FIG. 19 is a diagram showing an example of a computer simulation result of information transmission performed by applying the procedure of the fourth embodiment.
- FIG. 20 is a diagram illustrating a configuration example of a communication apparatus according to a fifth embodiment of the present invention.
- FIG. 21 is a schematic diagram showing an example of puncture processing and depuncture processing.
- FIG. 22 is a flowchart of an example of operation of the communication apparatus according to the fifth embodiment.
- FIG. 23-1 is a flowchart showing an example of puncture processing.
- FIG. 23-2 is a diagram showing an example of bit replacement by puncture processing.
- FIG. 24 is a diagram showing an example of a computer simulation result of information transmission performed by applying the procedure of the fifth embodiment.
- FIG. 25 is a diagram showing a configuration example of a sixth embodiment of the communication apparatus according to the present invention.
- FIG. 26 is a diagram of an example of an operation in which the communication apparatus according to the sixth embodiment performs signal transmission / reception.
- FIG. 27 is a flowchart of an example of the operation of the communication apparatus according to the sixth embodiment.
- FIG. 28 is a diagram of a configuration example of a decoding device included in the communication device according to the seventh embodiment.
- FIG. 29 is a flowchart of an example of operation of the decoding apparatus according to the seventh embodiment.
- FIG. 30-1 is a diagram for explaining the calculation amount reduction effect when the decoding apparatus according to the seventh embodiment is used.
- FIG. 30-2 is a diagram for explaining the calculation amount reduction effect when the decoding apparatus according to the seventh embodiment is used.
- FIG. 30-3 is a diagram for explaining the calculation amount reduction effect when the decoding apparatus according to the seventh embodiment is used.
- Fig. 30-4 shows the calculation amount reduction when the decoding device according to the seventh embodiment is used. It is a figure for demonstrating an effect.
- FIG. 31 is a diagram showing a configuration example of an embodiment 8 of a communication apparatus according to the present invention.
- FIG. 32 is a flowchart of an example of operation of the communication apparatus according to the eighth embodiment.
- FIG. 33 is a diagram showing a configuration example of a mobile communication system to which a communication apparatus according to the present invention is applied.
- FIG. 34 is a diagram schematically showing a MIMO transmission path.
- Another object of the present invention is to assign a transmission path for a signal sequence when an LDPC-coded signal sequence is transmitted / received using MIMO technology or the like in a transmission path having a plurality of non-uniform states.
- LDPC codes inherently perform well for multiple non-uniform transmission paths that are resistant to non-uniform noise.
- emphasizing nonuniformity may show higher decoding performance.
- the present invention uses this property to improve the error correction capability.
- the present invention can also be applied to data transmission performed by combining a communication apparatus having only a transmission function (transmitter) and a communication apparatus having only a reception function (receiver).
- a communication apparatus having only a transmission function transmitter
- a communication apparatus having only a reception function receiver
- description will be made assuming a communication device that includes a transmitter and a receiver and can perform bidirectional communication with a counterpart communication terminal.
- FIG. 1 is a diagram illustrating a configuration example of a first embodiment of a communication device according to the present invention.
- each communication device in order to clearly indicate the signal transmission source communication device and the transmission destination communication device, each communication device is configured to include only one of the transmitter and the receiver.
- both communication apparatuses are configured to include a transmitter and a receiver. The same applies to the configuration of the communication apparatus according to the embodiment described later.
- the communication apparatus includes a transmitter and a receiver, and the transmitter performs LDPC code encoding of transmission information, and an input signal from LDPC encoding unit 11 and LDPC encoding unit 11 ( LDP c coding bits) according to the distribution of the column order (number of non-zero elements in the column direction) of the parity check matrix, and the code sign bit sorted in the transmission sort unit 12 is transmitted to each transmission line. It consists of a signal transmission unit 13 that allocates and performs MIMO transmission.
- the receiver demodulates the MIMO transmission signal received via the antenna 14 and the demodulated received signal (received LDPC code bit) before being sorted by the transmitter (transmission sort unit 12).
- the receiving sort unit 15 performs sorting (reverse sorting) so as to return to the arrangement order of the data, and the LDPC decoding unit 16 performs decoding of the LDPC code input from the receiving sort unit 15.
- the LDPC code unit 11 performs LDPC code input on the input information bits (transmission information) using the generator matrix, and outputs the resulting code key bits.
- the generator matrix is the same as the parity check matrix.
- the transmission sort unit 12 converts the sign key input from the LDPC code key unit 11 to the column order of the corresponding check matrix based on the column degree distribution of the check matrix. Sort in order of size.
- the signal transmission unit 13 assigns the code bits sorted in the transmission sorting unit 12 in order from the transmission path with the lowest noise level, and transmits them. It is also possible to sort in ascending order of the column order and assign in order from the highest noise level to the transmission path!
- the variance value ⁇ may be a value obtained in advance as external force communication path information or may be calculated by the signal receiving unit 14.
- the reception sort unit 15 sorts (reverse sorts) the reception LLR so that the order (order after sorting) switched by the transmission sort unit 12 of the transmitter is returned to the original sign bit order.
- the LDPC decoding unit 16 performs decoding based on the reception LLRs sorted by the reception sorting unit 15 and outputs the decoded bits.
- the decoding process performed by the LDPC decoding unit 16 may be shifted as long as it has an algorithm for decoding an LDPC code.
- the receiver performs a decoding process using a matrix in which the column order of the check matrix used in the LDPC decoding unit 16 is rearranged according to the sort order performed by the transmission sort unit 12 of the transmitter, and thereafter The decoded bits may be sorted.
- the configuration of the communication device is as in the example shown in FIG.
- the reception sort unit 15a only needs to sort the bits decoded by the LDPC decoding unit 16a, and therefore, the number of processes for changing the order is smaller than that of the communication apparatus having the configuration shown in FIG. There is an advantage of becoming.
- FIG. 4 is a flowchart showing an example of the operation of the communication apparatus according to the first embodiment.
- the operation will be described with reference to this figure.
- the LDPC code unit 11 of the transmission side communication device encodes transmission information (information bits) using a predetermined generation matrix (step S 11).
- the transmission sort unit 12 sorts the code bit generated by the LDPC code key unit 11 using the sort pattern prepared in advance (step S12).
- the sort pattern used here is based on the column order of the parity check matrix corresponding to the encoded bits generated by the LDPC encoding unit 11! /, And the code bits are arranged in the order of the column order weights.
- the pattern is determined as follows.
- the signal transmission unit 13 grasps the noise state of the transmission path in advance as communication path information, and assigns signals (encoded bits) to the good transmission path in the noise state in descending order of the column order of the check matrix.
- Send (Step S13, S14).
- the signal transmission unit 13 grasps the noise state, it is necessary to measure the transmission path by sending a pilot signal in advance or to use the transmission path information obtained as a communication system. There are methods.
- the noise level differs for each modulation point. In this case, the change of the noise level due to the modulation point may be ignored and the code bit may be assigned, or the code bit may be assigned at a noise level considering the modulation point.
- the receiving side communication device when the signal receiving unit 14 receives the signal (step S15), information on the communication path (noise level for each transmission path) and reception information through which the received signal has passed.
- the reception LLR is calculated based on (Step S16).
- the reception sort unit 15 sorts the reception LLRs calculated by the signal reception unit 14 using the sort pattern prepared in advance (step S17).
- the sort pattern used here is the same as the sort pattern used by the transmission sort unit 12 on the transmission side based on the column order of the parity check matrix.
- the LDPC decoding unit 16 performs decoding based on the received LLR after sorting output from the reception sorting unit 15 (step S18).
- the LDPC decoding unit 16a prepares a matrix prepared by sorting the columns of the check matrix based on the column degree prepared in advance. Based on the received LLR, the decoding is executed (step S18a), and the received sort unit 15a sorts the decoded bits obtained as a result (step S17a). In this case, since only the decoded information bits are sorted, there is an advantage that the number of processes for changing the order is smaller than sorting coded bits having a code length.
- FIG. Figure 6 shows that the coding bits are assigned to four transmission lines with different noise levels, with a code rate of 1Z3, and the coding bits are assigned to the transmission lines in descending order of the order of the noise, t,
- the four transmission lines correspond to the case of 4 transmitting antennas and 4 receiving antennas in communication using the MIM O technology.
- FIG. 6 shows the case where the signal assignment order to the transmission line is the reverse of this embodiment (low column order, low noise level from bit to bit, signal assignment to transmission line).
- simulation results when information bits and parity bits are alternately assigned to each transmission line are also shown as an example of transmission processing performed without considering the influence of the column order.
- the conditions for obtaining an example of the computer simulation results shown in Fig. 6 are as follows: the information length is 1440 bits, the coding rate is 1Z3, the modulation method is BPSK, the additive white Gaussian channel, and the signal-to-noise ratio EbZNO Is 4 transmission lines shifted by [dB] from the average (-4.5, -1.5, 1.5, 4.5), and the decoding method of LDPC code is Sum-Product decoding method, and the number of repetitions Was 100 times.
- the result of allocating the sign bit to the transmission line with the highest order of the column in order of the transmission line with the low noise level is “descending order assignment”.
- the result when allocating to a channel is “Ascending Order Allocation”, and the result when information bits and parity bits are allocated alternately to a transmission channel with a low noise level is “Alternate Allocation”.
- the horizontal axis is the average value of EbZNO of 4 transmission lines (for example, 4 communication lines are -4.2, 1.2, 1.8, and 4.8, 0.3), and the vertical axis is the error probability.
- Solid line is bit error probability
- broken line is The block error probability is shown. From the results shown in FIG. 6, it can be seen that “descending order allocation” has the highest decoding performance.
- QCL m, n m, n represents the element of row number m and column number n in the parity check matrix H.
- I (p) is the line number: r (0 ⁇ r ⁇ p—l), column
- the LDGM structure refers to a structure in which a part of the parity check matrix is a lower triangular matrix as in the matrix shown in the equation (3). Furthermore, the regularity check matrix H of the QC-LDPC code of the LDGM structure defined as in (3) above has specific regularity.
- Equation (6) the combination of numerical values shown in Equation (6) is only an example, and a simulation or the like is performed, and the optimal one (the one that provides the highest decoding performance) is used according to the conditions.
- the zero matrix in the above equation (9) is a zero matrix of p rows x p columns.
- the matrix H is
- the weight distribution of the mask matrix Z when the weight distribution is non-uniform is determined by the density evolution method.
- a 64 row x 32 column matrix The skew matrix can be expressed as the following equation (10) based on the column degree distribution by the density evolution method.
- Z is the following equation (11).
- Z (1: 32,2: 5) is a submatrix of, and represents the submatrix between the 1st to 32nd rows and the 2nd force to the 5th column.
- the final non-regular parity check matrix H is, for example, 64 rows x 32 columns of mask matrix Z, 64 (row number j is 0 to 63) X 32 (column number 1 is 0 to 31) pseudo cyclic matrix H
- the parity check matrix H for generating the LDPC code is equal to the mask matrix Z and the pseudo cycle.
- the LDPC code is not limited to the example described here.
- the order is small! /, And that the distribution of the order is large and the distribution is non-uniform, the performance improvement effect is likely to appear.
- the transmission path generated when MIMO technology is applied In order from the difference in noise level, the bit with the highest order of the column is assigned to the transmission line with the lower noise level V (the higher the order of the column! /, The lower the bit, the lower the noise level is assigned to the transmission line. It was decided to send and receive (as it was guessed). As a result, it is possible to improve the error correction capability and realize a communication apparatus having a high decoding capability.
- FIG. 7 is a diagram illustrating a configuration example of the communication device according to the second embodiment.
- the communication apparatus according to the present embodiment has a configuration in which a transmission path selection unit 21 is added to the transmitter included in the communication apparatus according to the first embodiment described above. Since other parts are the same as those of the communication apparatus of the first embodiment, the same reference numerals are given and description thereof is omitted.
- the communication device (receiver) of the present embodiment may be partially replaced (see FIG. 8). The operation of the receiver in this case is as described in the first embodiment.
- the transmission path selection unit 21 corresponding to the transmission path determination unit according to claim 2 has a low noise level for the code bits sorted in the transmission sort unit 12 according to the code rate. Switches between transmission to the transmission path in turn, or transmission alternately to the low and high noise transmission lines.
- FIG. 9 is a flowchart illustrating an example of the operation of the communication device according to the second embodiment.
- Step S21 is executed instead of step S13 in the operation of the communication device according to the first embodiment (see FIG. 4).
- the other steps are the same as those in the first embodiment, so the same step numbers are assigned and the description thereof is omitted.
- the operation will be described with reference to FIG.
- the transmission path selection unit 21 of the transmitter converts the noise level of the input signal (code bit) according to the coding rate in descending order of the column order of the corresponding check matrix. Select low or low to assign a signal to the transmission line, or to assign a signal to the transmission line and the low transmission line alternately. Then, the signal transmission unit 13 assigns a signal (encoded bit) to the transmission line according to the selection result of the transmission line selection unit 21 (step S21), and transmits it (step S14).
- step S21 is executed instead of step S13 of the operation of the communication apparatus shown in FIG. 3 of the first embodiment (see FIG. 6).
- FIG. Figure 11 An example of a computer simulation result of information transmission using the above procedure is shown in FIG. Figure 11 shows that the coding bits are assigned to four transmission lines with different noise levels by changing the coding rate alternately with the case where the coding bits are assigned to the transmission line with the highest order of the column and the noise level in order of power.
- the computer simulation results are shown.
- the four transmission paths correspond to the case of four transmission antennas and four reception antennas in communication using MIMO technology.
- the LDPC code is generated by the LDPC code generation procedure described in Embodiment 1, the information length is 1440 bits, the coding rate is 1Z5, 1/3, 1 / 2, 2/3, modulation scheme is BPSK, additive white Gaussian channel, signal-to-noise ratio Eb ZNO from average (14.5, -1.5, 1.5, 4.5) [dB The four transmission lines were shifted, and the decoding method of the L DPC code was the Sum-Product decoding method, and the number of repetitions was 100.
- the code bits are assigned in descending order with the highest order of the column, the noise level is lower in the order of power, and the result when assigned to the transmission line is "assignment in descending order".
- the noise level is high, the transmission line is low, and the transmission line is assigned to the transmission line, “alternate assignment”.
- the horizontal axis is the average value of EbZNO of 4 transmission lines (for example, 4 communication paths are -4.2, 1 1.2, 1.8, and 4. 8), and the vertical axis is block error. Probability is shown. From the results shown in FIG.
- the decoding performance is high when the coding rates are 1Z5 and 1Z3 when assigned in descending order, but the decoding performance when the coding rates are 1Z2 and 2Z3 are assigned alternately. Therefore, in this example, the transmission path selection unit 21 only needs to perform the switching operation so that ascending order allocation is performed when the code rate is 1Z3 or less, and alternate allocation is performed when the code rate is 1Z2 or more.
- the transmission / reception is performed by switching between a case where the noise level is assigned to a low-band transmission line and a case where the noise level is assigned alternately to a low-band transmission line and a high-band transmission line.
- Figure 12 shows the third embodiment. It is a figure which shows the structural example of a communication apparatus.
- the transmitter included in the communication device according to the present embodiment also deletes the transmission sort unit 12 in the transmitter power included in the communication device according to the above-described first embodiment, and further includes a signal transmission unit 13b instead of the signal transmission unit 13. Take the configuration.
- the receiver has a configuration in which the receiver sort provided in the communication device of the first embodiment is also omitted from the reception sort unit 15. Other parts are the same as those of the communication apparatus of the first embodiment, and thus the same reference numerals are given and the description thereof is omitted.
- the column order of the column corresponding to the NORITY bit is smaller than the column order of the column corresponding to the information bit. Often, the order of the columns is almost in sequence from the beginning of the sign bit. Therefore, in the present embodiment, as shown in FIG. 14, transmission with a low noise level is performed in the order of the leading power of the bits corresponding to the information of the code key bits without sorting the code key bits. Assign to the road.
- FIG. 15 is a flowchart showing an example of the operation of the communication apparatus according to the third embodiment. Operation (see FIG. 4) force of the communication apparatus according to the first embodiment Steps S12 and S17 are deleted, and step S13 Instead, execute step S31. The other steps are the same as those in the first embodiment, so the same step numbers are assigned and the description thereof is omitted. Hereinafter, the operation will be described with reference to FIG.
- step S12 the signal transmission unit 13b of the transmitter, based on the noise state of the transmission path that has been grasped in advance, the bits (information (Bit) leading power In order of good noise state (low noise level), signals are allocated to the transmission path (step S31) and transmitted (step S14). After calculating the reception LLR, the receiver executes the decoding process without sorting it.
- FIG. 16 shows an example of a computer simulation result of information transmission using the above procedure.
- Figure 16 shows the results of computer simulations when code bits are assigned to transmission lines with low noise levels in order of the transmission power of information bits in four transmission lines with different noise levels.
- the four transmission paths correspond to the case of four transmission antennas and four reception antennas in MIMO technology communication.
- FIG. 16 shows the case where the order of signal allocation to the transmission path is the reverse of this embodiment (the noise level in order from the parity bit).
- the simulation result when information bits and parity bits are alternately assigned to each transmission path is also shown.
- the four transmission paths correspond to the case of four transmission antennas and four reception antennas in MIMO technology communication.
- FIG. 16 shows the case where the order of signal allocation to the transmission path is the reverse of this embodiment (the noise level in order from the parity bit).
- the conditions for obtaining the computer simulation results shown in Fig. 16 are that the LDPC code is generated by the LDPC code generation procedure described in Embodiment 1, the information length is 1440 bits, the coding rate is 1Z 3, and the modulation
- the system is BPSK, an additive white Gaussian channel, and the signal-to-noise ratio EbZNO is set to 4 channels shifted from the average (-4.5, 1 1.5, 1.5, 4.5) [dB].
- the decoding method of LDPC code is the Sum-Product decoding method, and the number of repetitions is 100. In Fig.
- the result when the noise level is assigned to the transmission line in order from the information bit is “information priority assignment”, and the result when the noise bit is assigned to the transmission line with the lowest noise level is “parity priority assignment”.
- the result when “information bit” and “parity bit” are alternately assigned to the transmission line with a low noise level is “alternate assignment”.
- the horizontal axis is the average value of Eb ZN0 of 4 transmission lines (for example, 4 communication lines are -4.2, -1.2, 1.8, and 4.8, 0.3), and the vertical axis is error probability. Is shown.
- the results shown in FIG. 16 show that “information priority assignment” has the highest decoding performance.
- the noise level is assigned to the transmission path in order from the information bit to the difference in noise level that occurs when the MIMO technology is applied. It was decided to send and receive.
- the error correction capability can be improved as in the case of sorting in descending order of the column order shown in the first embodiment.
- FIG. 17 is a diagram illustrating a configuration example of a communication device according to the fourth embodiment.
- the transmitter included in the communication apparatus according to the present embodiment has a configuration in which a transmission path selection unit 21 is added to the transmitter included in the communication apparatus according to the third embodiment described above.
- the transmission path selection unit 21 is the same as the transmission path selection unit 21 included in the communication device of the second embodiment described above.
- Other parts are the same as those of the communication device of the third embodiment, and thus the same reference numerals are given and description thereof is omitted.
- a signal transmission / reception operation will be described.
- FIG. 18 is a flowchart illustrating an example of the operation of the communication device according to the fourth embodiment.
- Step S3 lc is executed instead of step S31 in the operation of the communication device according to the third embodiment (see FIG. 15).
- the other steps are the same as those in the third embodiment, so the same step numbers are assigned and the description thereof is omitted.
- the operation will be described with reference to FIG.
- the transmission path selection unit 21 corresponding to the transmission path determination means of claim 4 grasps the noise level of the transmission path in advance, and encodes the input signal (encoded bit) coding rate. Depending on the situation, the power of the information bit is assigned to the transmission line with the low noise level in turn, or the power of the information bit is alternately assigned to the transmission line with the low noise level and the transmission line with the high power. Select and decide whether to assign a sign bit. Then, the signal transmission unit 13 assigns a signal (sign bit) to the transmission line according to the selection result of the transmission line selection unit 21 (step S3 lc) and transmits it (step S14).
- FIG. Fig. 19 shows the case where the code rate is changed, and the code bit is assigned to the four transmission lines with different noise levels, with the highest order of the column and the low noise level in order from the bit (Condition 1).
- the computer simulation results are shown when the sign-bits are alternately assigned to the transmission line with a low noise level and the transmission line with a high noise level (Condition 2).
- the four transmission paths correspond to the case of four transmit antennas and four receive antennas in MIMO technology communication.
- the LDPC code is generated by the LDPC code generation procedure described in Embodiment 1, the information length is 1440 bits, the coding rate is 1Z5, 1/3, 1 Z2 , 2Z3, modulation method is BPSK, additive white Gaussian channel, signal-to-noise ratio EbZNO from average (-4.5, -1.5, 1.5, 4.5) [dB] Four shifted transmission lines were used, and the decoding method of LDPC code was the Sum-Product decoding method, and the number of repetitions was 100.
- the computer simulation result for condition 1 is “information priority assignment”, and the computer simulation result for condition 2 is “alternate assignment”.
- the horizontal axis is the average value of EbZNO of 4 transmission lines (for example, 4 communication paths are -4.2, 1 1.2, 1.8, and 4. 8), and the vertical axis is error probability. Show. From the result shown in FIG. Decoding rates 1Z5 and 1Z3 have high decoding performance when information priority assignment is performed (condition 1), but coding rates 1Z2 and 2Z3 have high decoding performance when they are assigned alternately (condition 2). . Therefore, in this example, the transmission path selection unit 21 may perform the switching operation so that information priority allocation is performed at a coding rate of 1Z3 or less, and alternate allocation is performed at 1/2 or more.
- the noise level decreases in order from the information bit according to the coding rate with respect to the difference in noise level for each transmission path when the MIMO technology is applied.
- the transmission / reception is switched between the case of assigning to the transmission path and the transmission / reception switched between the low noise level and the high transmission path.
- the error correction capability can be further improved as compared with the case of the third embodiment.
- FIG. 20 is a diagram illustrating a configuration example of a communication apparatus according to the fifth embodiment.
- the transmitter included in the communication apparatus according to the present embodiment includes a puncture unit 51 in place of the transmission sort unit 12 in the transmitter of the communication apparatus in the first embodiment, and a receiver in place of the reception sort unit 15. In this configuration, a depuncture section 52 is provided. Since other parts are the same as those of the communication apparatus of the first embodiment, the same reference numerals are given and description thereof is omitted.
- FIG. 21 is a diagram illustrating an example of puncture processing and depuncture processing.
- the LDPC encoding unit 11 performs encoding with the encoding rate set to 1Z2 on the input transmission information, and passes all encoded bits to the puncture unit 51.
- the puncture unit 51 punctures the parity bits included in the code key bits according to the procedure shown in FIG. 21 so that the received code bit becomes the code bit length required by the communication system.
- the transmission rate is adjusted to generate a transmission bit with a coding rate of 2Z3.
- the depuncture unit performs the processing for the signal (received bit) received from the signal receiving unit 14 as shown in FIG. Depuncture is performed according to the procedure shown in. Specifically, 0 (dummy bit) indicating that there is no reliability information as the LLR of the punctured bit in the transmitter is inserted in the position of the punctured bit in the transmitter, and Depuncture is performed so that the received bit returns to its original position (so that it returns to the position before punctured by the transmitter), and the result is passed to the LDPC decoding unit 16.
- FIG. 22 is a flowchart of an example of operation of the communication device according to the fifth embodiment. Hereinafter, the operation will be described with reference to FIG.
- the LDPC encoding unit 11 of the transmission side communication apparatus encodes the transmission information by setting the encoding rate to 1/2 (step S51).
- the puncture unit 51 punctures the error bits of the code generated by the LDPC code key unit 11 so that the code bit length required by the communication system is obtained (step S52).
- the specific puncture procedure is shown below. In the following puncture procedure, k is the number of information bits, n is the code bit length required by the system, and q is a power of 2 and is changed according to the maximum code rate. Note that the parity bit length is the same as the information bit length because it is assumed that a code with a coding rate of 1Z2 is punctured.
- the puncture unit 51 determines the number of divisions s of NOR bits using the following equation (14).
- Equation (15) shows that the first NORITY bit is assigned to the j-th bit of the i-th block.
- the puncture unit 51 executes an operation according to FIG. 23-1, which is a flowchart showing an example of the puncture process, and outputs a code bit after puncture. Specifically, the puncture unit 51 first reads the rth bit (0 ⁇ j ⁇ number included in block).
- step S52-7 the process proceeds to step S52-3 (step S52-5).
- the parity bit string immediately after the sign is called the encoded parity bit string
- the parity bit string after the puncture is called the transmission order parity bit string.
- FIG. 23-2 is a diagram showing an example of bit replacement by the puncture process (the process shown in FIG. 23-1).
- the puncture unit 51 prepares q storage locations for the encoded parity bit string, and also stores the leading force in order. Then, all the 0th bit of the storage destination, all the bits of the storage destination qZ2th, all the bits of the storage destination qZ4th, hereafter, the storage destination 3qZ4th, qZ8th, 3qZ8th, 5qZ8 Read all the bits in the order of the 7th, 7qZ, 8th, etc. to obtain the transmission order parity bit string.
- the encircled numbers 1 to 8 indicate the bit reading order.
- the puncture unit 51 passes n bits, which are a combination of the k-bit information bit string and the transmission order parity bit string, to the signal transmission unit 13.
- the signal transmission unit 13 transmits the received information bit sequence and transmission order parity bit sequence to the receiving-side communication device (step S53).
- the depuncture unit 52 performs the processing performed by the puncture unit 51.
- the reverse processing of the processing (the processing shown in Equation (14) and Equation (15) and the processing shown in 023-1) is performed, and the reception LLR is returned to the bit position immediately after the sign key as shown in FIG. (Debanker is performed) and passed to the decryption unit (step S56).
- LLR is set to 0 and passed to the decoding unit.
- the depuncture unit 52 obtains in advance information related to puncture processing performed on the transmission side, and performs depuncture based on this information.
- the LDPC decoding unit 16 performs decoding based on the received LLR and outputs a decoding result (step S57).
- IR when IR is performed, the leading force of the untransmitted bits of the transmission order parity bits may be output in order.
- Figure 24 shows an example of computer simulation results for information transmission using the above procedure. The conditions for obtaining the computer simulation results shown in Fig.
- an additive white Gaussian channel is used, an LDPC code with a standard coding rate of 1Z2 is generated by the LDPC code generation procedure described in Embodiment 1, and Information length is 1440 bits, sign rate after puncture is 1Z2 (in this case, no puncture), 3Z5, 2/3, 3/4, 4/5, 5/6, 7/8, 8Z9
- the modulation method is BPSK.
- the decoding method for LDPC codes is the Sum-Product decoding method, and the number of repetitions is 100. From the results shown in FIG. 24, in the present embodiment, bit rate code rate setting and IR are possible, and any code rate is close to the Shannon limit, indicating decoding performance. I can tell you.
- an LDPC code having a code rate of 1Z2 is used as a reference code, and the bit position to be punctured using the procedure as described above is represented by a code rate “2”.
- ⁇ power Z (power of 2 + 1) '' it is determined that the positions are equally spaced, and in the case of other coding rates, it is the smallest that is smaller than the sign rate.
- power of 2 Z power of 2 + 1
- FIG. 25 is a diagram illustrating a configuration example of a communication apparatus according to the sixth embodiment.
- the transmitter included in the communication apparatus of the present embodiment has a configuration including a transmission adjustment unit 61, an LDPC code unit l ie, and a signal transmission unit 13, and the receiver includes a signal reception unit 14, reception adjustment.
- the configuration includes the unit 62 and the LDPC decoding unit 16e.
- Signal transmitter 13 and signal receiver 14 are the same as signal transmitter 13 and signal receiver 14 included in the communication device of the first embodiment.
- FIG. 26 is a diagram illustrating an example of an operation in which the communication apparatus according to the sixth embodiment transmits and receives signals.
- the transmission adjustment unit 61 corresponding to the bit length adjustment means according to claim 7 generates the information bit length requested by the system (bit length of information to be transmitted) prepared for LDPC code generation. If it does not match the size of the matrix, an adjustment bit is inserted into the information bits (transmission information) and passed to the LD PC encoding unit l ie.
- the LDPC code can be coded when “(number of columns)-(number of rows)” of the generator matrix matches the information bit length, but the information bit length required by the system is In some cases, the length of transmission information determined by the check matrix is shorter. In such a case, as shown in FIG. 26, the transmission adjustment unit 61 adjusts the number of bits by inserting 0 at the beginning or end of the transmission information by the insufficient number of bits, and LDPC-encodes the adjusted transmission information. Outputs to part l ie.
- the LDPC code key unit lie performs the same processing as the LDPC encoding unit 11 of the first embodiment and performs LDPC code key (generation of encoded bits) of the transmission information including the adjustment bits. I do. Then, the code bit after the adjustment bit is removed from the generated code key bit is output to the signal transmission unit 13.
- LDPC codes with an LDGM structure in which a check matrix and a generation matrix are shared by using only an LDPC code that requires a generation matrix separately from the check matrix.
- the reception adjustment unit 62 inserts an adjustment bit (dummy bit) into the reception LLR received from the signal reception unit 14, It is passed to the LDPC decoder 16e.
- the LDPC decoder 16e Decoding is performed based on the transmission LLR, but the LLR corresponding to 0 inserted by the transmission adjustment unit 61 performs decoding by inputting a value set as a positive value as large as possible as the adjustment LLR (Fig. 26). In this example, a force 1 that inserts 0 may be inserted as an adjustment bit. In that case, the reception adjustment unit performs decoding by setting the smallest possible negative value as the adjustment LLR.
- FIG. 27 is a flowchart showing an example of the operation of the communication apparatus according to the sixth embodiment. Hereinafter, the operation will be described with reference to this figure. Note that the same step number is assigned to the same process as the operation of the communication apparatus of Embodiment 1 (see FIG. 4). Here, the processing different from that of the first embodiment will be mainly described.
- the reception adjustment unit 62 receives the check matrix and the information bits required by the system. Based on the length, calculate the number of bits inserted at the time of sign key, and if the inserted bit is 0, adjust the positive value sufficiently large (to the extent that does not affect the decoding performance). And pass it to the LDPC decoder 16e. On the other hand, if the inserted bit is 1, a sufficiently small negative value is inserted as an adjustment LLR into the reception LLR and passed to the LDPC decoding unit 16e (step S63).
- the LDPC decoding unit 16e Based on the reception LLR received from the reception adjustment unit 62, the LDPC decoding unit 16e performs decoding, removes the adjustment bits, and outputs the decoded result (step S64). Note that 0 or 1 of the bit to be inserted may be defined in advance as a communication system.
- the decoding performance may vary greatly depending on the insertion position.
- the decoding performance of LDPC code depends greatly on the degree distribution. To do.
- a place where the influence on performance is small may be determined in advance as the adjustment bit insertion position.
- the last bit has many bits of the same degree and the first bit has relatively few bits of the same degree. .
- inserting the adjustment bit at the end rather than inserting the adjustment bit at the end has less influence on the degree distribution and can maintain high decoding performance.
- it is possible to improve the error correction capability by determining the insertion position of the adjustment bit as the head, tail, or middle part of the information bit by using the feature of the degree distribution.
- the transmitter when the size of the LDPC code and the information bit length required by the system are different, the transmitter inserts a predetermined 0 or 1 as the number of insufficient bits. After adjusting the information bits, the encoding process is executed, while the receiver inserts the adjustment LLR into the reception LLR and then executes the decoding process. As a result, even when the size of the LDPC code differs from the information bit length required by the system, the transmission information can be transmitted after being encoded into the LDPC code.
- FIG. 28 is a diagram illustrating a configuration example of a decoding device included in the communication device according to the seventh embodiment.
- This decoding apparatus constitutes an LDPC decoding unit included in any one of the communication apparatuses shown in the above-described embodiments 1 to 6, a row processing unit 71 that performs row processing related to decoding of an LDP C code, and an LDPC code A column processing unit 72 that performs column processing related to decoding, and a hard decision unit 73 that performs hard decision to obtain a decoding result.
- the column processing unit 72 includes a column processing unit 72-1 that performs normal column processing, a column processing unit 72-2 that performs column processing of column degree 2, and a column processing unit 72 that performs column processing of column degree 1 Including 3.
- a column processing unit 72-1 that performs normal column processing
- a column processing unit 72-2 that performs column processing of column degree 2
- a column processing unit 72 that performs column processing of column degree 1 Including 3.
- Ec. A bit having 1 in node m .
- N (m) ⁇ n indicates a set excluding n
- M (n) ⁇ m indicates a set excluding m.
- the row processing unit 71 performs a process represented by the following equation (16).
- the column processing unit 72 when processing the column corresponding to the information bits, the column processing unit 72-1 uses the following equation (17).
- the column processing unit 72-2 performs the processing shown in the following equation (18).
- column processing B when processing a column corresponding to a parity bit and having a column degree of 1, the column processing unit 72-3 performs processing shown in the following equation (19) (hereinafter referred to as column Execute process C).
- Z (i) F ••• (19)
- FIG. 29 is a flowchart showing an example of the operation of the decoding apparatus according to the seventh embodiment. Hereinafter, the operation will be described with reference to this diagram.
- the row processing unit 71 performs row processing (see the above equation (16)) for the reception LLR a predetermined number of times (M times ) to obtain ⁇ (i) (steps S71 and S72).
- ⁇ (i) is input from the row processing unit 71, m, nm, n
- the column processing unit 72 determines the column order determination (value of n) in order to select the processing to be performed on the input signal. (Step S73).
- the column processing unit 72-1 executes the column processing A (step S74-1).
- the column processing unit 72-2 executes the above column processing B (step S74-2), and the column order is the column corresponding to the noti bit.
- the column processing unit 72-3 executes the column processing C (step S74-3). Thereafter, the column processing unit 72 executes column processing (the force of any of steps S74-1 to S74-3) a predetermined number of times (N times ) to obtain Z (i) (steps S73, S74-l to 74). -3, S7 m, n
- the row processing unit 71 and the column processing unit 72 repeatedly execute the above-described row processing and column processing until the maximum number of times is reached, and when the repetition ends, the column processing unit 72 changes Z ( i) to Z ( i) . (i) is output to the hard decision unit 73 (step S76, Yes).
- Z (D m, nnn is input from the column processing unit 72
- the hard decision unit 73 generates and outputs a decoded bit (step S77).
- the decoded bit generated here is a bit corresponding to an information bit. Only.
- Fig. 30-1 shows an example of processing when the column order is 2 and the above-described column processing A is used.
- Fig. 30-2 shows the case where the column order is 2 and the above-mentioned column processing B is executed. An example of processing when used is shown below.
- Fig. 30-3 shows an example of processing when the column order is 1 and the above column processing A is used.
- Fig. 30-4 shows the case where the column order is 1 and the above column processing C is used. An example of processing is shown below.
- FIG. 31 is a diagram showing a configuration example of an eighth embodiment of a decoding device useful for the present invention.
- the decoding apparatus includes an initialization unit 81 that initializes decoding processing, a decoding core unit 82 that updates reliability information related to decoding of an LDPC code, and a hard decision to obtain a decoding result. And a hard decision unit 83 for judging a stop criterion for iterative decoding.
- the decoding core unit 82 has, as a partial configuration, a minimum value selection unit 821 for selecting a minimum three values, an update unit 822 for calculating and updating a new reliability, and information for holding update information A holding part 823 is provided.
- Stepl reliability information update
- ⁇ minimum index
- nl minimum index except tnO
- n2 min imum index except ⁇ nO, nl ⁇ .
- Step 2 hard decision 'stop criterion
- the estimated codeword c ′ [c ′] is determined using the following equation (25).
- Step l and Step2—1 Check whether the number of executions of Step l and Step2—1 has reached the maximum number of repetitions.
- Step l—l to Step 2-1 the processing from Step l—l to Step 2-1 is executed again.
- FIG. 32 is a flowchart showing processing of the decoding device according to the present embodiment. Hereinafter, the operation of the decoding apparatus will be described with reference to FIG. 31 and FIG.
- LLR is input as received information
- the initialization unit 81 initializes the information holding unit 821 in accordance with the algorithm initialization (initialization process) described above (steps S81 and S82).
- the decoding core unit 82 executes processing (step # 1) according to Step l (updating reliability information) of the algorithm described above.
- the minimum value selection unit 822 reads the information holding unit 821 force Z ( ⁇ and ⁇ ( "(Step S83), and then calculates ⁇ ( " (Step nm, nm, n
- step S84 the calculation result force in step S84 is selected from the three whose absolute values are smaller (step S85).
- the update unit 823 calculates ⁇ from the selected value, and the positive value of Z (1 >
- the updated value of ⁇ (1) is calculated from ⁇ (1) (step S87). Lastly, the update unit 823 is responsible for these ( ⁇ m, nnm
- part 82 The processing of part 82 is finished.
- the hard decision unit 83 executes a process (step # 2) according to Step 2 (hard decision 'stop criterion) of the above-described algorithm. Specifically, the hard decision unit 83 executes Z ( hard decision) in Step 2-1 above to obtain an estimated codeword, performs a noity check on the estimated codeword, and further determines whether or not to stop repeated decoding. (Step S89) If the stop criterion is satisfied, the decoding process ends and the decoding result is output (Step S 91), otherwise, the processing of the decoding core unit 82 is repeated (step S90).
- step S91 Thereafter, the iterative process is continued until the stop criterion is satisfied in the process corresponding to step S89 in each iterative process (step S90,..., Step S90g). Output (step S91).
- reception LLR is input.
- reception information after demodulation processing is input to a decoding device, and reception LLR is calculated in initialization processing of decoding processing. May be.
- Equation (21) which represents the update process of reliability information, shows a case where the simplification is made using up to the first order term of the function dominant in updating according to Non-Patent Document 4, but Non-Patent Document 4 Any approximation that is suitable for implementation can be used, such as using an update formula that ignores the dominance and ignores the approximation of the other function.
- Embodiment 9 will be described.
- a communication system to which the communication device according to any of the first to eighth embodiments described above is applied will be described.
- the LDPC code processing and decoding processing according to the present invention described in Embodiments 1 to 8 are, for example, mobile communication (terminal, base station), wireless LAN, optical communication, satellite communication, quantum cryptography.
- the present invention can be applied to all communication devices such as devices, and specifically, a device that executes LDPC encoding processing and decoding processing according to the present invention is mounted on each of the above communication devices to perform error correction.
- FIG. 33 is a diagram showing a configuration example of a mobile communication system to which the communication apparatus according to the present invention is applied.
- mobile terminal 100 has physical layer LDPC encoder 101, modulator 102, demodulator 103, physical layer LDPC decoder 104, and antenna 105 in the physical layer.
- the base station 200 includes a physical layer LDPC decoder 201, a demodulator 202, a modulator 203, a physical layer LDPC encoder 204, and an antenna 205 in the physical layer.
- the physical layer LDPC encoders 101 and 204 of the mobile terminal 100 and the base station 200 include the LPDC code encoders of the communication apparatuses described in the first to seventh embodiments.
- the mobile terminal 100 transmits and receives information data via the base station 200
- the physical layer LDPC encoder 101 for the fading channel encodes transmission data (information data) in units of packet data. This encoded data is transmitted to the wireless communication path via the modulator 102 and the antenna 105.
- base station 200 receives a received signal including an error that has occurred in the wireless communication path via antenna 205 and demodulator 202, and physical layer LDPC decoder 201 receives from demodulator 202. Performs error correction on the received data after demodulation. Then, the physical layer LDPC decoder 201 notifies the upper layer whether or not the error correction executed in units of packets has succeeded. If error correction is successful, the upper layer transfers the packet (information packet) containing this information data to the communication partner via the network as decoded data.
- base station 200 encodes mobile terminal 100 by performing processing reverse to the information data transmission operation of mobile terminal 100 described above. Send data and play back the data received by mobile terminal 100
- base station 200 transmits encoded data to mobile terminal 100
- physical layer LDPC encoder 204 for fading communication path transmits transmission data (information data). Sign in packet data units. This code data is sent to the wireless communication path via the modulator 203 and the antenna 205.
- the mobile terminal 100 receives a received signal including an error generated in the wireless communication channel via the antenna 105 and the demodulator 103, and receives the demodulated signal received by the physical layer LDPC decoder 104 from the demodulator 103. Correct data errors. Then, the physical layer LDPC decoder 104 notifies the upper layer whether or not the error correction executed for each packet is successful.
- the communication device described in any of Embodiments 1 to 8 described above is applied to a communication system (base station and mobile terminal). This This makes it possible to build a communication system with improved error correction capability (decoding capability) Industrial applicability
- the communication apparatus according to the present invention is useful for a communication system, and is particularly suitable for a communication apparatus having an error correction function using an LD PC code.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mathematical Analysis (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Radio Transmission System (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP07738674A EP1998454A4 (en) | 2006-03-17 | 2007-03-15 | COMMUNICATION DEVICE, DECODING DEVICE, INFORMATION TRANSMITTING METHOD, AND DECODING METHOD |
US12/293,355 US20090138785A1 (en) | 2006-03-17 | 2007-03-15 | Communication device, decoding device, information transmission method, and decoding method |
JP2008506269A JPWO2007108396A1 (ja) | 2006-03-17 | 2007-03-15 | 通信装置、復号装置、情報伝送方法および復号方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2006075513 | 2006-03-17 | ||
JP2006-075513 | 2006-03-17 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2007108396A1 true WO2007108396A1 (ja) | 2007-09-27 |
Family
ID=38522426
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2007/055224 WO2007108396A1 (ja) | 2006-03-17 | 2007-03-15 | 通信装置、復号装置、情報伝送方法および復号方法 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20090138785A1 (ja) |
EP (1) | EP1998454A4 (ja) |
JP (1) | JPWO2007108396A1 (ja) |
KR (1) | KR20080104376A (ja) |
WO (1) | WO2007108396A1 (ja) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009094805A1 (en) * | 2008-01-25 | 2009-08-06 | Panasonic Corporation | Radio communication apparatus and interleaving method |
JP2009303197A (ja) * | 2008-06-17 | 2009-12-24 | Samsung Electronics Co Ltd | 低密度パリティコードエンコーディング/デコーディング装置及びその方法並びにコンピュータ読み取り可能な記録媒体 |
JP2010041252A (ja) * | 2008-08-01 | 2010-02-18 | Toyota Central R&D Labs Inc | 通信方法および通信装置 |
JP2011512106A (ja) * | 2008-02-11 | 2011-04-14 | サムスン エレクトロニクス カンパニー リミテッド | 低密度パリティ検査符号を使用する通信システムにおけるチャネル符号化及び復号化方法並びにその装置 |
JP2011109228A (ja) * | 2009-11-13 | 2011-06-02 | Mitsubishi Electric Corp | 復号装置及び方法 |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4885960B2 (ja) * | 2006-07-26 | 2012-02-29 | 独立行政法人科学技術振興機構 | 秘密通信方法及びその秘密通信装置 |
WO2008132813A1 (ja) * | 2007-04-17 | 2008-11-06 | Panasonic Corporation | 無線通信装置および無線通信方法 |
KR100970645B1 (ko) | 2007-12-24 | 2010-07-15 | 엘지전자 주식회사 | 블록 코드를 이용한 다양한 길이를 가진 정보의 채널 코딩방법 |
TR201812378T4 (tr) | 2007-12-24 | 2018-09-21 | Lg Electronics Inc | Bir (32,11) blok kodu ve bir (20,o) blok kodunu değişken uzunlukta o ile kullanan kanal kodu. |
US8448041B1 (en) | 2010-02-01 | 2013-05-21 | Sk Hynix Memory Solutions Inc. | Multistage LDPC encoding |
US8572463B2 (en) * | 2010-02-01 | 2013-10-29 | Sk Hynix Memory Solutions Inc. | Quasi-cyclic LDPC encoding and decoding for non-integer multiples of circulant size |
US8443257B1 (en) | 2010-02-01 | 2013-05-14 | Sk Hynix Memory Solutions Inc. | Rate-scalable, multistage quasi-cyclic LDPC coding |
US8504894B1 (en) | 2010-03-04 | 2013-08-06 | Sk Hynix Memory Solutions Inc. | Systematic encoding for non-full row rank, quasi-cyclic LDPC parity check matrices |
EP2560311A1 (en) * | 2011-08-17 | 2013-02-20 | Panasonic Corporation | Cyclic-block permutations for spatial multiplexing with quasi-cyclic LDPC codes |
JP5826852B2 (ja) * | 2011-08-30 | 2015-12-02 | パナソニック株式会社 | Sc−fdma送信装置及び送信方法 |
JP2014045436A (ja) * | 2012-08-28 | 2014-03-13 | Jvc Kenwood Corp | 送信装置、受信装置、送信方法、受信方法 |
WO2014108982A1 (ja) | 2013-01-11 | 2014-07-17 | パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ | データ処理方法、プリコーディング方法、通信装置 |
US9774352B2 (en) * | 2013-09-17 | 2017-09-26 | Samsung Electronics Co., Ltd. | Transmitting apparatus, and puncturing method thereof |
EP3070850B1 (en) * | 2013-11-15 | 2019-07-17 | Nippon Hoso Kyokai | Encoder and decoder for an ldpc code of rate 93/120 and length 44880 |
DE102014213071A1 (de) * | 2014-07-04 | 2016-01-07 | Robert Bosch Gmbh | Verfahren und Vorrichtung zur Verarbeitung von Daten |
US11296823B2 (en) * | 2017-05-30 | 2022-04-05 | Qualcomm Incorporated | Priority based mapping of encoded bits to symbols |
US11750321B2 (en) * | 2019-12-03 | 2023-09-05 | Intel Corporation | Peak rate enhancement for constellation shaping |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2005039585A (ja) | 2003-07-16 | 2005-02-10 | Science Univ Of Tokyo | 情報送信方法及び装置 |
JP2005160106A (ja) * | 2003-11-26 | 2005-06-16 | Lucent Technol Inc | 通信システムにおいて情報を符号化および復号化するための非組織的反復累積符号 |
JP2005277784A (ja) | 2004-03-24 | 2005-10-06 | Toshiba Corp | Lpc符号を用いた符号化ビットのマッピング方法及び送信装置、受信装置 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6938196B2 (en) * | 2001-06-15 | 2005-08-30 | Flarion Technologies, Inc. | Node processors for use in parity check decoders |
DE10236510A1 (de) * | 2002-08-09 | 2004-02-19 | Grünenthal GmbH | Verfahren zur Herstellung von 2-[(Dimethylamino)methyl]-1-(3-methoxyphenyl)cyclohexanol |
US7395494B2 (en) * | 2003-12-22 | 2008-07-01 | Electronics And Telecommunications Research Institute | Apparatus for encoding and decoding of low-density parity-check codes, and method thereof |
FI121431B (fi) * | 2004-09-13 | 2010-11-15 | Tamfelt Pmc Oy | Paperikoneessa käytettävä kudosrakenne ja menetelmä sen valmistamiseksi |
JP2008529448A (ja) * | 2005-02-03 | 2008-07-31 | エージェンシー フォー サイエンス,テクノロジー アンド リサーチ | データの送信方法、データの受信方法、送信機、受信機、並びにコンピュータプログラム製品 |
KR100946884B1 (ko) * | 2005-07-15 | 2010-03-09 | 삼성전자주식회사 | 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서 채널인터리빙/디인터리빙 장치 및 그 제어 방법 |
-
2007
- 2007-03-15 JP JP2008506269A patent/JPWO2007108396A1/ja active Pending
- 2007-03-15 US US12/293,355 patent/US20090138785A1/en not_active Abandoned
- 2007-03-15 WO PCT/JP2007/055224 patent/WO2007108396A1/ja active Application Filing
- 2007-03-15 KR KR1020087025292A patent/KR20080104376A/ko not_active Application Discontinuation
- 2007-03-15 EP EP07738674A patent/EP1998454A4/en not_active Withdrawn
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2005039585A (ja) | 2003-07-16 | 2005-02-10 | Science Univ Of Tokyo | 情報送信方法及び装置 |
JP2005160106A (ja) * | 2003-11-26 | 2005-06-16 | Lucent Technol Inc | 通信システムにおいて情報を符号化および復号化するための非組織的反復累積符号 |
JP2005277784A (ja) | 2004-03-24 | 2005-10-06 | Toshiba Corp | Lpc符号を用いた符号化ビットのマッピング方法及び送信装置、受信装置 |
Non-Patent Citations (4)
Title |
---|
"100Mbit/s SDM-COFDM over MIMO Channel for Broadband Mobile Communications", TECHNICAL REPORT OF IEICE RCS2001-135, October 2001 (2001-10-01), pages 37 - 42 |
"Low-density parity-check codes and their decoding method LDPC (Low Density Parity Check) codes/sum-product decoding method", TRICEPS, 5 June 2002 (2002-06-05), pages 76 - 99 |
L. SAKAI; W. MATSUMOTO; H. YOSHIDA, LOW COMPLEXITY DECODING ALGORITHM FOR LDPC CODES AND ITS DISCRETIZED DENSITY EVOLUTION, July 2005 (2005-07-01), pages 13 - 18 |
See also references of EP1998454A4 |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009094805A1 (en) * | 2008-01-25 | 2009-08-06 | Panasonic Corporation | Radio communication apparatus and interleaving method |
JP2011512106A (ja) * | 2008-02-11 | 2011-04-14 | サムスン エレクトロニクス カンパニー リミテッド | 低密度パリティ検査符号を使用する通信システムにおけるチャネル符号化及び復号化方法並びにその装置 |
JP2014030247A (ja) * | 2008-02-11 | 2014-02-13 | Samsung Electronics Co Ltd | 低密度パリティ検査符号を使用する通信システムにおけるチャネル復号化方法及びその装置 |
JP2009303197A (ja) * | 2008-06-17 | 2009-12-24 | Samsung Electronics Co Ltd | 低密度パリティコードエンコーディング/デコーディング装置及びその方法並びにコンピュータ読み取り可能な記録媒体 |
JP2010041252A (ja) * | 2008-08-01 | 2010-02-18 | Toyota Central R&D Labs Inc | 通信方法および通信装置 |
JP2011109228A (ja) * | 2009-11-13 | 2011-06-02 | Mitsubishi Electric Corp | 復号装置及び方法 |
Also Published As
Publication number | Publication date |
---|---|
EP1998454A4 (en) | 2010-04-28 |
EP1998454A1 (en) | 2008-12-03 |
JPWO2007108396A1 (ja) | 2009-08-06 |
KR20080104376A (ko) | 2008-12-02 |
US20090138785A1 (en) | 2009-05-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2007108396A1 (ja) | 通信装置、復号装置、情報伝送方法および復号方法 | |
US11133825B2 (en) | Apparatus and method for channel encoding/decoding in communication or broadcasting system | |
US8286065B2 (en) | Method and apparatus for channel encoding and decoding in a communication system using low-density parity-check codes | |
US11646818B2 (en) | Method and apparatus for encoding/decoding channel in communication or broadcasting system | |
AU2012207771A1 (en) | Apparatus and method for transmittng and receiving data in communication/broadcasting system | |
JPWO2007080827A1 (ja) | 検査行列生成方法 | |
US11101926B2 (en) | Method and apparatus for channel encoding and decoding in communication or broadcasting system | |
US11791845B2 (en) | Method and apparatus for channel encoding and decoding in communication or broadcasting system | |
KR102549344B1 (ko) | 통신 또는 방송 시스템에서 채널 부호화/복호화 방법 및 장치 | |
US12021618B2 (en) | Method and apparatus for channel encoding and decoding in communication or broadcasting system | |
US20230421177A1 (en) | Apparatus and method for channel encoding/decoding in communication or broadcasting system | |
KR101276845B1 (ko) | 복수의 레이어들을 이용하여 ldpc 복호화를 수행하는방법 | |
KR102302366B1 (ko) | 통신 또는 방송 시스템에서 채널 부호화/복호화 방법 및 장치 | |
KR102445150B1 (ko) | 통신 또는 방송 시스템에서 채널 부호화/복호화 방법 및 장치 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 07738674 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2008506269 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007738674 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12293355 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020087025292 Country of ref document: KR |