Abstract:
Deinterleaving and cyclic deshifting of the PDCCH are processed at the same time as the demodulation for de-mapping. As such, the receiving device has: a deinterleaver unit which uses a row counter and a column counter to calculate a location number in a deinterleave matrix; a cyclic shift amount calculation unit which calculates the cyclic shift amount applied to demodulation data, before that demodulation data is acquired; a counter initial value calculation unit which calculates the initial values of the row counter and the column counter from the calculated cyclic shift amount and sends the results to the deinterleaver unit; and an address changing unit which changes the address of the destination to which the demodulation data is to be written to the location number calculated by the deinterleaver unit.

Description:
TECHNICAL FIELD 
       [0001]    The present application claims priority from Japanese Patent Application No. 2010-285663 filed on Dec. 22, 2010, the contents of which are incorporated herein by reference. 
         [0002]    The present invention relates to a receiver, a receiving method, and a computer program. 
       BACKGROUND ART 
       [0003]    In Long Term Evolution (LTE) as the standards of a communication method, Orthogonal Frequency Division Multiplexing Access (OFDMA) is applied as a wireless communication method of Downlink. 
         [0004]      FIG. 15  is a block diagram showing an outlined configuration of a conventional communication system. 
         [0005]    A transmission side is explained below at first. 
         [0006]    At a transmission side, error correction encoding, error detection encoding, and size adjustment are carried out for each user datum in an encode unit  101 . Then, in a modulation unit  102 , encoded data supplied from the encode unit  101  is assigned to each point on an IQ plane, corresponding to each type of modulation method, and furthermore precoding of spatial multiplexing, transmitter diversity, and the like are timely executed in order to create data for each transmission antenna. 
         [0007]    Subsequently, in a map unit  103 , a modulation unit output datum supplied from the modulation unit  102  is mapped to each resource element (RE) on a frequency axis, for each transmission antenna. After a mapping operation for one OFDM symbol, an output from the map unit  103  is transformed into a datum on a time axis, for each transmission antenna, in an Inverse Fast Fourier Transform (IFFT) unit  104 . Then, in a carrier wave modulation unit  105 , an output from the IFFT unit  104  is carrier-wave-modulated for each transmission antenna, and transmitted as transmission data from each transmission antenna (not shown). 
         [0008]    In this context, a map unit on a frequency axis is called ‘RE’ and a unit of time for executing an IFFT is called ‘OFDM symbol.’ 
         [0009]    Explained next below is a receiving side. 
         [0010]    At a receiving side, a datum on a time axis is taken out from received data in a carrier wave demodulation unit  106 . The datum on a time axis is transformed into a datum on a frequency axis, in a Fast Fourier Transform (FFT) unit  107 . Then, in a demap unit  108 , a datum mapped in each RE is taken out. The datum taken out is demodulated, corresponding to each modulation method, in a demodulation unit  109 . In the end, error detection and error correction are carried out in a decode unit  110 . 
         [0011]    In LTE, Physical Control Format Indicator Channel (PCFICH), Physical HARQ Indicator Channel (PHICH), and Physical Downlink Control Channel (PDCCH) are transmitted by using at most four OFDM symbols, starting from an OFDM symbol placed at a top of a sub-frame. PCFICH is a datum for notifying a receiving terminal of the number of OFDM symbols with which PDCCH is transmitted. PHICH is a datum for notifying the receiving terminal of a HARQ (Hybrid Automatic Repeat Request) Indicator. PDCCH is a datum for notifying the receiving terminal of various parameters, Transmit Power Control (TPC), and the like for receiving Physical Downlink Shared Channel (PDSCH). 
         [0012]    In the meantime, a method of mapping PCFICH, PHICH, and PDCCH is specified in non-patent literature NPL 1. 
         [0013]    As specified in NPL 1, PCFICH, PHICH, and PDCCH are mapped while Resource Element Group (REG) being used as a unit. 
         [0014]      FIG. 16  is a diagram showing an outline of mapping PCFICH, PHICH, and PDCCH. In  FIG. 16 , each square having diagonal lines represents an RE in which a Reference Signal (RS) of each transmission antenna is placed. In this context, RS is a pilot signal. 
         [0015]    One REG is composed of six REs in the case of an OFDM symbol having an RS, as “A” represents in  FIG. 16 . In the meantime, one REG is composed of four REs in the case of an OFDM symbol having no RS, as “B” represents in  FIG. 16 . As shown in  FIG. 16 , RS mapping positions are based on a cycle of six REs, for all transmission antennas. A mapping offset position is determined according to a cell ID of a base station. Incidentally, any RS is removed in the course of mapping in an REG. 
         [0016]    According to paragraph 6.8.5 in NPL 1, mapping information of PHICH and PCFICH is required for mapping PDCCH.  FIG. 17  shows an outline of the mapping. Using an REG as a unit, PDCCH is mapped at a position without PCFICH and PHICH, for each OFDM symbol in a time-wise direction. Furthermore, such mapping is carried out sequentially in a direction from a low-frequency side to a high-frequency side. Incidentally, a number written in each REG in  FIG. 17  is a PDCCH symbol-quadruplet number. 
         [0017]    A workflow of mapping PDCCH, specified in paragraph 6.8.5 in NPL 1, is shown in a flowchart of  FIG. 18 . 
         [0018]    At Step S 101 , a PDCCH symbol-quadruplet number m″ is initialized to be zero, and an RE number k′ is initialized to be zero. 
         [0019]    At Step S 102 , an OFDM symbol number l′ is initialized to be zero. At Step S 103 , it is judged whether or not an array (k′, l′) having the RE number k′ and the OFDM symbol number l′ as elements is equal to a REG index pair. k′ of the REG index pair is a multiple number of 6 or 4 when there exists an RS or not, respectively. 
         [0020]    In the case where it is judged at Step S 103  that the array (k′, l′) is equal to the REG index pair, operation progresses to Step S 104  in order to judge whether or not PCFICH is mapped to the REG (k′, l′). 
         [0021]    If it is judged at Step S 104  that PCFICH is not mapped to the REG (k′, l′), operation progresses to Step S 105  in order to judge whether or not PHICH is mapped to the REG (k′, l′). 
         [0022]    If it is judged at Step S 105  that PHICH is not mapped to the REG (k′, l′), operation progresses to Step S 106  in order to map PDCCH symbol-quadruplet to the REG (k′, l′). Then, a PDCCH symbol-quadruplet number m″ is incremented by only 1 at Step S 107 , and operation progresses to Step S 108 . 
         [0023]    In any one of the cases where it is judged at Step S 103  that the array (k′, l′) is not equal to the REG index pair, it is judged at Step S 104  that PCFICH is mapped to the REG (k′, l′), and it is judged at Step S 105  that PHICH is mapped to the REG (k′, l′); operation progresses to Step S 108 . 
         [0024]    At Step S 108 , the OFDM symbol number l′ is incremented by only 1. 
         [0025]    Then, at Step S 109 , it is judged whether or not the OFDM symbol number l′ is less than a number ‘L’; namely whether or not the symbol number has reached a maximum OFDM symbol (the number ‘L’) at which PDCCH is mapped. 
         [0026]    In the case where it is judged at Step S 109  that the OFDM symbol number l′ is less than the number ‘L’, the symbol number has not yet reached the maximum OFDM symbol (the number ‘L’) at which PDCCH is mapped, and therefore operation returns to Step S 103  to repeat the steps described above. 
         [0027]    In the case where it is judged at Step S 109  that the OFDM symbol number l′ is not less than the number ‘L,’ the symbol number has reached the maximum OFDM symbol (the number ‘L’) at which PDCCH is mapped, and therefore operation progresses to Step S 110  to increment the RE number k′ by 1. 
         [0028]    At Step S 111 , it is judged whether or not the RE number k′ has reached a maximum RE at which PDCCH is mapped. In the case where it is judged that the RE number k′ has not yet reached the maximum RE at which PDCCH is mapped, operation returns to Step S 102  to repeat the steps described above. 
         [0029]    If it is judged at Step S 111  that the RE number k′ has reached the maximum RE at which PDCCH is mapped, operation of mapping PDCCH finishes. 
         [0030]    As described above, PDCCH is mapped on the basis of the RE number. 
         [0031]    In the meantime, prior to the mapping operation, cyclic shifting and interleaving are carried out for PDCCH, as described in NPL 1. 
       CITATION LIST 
     Non Patent Literature 
       [0000]    
       
         NPL 1: 3GPP TS 36.211, “Physical Channels and Modulation” 
       
     
       SUMMARY OF INVENTION 
     Technical Problem 
       [0033]    According to the steps shown in the flowchart of  FIG. 18 , operation of mapping PDCCH in LTE is carried out for each OFDM symbol in a time-wise direction from the low-frequency side, and the operation sequentially proceeds in a frequency-wise direction. The operation of mapping PDCCH needs to be carried out, while staying away from any REG where PCFICH and PHICH are mapped. 
         [0034]    In this context, if it is attempted to materialize demapping operation by way of following the mapping steps shown in the flowchart of  FIG. 18 , as they are, simply in a reverse direction, demapping of PDCCH can be done only after receiving all the OFDM symbols in the time-wise direction. Therefore, an overhead for process time becomes greater. Furthermore, a memory unit for storing Raw RE (RRE) data requires a memory space for at most four OFDM symbols so that a scale of a circuit becomes enlarged. 
         [0035]    An inventor of the present invention has invented a receiver, a receiving method and a computer program that give a solution to the issues described above, and make it possible to demap PDCCH with a small overhead of process time and by means of a small-scale circuit or a small-scale memory, and the inventor has already had a patent application on the invention (Japanese patent application number: 2010-116104, applied on May 20, 2010; hereinafter, called “the prior application”). Unfortunately, deinterleaving and cyclic deshifting of PDCCH, for which cyclic shifting and interleaving have been carried out, are not taken into consideration in the prior application. 
         [0036]    Deinterleaving of PDCCH in LTE is carried out together with cyclic shifting, for data of all OFDM symbols. Therefore, in a naive notion, the operation can be carried out only after demodulation data of all the OFDM symbols become prepared, and accordingly the process time becomes greater. 
         [0037]    Furthermore, owing to the nature of a re-arrangement process, writing back to the same memory by way of Read Modify Write cannot be implemented in deinterleaving and cyclic deshifting. Therefore, another memory unit of the same size as a memory unit for storing the demodulation data before processing operation is needed for storing data after the processing operation so that the memory capacity becomes enlarged. 
         [0038]    Thus, it is an objective of the present invention to provide a receiver, a receiving method and a computer program that give a solution to the issues described above, and make it possible to reduce an overhead of process time required for deinterleaving of PDCCH and cut down a memory unit for storing data after data processing operation. 
       Solution to Problem 
       [0039]    According to a first aspect of the present invention, provided is a receiver for receiving a signal according to LTE, for which interleaving and cyclic shifting are carried out, the signal being mapped for each transmission antenna with an RE on a frequency-wise axis being as a unit, the receiver comprising: a PDCCH demap unit for demapping PDCCH mapped to an OFDM symbol; and a PDCCH deinterleave and cyclic deshift unit for carrying out cyclic deshifting and deinterleaving on a demodulation datum obtained by the PDCCH demap unit; wherein the PDCCH demap unit includes: a judgment means for making a judgment, with respect to an REG, which is a group of the RE and provided with a serial number, in order of the serial number, on whether or not neither PCFICH nor PHICH are mapped to an attention-receiving REG that is watched at the time, and furthermore, on whether or not the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present, which is input each time when an OFDM symbol is received; and a PDCCH demapping execution means for demapping PDCCH of the attention-receiving REG, in the case where neither PCFICH nor PHICH are mapped to the attention-receiving REG, and furthermore the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present; and the PDCCH deinterleave and cyclic deshift unit includes: a deinterleave unit for calculating a position number on a deinterleaving matrix by using a row counter and a column counter; a cyclic shift amount calculation unit for calculating a cyclic shift amount implemented on the demodulation datum, before the demodulation datum is obtained; a counter initial value calculation unit for calculating initial values of a row counter and a column counter, by using the cyclic shift amount, which has been calculated, in order to give the deinterleave unit the initial values; and an address change unit for changing an address where the demodulation datum is written, to the position number calculated by the deinterleave unit. 
         [0040]    According to a second aspect of the present invention, provided is a receiving method for receiving a signal according to LTE, for which interleaving and cyclic shifting are carried out, the signal being mapped for each transmission antenna with an RE on a frequency-wise axis being as a unit, the receiving method comprising execution of a first judgment step for making a judgment, with respect to an REG, which is a group of the RE and provided with a serial number, in order of the serial number, on whether or not at least either of PCFICH and PHICH is mapped to an attention-receiving REG that is watched at the time, a second judgment step for making a judgment on whether or not the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present, which is input each time when an OFDM symbol is received; and a PDCCH demapping step for demapping PDCCH of the attention-receiving REG, in the case where neither PCFICH nor PHICH are mapped to the attention-receiving REG, and furthermore the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present; and in addition to execution of the above steps, further comprising execution of; a cyclic shift amount calculation step for calculating a cyclic shift amount implemented on the demodulation datum, before the demodulation datum is obtained; a counter initializing step for calculating initial values of a row counter and a column counter for calculating a position number on a deinterleaving matrix, by using the cyclic shift amount calculated, and initializing the row counter and the column counter; a deinterleaving step for calculating the position number on the deinterleaving matrix by using a row counter and a column counter; and an address changing step for changing an address where the demodulation datum is written, to the position number calculated by the deinterleaving step. 
         [0041]    According to a third aspect of the present invention, provided is a computer program to operate a computer of a receiver for receiving a signal according to LTE, for which interleaving and cyclic shifting are carried out, the signal being mapped for each transmission antenna with an RE on a frequency-wise axis being as a unit, the computer program comprising execution of a first judgment step for making a judgment, with respect to an REG, which is a group of the RE and provided with a serial number, in order of the serial number, on whether or not at least either of PCFICH and PHICH is mapped to an attention-receiving REG that is watched at the time, a second judgment step for making a judgment on whether or not the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present, which is input each time when an OFDM symbol is received; and a PDCCH demapping step for demapping PDCCH of the attention-receiving REG, in the case where neither PCFICH nor PHICH are mapped to the attention-receiving REG, and furthermore the serial number provided to the attention-receiving REG is correspondent to the OFDM symbol number at present; and in addition to execution of the above steps, further comprising execution of a cyclic shift amount calculation step for calculating a cyclic shift amount implemented on the demodulation datum, before the demodulation datum is obtained; a counter initializing step for calculating initial values of a row counter and a column counter for calculating a position number on a deinterleaving matrix, by using the cyclic shift amount calculated, and initializing the row counter and the column counter; a deinterleaving step for calculating the position number on the deinterleaving matrix by using a row counter and a column counter; and an address changing step for changing an address where the demodulation datum is written, to the position number calculated by the deinterleaving step. 
       Advantageous Effects of Invention 
       [0042]    According to the present invention, it becomes possible to reduce an overhead of process time required for deinterleaving of PDCCH and cut down a memory unit for storing data after data processing operation. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0043]      FIG. 1  is a block diagram showing a configuration example of a receiver according to an embodiment of the present invention. 
           [0044]      FIG. 2  is a drawing that shows an example of a re-arrangement pattern within rows of REGs of PDCCH by an interleaving process. 
           [0045]      FIG. 3  is a diagram that shows an example of re-arrangement by using the re-arrangement pattern, shown in  FIG. 2 , of REGs of PDCCH by an interleaving process. 
           [0046]      FIG. 4  is a drawing for explaining an example of a processing operation by a counter initial value calculation unit in the receiver shown in  FIG. 1 , with reference to a source code of a computer program. 
           [0047]      FIG. 5  is a drawing for explaining an example of a processing operation by a deinterleave unit in the receiver shown in  FIG. 1 , with reference to a source code of a computer program. 
           [0048]      FIG. 6  is a diagram that shows an REG arrangement. 
           [0049]      FIG. 7  is a diagram that shows an REG arrangement. 
           [0050]      FIG. 8  is a flowchart for explaining a demapping operation of PDCCH. 
           [0051]      FIG. 9  is a flowchart for explaining details of a process for one RB in the flowchart shown in  FIG. 8 . 
           [0052]      FIG. 10  is a diagram that shows a mapping image of PCFICH. 
           [0053]      FIG. 11  is a diagram that shows a mapping image of PHICH. 
           [0054]      FIG. 12  is a diagram that shows a mapping image of PHICH. 
           [0055]      FIG. 13  is a drawing that explains a demapping operation by using an OFDM symbol number lnow′ at present. 
           [0056]      FIG. 14  is a block diagram showing a configuration example of hardware of a computer that executes a series of processes by way of a computer program. 
           [0057]      FIG. 15  is a block diagram showing an outlined configuration of a conventional communication system. 
           [0058]      FIG. 16  is a diagram that shows an outline of mapping PCFICH, PHICH, and PDCCH. 
           [0059]      FIG. 17  is a diagram that shows mapping information of PHICH and PCFICH required for mapping PDCCH. 
           [0060]      FIG. 18  is a flowchart for explaining a conventional workflow of mapping PDCCH. 
       
    
    
     DESCRIPTION OF EMBODIMENTS 
       [0061]    A preferred embodiment of the present invention is explained below with reference to the accompanied drawings. 
         [0062]      FIG. 1  is a block diagram showing a configuration example of a receiver according to an embodiment of the present invention. Being used in a mobile phone, for example, this receiver includes a PCFICH demap unit  11 , a PHICH demap unit  12 , a PDCCH demap unit  13 , and a PDCCH cyclic deshift and deinterleave unit  14 . 
         [0063]    The PCFICH demap unit  11  outputs an REG number of an REG where PCFICH is mapped. The PHICH demap unit  12  outputs an REG number of an REG where PHICH symbol-quadruplet is mapped. The PDCCH demap unit  13  outputs an REG number of an REG where PDCCH is mapped. The PDCCH cyclic deshift and deinterleave unit  14  carries out a cyclic deshift and deinterleaving for a demodulation datum (REG number) to be obtained by the PDCCH demap unit  13 . 
         [0064]    The PCFICH demap unit  11  and the PHICH demap unit  12  output a parameter for demapping PDCCH, to the PDCCH demap unit  13 . 
         [0065]    A memory unit  21 , an internal parameter storing unit  22 , an REG counter  23 , a comparator  24 , a counter  25 , an REG pair unit  26 , and a control unit  27  are provided in the PDCCH demap unit  13 . The PDCCH demap unit  13  is invoked each time when an OFDM symbol is received, and an OFDM symbol number l′now at present is given as a parameter at the time of invoking. 
         [0066]    The memory unit  21  stores various parameters that the PCFICH demap unit  11  and the PHICH demap unit  12  output. 
         [0067]    Meanwhile, the internal parameter storing unit  22  stores a PCFICH symbol quadruplet-number: 
         [0000]      MIN quadruplet   PCFICH   {Math. 1}
 
         [0000]    a PHICH symbol quadruplet-number: 
         [0000]      MIN quadruplet   PHICH   [l′   i ]  {Math. 2}
 
         [0000]    and a PHICH mapping unit number: 
         [0000]      MIN unit   PHICH   [l′   i ]  {Math. 3}
 
         [0000]    Details of the PCFICH symbol quadruplet-number (Math 1), the PHICH symbol quadruplet-number (Math 2), and the PHICH mapping unit number (Math 3) are described later. 
         [0068]    The REG counter  23  counts REGs of each CH. The comparator  24  makes a judgment on an REG. Namely, the comparator  24  makes a judgment with respect to an REG provided with a serial number l′, in order of the serial number l′, on whether or not neither PCFICH nor PHICH are mapped to an attention-receiving REG that is watched at the time, and furthermore, on whether or not the serial number l′ provided to the attention-receiving REG is correspondent to the OFDM symbol number l′now at present, which is input each time when an OFDM symbol is received. The counter  25  counts the PDCCH number and the OFDM symbol number l′. The REG pair unit  26  demaps PDCCH of the attention-receiving REG, in the case where neither PCFICH nor PHICH are mapped to the attention-receiving REG, and furthermore the serial number l′ provided to the attention-receiving REG is correspondent to the OFDM symbol number l′ at present. The control unit  27  controls an entire section of the PDCCH demap unit  13 . 
         [0069]    The PCFICH demap unit  11  demaps PCFICH. Moreover, at this time, the PCFICH demap unit  11  searches for the PCFICH symbol quadruplet-number (Math. 1) correspondent to a minimum REG number where PCFICH is mapped, for demapping PDCCH, and outputs the PCFICH symbol quadruplet-number. The PCFICH symbol quadruplet-number (Math. 1) is stored in the memory unit  21  of the PDCCH demap unit  13 . 
         [0070]    The PHICH demap unit  12  demaps PHICH. Moreover, at this time, the PHICH demap unit  12  searches for the PHICH symbol quadruplet-number (Math. 2) correspondent to a minimum REG number where PHICH is mapped, and the PHICH map unit number (Math. 3), for demapping PDCCH, and outputs those numbers. The PHICH symbol quadruplet-number (Math. 2) and the PHICH mapping unit number (Math. 3) are stored in the memory unit  21  of the PDCCH demap unit  13 . 
         [0071]    At an initializing operation (Step S 13 ) to be explained with reference to the flowchart of  FIG. 8 , the internal parameter storing unit  22  initializes the following numbers as parameters; namely, a PCFICH symbol quadruplet-number: 
         [0000]        n   quadruplet   PCFICH   {Math. 4}
 
         [0000]    a PHICH symbol quadruplet-number: 
         [0000]        n   quadruplet   PHICH ( l ′)  {Math. 5}
 
         [0000]    and a PHICH mapping unit number: 
         [0000]        n   unit   PHICH ( l ′)  {Math. 6}
 
         [0000]    to be the PCFICH symbol quadruplet-number (Math. 1), the PHICH symbol quadruplet-number (Math. 2), and the PHICH mapping unit number (Math. 3), respectively. Moreover, at an updating operation (Step S 24 ) in regard to PCFICH, and at an updating operation (Step S 26 ) in regard to PHICH, both the operations being explained with reference to the flowchart of  FIG. 9 , the internal parameter storing unit  22  updates each parameter. 
         [0072]    The REG counter  23  counts a REG number for PCFICH, PHICH, and PDCCH. At the initializing operation (Step S 13 ) to be explained with reference to the flowchart of  FIG. 8 , the REG counter  23  is initialized with an internal parameter after the initializing operation. 
         [0073]    Being controlled by the control unit  27 , the REG counter  23  carries out an update in regard to PCFICH and an update in regard to PHICH, at the updating operation (Step S 24 ) in regard to PCFICH, and at the updating operation (Step S 26 ) in regard to PHICH, both the operations being explained with reference to the flowchart of  FIG. 9 . Furthermore, being provided for each OFDM symbol, the REG counter  23  that counts a REG number for PDCCH is controlled by the control unit  27  to timely increment the REG number by 1. 
         [0074]    In other words, the REG counter  23  counts a REG number for each of PCFICH, PHICH, and PDCCH so that each count value of the REG counter  23  represents each corresponding REG number. 
         [0075]    The comparator  24  receives the REG count value for PDCCH from the REG counter  23 , and makes a judgment on whether the REG represented by the REG number is a REG for PDCCH, or not. The judgment is made by way of an operation of Step S  22  to be explained with reference to the flowchart of  FIG. 9 . If once it is judged to be the REG, the comparator  24  subsequently receives the REG count value for PCFICH from the REG counter  23 , and makes a judgment on whether or not the REG count value for PCFICH is the same as the REG count value for PDCCH, and then returns the result to the control unit  27 . 
         [0076]    Next, the comparator  24  receives the REG count value for PHICH from the REG counter  23 ; and in the same way, makes a judgment on whether or not the REG count value for PHICH is the same as the REG count value for PDCCH, and then returns the result to the control unit  27 . If the REG count value for PDCCH is neither the same as the REG count value for PCFICH nor the same as the REG count value for PHICH, the REG represented by the REG count value for PDCCH can be deemed to be a REG where PDCCH is mapped. Then, the result is output to the REG pair unit  26 . 
         [0077]    The counter  25  counts a PDCCH symbol-quadruplet number m″ and an OFDM symbol number F. According to control by the control unit  27 , timely the counter  25  either initializes the PDCCH symbol-quadruplet number m″ and the OFDM symbol number l′, or increments those numbers only by 1. 
         [0078]    In the comparator  24 , the OFDM symbol number l′ according to the counter  25  is compared to the OFDM symbol number l′now at present. When these values agree with each other, the comparator  24  outputs the result to the REG pair unit  26 . The OFDM symbol number l′now at present is input into the PDCCH demap unit  13  every time when an OFDM symbol is received, and then the OFDM symbol number l′now at present is supplied to the comparator  24  by the intermediary of the control unit  27 . 
         [0079]    According to procedures to be explained with reference to the flowcharts of  FIG. 8  and  FIG. 9 , the control unit  27  controls the internal parameter storing unit  22 , the REG counter  23 , the comparator  24 , and the counter  25 . 
         [0080]    A cyclic shift amount calculation unit  31 , a counter initial value calculation unit  32 , a deinterleave unit  33 , and an address change unit  34  are provided in the PDCCH deinterleave and cyclic deshift unit  14 . 
         [0081]    The cyclic shift amount calculation unit  31  calculates a cyclic shift amount Ncs implemented on a demodulation datum, before the demodulation datum is obtained. The cyclic shift amount Ncs is obtained as a reminder of dividing the total number of REGs: 
         [0000]        N   PDCCH   REG   {Math. 7}
 
         [0000]    where PDCCH is mapped by a cell ID: 
         [0000]        N   ID   cell   {Math. 8}
 
         [0000]      It is expressed as: 
         [0000]      N CS =N PDCCH   REG  mod N ID   cell   {Math. 9}
 
         [0082]    The counter initial value calculation unit  32  calculates initial values of a row counter and a column counter of a deinterleaving matrix, by using the cyclic shift amount Ncs that has been calculated, and gives the initial values to the deinterleave unit  33 . In a deinterleaving matrix (and its corresponding interleaving matrix at a transmission side), the number of rows C is expressed as: 
         [0000]        C=C   subblock   CC =32  {Math. 10}
 
         [0000]    namely, the number of rows C is fixed to be 32. In the mean time the number of columns R is expressed as: 
         [0000]        R =floor(( N   PDCCH   REG −1)/ C   subblock   CC )+1  {Math. 11}
 
         [0000]    in a matrix. The size of the matrix may sometimes be greater than the total number of REGs (Math. 7); and in such a case, a dummy bit D is inserted in a top row. Incidentally, the dummy bit is not transmitted. The number of dummy bits is expressed as: 
         [0000]        D=R·C−N   PDCCH   REG   {Math. 12}
 
         [0083]    In an interleaving process at the transmission side, at first dummy bits are written in the top row, starting from a top column, on an interleaving matrix. Subsequently, REGs of PDCCH are written in a direction, from a top column toward an end column. Then, according to a re-arrangement pattern in the rows as described below: 
         [0000]      &lt; P (0), P (1), . . .  P ( C   subblock   CC −1)&gt;  {Math. 13}
 
         [0000]    the written data are re-arranged in the rows, and read out in the end, from the top row toward the end row.  FIG. 2  shows an example of a re-arrangement pattern within rows of REGs of PDCCH by an interleaving process, and meanwhile  FIG. 3  shows an example of re-arrangement by using the re-arrangement pattern. 
         [0084]    Demodulation data obtained as a result of demodulating PDCCH that has been interleaved as described above are in an arrangement of a matrix shown at a lower position in  FIG. 3 . Incidentally, in this example, shown is a case where the cyclic shift amount Ncs is equal to 0. In reality, the data to be obtained as the demodulation data are shifted for the amount of Ncs. Before demodulating PDCCH, the counter initial value calculation unit  32  makes a decision on initial positions of rows and columns, in accordance with the numerical advancement for the cyclic shift amount Ncs.  FIG. 4  shows an example of such a processing operation.  FIG. 4  is a drawing for explaining an example of a processing operation by the counter initial value calculation unit  32 , with reference to a source code of a computer program. Rp is a row counter and Cp is a column counter. ‘n’ and ‘m’ are variables. 
         [0085]    Each time subsequent to a unit processing operation, namely for example, each time subsequent to demapping PDCCH of one REG; the deinterleave unit  33  advances an interleaving matrix for the number of REGs progressed after a last unit processing operation. Specifically to describe, while the row counter Rp being advanced, and at the time when the row counter Rp reaches the number of columns R, the column counter Cp is incremented. At the same time, the number of columns Rp is initialized to be zero. Until reaching the number of REGs progressed after the last unit processing operation, this process is repeated.  FIG. 5  shows an example of such a processing operation.  FIG. 5  is a drawing for explaining an example of a processing operation by a deinterleave unit  33 , with reference to a source code of a computer program. Wadr shown in  FIG. 5  is a deinterleaving pattern. 
         [0086]    The address change unit  34  changes an address where a demodulation datum is written, to a position number calculated by the deinterleave unit  33 . 
         [0087]    Explained next below are operations of cyclic deshifting and deinterleaving by the PDCCH cyclic deshift and deinterleave unit  14 , together with demapping by the PDCCH demap unit  13 . 
         [0088]    For demapping PDCCH, it is simply needed to follow a procedure of mapping operation shown in a flowchart of  FIG. 18 , in reverse order. Namely, demapping operation is carried out on the basis of the RE number (k′ described in  FIG. 18 ). In this case, needed is to store all top RE numbers of the REGs where PCFICH and PHICH are mapped, to a memory unit. The process results in an increased size of a circuit. Therefore, in the present embodiment, serial REG numbers provided to the REGs are used instead of the RE numbers, for demapping PDCCH. 
         [0089]    An arrangement of the REGs is common to Resource Block (RB), with regard to each RB. Accordingly, demapping PDCCH is carried out for each RB as a unit.  FIG. 6  and  FIG. 7  are diagrams that show all of applicable REG arrangements.  FIG. 6  is a diagram that shows an REG arrangement in the case where the number of transmission antennas is one or two. In the meantime,  FIG. 7  is a diagram that shows an REG arrangement in the case where the number of transmission antennas is four. Each of the squares shown in  FIG. 6  and  FIG. 7  represents one REG. Incidentally, in  FIG. 6  and  FIG. 7 , a horizontal direction and a vertical direction represent a time-wise direction and a frequency-wise direction, respectively. 
         [0090]    In the case of an OFDM symbol with no RS, REGs of one RB are grouped into three sections for placement; i.e., an upper section, a middle section, and a lower section. Therefore, a demapping operation for one RB is carried out in three stages, as a general rule. Incidentally, a numerical number in a cell (square) of each REG shown in  FIG. 6  and  FIG. 7  represents a PDCCH symbol-quadruplet number in one RB. Though PCFICH and PHICH are not taken into consideration for simple explanation here in  FIG. 6  and  FIG. 7 , it is needed in reality to carry out mapping PDCCH while staying away from any REG where PCFICH and PHICH are mapped, and therefore, sometimes the PDCCH symbol-quadruplet number may become different from the numerical number shown in  FIG. 6  and  FIG. 7 . 
         [0091]    Explained next below are operations of demapping and deinterleaving of PDCCH with reference to the flowcharts of  FIG. 8  and  FIG. 9 .  FIG. 8  is the flowchart for explaining a demapping operation of PDCCH.  FIG. 9  is the flowchart for explaining details of a process for one RB in the flowchart shown in  FIG. 8 . 
         [0092]    At Step S 11 , the PCFICH demap unit  11  demaps PCFICH. PCFICH is mapped to OFDM symbol # 0 .  FIG. 10  is a diagram that shows a mapping image of PCFICH. Each of the squares shown in  FIG. 10  represent one REG, and each square having diagonal lines represents an REG where PCFICH is demapped. In  FIG. 10 , a numerical number given in a square represents a PCFICH symbol-quadruplet number. 
         [0093]    In the meantime, according to NPL 1, an algorithm for calculating a PCFICH mapping pattern is expressed as Formula (1) shows. ‘k’ represents a mapping pattern. The number of RBs for one OFDM symbol, which an expression below show: 
         [0000]        N   RB   DL   {Math. 14}
 
         [0000]    becomes one of six different ways; i.e., 6, 15, 25, 50, 75, and 100, according to a system band width. The number of sub-carriers (SCs) for one RB, which an expression below shows: 
         [0000]        N   sc   RB   {Math. 15}
 
         [0000]    is a constant, i.e., 12. Moreover, a function, which an expression below shows: 
         [0000]      └ x┘   {Math. 16}
 
         [0000]    is a floor function. 
         [0000]      {Math. 17} 
         [0000]      PCFICH symbol−quadruplet #0  k=  k   
 
         [0000]      PCFICH symbol−quadruplet #1  k=  k +└N   RB   DL /2 ┘·N   sc   RB /2
 
         [0000]      PCFICH symbol−quadruplet #2  k=  k +└ 2 N   RB   DL /2 ┘·N   sc   RB /2
 
         [0000]      PCFICH symbol−quadruplet #3  k=  k +└ 3 N   RB   DL /2 ┘·N   sc   RB /2  Formula (1)
 
         [0094]    Wherein, ‘k’ in Formula (1) is a remainder of the following expression: 
         [0000]        N   RB   DL   N   sc   RB   {Math. 18}
 
         [0000]    Furthermore, the following expression: 
         [0000]          k     {Math. 19}
 
         [0000]    is calculated by way of Formula (2). 
         [0000]      {Math. 20} 
         [0000]          k = ( N   sc   RB /2)·( N   ID   cell  mod 2 N   RB   DL )  Formula (2)
 
         [0000]        N   ID   cell   {Math. 21}
 
         [0000]    The above-described expression represents a number assigned to each base station (Physical-layer cell identity), and it is given in a numeric range from 0 to 503. 
         [0095]    With the above expression being considered, it is understood that Math. 19 is a multiple number of 6 eventually, as being the following expression: 
         [0000]      ( N   sc   RB /2)  {Math. 22}
 
         [0000]    OFDM symbol # 0 , where PCFICH is mapped, has an RS and therefore the size of REG also becomes 6 in the same way. Accordingly, the REG number for which PCFICH is mapped can be calculated by using Formula (3). Incidentally, the following expression: 
         [0000]          k′     {Math. 23}
 
         [0000]    is calculated by dividing Math. 19 by Math. 22. 
         [0000]      {Math. 24} 
         [0000]      π REG   PCFICH [0 ]=  k′   
 
         [0000]      π REG   PCFICH [1 ]=  k′ +└N   RB   DL /2┘
 
         [0000]      π REG   PCFICH [2 ]=  k′ +└ 2 N   RB   DL /2┘
 
         [0000]      π REG   PCFICH [3 ]=  k′ +└ 3 N   RB   DL /2┘  Formula (3)
 
         [0096]    Wherein, Math. 23 is a remainder of the following expression: 
         [0000]      2 N   RB   DL   {Math. 25}
 
         [0000]    Furthermore, with respect to the following expression: 
         [0000]      π REG   PCFICH   [i]   {Math. 26}
 
         [0000]    it is also a remainder of Math. 25. For example, in the case where an addition result on the second member of the right side of Formula (3) is equal to or greater than Math. 25, this can be calculated by subtracting Math. 25 from the addition result. For demapping PDCCH, a calculation is made to obtain a PCFICH symbol-quadruplet number with which Math. 26 becomes minimum, in order to make it Math. 1. Wherein, ‘i’ is a PCFICH symbol-quadruplet number, which is a numerical value in a range from 0 to 3. 
         [0097]    Next, at Step S 12 , the PHICH demap unit  12  demaps PHICH. 
         [0098]    Though being usually mapped to OFDM symbol # 0 , PHICH is mapped to a plurality of OFDM symbols in the case of Extended PHICH duration. 
         [0099]      FIG. 11  is a diagram that shows a mapping image of normal PHICH. Meanwhile,  FIG. 12  is a diagram that shows a mapping image of PHICH in the case of Extended PHICH duration. A right-hand side of  FIG. 12  shows a mapping image of PHICH in the case of Extended PHICH duration and MBSFN subframe. Though mapping is carried out alternately for every two REGs on two OFDM symbols in the case of Extended PHICH duration and MBSFN subframe,  FIG. 12  shows a case of mapping alternately for every one REG, in order to simplify an explanation. 
         [0100]    Each of the squares shown in  FIG. 11  and  FIG. 12  represents one REG, and each square having diagonal lines represents an REG where PHICH is mapped. In  FIG. 11  and  FIG. 12 , a numerical number given in a square represents a PHICH symbol-quadruplet number. 
         [0101]    In the meantime, according to NPL 1, an algorithm for calculating a PHICH mapping pattern is as described next. Determined at first according to Formula (4) is an OFDM symbol number li′ where PHICH is mapped. 
         [0000]    
       
         
           
             
               
                 
                   
                       
                   
                    
                   
                     { 
                     
                       Math 
                       . 
                       
                           
                       
                        
                       27 
                     
                     } 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     l 
                     i 
                     ′ 
                   
                   = 
                   
                     { 
                     
                       
                         
                           0 
                         
                         
                           
                             
                               
                                 
                                   
                                     normal 
                                      
                                     
                                         
                                     
                                      
                                     PHICH 
                                      
                                     
                                         
                                     
                                      
                                     duration 
                                   
                                   , 
                                 
                               
                             
                             
                               
                                 
                                   all 
                                    
                                   
                                       
                                   
                                    
                                   subframes 
                                 
                               
                             
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       m 
                                       ′ 
                                     
                                     / 
                                     2 
                                   
                                   ⌋ 
                                 
                                 + 
                                 i 
                                 - 
                                 1 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             2 
                           
                         
                         
                           
                             
                               
                                 
                                   
                                     extended 
                                      
                                     
                                         
                                     
                                      
                                     PHICH 
                                      
                                     
                                         
                                     
                                      
                                     duration 
                                   
                                   , 
                                 
                               
                             
                             
                               
                                 
                                   MBSFN 
                                    
                                   
                                       
                                   
                                    
                                   subframes 
                                 
                               
                             
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       m 
                                       ′ 
                                     
                                     / 
                                     2 
                                   
                                   ⌋ 
                                 
                                 + 
                                 i 
                                 - 
                                 1 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             2 
                           
                         
                         
                           
                             
                               
                                 
                                   
                                     extended 
                                      
                                     
                                         
                                     
                                      
                                     PHICH 
                                      
                                     
                                         
                                     
                                      
                                     duration 
                                   
                                   , 
                                 
                               
                             
                             
                               
                                 
                                   
                                     
                                       
                                         subframe 
                                          
                                         
                                             
                                         
                                          
                                         1 
                                          
                                         
                                             
                                         
                                          
                                         and 
                                          
                                         
                                             
                                         
                                          
                                         6 
                                          
                                         
                                             
                                         
                                          
                                         in 
                                          
                                         
                                             
                                         
                                          
                                         frame 
                                       
                                     
                                   
                                   
                                     
                                       
                                         structure 
                                          
                                         
                                             
                                         
                                          
                                         type 
                                          
                                         
                                             
                                         
                                          
                                         2 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                       
                       
                         
                           i 
                         
                         
                           otherwise 
                         
                       
                     
                   
                 
               
               
                 
                   Formula 
                    
                   
                       
                   
                    
                   
                     ( 
                     4 
                     ) 
                   
                 
               
             
           
         
       
     
         [0000]    A PHICH symbol-quadruplet number ‘i’ is given as a numerical value in a range from 0 to 2. A PHICH mapping unit number m′ is given as a PHICH group number (0 to 25) at the time of Normal CP; and meanwhile, at the time of Extended CP, it is given as a value calculated by way of dividing a PHICH group number (0 to 50) by two and rounding off a digit after the decimal point. 
         [0102]    In the case of Extended PHICH duration and MBSFN subframe, PHICH is mapped to two OFDM symbols; and meanwhile, simply in the case of Extended PHICH duration, PHICH is mapped to three OFDM symbols. In the case of Normal PHICH duration, PHICH is mapped to OFDM symbol # 0 . 
         [0103]    Subsequently determined, as described below, is an REG number where PHICHI at each OFDM symbol is mapped. 
         [0104]    In the case of Extended PHICH duration and MBSFN subframe, an REG number where PHICHI is mapped is determined according to Formula (5). 
         [0000]    
       
         
           
             
               
                 
                   
                       
                   
                    
                   
                     { 
                     
                       Math 
                       . 
                       
                           
                       
                        
                       28 
                     
                     } 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       π 
                       REG 
                       PHICH 
                     
                      
                     
                       [ 
                       
                         
                           m 
                           ′ 
                         
                         , 
                         i 
                       
                       ] 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         1 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             0 
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         1 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                                 + 
                                 
                                   ⌊ 
                                   
                                     
                                       n 
                                       
                                         l 
                                         1 
                                         ′ 
                                       
                                     
                                     / 
                                     3 
                                   
                                   ⌋ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             1 
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         1 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                                 + 
                                 
                                   ⌊ 
                                   
                                     2 
                                      
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       3 
                                     
                                   
                                   ⌋ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             2 
                           
                         
                       
                     
                   
                 
               
               
                 
                   Formula 
                    
                   
                       
                   
                    
                   
                     ( 
                     5 
                     ) 
                   
                 
               
             
           
         
       
     
         [0105]    In any other case, an REG number where PHICHI is mapped is determined according to Formula (6). 
         [0000]    
       
         
           
             
               
                 
                   
                       
                   
                    
                   
                     { 
                     
                       Math 
                       . 
                       
                           
                       
                        
                       29 
                     
                     } 
                   
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       π 
                       REG 
                       PHICH 
                     
                      
                     
                       [ 
                       
                         
                           m 
                           ′ 
                         
                         , 
                         i 
                       
                       ] 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         0 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             0 
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         0 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                                 + 
                                 
                                   ⌊ 
                                   
                                     
                                       n 
                                       
                                         l 
                                         1 
                                         ′ 
                                       
                                     
                                     / 
                                     3 
                                   
                                   ⌋ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             1 
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 
                                   ⌊ 
                                   
                                     
                                       N 
                                       ID 
                                       cell 
                                     
                                     · 
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       
                                         n 
                                         0 
                                       
                                     
                                   
                                   ⌋ 
                                 
                                 + 
                                 
                                   m 
                                   ′ 
                                 
                                 + 
                                 
                                   ⌊ 
                                   
                                     2 
                                      
                                     
                                       
                                         n 
                                         
                                           l 
                                           1 
                                           ′ 
                                         
                                       
                                       / 
                                       3 
                                     
                                   
                                   ⌋ 
                                 
                               
                               ) 
                             
                              
                             
                                 
                             
                              
                             mod 
                              
                             
                                 
                             
                              
                             
                               n 
                               
                                 l 
                                 1 
                                 ′ 
                               
                             
                           
                         
                         
                           
                             i 
                             = 
                             2 
                           
                         
                       
                     
                   
                 
               
               
                 
                   Formula 
                    
                   
                       
                   
                    
                   
                     ( 
                     6 
                     ) 
                   
                 
               
             
           
         
       
     
         [0106]    In the meantime, an REG number where an ‘i’-th PHICH symbol-quadruplet is mapped is expressed with the following expression: 
         [0000]      π REG   PHICH   [m′,i]   {Math. 30}
 
         [0000]    The number of REGs of the OFDM symbol number li′, which an expression below shows: 
         [0000]        n   l′     1     {Math. 31}
 
         [0000]    is the number of REGs given by subtracting REGs where PCFICH is mapped, in the case of OFDM symbol # 0 . 
         [0107]    At the time of demapping PHICH, a PHICH symbol-quadruplet number ‘i’ and a PHICH mapping unit number m′, at a position where (Math. 30) becomes minimum, are searched for; and those numbers are each stored in (Math. 2) and (Math. 3). At this time, PHICH is mapped to a plurality of OFDM symbols, in the case of Extended PHICH duration. In this case, PHICH is held for each OFDM symbol in the memory unit  21 . 
         [0108]    At Step S 13 , the internal parameter storing unit  22 , the REG counter  23 , and the counter  25  each initialize the PDCCH symbol-quadruplet number and REG number, the minimum REG number where PCFICH is mapped, and the minimum REG number where PHICH is mapped. 
         [0109]    Namely, the REG counter  23  initializes the PDCCH symbol quadruplet number by setting 0 for m″. 
         [0110]    On the other hand, the internal parameter storing unit  22  initializes the PCFICH symbol-quadruplet number, as described in Formula (7). 
         [0000]      {Math. 32} 
         [0000]        n   quadruplet   PCFICH =MIN quadruplet   PCFICH   Formula (7)
 
         [0111]    Moreover, the REG counter  23  initializes the PCFICH REG number, as described in Formula (8). 
         [0000]      {Math. 33} 
         [0000]        n   REG   PCFICH [0 ]=  k′ +└n   quadruplet   PCFICH   ·N   RB   DL/ 2┘  Formula (8)
 
         [0112]    Furthermore, while the variable ‘i’ being incremented each time by 1 from 0 is less than the number of OFDM symbols L for which PDCCH is mapped; the PHICH symbol-quadruplet number, the PHICH mapping unit number, and the PHICH REG number are initialized in the internal parameter storing unit  22  according to Formula (9) and Formula (10). 
         [0000]      {Math. 34} 
         [0000]        n   quadruplet   PHICH   [i ]=MIN quadruplet   PHICH   [i]   
         [0000]        n   unit   PHICH   [i ]=MIN unit   PHICH   [i]   
         [0000]        n   REG   PHICH   [i]=π   REG   PHICH   [n   quadruplet   PHICH   [i],n   unit   PHICH   [p]]   Formula (9)
 
         [0113]    Incidentally, though the variable ‘i’ is incremented from 0 up to but not including the number of OFDM symbols L for which PDCCH is mapped; the PHICH symbol-quadruplet number, the PHICH mapping unit number, and the PHICH REG number are initialized according to Formula (9) in the case where the variable ‘i’ is less than the number of OFDM symbols L′ for which PHICH is mapped. 
         [0114]    In the case where the variable ‘i’ becomes not less than the number of OFDM symbols L for which PDCCH is mapped as a result of being incremented ‘i’ each time by 1, or the variable ‘i’ becomes not less than the number of OFDM symbols L′ for which PHICH is mapped; initializing is carried out in the internal parameter storing unit  22  with a great value, with which PHICH is not mapped and which does not exist in reality as an OFDM symbol, as shown in Formula (10). 
         [0000]      {Math. 35} 
         [0000]        n   quadruplet   PHICH   [i]= 4 
         [0000]        n   unit   PHICH   [i]= 51 
         [0000]        n   REG   PHICH   [i]= 301  Formula (10)
 
         [0115]    Incidentally, any great value that does not exist in reality, for example such as 301, may be substituted into the following expression: 
         [0000]        n   REG   PCFICH [1 ]˜n   REG   PCFICH [3]  {Math. 36}
 
         [0000]    Meanwhile, in the first place, a judgment on PCFICH may be carried out only in the case of l′=0. 
         [0116]    At Step S 14 , the cyclic shift amount calculation unit  31  calculates a cyclic shift amount Ncs implemented on a demodulation datum, before the demodulation datum is obtained. Moreover, at Step S 15 , the counter initial value calculation unit  32  calculates initial values of a row counter and a column counter of a deinterleaving matrix, by using the cyclic shift amount Ncs that has been calculated, and initializes both the counters. At Step S 16 , the REGs included in one RB are sequentially processed. 
         [0117]    The number of REGs included in one RB is specific, depending on whether or not an RS is mapped to the OFDM symbol; namely, the number is 2 when an RS is mapped, and it is 3 when no RS is mapped. In the present case, it is assumed for simplifying the process that the number of REGs included in one RB is always 3. 
         [0118]    In the following explanation, the REGs are each called ‘a lower section’, ‘a middle section’, and ‘an upper section’ in a direction from a lower frequency side. Presence of RS is dependent on the OFDM symbol, the TxAnt number, and the CP length. The number of REGs being 2 means that no middle section exists. Then, it is judged in a later step that the section is not a REG, and procedures from Step S 23  to Step S 32  shown in  FIG. 9  are skipped. 
         [0119]    Incidentally, only in the case of Extended CP, a narrow band (the number of RBs is 10 or less), and CFI being 3; the number of REGs of OFDM symbol # 3  is 2 so that no middle section exists. In this case, it is carefully needed to map PDCCH to a REG of an upper section of OFDM symbol # 3 , before an REG of an upper section of OFDM symbol # 2  in the case of the TxAnt number being 4, or an REG of an upper section of OFDM symbols # 1  and # 2  in any other case. 
         [0120]    At Step S 16  shown in  FIG. 8 , procedures from Step S 21  to S 34  shown in  FIG. 9  are repeated with respect to a lower section, a middle section, and an upper section of one RB. 
         [0121]    At Step S 21 , the counter  25  sets 0 for the OFDM symbol number li′. At Step S  22 , the comparator  24  receives an REG count value for PDCCH from the REG counter  23 , and makes a judgment on whether or not it is an REG for PDCCH. If it is judged to be such an REG, operation progresses to Step S 23 . 
         [0122]    At Step S 22 , if it is judged to be an REG, operation progresses to Step S 23 . 
         [0123]    At Step S 23 , the comparator  24  receives an REG count value for PCFICH from the REG counter  23 ; and by way of making a judgment on whether or not the REG count value for PCFICH is the same as the REG count value for PDCCH, the comparator  24  judges if PCFICH is already mapped to the REG indicated by the REG count value for PDCCH, or not. 
         [0124]    If it is judged at Step S 23  that PCFICH is already mapped to the REG indicated by the REG count value for PDCCH, operation progresses to Step S 24  to carry out an updating process with respect to PCFICH at the REG counter  23 . 
         [0125]    More specifically, if operation reaches an REG where PCFICH is mapped, mapping PDCCH for the REG is skipped. At the time, for the REG where PCFICH is mapped, an update is made so as to execute for a next PCFICH symbol-quadruplet number. The PCFICH symbol quadruplet number is updated by way of a calculation described as Formula (11), and in the meantime, the PCFICH REG number is updated by way of a calculation described as Formula (12). Since the PCFICH symbol-quadruplet number is 4, an operation of mod 4 is executed. Furthermore; 
         [0000]        n   REG   PCFICH [0]  {Math. 37}
 
         [0000]    is also a remainder of the following expression: 
         [0000]      2 N   RB   DL   {Math. 38}
 
         [0000]      {Math. 39} 
         [0000]        n   quadruplet   PCFICH =( n   quadruplet   PCFICH +1)mod 4  Formula (11)
 
         [0000]      {Math. 40} 
         [0000]        n   REG   PCFICH [0 ]=  k′ +└n   quadruplet   PCFICH   ·N   RB   DL /2┘  Formula (12)
 
         [0126]    After Step S 24 , operation progresses to Step S 32 . 
         [0127]    If it is judged at Step S 23  that PCFICH is not mapped to the REG indicated by the REG count value for PDCCH, operation progresses to Step S 25 . At Step S 25 , the comparator  24  receives an REG count value for PHICH from the REG counter  23 ; and by way of making a judgment on whether or not the REG count value for PHICH is the same as the REG count value for PDCCH, the comparator  24  judges if PHICH is already mapped to the REG indicated by the REG count value for PDCCH, or not. 
         [0128]    If it is judged at Step S 25  that PHICH is already mapped to the REG indicated by the REG count value for PDCCH, operation progresses to Step S 26  to carry out an updating process with respect to PHICH at the REG counter  23 . 
         [0129]    More specifically, if operation reaches an REG where PHICH is mapped, mapping PDCCH for the REG is skipped. At the time, for the REG where PHICH is mapped, an update is made so as to execute for a next PHICH symbol-quadruplet number. Since the PHICH symbol-quadruplet number is 3, an operation of mod 3 is executed. Incidentally, in order to simply explain, an explanation is made here without considering a case involving MBSFN. 
         [0130]    More in detail, in the case where a condition that Formula (13) mentions is fulfilled, the PHICH symbol-quadruplet number is updated by way of an operation that Formula (14) mentions. 
         [0000]      {Math. 41} 
         [0000]        n   unit   PHICH ( l ′)= N   unit   PHICH   Formula (13)
 
         [0000]      {Math. 42} 
         [0000]        n   quadruplet   PHICH ( l ′)=( n   quadruplet   PHICH ( l ′)+1)mod 3  Formula (14)
 
         [0131]    In other words, wherein the condition that Formula (13) mentions is fulfilled with the PHICH mapping unit number mentioned by the following expression: 
         [0000]        n   unit   PHICH ( l ′)  {Math. 43}
 
         [0000]    if the PHICH mapping unit number reaches the number of PHICH mapping units mentioned by the following expression: 
         [0000]        N   unit   PHICH   {Math. 44}
 
         [0000]    the PHICH symbol-quadruplet number mentioned by the following expression: 
         [0000]        n   quadruplet   PHICH ( l ′)  {Math. 45}
 
         [0000]    is updated. Then, as Formula (15) shows, the PHICH mapping unit number mentioned by the following expression, 
         [0000]        n   unit   PHICH ( l ′)  {Math. 46}
 
         [0000]    is initialized to be 0. 
         [0000]      {Math. 47} 
         [0000]        n   unit   PHICH ( l ′)=0  Formula (15)
 
         [0132]    If the condition mentioned by Formula (13) is not fulfilled, the PHICH mapping unit number mentioned by the following expression: 
         [0000]        n   unit   PHICH ( l ′)  {Math. 48}
 
         [0000]    is incremented only by 1, as shown in Formula (16). 
         [0000]      {Math. 49} 
         [0000]        n   unit   PHICH ( l ′)= n   unit   PHICH ( l ′)+1  Formula (16)
 
         [0133]    After the updating operations shown in Formula (13) to Formula (16), the REG number, mentioned by the following expression, to which PHICH is mapped; 
         [0000]        n   REG   PHICH ( l ′)  {Math. 50}
 
         [0000]    is updated, as Formula (17) shows. 
         [0000]      {Math. 51} 
         [0000]        n   REG   PHICH   [l′]=π   REG   PHICH   └n   quadruplet   PHICH   [l′],n   unit   PHICH   [l′]┘   Formula (17)
 
         [0134]    In the meantime, as far as no case involving MBSFN is taken into consideration, PHICH symbol-quadruplet is mapped continuously while each PHICH mapping unit being handled as a unit. Therefore, an update of an REG, where PHICH is mapped, can be calculated without referring to an expression described below: 
         [0000]      π REG   PHICH   [m′,i]   {Math. 52}
 
         [0000]    by way of incrementing the following expression by 1: 
         [0000]        n   REG   PHICH ( l ′)  {Math. 53}
 
         [0000]    Incidentally, in a case involving MBSFN, the OFDM symbol changes for every two REGs as a unit, and therefore an increment of 3 is made. Moreover, at the time of updating the PHICH symbol-quadruplet number that the following expression describes: 
         [0000]        n   quadruplet   PHICH ( l ′)  {Math. 54}
 
         [0000]    it is also needed to take two REGs as a unit into account. 
         [0135]    After Step S 26 , operation progresses to Step S 32 . 
         [0136]    If it is judged at Step S 25  that PHICH is not mapped to the REG indicated by the REG count value for PDCCH, the deinterleave unit  33  carries out a deinterleaving operation at Step S 27 . Then, only if the OFDM symbol number li′ agrees with the OFDM symbol number l′now at present at Step S 28 , operation progresses to Step S 29 . At Step S 29 , the address change unit  34  changes a write address for demodulation data to an address calculated by the deinterleave unit  33 . It is an operation that the following expression describes: 
         [0000]        REG   SYM   PDCCH   [Wadr]=REG ( n   REG   [l ′]×(4 +n   RS ), l ′)  {Math. 55}
 
         [0137]    Subsequently, the REG pair unit  26  demaps PDCCH at Step S 30 . Namely, the REG pair unit  26  demaps the REG having the PDCCH symbol-quadruplet number that the REG count value for PDCCH indicates. In this case, nRS represents the number of RSs in the REG, i.e., 0 or 2. 
         [0138]    After Step S 30 , or in the case where the OFDM symbol number li′ does not agree with the OFDM symbol number l′now at present at Step S 28 , operation progresses to Step S 31 . At Step S 31 , the internal parameter storing unit  22  increments the PDCCH symbol-quadruplet number m″ only by 1. At Step S 32 , the REG counter  23  increments the REG number of each OFDM symbol only by 1. 
         [0139]    At Step S 33 , the REG counter  23  increments the OFDM symbol number l′ only by 1. At Step S 34 , the comparator  24  makes a judgment on whether or not the OFDM symbol number l′ has reached the number of OFDM symbols L for which PDCCH is mapped. If it is judged at Step S 34  that the OFDM symbol number l′ has not yet reached the number of OFDM symbols L for which PDCCH is mapped, operation returns to Step S 22  in order to repeat the procedures described above. 
         [0140]    After the procedures finish with respect to a lower section, a middle section, and an upper section of one RB, operation returns to Step S 16  shown in  FIG. 8  to progress to Step S 17 . At Step S 17 , the control unit  27  judges whether or not nREG[0] is equal to two times of the number of RBs for one OFDM symbol (Math. 14). If it is judged that nREG[0] is not equal to two times of the number of RBs for one OFDM symbol (Math. 14), operation returns to Step S 16  in order to repeat the procedures described above. 
         [0141]    If it is judged at Step S 17  that nREG[0] is equal to two times of the number of RBs for one OFDM symbol (Math. 14), the procedures of demapping PDCCH finish. 
         [0142]    As described above, in the procedures of demapping PDCCH, a number assigned to an REG is used instead of an RE number. Then, at the time of demapping PDCCH, the REG numbers of REGs where PCFICH and PHICH are mapped are calculated in an ascending order for staying away from those REGs so that it becomes possible to eliminate “a memory unit for storing all top RE numbers of REGs where PCFICH and PHICH are mapped”, though the memory unit being conventionally needed. In other words, it becomes possible to demap PDCCH in LTE by means of a small-scale circuit. 
         [0143]    Moreover, a parameter called l′now representing the OFDM symbol number at present is added for demapping PDCCH, in such a way that demapping is carried out only when the OFDM symbol number l′ agrees with the OFDM symbol number l′now at present. 
         [0144]    Demapping PDCCH is carried out, while skipping any REG where PCFICH or PHICH is mapped. In order to find any REG where PCFICH or PHICH is mapped, it is needed to search a series of REGs in due order. In the meantime, for demapping PDCCH, it is unnecessary to take the order of the REGs into consideration. Therefore, all the REGs are searched with respect to each OFDM symbol, and demapping PDCCH is carried out only for a REG of the OFDM symbol at present. 
         [0145]      FIG. 13  is a drawing that explains a demapping operation by using an OFDM symbol number lnow′ at present. The drawing shows a comparison example with respect to operation timing of two cases: namely, in one case where a demapping operation is carried out without considering the OFDM symbol number lnow′ at present, and in the other case where a demapping operation is carried out only when the OFDM symbol number l′ agrees with the OFDM symbol number l′now at present. 
         [0146]    In the case where a demapping operation is carried out without considering the OFDM symbol number lnow′ at present, namely in the case where the operation is carried out for each series of REGs, searching REGs is needed only one time. Meanwhile, in this case, the operation can get started only after receiving all the REGs. On the contrary, in the case where the operation is carried out with respect to each OFDM symbol, searching REGs (the procedures shown in  FIG. 9 ) needs to be done each time. Nevertheless, fortunately in that case, demapping PDCCH can be carried out each time when RRE for one OFDM symbol is received, and therefore it becomes possible to reduce the process overhead and cut down the memory unit for storing RRE data. 
         [0147]    Incidentally, though the above explanation describes a method; in which searched is a PCFICH symbol-quadruplet number corresponding to a minimum REG number to which PCFICH is mapped, and then, starting from the position there, the operation of demapping PDCCH sequentially creates a demapping pattern of PCFICH for use; four demapping patterns of PCFICH may be prepared and stored in the first place for using them sequentially, or the four patterns may be re-arranged for using them. 
         [0148]    Furthermore to describe; in the above method, though searched are a PHICH symbol-quadruplet number corresponding to a minimum REG number to which PHICH is mapped, and a PHICH mapping unit number, and in the operation of demapping PDCCH, the PHICH symbol-quadruplet number and the PHICH mapping unit number are initialized at first, and then the REG number of PHICH is subsequently initialized; the minimum REG number to which PHICH is mapped is already searched at the time of demapping PHICH, and therefore the minimum REG number may be stored and used for demapping PDCCH. 
         [0149]    In the embodiment described above, deinterleaving of PDCCH and cyclic deshifting are processed in parallel with demodulation so that the process time of the deinterleaving and cyclic deshifting, as well as the memory unit for storing the data after processing operations of the deinterleaving and cyclic deshifting can be reduced. Under the situation, the demodulation is carried out for each OFDM symbol as a unit. 
         [0150]    In the demodulation for each OFDM symbol as a unit, while operation is carried out in a frequency-wise direction, PDCCH is sequentially mapped in a direction of the OFDM symbols. Therefore, sometimes the REGs of PDCCH may be progressed forward at most for the number of OFDM symbols for which PDCCH is mapped. Accordingly, in order that the deinterleaving operation is carried out for each OFDM symbol as a unit, it is made possible to advance for two steps or more at a time in operation on a deinterleaving matrix. Incidentally, in this context, the operation on a deinterleaving matrix means a procedure for advancing both counters in operation of calculating a position number on the matrix by using a row counter and a column counter. 
         [0151]    Moreover, the cyclic shift is executed with initial values given to both the counters that are used in the operation on a deinterleaving matrix. Therefore, the cyclic shift amount is calculated before writing an initial demodulation datum, and then the initial values are calculated by using the cyclic shift amount. In the deinterleaving operation, both the counters are initialized with the initial values to start the operation. 
         [0152]    Finally, an address into which the demodulation datum is written is changed to the address calculated by using both the counters of the deinterleaving matrix. 
         [0153]    In this way, for deinterleaving and cyclic deshifting as well, operation can be carried out for each OFDM symbol as a unit. Thus, the overhead of process time is reduced. Furthermore, the operation can be carried out in parallel with demodulation so that the memory unit required can be cut down. 
         [0154]    The series of processes described above may be executed by means of hardware, and may also be executed by way of software. For executing the series of processes by way of software, a computer program constituting the software is installed into a computer, which is built in exclusive-use hardware, from a computer program recording medium; or the software is installed from a computer program recording medium, for example, into a general-purpose personal computer that can execute various functions with various computer programs being installed. 
         [0155]      FIG. 14  is a block diagram showing a configuration example of hardware of a computer that executes the series of processes described above by way of a computer program. 
         [0156]    In the computer; a central processing unit (CPU)  51 , a read only memory (ROM)  52 , and a random access memory (RAM)  53  are interconnected by using a bus  54 . 
         [0157]    Moreover, an I/O interface  55  is connected to the bus  54 . Connected to the I/O interface  55  are; an input unit  56  including a keyboard, a mouse, a microphone, and the like; an output unit  57  including a display, a speaker, and the like; a storage unit  58  including a hard disc, a non-volatile memory, and the like; a communication unit  59  including a network interface and the like; and a drive  60  for driving a removable medium  61  such as a magnetic disc, an optical disc, a magnetic optical disc, or a semiconductor memory. 
         [0158]    In the computer configured as described above, the CPU  51  loads a computer program, for example, stored in the storage unit  58  by way of the I/O interface  55  and the bus  54 , and executes the program in order to carry out the series of processes described above. 
         [0159]    The computer program to be executed by the computer (the CPU  51 ) is recorded, for being provided, in the removable medium  61  as a package medium; such as, for example, a magnetic disc (including a flexible disc), an optical disc (Compact Disc-Read Only Memory (CD-ROM), Digital Versatile Disc (DVD), and the like), a magnetic optical disc, or a semiconductor memory; or the computer program is provided via a wired or wireless transmission medium such as a local area network, the Internet, or digital satellite broadcasting. 
         [0160]    Then, the computer program can be installed in the computer by way of being stored in the storage unit  58  through the I/O interface  55 , while the removable medium  61  being mounted on the drive  60 . Alternatively, the computer program can be installed in the computer by way of being stored in the storage unit  58 , while being received in the communication unit  59  by the intermediary of a wired or wireless transmission medium. In another way, the computer program can previously be installed in the computer by way of storing the program in advance in the ROM  52  or the storage unit  58 . 
         [0161]    Incidentally, the program to be executed by the computer may be a program with which processes are carried out in chronological order along the sequence explained in this specification document, or may be a program with which processes are carried out in parallel or at the time as required, such as, in response to a call. 
         [0162]    Furthermore, a scope of application of the embodiment of the present invention is not limited only to the embodiment described above, and various other variations may be made without departing from the concept of the present invention. 
       REFERENCE SIGNS LIST 
       [0000]    
       
           11 . PCFICH demap unit 
           12 . PHICH demap unit 
           13 . PDCCH demap unit 
           14 . PDCCH cyclic deshift and deinterleave unit 
           21 . memory unit 
           22 . internal parameter storing unit 
           23 . REG counter 
           24 . comparator 
           25 . counter 
           26 . REG pair unit 
           27 . control unit 
           31 . cyclic shift amount calculation unit 
           32 . counter initial value calculation unit 
           33 . deinterleave unit 
           34 . address change unit