JP2011119933A - Receiving device, receiving method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a receiving device, a receiving method, and a program which enable more rapid decoding. <P>SOLUTION: A decoding processing section 42 applies decoding processing according to coded data to received data stored in a received data memory 41 to acquire decoded data, and supplies its likelihood information to a control section 45. An error detecting section 44 detects an error of decoded data stored in a decoded data memory 43, and supplies a result of error detection to the control section 45. The control section 45 determines the continuation or discontinuation of decoding in the decoding processing section 42 from the likelihood information supplied from the decoding processing section 42, the result of error detection of the decoded data by the error detecting section 44, and the number of repetitions of decoding in the decoding processing section 42, and controls the continuation or discontinuation of decoding of the decoding processing section 42 in accordance with the determination. The present invention can be applied to a receiving device such as a portable telephone terminal. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a receiving device, a receiving method, and a program.

  Currently, 3GPP (Third Generation Partnership Project) is standardizing a new communication method as LTE (Long Term Evolution). One of the transport channels used in LTE is DCI (Downlink Control Information). The DCI is a control channel that is received by a UE (User Equipment) on a cell for communication with a base station, and is a TTI (Transmit Time Interval) of Sub-frame (1 ms). Also, DCI transmission specifications have characteristics, and information for a plurality of UEs is concatenated and transmitted.

  DCI encoding processing mainly includes CRC (Cyclic Redundancy Check) addition, CRC masking, convolutional encoding, rate matching, data multiplexing, and scrambling (for example, Non-Patent Document 1 and Non-Patent Document 1). Reference 2). That is, as shown in FIG. 9, first, a 16-bit CRC obtained as a result of the CRC calculation is added to the information to be transmitted, and the added CRC portion is masked with a separately acquired 16-bit masking pattern (exclusive This is convolutionally coded, and then rate matching is performed for the purpose of adjusting the data size by iterating or thinning data, and data for multiple UEs is concatenated and multiplexed, and finally Scrambling Processing is performed. Thereafter, the data is modulated and transmitted as a PDCCH (Physical Downlink Control Channel).

  As described above, since the DCI in which data for a plurality of UEs is multiplexed is transmitted, the UEs that receive the PDCCH have different data extraction positions. The data extraction position is calculated based on RNTI (Radio Network Temporary ID) specified for each UE. However, the position where the data for each UE is arranged cannot be uniquely determined from the calculation result, and only a candidate area (referred to as Search Space) is narrowed down (for example, non-patent document). 2 and Non-Patent Document 3).

  Hereinafter, Search Space will be described.

  As a result of the encoding process, all DCIs are matched to a unit called CCE (Control Channel Element), and the number of CCEs is rate-matched to any one of 1, 2, 4, and 8 sizes. That is, the size of 1CCE is 72 bits, and the DCI data size after rate matching is 72 bits for 1CCE, 144 bits for 2CCE, 288 bits for 4CCE, and 576 bits for 8CCE. The number of rate-matched CCEs is referred to as an aggregation level. At the time of multiplexing, data with an aggregation level of L is mapped to a position that satisfies i mod L = 0 for the CCE number that is i after multiplexing. Note that i as a CCE number takes any value from 0 to Ncce-1 when the total number of CCEs is Ncce. A CCE to which no DCI is mapped (CCE not assigned to UE) is modulated with an amplitude of zero.

On the other hand, in each UE that performs decoding, it is unknown how many aggregation levels of data for itself (own UE) are, and it is necessary to search for all aggregation levels of 1, 2, 4, and 8. Each aggregation
Level Search Space Sk (L) is calculated as shown in Equation (1).

Sk (L) = L * {(Yk + m) mod floor (Ncce / L)} + i
... (1)

  In Expression (1), the sub-frame number indicated by k is 0 to 9, and the aggregation level is indicated by L. The CCE number i is 0 to L-1. The candidate number is indicated by m. As shown in FIG. 10, the number of candidates varies depending on the type of search space (Common or UE-Specific). Also, Yk differs depending on the type of Search Space like the candidate number, and is 0 in the case of a Common Search Space searched by all UEs, and in the case of a UE-Specific Search Space in which the search position is different for each UE, from RNTI, It is determined as shown in equation (2).

Yk = (A * Yk-1) mod D
... (2)
However, Y-1 is RNTI, and A = 39827 and D = 65537.

  Examples of Search Spaces of two UEs having different RNTIs calculated from Equation (1) and Equation (2) are shown in FIGS. As shown in FIG. 11 and FIG. 12, the Common Search Space is the same area for each UE. However, the UE-Specific Search Space basically differs for each UE, and UE-Specific Search Spaces of different UEs may overlap each other. In addition, the area where each UE performs a search is a total of 6 locations in the Common Search Space, 4 locations of L = 4 (288 bits) and 2 locations of L = 8 (576 bits), in the UE-Specific Search Space. , L = 1 (72 bits), 6 places, L = 2 (144 bits), 2 places, L = 4, and 2 places, L = 8. Since the UE decodes these Search Spaces with two kinds of decoding sizes (sizes after adding CRC bits to information bits), the number of decoding times is twice the number of candidate positions. That is, from (16 + 6) × 2, each UE needs to perform 44 decoding processes at the maximum.

  However, the number of DCIs to be acquired by each UE is at most several, and most of the Search Space used in the 44 decoding processes includes DCIs for other UEs, or for any UE. The DCI is not arranged and cannot be decoded.

  In 3GPP-LTE, a tail-biting convolutional code whose correction capability is improved by iterative decoding is employed as a DCI encoding method (see, for example, Non-Patent Document 1). Since the decoding processing time in the UE depends on the number of iterations, it is important how to reduce the time required for the iterative processing in reducing the entire decoding processing time.

  As described above, in the DCI acquisition, 44 times of decoding is performed, and most of them cannot be decoded (decoding is impossible). For this reason, it is desirable that decoding of an undecodable area can be completed early without iterative decoding.

3GPP TS 36.212 V8.7.0 pp.43-56 3GPP TS 36.211 V8.7.0 pp.58-59 3GPP TS 36.213 V8.7.0 pp.64-65

  Conventionally, a decoding device that decodes encoded data that can be iteratively decoded performs error detection on the decoding result, stops if no error is detected, outputs the decoding result, and repeats if an error is detected Decoding is performed, and error detection is repeated or decoding is repeated up to a predetermined number of times. For this reason, much processing time is required for encoded data whose error detection result is not OK (error is detected).

  In particular, when DCI for other UEs is placed in the search space of own (own UE), the decoding is erroneous due to the difference in masking pattern applied to CRC even though the likelihood of the decoding result is high. Since a situation occurs in which the detection result does not become OK (error is detected), it is conceivable to use this to stop iterative decoding early. In a low noise environment (with a small amount of noise), decoding of Search Space where no DCI is placed has a data amplitude of almost zero, so the likelihood of the decoding result is extremely small, and the error detection result is also OK. Therefore, it is conceivable to use this to stop iterative decoding at an early stage.

  Therefore, an object of the present invention is to solve the above-described problem, that is, to provide a receiving device, a receiving method, and a program that can decode more quickly.

  In order to solve the above-mentioned problem, one aspect of the receiving apparatus of the present invention is that information directed to itself is arranged among received data in which information directed to oneself and information directed to another receiving apparatus are multiplexed. A decoding device that acquires information directed to itself by repeatedly decoding a candidate region to be performed by decoding the candidate region of received data and acquiring likelihood information; Detecting means for detecting an error from the decoding result decoded by the decoding means; and either continuing or stopping the decoding of the candidate area of the received data based on the likelihood information and the error detection result. Determining means for determining.

  In addition to the above-described configuration, one aspect of the receiving apparatus of the present invention is that the determining unit determines to stop decoding repetition when no error is detected from the decoding result.

  Furthermore, in addition to the above-described configuration, one aspect of the receiving apparatus of the present invention is that the determination unit stops the repetition of decoding when an error is detected from the decoding result and the likelihood information is equal to or greater than a predetermined threshold. Is to determine.

  Furthermore, in addition to the above-described configuration, one aspect of the reception apparatus of the present invention is that the determining unit is configured to repeat decoding when an error is detected from a decoding result and the likelihood information is equal to or less than a predetermined threshold. It is a decision to stop.

  In addition, according to one aspect of the reception method of the present invention, out of reception data in which information for a reception apparatus and information for another reception apparatus are multiplexed, candidates for information for the reception apparatus are arranged. A receiving method for a receiving apparatus that acquires information directed to a receiving apparatus by repeatedly decoding a region multiple times, decoding a candidate area of received data and acquiring likelihood information; and The detection step for detecting an error from the decoding result decoded in the decoding step, and the likelihood information and the error detection result indicate whether to continue or stop the decoding of the candidate area of the received data. And a determination step for determining.

  Furthermore, one aspect of the program of the present invention is a candidate area in which information for a receiving device is arranged among received data in which information for a receiving device and information for another receiving device are multiplexed. In the decoding step of decoding the candidate region of the received data and acquiring the likelihood information in the computer of the receiving device that acquires the information directed to the receiving device by repeatedly decoding a plurality of times, and in the decoding step A detection step for detecting an error from the decoded decoding result, and a determination step for determining whether to continue or stop the decoding of the candidate area of the received data from the likelihood information and the error detection result To perform processing including.

  According to one aspect of the present invention, it is possible to provide a receiving device, a receiving method, and a program that can be decoded more quickly.

It is a block diagram which shows the whole structure of the communication system in one embodiment of this invention. 6 is a block diagram illustrating an example of a configuration of a decoding unit 23. FIG. 12 is a block diagram illustrating another example of the configuration of the decoding unit 23. FIG. It is a flowchart explaining the process of determination of stop / continuation of decoding. It is a figure explaining the conventional iterative decoding. It is a figure explaining iterative decoding by the user terminal. It is a figure explaining iterative decoding by the user terminal. It is a block diagram which shows the structural example of the hardware of a computer. It is a figure explaining the encoding process of DCI in 3GPP-LTE. It is a figure which shows the number of the search candidates for every combination of Search Space type and aggregation level of PDCCH in 3GPP-LTE. It is a figure which shows the example of Search Space. It is a figure which shows the example of Search Space.

  Hereinafter, a communication system according to an embodiment of the present invention will be described with reference to FIGS.

  FIG. 1 is a block diagram showing the overall configuration of a communication system according to an embodiment of the present invention. As shown in FIG. 1, the transmission side is, for example, a base station 10, and the base station 10 includes an encoding unit 11, a modulation unit 12, a D / A (Digital Analog) conversion unit 13, and an antenna 14. The receiving side is, for example, a user terminal 20, and the user terminal 20 includes an antenna 24, an A / D (Analog Digital) conversion unit 21, a demodulation unit 22, and a decoding unit 23. The user terminal 20 is a wireless communication device, and can be a mobile phone terminal, for example.

  In the base station 10, for example, first, a central processing unit (CPU) (not shown) of the base station 10 inputs data to be transmitted to the encoding unit 11 as information bits. The encoding unit 11 adds CRC to the input information bits and performs convolutional encoding. The modulation unit 12 modulates the input code data and outputs modulated data that is data after modulation to the D / A conversion unit 13. The D / A conversion unit 13 converts the modulation data output from the modulation unit 12 from a digital signal to an analog signal. The modulated data converted into the analog signal is transmitted via the antenna 14.

  The user terminal 20 receives the modulation data transmitted from the antenna 14 on the transmission side 10 via the antenna 24. However, the modulation data received by the antenna 24 is affected by noise and the like when propagating through space after being output from the antenna 14. The modulated data received by the antenna 24 is input to the A / D converter 21. The A / D converter 21 converts the input modulation data from an analog signal to a digital signal. The A / D converter 21 outputs the converted digital signal to the demodulator 22. Then, the demodulator 22 demodulates the digital signal output from the A / D converter 21. The demodulator 22 outputs the received data obtained by demodulation to the decoder 23. The decoding unit 23 performs error correction decoding and error detection processing on the input received data. A processing circuit such as a subsequent CPU performs a predetermined process using the decoded data obtained as a result.

  FIG. 2 is a block diagram illustrating an example of the configuration of the decoding unit 23. The decoding unit 23 is configured to include a reception data memory 41, a decoding processing unit 42, a decoded data memory 43, an error detection unit 44, and a control unit 45. The reception data memory 41 stores the reception data supplied from the demodulation unit 22. The decoding processing unit 42 applies a decoding process according to the encoded data to the reception data stored in the reception data memory 41, supplies a decoding result (hereinafter referred to as decoded data) to the decoded data memory 43, and The likelihood information is supplied to the control unit 45. For example, the likelihood information can take a larger value as the likelihood is higher, and can take a smaller value as the likelihood is lower. The decoded data memory 43 stores the decoded data supplied from the decoding processing unit 42. The error detection unit 44 detects an error in the decoded data stored in the decoded data memory 43 and supplies the error detection result to the control unit 45.

  The control unit 45 uses the likelihood information supplied from the decoding processing unit 42, the error detection result of the decoded data by the error detecting unit 44, and the number of repetitions of decoding in the decoding processing unit 42, so that the decoding processing unit 42. The continuation or stop of the decoding in is determined, and the continuation or stop of the decoding of the decoding processing unit 42 is controlled according to the determination. The decoding processing unit 42 continues or stops the iterative decoding under the control of the control unit 45.

  The decrypted data stored in the decrypted data memory 43 is acquired by a CPU or the like subsequent to the decrypting unit 23.

  Next, the operation of the decoding unit in FIG. 2 will be described.

  First, when received data is stored in the received data memory 41, the decoding processing unit 42 reads the received data from the received data memory 41 and performs a decoding process on the read received data. The decoding processing unit 42 outputs the decoded data obtained by the decoding processing and its likelihood information to the decoded data memory 43 and the control unit 45, respectively. The decoded data is input from the decoded data memory 43 to the error detection unit 44. The error detection unit 44 performs error detection processing on the decoded data and outputs an error detection result to the control unit 45. The control unit 45 determines whether to continue or stop the iterative decoding for the received data based on the likelihood information, the error detection result, and the number of decoding repetitions, and instructs the decoding processing unit 42 to continue or stop the iterative decoding. .

  The reception data memory 41 and the decoded data memory 43 may be provided outside the decoding unit 23, for example, or may be replaced with another storage medium or the like.

  Although the error detection unit 44 has been described as acquiring the decoded data from the decoded data memory 43, it may be acquired directly from the decoding processing unit. FIG. 3 is a block diagram showing another example of the configuration of the decoding unit 23 in this case.

  The operations of the reception data memory 41, the decoding processing unit 42, the decoded data memory 43, the error detection unit 44, and the control unit 45 shown in FIG. 3 are the same as those shown in FIG. A description of the same parts as those in FIG. 2 is omitted. In the configuration shown in FIG. 3, the decoding processing unit 42 applies a decoding process according to the encoded data to the reception data stored in the reception data memory 41, and converts the decoded data into the decoded data memory 43 and the error detection unit 44. And the likelihood information is supplied to the control unit 45. The error detection unit 44 detects an error in the decoded data supplied from the decoding processing unit 42 and supplies the error detection result to the control unit 45.

  FIG. 4 is a flowchart for explaining processing for determining whether to stop or continue decoding by the control unit 45. In step S11, the control unit 45 determines whether or not the number of decoding iterations is an upper limit that is a predetermined number. If it is determined that the number of decoding iterations is an upper limit, the procedure proceeds to step S12. Then, the control unit 45 determines to stop decoding in the decoding processing unit 42, causes the decoding processing unit 42 to stop decoding, and ends the process of determining whether to stop or continue decoding.

  On the other hand, when it is determined in step S11 that the number of repetitions of decoding is not the upper limit, the procedure proceeds to step S13, and the control unit 45 refers to the error detection result from the error detection unit 44 and the decoded data has an error. It is determined whether it was not detected. If it is determined in step S13 that no error has been detected in the decoded data, the procedure proceeds to step S12, the control unit 45 determines to stop decoding in the decoding processing unit 42, and the decoding processing unit 42 performs decoding. The process of stopping and deciding whether to stop or continue decoding ends.

  If it is determined in step S13 that an error has been detected in the decoded data, the procedure proceeds to step S14, and the control unit 45 determines whether or not the likelihood information supplied from the decoding processing unit 42 is greater than or equal to the threshold value 1. It is also determined whether the likelihood information is equal to or less than threshold value 2 (second threshold value <first threshold value). If it is determined in step S14 that the likelihood information is greater than or equal to the threshold value 1, or if it is determined that the likelihood information is less than or equal to the threshold value 2, the procedure proceeds to step S12, and the control unit 45 includes the decoding processing unit. The decoding stop at 42 is determined, the decoding processing unit 42 is stopped, and the decoding stop / continuation determination process ends.

  That is, in step S14, if the likelihood information is greater than or equal to threshold 1 and the likelihood information is not less than or equal to threshold 2, the procedure proceeds to step S12, where the likelihood information is not greater than or equal to threshold 1 and the likelihood information is less than or equal to threshold 2. If so, the procedure proceeds to step S12, and the decoding in the decoding processing unit 42 is stopped.

  Here, the processing of step S13 to step S15 will be described more specifically by taking DCI transmission / reception defined by 3GPP-LTE as an example.

  First, the search space of UE-Specific L = 1 of UE0 shown in FIG. 11 and the search space of UE-Specific L = 2 of UE1 shown in FIG. 12 overlap (the same region CCE Index 16-19). Included). If data for UE1 is mapped and transmitted at a position of UE-Specific L = 2 and CCE Index 16 to 17, UE0 uses the received data at this position and UE-Specific L = 1. When the decoding process is performed, decoded data to be acquired by UE1 is obtained as a result of decoding.

  However, since the masking pattern applied to the CRC part is different between the data for UE0 and the data for UE1, an error is always detected in the error detection of the decoded data in UE0. It is not accidentally obtained as data for UE.

  However, since the data encoding method and decoding method are not different for each UE, a correct decoding result can be obtained. If Viterbi decoding is performed, the likelihood of a path metric value, a path metric difference, etc. The degree information indicates a higher value than when random data is decoded. At this time, even if the likelihood information is greater than or equal to the predetermined threshold value 1, an error is detected in the decoding result, so the decoding unit 23 determines that the data is not intended for itself (own UE) and stops the decoding process.

  Further, if no DCI for any UE is arranged (mapped) in the CCE Index 28 to 29, the transmission data is 0 (no amplitude), and the reception data is only a noise component generated in the reception environment. Will be included. When UE0 performs UE-Specific L = 2 decoding using received data of CCE Index 28 to 29, random data is obtained as a result of decoding, and of course an error is necessarily detected. . Further, when the reception environment is good and the noise component is small, the likelihood information also shows a lower value than when the reception data has some data. At this time, since the likelihood information is equal to or smaller than the predetermined threshold 2 and an error is detected in the decoding result, the decoding unit 23 determines that no data is on the received data and stops the decoding process.

  Returning to FIG. 4, when it is determined in step S <b> 14 that the likelihood information is not greater than or equal to threshold 1 and the likelihood information is determined not to be less than or equal to threshold 2, that is, the likelihood information is less than threshold 1 and threshold 2 is set. If exceeded, the procedure proceeds to step S15, and the control unit 45 determines to continue the decoding in the decoding processing unit 42, causes the decoding processing unit 42 to continue the decoding, and determines whether to stop or continue the decoding. finish.

  Note that the upper limit of the number of repetitions and the threshold value of likelihood information (threshold value 1 and threshold value 2) may be determined in advance, or dynamically determined by changes in likelihood information obtained by the decoding process. May be. For example, when the likelihood information changes greatly every time iterative decoding is performed, the upper limit of the number of repetitions is increased (increased), or a constant multiple of the value of likelihood information at the time of the first decoding is set as a threshold of likelihood information Or you may.

  Conventionally, as shown in FIG. 5, when the upper limit number of repetitions of decoding is four, if a decoding error is detected in each of the first to third decoding, the upper limit of four times The decoding is repeated up to the number of times.

  On the other hand, according to the user terminal 20, for example, as shown in FIG. 6, when the upper limit number of repetitions of decoding is 4, a decoding error is detected at the first decoding, and the likelihood When the degree information exceeds the threshold value 2 and the likelihood information is less than the threshold value 1, decoding is performed again, and even if a decoding error is detected in the second decoding, the likelihood information is greater than or equal to the threshold value 1 If so, the next decoding is stopped. Therefore, as shown in A, it is possible to reduce the processing time and advance to the next decoding by advancing the determination that decoding is impossible using the likelihood information.

  Further, according to the user terminal 20, for example, as shown in FIG. 7, when the upper limit number of repetitions of decoding is 4, even if a decoding error is detected in the first decoding, the likelihood information Is less than or equal to the threshold value 2, the next decoding is stopped. Therefore, also in this case, it is possible to reduce the processing time and advance to the next decoding by accelerating the determination that the decoding is impossible using the likelihood information.

  As described above, the decoding process in which the error is detected in spite of the high likelihood information of the decoding result and the decoding process in which the value of the likelihood information of the decoding result is extremely small and the error is detected. It is determined that decoding is not possible (cannot be decoded), and the decoding process is terminated without performing repeated decoding. As a result, it is possible to reduce the decoding processing time of the encoded data in which the error detection result does not finally become OK (error is detected).

  That is, when decoding a plurality of encoded data and obtaining desired data from them, it is determined whether to continue or stop decoding based on likelihood information of the decoded data obtained at the time of decoding and an error detection result. As a result, the time required for the entire decoding process is reduced.

  The series of processes of the decoding unit 23 described above can be executed by hardware or can be executed by software. When a series of processing is executed by software, a program constituting the software executes various functions by installing a computer incorporated in dedicated hardware or various programs. For example, it is installed from a program recording medium in a general-purpose personal computer or the like.

  FIG. 8 is a block diagram illustrating an example of a hardware configuration of a computer that executes the above-described series of processes using a program.

  In a computer, a CPU (Central Processing Unit) 101, a ROM (Read Only Memory) 102, and a RAM (Random Access Memory) 103 are connected to each other via a bus 104.

  An input / output interface 105 is further connected to the bus 104. The input / output interface 105 includes an input unit 106 including a keyboard, a mouse, and a microphone, an output unit 107 including a display and a speaker, a storage unit 108 including a hard disk and a non-volatile memory, and a communication unit 109 including a network interface. A drive 110 for driving a removable medium 111 such as a magnetic disk, an optical disk, a magneto-optical disk, or a semiconductor memory is connected.

  In the computer configured as described above, the CPU 101 loads, for example, the program stored in the storage unit 108 to the RAM 103 via the input / output interface 105 and the bus 104 and executes the program. Is performed.

  The program executed by the computer (CPU 101) is, for example, a magnetic disk (including a flexible disk), an optical disk (CD-ROM (Compact Disc-Read Only Memory), DVD (Digital Versatile Disc), etc.), a magneto-optical disk, or a semiconductor. The program is recorded on a removable medium 111 that is a package medium including a memory or the like, or is provided via a wired or wireless transmission medium such as a local area network, the Internet, or digital satellite broadcasting.

  The program can be installed in the computer by loading the removable medium 111 in the drive 110 and storing it in the storage unit 108 via the input / output interface 105. Further, the program can be installed in a computer by being received by the communication unit 109 via a wired or wireless transmission medium and stored in the storage unit 108. In addition, the program can be installed in the computer in advance by storing the program in the ROM 102 or the storage unit 108 in advance.

  Note that the program executed by the computer may be a program that is processed in time series in the order described in this specification, or in parallel or at a necessary timing such as when a call is made. It may be a program for processing.

  The embodiments of the present invention are not limited to the above-described embodiments, and various modifications can be made without departing from the scope of the present invention.

  DESCRIPTION OF SYMBOLS 20 ... User terminal, 21 ... A / D conversion part, 22 ... Demodulation part, 23 ... Decoding part, 41 ... Reception data memory, 42 ... Decoding processing part, 43 ... Decoding data memory, 44 ... Error detection part, 45 ... Control , 101 ... CPU, 102 ... ROM, 103 ... RAM, 109 ... communication unit, 111 ... removable media

Claims (6)

Of the received data in which the information for yourself and the information for other receiving devices are multiplexed, the candidate area where the information for yourself is placed is repeatedly decoded several times and directed to yourself In a receiving device that acquires information,
Decoding means for decoding the candidate area of the received data to obtain likelihood information;
Detecting means for detecting an error from the decoding result decoded by the decoding means;
And a determining means for determining whether to continue or stop decoding of the candidate area of the received data from the likelihood information and the error detection result. The receiving device according to claim 1,
The receiving device, wherein an error is not detected from a decoding result, determines to stop decoding repetition. The receiving device according to claim 1,
The receiving device, wherein an error is detected from a decoding result, and when the likelihood information is greater than or equal to a predetermined threshold value, the stop of decoding repetition is determined. The receiving device according to claim 1,
The receiving device, wherein an error is detected from a decoding result, and when the likelihood information is equal to or less than a predetermined threshold value, decoding stop is determined. Of the received data in which the information for the receiving device and the information for the other receiving device are multiplexed, the candidate area where the information for the receiving device is arranged is repeatedly decoded several times, thereby decoding In the receiving method of the receiving device for acquiring information for the receiving device,
Decoding the candidate region of the received data to obtain likelihood information; and
A detection step of detecting an error from the decoding result decoded in the decoding step;
And a determination step of determining whether to continue or stop decoding of the candidate area of the received data from the likelihood information and the error detection result. Of the received data in which the information for the receiving device and the information for the other receiving device are multiplexed, the candidate area where the information for the receiving device is arranged is repeatedly decoded several times, thereby decoding In the computer of the receiving device that acquires information for the receiving device,
Decoding the candidate region of the received data to obtain likelihood information; and
A detection step of detecting an error from the decoding result decoded in the decoding step;
And a determination step for determining whether to continue or stop the decoding of the candidate area in the received data from the likelihood information and the error detection result.

Images