WO2016166822A1 - Transmission device, reception device, and communication system - Google Patents

Transmission device, reception device, and communication system Download PDF

Info

Publication number
WO2016166822A1
WO2016166822A1 PCT/JP2015/061518 JP2015061518W WO2016166822A1 WO 2016166822 A1 WO2016166822 A1 WO 2016166822A1 JP 2015061518 W JP2015061518 W JP 2015061518W WO 2016166822 A1 WO2016166822 A1 WO 2016166822A1
Authority
WO
WIPO (PCT)
Prior art keywords
symbol
unit
data
symbols
block
Prior art date
Application number
PCT/JP2015/061518
Other languages
French (fr)
Japanese (ja)
Inventor
文大 長谷川
Original Assignee
三菱電機株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 三菱電機株式会社 filed Critical 三菱電機株式会社
Priority to JP2017512501A priority Critical patent/JP6214822B2/en
Priority to PCT/JP2015/061518 priority patent/WO2016166822A1/en
Publication of WO2016166822A1 publication Critical patent/WO2016166822A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J11/00Orthogonal multiplex systems, e.g. using WALSH codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/01Equalisers

Definitions

  • the present invention relates to a transmission device, a reception device, and a communication system that perform block transmission.
  • transmission path frequency selectivity and time variation occur due to multipath fading caused by reflection of a transmission signal on a building or the like, and Doppler fluctuation caused by movement of a terminal.
  • the received signal is a signal that interferes with a transmitted symbol and a symbol that arrives after a delay time.
  • a single carrier (SC) block transmission system has recently attracted attention in order to obtain the best reception characteristics (for example, see Non-Patent Document 1 below).
  • the single carrier block transmission scheme can reduce the peak power as compared with an OFDM (Orthogonal Frequency Division Multiplexing) transmission scheme (for example, see Non-Patent Document 2 below) which is a multicarrier (MC) block transmission.
  • OFDM Orthogonal Frequency Division Multiplexing
  • a transmitter that performs SC block transmission generally performs DFT (Discrete Fourier Transform) processing in a precoder.
  • DFT Discrete Fourier Transform
  • the conventional SC block transmission technique it is possible to suppress transmission peak power while reducing the influence of multipath fading.
  • the phase and amplitude between the SC blocks are discontinuous, so that signal components other than the desired band, such as out-of-band spectrum or out-of-band leakage, are generated.
  • the out-of-band spectrum becomes interference to an adjacent channel or frequency band. For this reason, out-of-band spectrum suppression is required.
  • a spectrum mask that is an allowable range of spectrum is determined, and it is necessary to suppress an out-of-band spectrum so as to satisfy the spectrum mask.
  • the present invention has been made in view of the above, and an object of the present invention is to obtain a transmitter capable of suppressing out-of-band spectrum.
  • a transmission apparatus includes a data symbol generation unit that generates a data symbol for each block, and a past block in the data symbol generated by the data symbol generation unit. Insertion unit that inserts past symbols, which are data symbols, and generates a multiple symbol, a time-frequency conversion unit that converts the multiple symbol into frequency domain data, and an interpolation unit that performs interpolation processing on the frequency domain data And a frequency time conversion unit for converting the data after the interpolation processing into time domain data composed of a plurality of samples.
  • the transmission apparatus includes: an addition unit that performs addition processing on at least some of the past symbols or at least some of the samples corresponding to the past symbols of the time domain data; and time domain data
  • a selection unit that selects a sample at a position to be selected from the selection unit and inputs the sample to the addition unit, and a transmission unit that transmits a block signal including time-domain data.
  • the addition unit adds the adjustment amount calculated based on the sample input from the selection unit in the block signal generation process of the previous block to at least some symbols or at least some samples.
  • the transmission device according to the present invention has an effect that the out-of-band spectrum can be suppressed.
  • FIG. 1 is a diagram illustrating a configuration example of a transmission device according to a first embodiment
  • 1 is a diagram illustrating a configuration example of a control circuit according to a first embodiment
  • the figure for demonstrating the definition of the term used in Embodiment 1 The figure which shows the example of arrangement
  • the flowchart which shows an example of the production
  • FIG. 10 is a diagram illustrating a configuration example of a receiving apparatus according to Embodiment 3
  • FIG. 1 is a diagram of a configuration example of a transmission apparatus according to the first embodiment of the present invention.
  • the transmission apparatus 20 according to the present embodiment is a transmission apparatus that performs SC block transmission.
  • the data symbol generation unit 1, the addition processing unit 2, the symbol insertion unit 3, the symbol selection unit 4, the DFT ( A Discrete Fourier Transform unit 5, an oversampling processing unit 6, an IDFT (Inverse DFT) unit 7, a sample selection unit 8, a CP (Cyclic Prefix) addition unit 9, a transmission unit 10 and a storage unit 11 are provided.
  • the data symbol generation unit 1 generates data symbols such as a PSK (Phase Shift Keying) symbol and a QAM (Quadrature Amplitude Modulation) symbol based on the information data to be transmitted.
  • the data symbol generator 1 generates a data symbol for each block in SC block transmission, that is, in units of blocks. Note that the data symbol generation unit 1 may use data subjected to error correction coding as information data.
  • the addition processing unit 2 reads a past symbol that is a data symbol of a past block, that is, a data symbol of one block before and is stored in the storage unit 11, and an adjustment value for at least a part of the read past symbol It is an addition part which performs the addition process which adds.
  • the addition process is a process performed to suppress the out-of-band spectrum. Although the details of the addition process and the adjustment value will be described later, the addition processing unit 2 performs the adjustment calculated based on the sample input from the sample selection unit 8 in the CP block generation process described later of the previous block. The quantity is added to at least some of the above symbols.
  • the symbol insertion unit 3 inserts the past symbol after the addition processing by the addition processing unit 2 into the data symbol generated by the data symbol generation unit 1, and the past after the addition processing with the data symbol. Multiple symbols, which are symbols for one block in which symbols are multiplexed, are generated.
  • the symbol selection unit 4 selects a symbol to be selected from the symbols for one block output from the symbol insertion unit 3, stores the selected symbol in the storage unit 11, and is input by the symbol insertion unit 3.
  • the symbols for one block are input to the DFT unit 5 as they are.
  • the symbol selection unit 4 selects a first first number of symbols and a second second number of symbols from among the symbols multiplexed by the symbol insertion unit 3, and selects the selected symbols. Is stored in the storage unit 11.
  • the first number is K or K1 described later
  • the second number is K or K2 described later.
  • the symbols to be selected will be described later.
  • the DFT unit 5 is a time-frequency conversion unit that converts symbols for one block into frequency domain data by performing DFT processing on the symbols for one block input from the symbol selection unit 4. Any component that converts a time-domain signal into a frequency-domain signal can be used instead of the DFT unit 5.
  • an FFT unit that performs FFT (Fast Discrete Fourier Transform) instead of the DFT unit 5 May be used.
  • the oversampling processing unit 6 is an interpolation unit that performs oversampling processing, which is a kind of interpolation processing, on the data after DFT processing.
  • the oversampling rate is L.
  • the oversampling processing unit 6 further performs a process of converting the data after the DFT processing into a desired bandwidth.
  • the oversampling process of the present embodiment is an interpolation process that increases the sampling rate of the time domain signal, that is, narrows the sampling interval. Specifically, for example, using the signal interpolation formula described in “B.
  • Porat,“ A Course in Digital Signal Processing ”, John Wiley and Sons Inc., 1997” (hereinafter referred to as Porat literature), etc.
  • Oversampling processing processing to increase the sampling rate, that is, to narrow the sampling interval) is performed, and oversampling is performed on the input signal so that there are L sampling points per symbol.
  • the oversampling process is performed when the oversampling rate is L, and the time domain data output from the IDFT unit 7 with respect to the input sampling rate, that is, the time domain data input to the DFT unit 5.
  • Oversampling is performed so that the sampling rate of L becomes L times.
  • the oversampling rate is a value indicating how many times the sampling rate after oversampling is higher than the input sampling rate.
  • the oversampling process for example, a technique such as zero insertion can be used.
  • the time domain data input to the DFT unit 5 is interpolated by inserting zeros into the data after the DFT processing, which is the frequency domain data, and performing the IDFT processing on the data after the zero insertion.
  • L need not be an integer, but may be a real number.
  • the oversampling processing unit 6 converts the data after the DFT processing into the bandwidth, assuming that the bandwidth of the data after the DFT processing is B 1 and the desired bandwidth is B 2 as the processing to convert to the desired bandwidth. Convert to B 2 data. This conversion to the desired bandwidth can be realized by inserting 0 corresponding to the difference between B 2 and B 1 when B 1 ⁇ B 2 , for example.
  • the oversampling processing unit 6 performs the above-described interpolation processing after performing processing for conversion to a desired bandwidth.
  • the IDFT unit 7 performs IDFT processing on the data after oversampling processing that is frequency domain data, thereby converting the data after the oversampling processing into time domain data composed of a plurality of samples. It is a time conversion unit. Instead of the IDFT unit 7, any component that converts a time domain signal into a frequency domain signal can be used. For example, instead of the IDFT unit 7, an IFFT unit that performs IFFT (Inverse FFT) is used. May be.
  • the sample selection unit 8 is a selection unit that selects the sample after the IDFT processing, that is, the sample at the position to be selected from the data in the time domain, and inputs the sample to the addition processing unit 2.
  • the sample selection unit 8 selects a sample at a position to be selected from the samples after IDFT processing and inputs the selected sample to the addition processing unit 2, and also adds all samples after IDFT processing, that is, samples for one block to the CP addition unit. Output to 9. Since the sample at the position to be selected is used by the addition processing unit 2 in the processing of the next block, the sample selection unit 8 delays the selection block by a predetermined time in accordance with the processing timing of the next block. A sample at a position may be input to the addition processing unit 2.
  • the CP adding unit 9 adds a CP to the sample output from the sample selecting unit 8 to generate a block signal. Specifically, the CP adding unit 9 copies, that is, duplicates, the last N CP L samples in the block and arranges them at the head of the block. N CP is a value corresponding to the number of symbols copied in the CP addition, and L is the above-described oversampling rate.
  • the transmission unit 10 converts the block signal, which is a signal after the addition of the CP, into a signal corresponding to the transmission path and transmits the signal.
  • the transmission unit 10 When the transmission path is a wireless transmission path, the transmission unit 10 includes an analog digital circuit that converts a digital signal into an analog signal, an antenna that transmits the analog signal as a radio wave, and the transmission path is a wired transmission path. It includes an analog / digital circuit, a circuit that performs processing of a physical layer corresponding to a wired transmission path, and the like.
  • the data symbol generation unit 1 is a modem or a modulator
  • the DFT unit 5 and the IDFT unit 7 are electronic circuits using, for example, a flip-flop circuit, a shift register, etc.
  • the storage unit 11 is a memory
  • the transmission unit 10 It is a transmitter.
  • Each of the addition processing unit 2, symbol insertion unit 3, symbol selection unit 4, oversampling processing unit 6, sample selection unit 8, and CP addition unit 9 can also be realized as an electronic circuit.
  • some of the components shown in FIG. 1 may be configured by software.
  • the components realized by software are realized by the control circuit 200 shown in FIG. As shown in FIG.
  • the control circuit 200 includes an input unit 201 that is a reception unit that receives data input from the outside, a processor 202, a memory 203, and an output unit 204 that is a transmission unit that transmits data to the outside.
  • the input unit 201 is an interface circuit that receives data input from the outside of the control circuit 200 and applies the data to the processor 202
  • the output unit 204 is an interface that transmits data from the processor 202 or the memory 203 to the outside of the control circuit 200. Circuit.
  • the processor 202 reads a program corresponding to each component of the transmission device 20 stored in the memory 203. It is realized by executing.
  • the memory 203 is also used as a temporary memory in each process executed by the processor 202.
  • FIG. 3 is a diagram for explaining definitions of terms used in the present embodiment.
  • the number of data symbols for one block generated by the data symbol generator 1 is N D.
  • M be the number of symbols for one block of the multiplexed symbols after the data symbol and the past symbol after the addition processing are multiplexed by the symbol insertion unit 3.
  • the DFT unit 5 receives M symbols and outputs M frequency domain data. An input unit to the DFT unit 5, that is, one point of input data is called a symbol.
  • the N symbols d (bold) k in the k-th block after the past symbol and the data symbol are multiplexed by the symbol insertion unit 3 are defined as the following equation (1).
  • B (bold) T represents transposition of an arbitrary matrix B (bold).
  • the oversampling rate of oversampling performed by the oversampling processing unit 6 is L as described above.
  • the number of data for one block output from the oversampling processing unit 6 is NL.
  • N is a value corresponding to the desired bandwidth B 2 described above.
  • the IDFT unit 7 receives NL frequency domain data and outputs NL time domain data.
  • An output unit of the IDFT unit 7, that is, one point of data output from the IDFT unit 7 is called a sample.
  • the entire data output from the IDFT unit 7 in one IDFT process is referred to as a block sample, and the block signal that is the entire data output from the CP adding unit 9 is referred to as a CP block. Therefore, as shown in FIG. 3, one block sample is composed of NL samples.
  • the NL samples are obtained by interpolating N symbols output from the symbol insertion unit 3, that is, N symbols.
  • One CP block is composed of (N + N CP ) L samples, that is, (N + N CP )
  • N CP L samples of one block sample are copied by the CP adding unit 9 and arranged at the head. Therefore, after the last sample of the previous block, the first sample of the portion copied by the CP adding unit 9 is transmitted.
  • the phase and amplitude of the last sample of the previous block and the first sample of the copied part should be as smooth as possible. It is desirable to connect.
  • the first symbol of the data input to the DFT unit 5, that is, the symbol multiplexed by the symbol insertion unit 3, is defined as the first position
  • the first sample copied by the CP adding unit 9 is defined as the first position
  • the position of the corresponding symbol is defined as the second position.
  • the second position is the M ⁇ Xth symbol from the end among the M symbols input to the DFT unit 5.
  • X indicates the symbol number at the position corresponding to the second position of the M symbols input to the DFT unit 5.
  • the last sample among the block samples output from the IDFT unit 7 is the last symbol and the first symbol input to the DFT unit 5. Interpolation point between Therefore, if the first symbol of the previous block is equal to the symbol at the second position, the last sample of the previous block is between the last symbol of the previous block and the first symbol. Since it is an interpolation point, the last sample of the previous block and the first sample after CP insertion are smoothly connected.
  • the data input to the DFT unit 5 and the data output from the IDFT unit 7 are both time domain data for one block, but are interpolated by oversampling as described above. Therefore, when L is not 1, the data points are different between the two.
  • the data is output from the IDFT unit 7 at the first position.
  • the corresponding sample is the 0th sample, but when L is not 1, the sample corresponding to the second position among the data output from the IDFT unit 7 is not the Xth.
  • the head position of the NL sample output from the IDFT unit 7 is A1
  • the position of the sample corresponding to the second position among the NL samples output from the IDFT unit 7 is A2.
  • the past symbols inserted by the symbol insertion unit 3 are, for example, the first K symbols one block before and the last K symbols. That is, when the data symbol generation unit 1 generates the data symbol of the kth block and inputs the data symbol to the symbol insertion unit 3, the symbol insertion unit 3 sets the symbol insertion unit 3 when the k ⁇ 1th block is generated.
  • an output d (bold) of the k-1, the 2K symbols ⁇ d k-1, MK, d k-1, MK + 1, ..., d k-1, M-1, d k -1,0 , d k-1,1 ,..., D k-1, K-1 ⁇ are inserted as past symbols into the input data symbol.
  • k-1, M-1 ⁇ the first symbol group, d k-1, 0 or later K symbols ⁇ d k-1,0, d k -1,1, ..., d k-1, K ⁇ 1 ⁇ is called a second symbol group.
  • the oversampling process and the IDFT process By performing the oversampling process and the IDFT process, it becomes an interpolation point between the last symbol of the (k ⁇ 1) th block and the leading symbol of the (k ⁇ 1) th block.
  • the symbol at the kth second position is the same as the first symbol of the k ⁇ 1th block. Therefore, the first sample of the k-th block after CP insertion is the sample corresponding to the A2 sample in FIG. 3, that is, the second position, and is smoothly connected to the last sample of the (k ⁇ 1) -th block. Thereby, an out-of-band spectrum can be reduced.
  • g k, ND subscript portion of ND-1 indicates the N D.
  • the symbol insertion unit 3 includes M data symbols, a symbol group arranged on the left side of a past symbol arranged including the second position, and a past symbol arranged including the second position. It is divided into symbols arranged on the right side.
  • g k, Q be the first symbol in the symbol group arranged on the right side of the past symbol arranged including the second position.
  • the DFT process performed by the DFT unit 5, that is, the M-point DFT process can be expressed as the following Expression (3).
  • s (bold) k indicates a DFT processing result
  • s (bold) k [s k, 0 ,..., s k, M ⁇ 1 ] T.
  • the frequency domain signal s (bold) k, Z that has been zero-inserted up to the NL point by the oversampling process in the oversampling processing unit 6 can be expressed by the following equation (4).
  • the IDFT processing by the IDFT unit 7 can be expressed by the following equation (5).
  • B (bold) H indicates Hermitian transpose of the matrix B (bold).
  • W (bold) M 1 is W (bold) is a matrix obtained by extracting a row of up to M / 2-1 line from the 0 line of M W (bold) M, 2 is W (bold) M of M / This is a matrix extracted from the second row to the M ⁇ 1th row.
  • 0 (bold) NL-M M is a matrix formed by (NL-M) ⁇ M zeros.
  • a matrix A (bold) shown in the following formula (7) is defined.
  • the first position, the second position, A1, and A2 will be described using the above-described equations.
  • the symbol at the first position is d k, 0 and the symbol at the second position is d k, X.
  • the value of Q will be described.
  • the K past symbols ⁇ d k ⁇ 1, MK , d k ⁇ 1, M ⁇ K + 1 ) from the Q ⁇ 1th data symbol. ,..., D k ⁇ 1, M ⁇ 1 ⁇ is the second position, that is, the Xth position. Therefore, Q X ⁇ K.
  • the symbol insertion unit 3 divides the data symbols into the 0th to Q ⁇ 1th data symbol groups and the Qth to N D ⁇ 1th data symbol groups, and the second data symbol group is preceded by the second data symbol group.
  • a symbol group is arranged, a first symbol group and a second symbol group are arranged after the former data symbol group, and a latter data symbol group is arranged after the second symbol group.
  • the second position corresponding to A2 which is the head position copied as the CP can be obtained, and the insertion position of the past symbol into the data symbol can be determined.
  • the number of symbols after the second position and the number of symbols before the second position are the same. However, the number of symbols after the second position and the number of symbols before the second position are the same. May be different.
  • past symbols are arranged as shown in the following equation (9). X indicates the second position, K1 indicates the number of symbols of the past symbols after the second position, and K2 indicates the number of symbols before the symbol immediately before the second position.
  • Q 16 ⁇ K.
  • K is the number of symbols of one past symbol is less M-X.
  • each value of K, M, N, L, and N CP can be arbitrarily determined within a range in which the relationship shown in the following formula (10) is satisfied.
  • X is a multiple of 6, for example, any value of 6, 12, 18 May be set to
  • FIG. 4 is a diagram illustrating an arrangement example of past symbols according to the present embodiment.
  • j indicates the symbol number in the N symbols after the data symbol and the past symbol are multiplexed.
  • the past symbol after the addition process is inserted into the data symbol, but in FIG. 4, the past symbol before the addition process is virtually multiplexed with the data symbol to indicate the position of the past symbol. The arrangement is shown.
  • FIG. 5 is a flowchart illustrating an example of a CP block generation processing procedure according to the present embodiment.
  • the data symbol generation unit 1 generates a data symbol (step S1).
  • the addition processing unit 2 reads the past symbol read from the storage unit 11 using the sample selected by the sample selection unit 8 in the processing of the previous block, and sets it as the symbol to be added among the read past symbols. Addition processing is performed for the above (step S2).
  • the past symbol read from the storage unit 11 in step S2 is the symbol stored in step S4 when the previous CP block is generated.
  • Addition processing unit 2 to the following as shown in equation (11), k + 1 th block is a symbol position of the addition processed in that d (bold) k + 1 corresponding I G th symbol, Addition processing for adding an adjustment value ⁇ (bold) k + 1, which will be described later, is performed.
  • the IG- th symbol may be one or plural. That is, the number G of elements in the set of I G is 1 or more. As will be described later, the IG- th symbol is, for example, a symbol that continues to the second position including the second position.
  • the symbols after the above addition processing are normalized so that the average power is the same as that before the adjustment.
  • the addition process in the (k + 1) th block will be described.
  • the CP block of the k-th block has already been generated.
  • the output data from the IDFT unit 7 obtained in the process of generating the CP block of the kth block is y (bold) (hat) k .
  • y (bold) (hat) k is data that has been subjected to addition processing in the process of generating the CP block of the k-th block.
  • FIG. 6 is a diagram illustrating an example of sample positions to be considered in the addition processing of the present embodiment.
  • the symbols of the kth block are placed around the second position so that the samples around A2 of the (k + 1) th block are equal to the samples of A1 of the kth block. insert.
  • the samples around A2 of the (k + 1) th block and the samples around A1 in the kth block are made equal by using the circularity of Fourier transform.
  • the addition processing unit 2 performs P1 + P2 samples around A2 of the (k + 1) th block represented by the following equation (12) and the kth block represented by the following equation (13): A1 so that the periphery of P1 + P2 samples equal the to determine the adjustment amount to be added to the symbol position of I G in the k + 1 th block.
  • the P1 + P2 samples around A1 are appropriately referred to as a first sample group
  • the P1 + P2 samples around A2 are appropriately referred to as a second sample group.
  • P2 samples at the end of the k-th block which are positions consecutive to A1 by being cycled by the property of Fourier transform in a finite section Including.
  • the sample selection unit 8 extracts the P1 + P2 sample shown in Expression (13) centered on A1 from the input signals and outputs the sample to the addition processing unit 2 To do.
  • the addition processing unit 2 defines A (bold) ′ as a matrix obtained by extracting a row corresponding to I O and a column corresponding to I G.
  • the size of A (bold) ′ is (P1 + P2) ⁇ G.
  • the error ⁇ (bold) k + 1 at the block boundary can be expressed by the following equation (14).
  • the addition processing unit 2 uses the samples input from the sample selection unit 8 and the P1 + P2 symbols around A2 of the k + 1-th block for the past symbols corresponding to y (bold) k + 1, S1.
  • ⁇ (bold) k + 1 is obtained by (14)
  • ⁇ (bold) k + 1 is obtained using ⁇ (bold) k + 1 and matrix A (bold) ′, and ⁇ (Bold) Add k + 1 .
  • the past symbol after the addition processing is output to the symbol insertion unit 3.
  • the symbol subject to addition processing is described as being in the past symbol, the symbol subject to addition processing may be other than the past symbol.
  • the symbol positions of I G can be arbitrarily selected, it is desirable to have a large Symbol impact on the A2 surrounding the sample, also to add an adjustment in the past symbols desired.
  • Past symbols are symbols that have been transmitted even in past CP blocks, and by performing processing together with symbols transmitted in past CP blocks on the receiving side, the influence of addition processing in demodulation can be reduced. From the above, the symbol locations of the I G is preferably a symbol near the second position.
  • Symbol positions of I G may even past the whole symbol including the second position, may be part of a position past symbol is inserted. By selecting symbols around the second position, the amount of change to be added is reduced, and changes in symbols after addition and before addition are reduced. Further, symbols around the second and first positions may be selected. In general, as the number of symbols to be added increases, the adjustment amount, that is, the addition amount decreases. The number of symbols of the position of the I G may be changed for each block. That is, the addition process can be performed adaptively. For example, when ⁇ (bold) k + 1 is equal to or greater than the threshold, the number of symbols to be added is G1, and when ⁇ (bold) k + 1 is less than the threshold, the addition is processed. Processing such as setting the number of symbols to G2 (G2 ⁇ G1) can be performed.
  • the symbol insertion unit 3 inserts the past symbol after the addition process into the data symbol input from the data symbol generation unit 1 (step S3).
  • the data symbols are divided into the 0th to Q ⁇ 1th data symbol groups and the Qth to N D ⁇ 1th data symbol groups, and the former data symbol group
  • the second symbol group is arranged, the first symbol group and the second symbol group are arranged after the former data symbol group, and the latter data symbol group is arranged after the second symbol group.
  • the value of Q is calculated in advance by the procedure described above and set in the symbol insertion unit 3.
  • the symbol insertion unit 3 may be configured so that the value of Q can be changed by an instruction from the outside.
  • the symbol selection unit 4 stores the selected symbol among the symbols output from the symbol insertion unit 3 in the storage unit 11 (step S4).
  • This selected symbol is a symbol that is read as a past symbol when the CP block of the next block, that is, the k + 2th block is generated, assuming that the CP block to be generated is the (k + 1) th CP block.
  • the symbol selection unit 4 when four past symbols are inserted around the second position, the symbol selection unit 4 includes d k + 1 which is the first two symbols and the last two symbols. , 22 , d k + 1,23 , d k + 1,0 , d k + 1,1 are stored in the storage unit 11.
  • D k + 1,22 , d k + 1,23 , d k + 1,0 , d k + 1,1 stored in the storage unit 11 are read in step S2 when the k + 2nd CP block is generated. Then, addition processing is performed.
  • the DFT unit 5 performs DFT processing on the data after the past symbol insertion (step S5).
  • the oversampling processing unit 6 performs oversampling processing (step S6), and inputs the processed data to the IDFT unit 7.
  • the IDFT unit 7 performs IDFT processing on the input data (step S7), and inputs the processing result to the sample selection unit 8.
  • the sample selection unit 8 selects P1 + P2 samples centering on A1 among the input samples (step S8), and inputs them to the addition processing unit 2. Note that P1 + P2 samples centering on A1 are referred to as a first sample group.
  • the selected sample is used in step S3 of the next block processing.
  • the CP adding unit 9 adds a CP (step S9).
  • a CP block is generated by the above processing.
  • FIG. 7 is a diagram illustrating an example of symbols to be added.
  • FIG. 7 shows the positions of symbols to be added in the arrangement after symbol multiplexing.
  • the arrangement position where the past symbols before the addition processing are symbol-multiplexed is virtually shown.
  • j indicates the symbol number in the N symbols after the data symbol and the past symbol are multiplexed.
  • d (bold) k + 1, IG is added by the addition processing unit 2 and input to the DFT unit 5.
  • d (bold) d k + 1, IG after addition processing is d (bold) (hat) k + 1, IG , d (bold) (hat) k + 1, IG is expressed by the following equation (19) ).
  • past symbols that are the first and last symbols of the previous CP block are arranged around the second position, and the P1 + P2 samples around A1 of the previous block are
  • the addition processing unit 2a adds the adjustment amount to one or more symbols in the block so that the P1 + P2 samples in the vicinity of A2 of the block to be processed are equal. For this reason, the sample and the phase and amplitude of the previous block can be made continuous, and the out-of-band spectrum can be suppressed. Further, when there is no need to make adjustments, there is no need to calculate the adjustment amount.
  • FIG. FIG. 8 is a diagram of a configuration example of the transmission apparatus according to the second embodiment of the present invention.
  • the transmission device 20a according to the present embodiment includes the addition processing unit 2a arranged at the subsequent stage of the IDFT unit 7 instead of the addition processing unit 2 of the transmission device 20 according to the first embodiment. It is the same as the device 20. Components having the same functions as those in the first embodiment are denoted by the same reference numerals as those in the first embodiment, and redundant description is omitted.
  • the addition processing unit 2a is an addition unit that performs addition processing on at least some of the samples corresponding to the past symbols in the samples output from the IDFT unit 7.
  • the symbol insertion unit 3 multiplexes data symbols and past symbols that have not been subjected to addition processing.
  • the arrangement of data symbols and fixed symbol sequences is the same as in the first embodiment.
  • P1 + P2 samples y (bold) k + 1, S1 around A2 of the ( k + 1 ) th block shown in the following equation (21) and the kth block shown in the following equation (22)
  • the sample of the (k + 1) -th block output from the IDFT unit 7 such that the samples y (bold) (hat) k, S0 around A1 that have been circulated in FIG. implementing the addition processing with respect to the sample position of the I G 'is the sample corresponding to the symbol position of G.
  • y (bold) k + 1, S1 is the output of the IDFT unit 7.
  • the above equation (15) is satisfied when G> P1 + P2, and the case where G ⁇ P1 + P2 is satisfied.
  • ⁇ (bold) k + 1 is calculated using the above equation (16).
  • the addition processing unit 2a assumes that A (bold) SUB2 is an NL ⁇ G ′ matrix obtained by extracting a column corresponding to IG ′ in the matrix A (bold), and the signal after the addition processing is expressed by the following equation (24). Is calculated.
  • normalization processing may be performed so that the average power becomes equal to y (bold) k + 1 .
  • epsilon instead of (bold) k + 1, by using the c 2 epsilon (bold) k + 1 multiplied by the count c 2 for normalization, addition processing by normalizing May be performed.
  • FIG. 9 is a flowchart illustrating an example of a CP block generation processing procedure according to the present embodiment.
  • Step S1 in FIG. 9 is the same as step S1 in the first embodiment.
  • step S3 is performed.
  • the symbol insertion unit 3 multiplexes the past symbol and the data symbol before the addition process.
  • Steps S4 to S7 are the same as steps S4 to S7 in the first embodiment.
  • the addition processing unit 2a performs addition processing on the sample to be added using the sample selected by the sample selection unit 8 in the previous block processing (step S3a).
  • Steps S8 and S9 after step S3a are the same as steps S8 and S9 of the first embodiment.
  • past symbols that are the first and last symbols of one previous CP block are arranged around the second position, and the P1 + P2 samples around A1 of the previous block and the current
  • the adjustment amount is added to one or more samples in the block after the IDFT processing so that the P1 + P2 samples in the vicinity of A2 of the block to be processed are equal.
  • the sample and the phase and amplitude of the previous block can be made continuous, and the out-of-band spectrum can be suppressed.
  • FIG. 10 is a diagram of a configuration example of the receiving apparatus according to the third embodiment of the present invention.
  • FIG. 11 is a diagram illustrating a configuration example of a communication system according to the present embodiment.
  • a receiving device 30 illustrated in FIG. 10 is a receiving device that receives a signal from the transmitting device 20 according to the first embodiment.
  • the communication system 50 according to the present embodiment includes a transmission device 20 and a reception device 30 as shown in FIG.
  • FIG. 11 shows an example in which the transmission device 20 transmits a block signal by wireless communication, the transmission device 20 may transmit the block signal by wired communication. Note that the transmission device 20a may be used instead of the transmission device 20.
  • the reception device 30 includes a reception unit 31, a CP removal unit 32, a DFT unit 33, an undersampling processing unit 34, an FDE (Frequency Domain Equalizer) 35, an IDFT unit 36, a symbol selection unit 37, and a storage unit. 38 and a demodulator 39.
  • a reception unit 31 a CP removal unit 32, a DFT unit 33, an undersampling processing unit 34, an FDE (Frequency Domain Equalizer) 35, an IDFT unit 36, a symbol selection unit 37, and a storage unit. 38 and a demodulator 39.
  • FDE Frequency Domain Equalizer
  • the demodulation unit 39 may be replaced with a demodulation and decoding unit, and decoding may be performed after demodulation.
  • the receiving unit 31 is a receiver
  • the DFT unit 33 and the IDFT unit 36 are electronic circuits using, for example, a flip-flop circuit and a shift register
  • the storage unit 38 is a memory.
  • the demodulator 39 is a modem or a demodulator and a decoder.
  • Each of the CP removing unit 32, the FDE 35, the undersampling processing unit 34, and the symbol selecting unit 37 can be realized as an electronic circuit.
  • some of the components shown in FIG. 10 may be configured by software.
  • the components realized by software are realized by the control circuit 200 shown in FIG. As shown in FIG.
  • the control circuit 200 includes an input unit 201 that is a reception unit that receives data input from the outside, a processor 202, a memory 203, and an output unit 204 that is a transmission unit that transmits data to the outside.
  • the input unit 201 is an interface circuit that receives data input from the outside of the control circuit 200 and applies the data to the processor 202
  • the output unit 204 is an interface that transmits data from the processor 202 or the memory 203 to the outside of the control circuit 200. Circuit.
  • the processor 202 stores a program corresponding to each component of the reception device 30 stored in the memory 203. This is realized by reading and executing.
  • the memory 203 is also used as a temporary memory in each process executed by the processor 202.
  • the receiving unit 31 receives a block signal, that is, a signal transmitted from the transmitting device 20 as a CP block
  • the CP removing unit 32 removes the CP from the received signal.
  • the DFT unit 33 which is a time-frequency conversion unit, converts the received signal in the time domain into a signal in the frequency domain by performing DFT processing on the signal after CP removal.
  • the undersampling processing unit 34 performs undersampling processing on the signal after DFT processing.
  • the undersampling process is a process of deleting a portion in which zero is inserted in the transmission apparatus 20 when zero insertion is performed as an oversampling process in the transmission apparatus 20.
  • the FDE 35 performs equalization processing in the frequency domain using the frequency domain received signal after the undersampling processing. That is, the FDE 35 is an equalization processing unit that performs an equalization process on the signal in the frequency domain after the undersampling process.
  • the frequency domain equalization process is a process used for distortion correction in the frequency domain, and any method such as the minimum mean square error (MMSE) norm FDE may be used. 1 can be used.
  • MMSE minimum mean square error
  • the channel response is obtained in the process of distortion correction in the frequency domain.
  • the IDFT unit 36 that is a frequency time conversion unit converts the frequency domain signal into a time domain signal by performing IDFT processing on the frequency domain signal after FDE.
  • the demodulation unit 39 performs demodulation based on the symbol at the position where the past symbol is arranged in the transmitter 20 in the time domain signal and the block signal received in the past, and the past symbol in the time domain signal is arranged. Demodulation is performed based on symbols at positions other than the positions.
  • the output of the IDFT unit 36 when the signal of the k-th block is received is set to q k, 0 , q k, 1 ,..., Q k, M ⁇ 1 . Since q k, 0 , q k, 1 ,..., q k, M ⁇ 1 are all estimated values of information data, demodulation can be performed according to the following equation (25). Note that a portion corresponding to a symbol stored as a past symbol is a symbol that has already been demodulated, and thus may not be used for demodulation.
  • d indicates a symbol candidate, and D indicates a set of symbol candidates.
  • D ⁇ + 1, ⁇ 1 ⁇
  • D ⁇ + 1 + j, + 1 ⁇ j, ⁇ 1 + j, ⁇ 1 ⁇ j ⁇ .
  • the transmission apparatus described in Embodiment 1 or 2 transmits a symbol corresponding to the past symbol twice in total.
  • the k th CP block includes the k 1 symbols d k-1,0 , d k ⁇ 1,1 ,..., D k ⁇ 1 as the past symbols after the second position .
  • K1 and K2 symbols d k-1, M-K2 , d k-1, M-K2 + 1 ,..., D k-1, M-1 up to the previous second position are stored.
  • symbols transmitted as past symbols are both a received signal corresponding to the (k ⁇ 1) th block and a received signal corresponding to the kth block.
  • Demodulation processing may be performed using.
  • FIG. 12 is a flowchart illustrating an example of a reception processing procedure according to the present embodiment.
  • CP removing unit 32 removes the CP from the signal received by receiving unit 31 (step S11).
  • the DFT unit 33 which is a time-frequency conversion unit, converts the received signal in the time domain into a signal in the frequency domain by performing DFT processing on the signal after CP removal (step S12).
  • the undersampling processing unit 34 performs undersampling processing on the signal after DFT processing (step S13).
  • the FDE 35 performs equalization processing in the frequency domain using the frequency domain received signal after the undersampling processing (step S14).
  • the IDFT unit 36 that is a frequency time conversion unit converts the frequency domain signal into a time domain signal by performing IDFT processing on the frequency domain signal after FDE (step S15).
  • the symbol selection unit 37 selects a symbol to be selected from the time domain signals output from the IDFT unit 36, and stores the selected symbol in the storage unit 38 (step S16).
  • the time domain signal output from the IDFT unit 36 is a reception signal corresponding to N symbols after the past symbol is inserted by the symbol insertion unit 3 in the transmission device 20.
  • the past symbol is a symbol of the previous block inserted in the transmission apparatus 20.
  • the symbol to be selected is a portion to be inserted as a past symbol in the (k + 1) th block, that is, the first and last symbols of the kth block.
  • the k-th block, as the past symbols, d k-1, 0 is a K1 symbols after the second position, d k-1,1, ..., d k-1, K1 and second Symbol selection is made up of K2 symbols d k-1, M-K2 , d k-1, M-K2 + 1 ,..., D k-1, M-1 up to the previous position.
  • the demodulator 39 sets a symbol to be demodulated (step S17).
  • the symbol to be demodulated is a symbol excluding the symbol at the position stored in the storage unit 38.
  • it is determined whether or not the symbol to be demodulated is a past symbol step S18. If the symbol to be demodulated is a past symbol (step S18, Yes), the demodulator 39 uses the symbol of the (k-1) th block stored in the storage unit 38 and the past symbol stored in the kth block. Demodulation is performed (step S19). That is, the demodulator 39 performs demodulation processing according to the above-described equation (26).
  • the demodulator 39 determines whether or not all symbols except the symbols at the positions stored in the storage unit 38 have been demodulated in the kth block (step S21). If it is determined that all symbols excluding symbols at positions stored in the storage unit 38 have been demodulated (Yes in step S21), the reception process for the kth block is terminated.
  • step S21 If it is determined that there is a symbol that has not been demodulated among all symbols excluding the symbol at the position stored in the storage unit 38 (No in step S21), the process returns to step S17, and the demodulation of the symbol to be demodulated is completed in step S17.
  • the symbols that have not been set are set, and the processes in and after step S18 are performed.
  • step S18 If the symbol to be demodulated is not a past symbol (No in step S18), the demodulator 39 demodulates using the symbol stored in the kth block (step S20), and proceeds to step S21. That is, in step S20, the demodulator 39 performs demodulation processing according to the above-described equation (27).
  • the configuration and operation of the receiving device 30 that receives a signal transmitted from the transmitting device of the first or second embodiment has been described.
  • demodulation can be performed without degrading the demodulation characteristics of the past symbols by performing demodulation using the fact that past symbols are transmitted a plurality of times. For this reason, an out-of-band spectrum can be suppressed without affecting demodulation and decoding.
  • the configuration described in the above embodiment shows an example of the contents of the present invention, and can be combined with another known technique, and can be combined with other configurations without departing from the gist of the present invention. It is also possible to omit or change the part.

Abstract

A transmission device 20 according to the present invention is provided with: a data symbol generation unit 1 that generates a data symbol; an addition unit 2 that carries out addition on at least some symbols from among past symbols, which are the data symbols of a past block; a symbol insertion unit 3 that multiplexes the post-addition past symbols with the data symbol generated by the data symbol generation unit; a DFT unit 5 that converts the symbols multiplexed by the symbol insertion unit to frequency-domain data; an IDFT unit 7 that converts the frequency-domain data to time-domain data formed from a plurality of samples; a sample selection unit 8 that selects, from the time-domain data, the sample at a selection target position, and inputs said sample to the addition unit; and a transmission unit 10 that transmits a block signal including the time-domain data. The addition unit 2 adds, to at least some symbols, an adjustment amount calculated on the basis of the sample inputted from the selection unit during the generation of the block signal of the previous block.

Description

送信装置、受信装置および通信システムTransmitting apparatus, receiving apparatus, and communication system
 本発明は、ブロック伝送を行う送信装置、受信装置および通信システムに関する。 The present invention relates to a transmission device, a reception device, and a communication system that perform block transmission.
 デジタル通信システムにおいて、送信信号が建物などに反射して起こるマルチパスフェージングや端末の移動によって起こるドップラ変動によって、伝送路の周波数選択性と時間変動が発生する。このようなマルチパス環境において、受信信号は送信シンボルと遅延時間が経って届くシンボルと干渉した信号となる。 In a digital communication system, transmission path frequency selectivity and time variation occur due to multipath fading caused by reflection of a transmission signal on a building or the like, and Doppler fluctuation caused by movement of a terminal. In such a multipath environment, the received signal is a signal that interferes with a transmitted symbol and a symbol that arrives after a delay time.
 このような周波数選択性のある伝送路において、最良の受信特性を得るためシングルキャリア(Single Carrier:SC)ブロック伝送方式が近年注目を集めている(例えば、下記非特許文献1参照)。シングルキャリアブロック伝送方式は、マルチキャリア(Multiple Carrier:MC)ブロック伝送であるOFDM(Orthogonal Frequency Division Multiplexing)伝送方式(例えば、下記非特許文献2参照)に比べピーク電力を低くすることができる。 In such a frequency selective transmission line, a single carrier (SC) block transmission system has recently attracted attention in order to obtain the best reception characteristics (for example, see Non-Patent Document 1 below). The single carrier block transmission scheme can reduce the peak power as compared with an OFDM (Orthogonal Frequency Division Multiplexing) transmission scheme (for example, see Non-Patent Document 2 below) which is a multicarrier (MC) block transmission.
 また、送信ピーク電力を抑圧するため、SCブロック伝送を行う送信機では、一般的にプリコーダにおいてDFT(Discrete Fourier Transform)処理が行われる。 In order to suppress the transmission peak power, a transmitter that performs SC block transmission generally performs DFT (Discrete Fourier Transform) processing in a precoder.
 上記従来のSCブロック伝送の技術によれば、マルチパスフェージングの影響を低減しつつ送信ピーク電力を抑圧することができる。しかしながら、SCブロック伝送では、SCブロック間の位相および振幅が不連続となるため、帯域外スペクトルまたは帯域外漏洩等と呼ばれる、所望の帯域以外の信号成分が発生する。帯域外スペクトルは隣接するチャネルすなわち周波数帯への干渉となる。このため、帯域外スペクトル抑圧が必要となる。また、一般に、通信システムにおいては、スペクトルの許容範囲であるスペクトルマスクが定められており、スペクトルマスクを満足するように帯域外スペクトルを抑圧する必要がある。 According to the conventional SC block transmission technique, it is possible to suppress transmission peak power while reducing the influence of multipath fading. However, in SC block transmission, the phase and amplitude between the SC blocks are discontinuous, so that signal components other than the desired band, such as out-of-band spectrum or out-of-band leakage, are generated. The out-of-band spectrum becomes interference to an adjacent channel or frequency band. For this reason, out-of-band spectrum suppression is required. In general, in a communication system, a spectrum mask that is an allowable range of spectrum is determined, and it is necessary to suppress an out-of-band spectrum so as to satisfy the spectrum mask.
 本発明は、上記に鑑みてなされたものであって、帯域外スペクトルを抑圧することができる送信装置を得ることを目的とする。 The present invention has been made in view of the above, and an object of the present invention is to obtain a transmitter capable of suppressing out-of-band spectrum.
 上述した課題を解決し、目的を達成するために、本発明にかかる送信装置は、ブロックごとにデータシンボルを生成するデータシンボル生成部と、データシンボル生成部により生成されたデータシンボルに過去のブロックのデータシンボルである過去シンボルを挿入して多重シンボルを生成するシンボル挿入部と、多重シンボルを周波数領域のデータに変換する時間周波数変換部と、周波数領域のデータに対して補間処理を行う補間部と、補間処理後のデータを、複数のサンプルで構成される時間領域のデータに変換する周波数時間変換部と、を備える。また、この送信装置は、過去シンボルのうち少なくとも一部のシンボル、または時間領域のデータのうち過去シンボルに対応するサンプルのうち少なくとも一部のサンプルに加算処理を行う加算部と、時間領域のデータから選択対象の位置のサンプルを選択して加算部へ入力する選択部と、時間領域のデータを含むブロック信号を送信する送信部と、を備える。加算部は、1つ前のブロックのブロック信号の生成処理において選択部から入力されたサンプルに基づいて算出された調整量を、少なくとも一部のシンボルまたは少なくとも一部のサンプルに加算することを特徴とする。 In order to solve the above-described problems and achieve the object, a transmission apparatus according to the present invention includes a data symbol generation unit that generates a data symbol for each block, and a past block in the data symbol generated by the data symbol generation unit. Insertion unit that inserts past symbols, which are data symbols, and generates a multiple symbol, a time-frequency conversion unit that converts the multiple symbol into frequency domain data, and an interpolation unit that performs interpolation processing on the frequency domain data And a frequency time conversion unit for converting the data after the interpolation processing into time domain data composed of a plurality of samples. In addition, the transmission apparatus includes: an addition unit that performs addition processing on at least some of the past symbols or at least some of the samples corresponding to the past symbols of the time domain data; and time domain data A selection unit that selects a sample at a position to be selected from the selection unit and inputs the sample to the addition unit, and a transmission unit that transmits a block signal including time-domain data. The addition unit adds the adjustment amount calculated based on the sample input from the selection unit in the block signal generation process of the previous block to at least some symbols or at least some samples. And
 本発明にかかる送信装置は、帯域外スペクトルを抑圧することができるという効果を奏する。 The transmission device according to the present invention has an effect that the out-of-band spectrum can be suppressed.
実施の形態1にかかる送信装置の構成例を示す図1 is a diagram illustrating a configuration example of a transmission device according to a first embodiment; 実施の形態1にかかる制御回路の構成例を示す図1 is a diagram illustrating a configuration example of a control circuit according to a first embodiment; 実施の形態1で用いる用語の定義を説明するための図The figure for demonstrating the definition of the term used in Embodiment 1 実施の形態1の過去シンボルの配置例を示す図The figure which shows the example of arrangement | positioning of the past symbol of Embodiment 1. 実施の形態1のCPブロックの生成処理手順の一例を示すフローチャートThe flowchart which shows an example of the production | generation procedure of CP block of Embodiment 1 実施の形態1の加算処理において考慮するサンプル位置の一例を示す図The figure which shows an example of the sample position considered in the addition process of Embodiment 1 加算処理対象のシンボルの一例を示す図The figure which shows an example of the symbol of addition processing object 実施の形態2にかかる送信装置の構成例を示す図The figure which shows the structural example of the transmitter concerning Embodiment 2. FIG. 実施の形態2のCPブロック生成処理手順の一例を示すフローチャートFlowchart illustrating an example of a CP block generation processing procedure according to the second embodiment 実施の形態3の受信装置の構成例を示す図FIG. 10 is a diagram illustrating a configuration example of a receiving apparatus according to Embodiment 3 実施の形態3にかかる通信システムの構成例を示す図The figure which shows the structural example of the communication system concerning Embodiment 3. FIG. 実施の形態3の受信処理手順の一例を示すフローチャートFlowchart illustrating an example of a reception processing procedure according to the third embodiment
 以下に、本発明の実施の形態にかかる送信装置、受信装置および通信システムを図面に基づいて詳細に説明する。なお、この実施の形態によりこの発明が限定されるものではない。 Hereinafter, a transmitter, a receiver, and a communication system according to an embodiment of the present invention will be described in detail based on the drawings. Note that the present invention is not limited to the embodiments.
実施の形態1.
 図1は、本発明の実施の形態1にかかる送信装置の構成例を示す図である。本実施の形態の送信装置20は、SCブロック伝送を行う送信装置であり、図1に示すように、データシンボル生成部1、加算処理部2、シンボル挿入部3、シンボル選択部4、DFT(Discrete Fourier Transform)部5、オーバサンプリング処理部6、IDFT(Inverse DFT)部7、サンプル選択部8、CP(Cyclic Prefix)付加部9、送信部10および記憶部11を備える。
Embodiment 1 FIG.
FIG. 1 is a diagram of a configuration example of a transmission apparatus according to the first embodiment of the present invention. The transmission apparatus 20 according to the present embodiment is a transmission apparatus that performs SC block transmission. As illustrated in FIG. 1, the data symbol generation unit 1, the addition processing unit 2, the symbol insertion unit 3, the symbol selection unit 4, the DFT ( A Discrete Fourier Transform unit 5, an oversampling processing unit 6, an IDFT (Inverse DFT) unit 7, a sample selection unit 8, a CP (Cyclic Prefix) addition unit 9, a transmission unit 10 and a storage unit 11 are provided.
 データシンボル生成部1は、送信する情報データに基づいて、例えば、PSK(Phase Shift Keying)シンボル、QAM(Quadrature Amplitude Modulation)シンボル等のデータシンボルを生成する。データシンボル生成部1は、SCブロック伝送におけるブロックごとにすなわちブロック単位でデータシンボルを生成する。なお、データシンボル生成部1は、誤り訂正符号化が施されたデータを情報データとして用いても良い。 The data symbol generation unit 1 generates data symbols such as a PSK (Phase Shift Keying) symbol and a QAM (Quadrature Amplitude Modulation) symbol based on the information data to be transmitted. The data symbol generator 1 generates a data symbol for each block in SC block transmission, that is, in units of blocks. Note that the data symbol generation unit 1 may use data subjected to error correction coding as information data.
 加算処理部2は、記憶部11に格納されている、過去のブロックのデータシンボルである過去シンボル、すなわち1ブロック前のデータシンボルを読み出し、読み出した過去シンボルのうち少なくとも一部に対して調整値を加算する加算処理を行う加算部である。加算処理は、帯域外スペクトルを抑圧するために行われる処理である。加算処理および調整値の詳細については、後述するが、加算処理部2は、1つ前のブロックの後述するCPブロックの生成処理においてサンプル選択部8から入力されたサンプルに基づいて算出された調整量を、上記の少なくとも一部のシンボルに加算する。 The addition processing unit 2 reads a past symbol that is a data symbol of a past block, that is, a data symbol of one block before and is stored in the storage unit 11, and an adjustment value for at least a part of the read past symbol It is an addition part which performs the addition process which adds. The addition process is a process performed to suppress the out-of-band spectrum. Although the details of the addition process and the adjustment value will be described later, the addition processing unit 2 performs the adjustment calculated based on the sample input from the sample selection unit 8 in the CP block generation process described later of the previous block. The quantity is added to at least some of the above symbols.
 シンボル挿入部3は、データシンボル生成部1により生成されたデータシンボルに加算処理部2により加算処理が施された後の過去シンボルを挿入して、データシンボルと加算処理が施された後の過去シンボルとが多重された1ブロック分のシンボルである多重シンボルを生成する。シンボル選択部4は、シンボル挿入部3から出力される1ブロック分のシンボルのうち、選択対象のシンボルを選択し、選択したシンボルを記憶部11に格納するとともに、シンボル挿入部3により入力された1ブロック分のシンボルをそのままDFT部5へ入力する。シンボル選択部4は、後述するように、例えば、シンボル挿入部3により多重されたシンボルのうち、先頭の第1の個数のシンボルと末尾の第2の個数のシンボルとを選択し、選択したシンボルを記憶部11に格納する。第1の個数は、後述するKまたはK1であり、第2の個数は、後述するKまたはK2である。選択対象のシンボルについては後述する。 The symbol insertion unit 3 inserts the past symbol after the addition processing by the addition processing unit 2 into the data symbol generated by the data symbol generation unit 1, and the past after the addition processing with the data symbol. Multiple symbols, which are symbols for one block in which symbols are multiplexed, are generated. The symbol selection unit 4 selects a symbol to be selected from the symbols for one block output from the symbol insertion unit 3, stores the selected symbol in the storage unit 11, and is input by the symbol insertion unit 3. The symbols for one block are input to the DFT unit 5 as they are. As will be described later, for example, the symbol selection unit 4 selects a first first number of symbols and a second second number of symbols from among the symbols multiplexed by the symbol insertion unit 3, and selects the selected symbols. Is stored in the storage unit 11. The first number is K or K1 described later, and the second number is K or K2 described later. The symbols to be selected will be described later.
 DFT部5は、シンボル選択部4から入力された1ブロック分のシンボルに対してDFT処理を実施することにより、1ブロック分のシンボルを周波数領域のデータに変換する時間周波数変換部である。なお、DFT部5の替わりに、時間領域の信号を周波数領域の信号に変換する任意の構成要素を用いることができ、例えば、DFT部5の替わりにFFT(Fast Discrete Fourier Transform)を行うFFT部を用いてもよい。 The DFT unit 5 is a time-frequency conversion unit that converts symbols for one block into frequency domain data by performing DFT processing on the symbols for one block input from the symbol selection unit 4. Any component that converts a time-domain signal into a frequency-domain signal can be used instead of the DFT unit 5. For example, an FFT unit that performs FFT (Fast Discrete Fourier Transform) instead of the DFT unit 5 May be used.
 オーバサンプリング処理部6は、DFT処理後のデータに対して補間処理の一種であるオーバサンプリング処理を実施する補間部である。本実施の形態では、オーバサンプリングレートはLとする。また、本実施の形態では、オーバサンプリング処理部6は、さらに、DFT処理後のデータを、所望の帯域幅へ変換する処理を実施する。本実施の形態のオーバサンプリング処理とは、時間領域信号のサンプリングレートを上げる、すなわちサンプリング間隔を細かくする補間処理である。具体的には、例えば、「B.Porat,“A Course in Digital Signal Processing”,John Wiley and Sons Inc.,1997」(以下、Porat文献という)に記載されている信号補間式等を用いて、オーバサンプリング処理(サンプリングレートを上げる、すなわちサンプリング間隔を細かくする処理)を行い、入力される信号に対し、1シンボルあたりのサンプリング点がL個となるようオーバサンプリングを行う。本実施の形態では、オーバサンプリング処理は、オーバサンプリングレートをLとした場合、入力のサンプリングレートすなわちDFT部5に入力される時間領域のデータに対してIDFT部7から出力される時間領域のデータのサンプリングレートがL倍となるようオーバサンプリングを行う。なお、オーバサンプリングレートは、オーバサンプリング後のサンプリングレートが入力のサンプリングレートの何倍であるかを示す値とする。オーバサンプリング処理としては、例えばゼロ挿入等の手法を用いることができる。周波数領域のデータであるDFT処理後のデータにゼロを挿入し、ゼロ挿入後のデータに対してIDFT処理を実施することにより、DFT部5に入力される時間領域のデータが内挿される。Lは整数である必要はなく、実数であればよい。また、オーバサンプリング処理部6は、所望の帯域幅へ変換する処理として、DFT処理後のデータの帯域幅をB1とし、所望の帯域幅をB2とすると、DFT処理後のデータを帯域幅B2のデータに変換する。この所望の帯域幅への変換は、B1<B2のとき、例えば、B2とB1の差に相当する0を挿入することで実現できる。オーバサンプリング処理部6は、所望の帯域幅へ変換する処理を実施した後に、上述の補間処理を実施する。 The oversampling processing unit 6 is an interpolation unit that performs oversampling processing, which is a kind of interpolation processing, on the data after DFT processing. In this embodiment, the oversampling rate is L. In the present embodiment, the oversampling processing unit 6 further performs a process of converting the data after the DFT processing into a desired bandwidth. The oversampling process of the present embodiment is an interpolation process that increases the sampling rate of the time domain signal, that is, narrows the sampling interval. Specifically, for example, using the signal interpolation formula described in “B. Porat,“ A Course in Digital Signal Processing ”, John Wiley and Sons Inc., 1997” (hereinafter referred to as Porat literature), etc., Oversampling processing (processing to increase the sampling rate, that is, to narrow the sampling interval) is performed, and oversampling is performed on the input signal so that there are L sampling points per symbol. In the present embodiment, the oversampling process is performed when the oversampling rate is L, and the time domain data output from the IDFT unit 7 with respect to the input sampling rate, that is, the time domain data input to the DFT unit 5. Oversampling is performed so that the sampling rate of L becomes L times. The oversampling rate is a value indicating how many times the sampling rate after oversampling is higher than the input sampling rate. As the oversampling process, for example, a technique such as zero insertion can be used. The time domain data input to the DFT unit 5 is interpolated by inserting zeros into the data after the DFT processing, which is the frequency domain data, and performing the IDFT processing on the data after the zero insertion. L need not be an integer, but may be a real number. Further, the oversampling processing unit 6 converts the data after the DFT processing into the bandwidth, assuming that the bandwidth of the data after the DFT processing is B 1 and the desired bandwidth is B 2 as the processing to convert to the desired bandwidth. Convert to B 2 data. This conversion to the desired bandwidth can be realized by inserting 0 corresponding to the difference between B 2 and B 1 when B 1 <B 2 , for example. The oversampling processing unit 6 performs the above-described interpolation processing after performing processing for conversion to a desired bandwidth.
 IDFT部7は、周波数領域のデータであるオーバサンプリング処理後のデータに対してIDFT処理を実施することにより、オーバサンプリング処理後のデータを複数のサンプルで構成される時間領域のデータに変換する周波数時間変換部である。なお、IDFT部7の替わりに、時間領域の信号を周波数領域の信号に変換する任意の構成要素を用いることができ、例えば、IDFT部7の替わりにIFFT(Inverse FFT)を行うIFFT部を用いてもよい。 The IDFT unit 7 performs IDFT processing on the data after oversampling processing that is frequency domain data, thereby converting the data after the oversampling processing into time domain data composed of a plurality of samples. It is a time conversion unit. Instead of the IDFT unit 7, any component that converts a time domain signal into a frequency domain signal can be used. For example, instead of the IDFT unit 7, an IFFT unit that performs IFFT (Inverse FFT) is used. May be.
 サンプル選択部8は、IDFT処理後のサンプルすなわち時間領域のデータから選択対象の位置のサンプルを選択して、加算処理部2へ入力する選択部である。サンプル選択部8は、IDFT処理後のサンプルのうち選択対象となる位置のサンプルを選択して加算処理部2へ入力するとともに、IDFT処理後の全てのサンプルすなわち1ブロック分のサンプルをCP付加部9へ出力する。なお、選択対象となる位置のサンプルは、次のブロックの処理において加算処理部2で用いられるため、サンプル選択部8は、次のブロックの処理のタイミングにあわせて一定時間遅延させて選択対象となる位置のサンプルを加算処理部2へ入力してもよい。CP付加部9は、サンプル選択部8から出力されたサンプルに対してCPを付加してブロック信号を生成する。具体的には、CP付加部9は、ブロック内の最後のNCPL個のサンプルをコピーすなわち複製し、ブロックの先頭に配置する。NCPは、CP付加においてコピーされるシンボル数に相当する値であり、Lは上述したオーバサンプリングレートである。送信部10は、CP付加後の信号であるブロック信号を、伝送路に対応した信号に変換して送信する。送信部10は、伝送路が無線伝送路である場合、デジタル信号をアナログ信号に変換するアナログデジタル回路、およびアナログ信号を電波として送出するアンテナ等を含み、伝送路が有線伝送路である場合、アナログデジタル回路、および有線伝送路に対応した物理層の処理等を行う回路等を含む。 The sample selection unit 8 is a selection unit that selects the sample after the IDFT processing, that is, the sample at the position to be selected from the data in the time domain, and inputs the sample to the addition processing unit 2. The sample selection unit 8 selects a sample at a position to be selected from the samples after IDFT processing and inputs the selected sample to the addition processing unit 2, and also adds all samples after IDFT processing, that is, samples for one block to the CP addition unit. Output to 9. Since the sample at the position to be selected is used by the addition processing unit 2 in the processing of the next block, the sample selection unit 8 delays the selection block by a predetermined time in accordance with the processing timing of the next block. A sample at a position may be input to the addition processing unit 2. The CP adding unit 9 adds a CP to the sample output from the sample selecting unit 8 to generate a block signal. Specifically, the CP adding unit 9 copies, that is, duplicates, the last N CP L samples in the block and arranges them at the head of the block. N CP is a value corresponding to the number of symbols copied in the CP addition, and L is the above-described oversampling rate. The transmission unit 10 converts the block signal, which is a signal after the addition of the CP, into a signal corresponding to the transmission path and transmits the signal. When the transmission path is a wireless transmission path, the transmission unit 10 includes an analog digital circuit that converts a digital signal into an analog signal, an antenna that transmits the analog signal as a radio wave, and the transmission path is a wired transmission path. It includes an analog / digital circuit, a circuit that performs processing of a physical layer corresponding to a wired transmission path, and the like.
 なお、図1に示した送信装置20の構成要素は、全てをハードウェアにより実現することができる。データシンボル生成部1は、モデムまたはモジュレータであり、DFT部5、IDFT部7は、例えばフリップフロップ回路、シフトレジスタ等を用いた電子回路であり、記憶部11はメモリであり、送信部10は送信機である。加算処理部2、シンボル挿入部3、シンボル選択部4、オーバサンプリング処理部6、サンプル選択部8、CP付加部9についても、各々が電子回路として実現できる。しかしながら、図1に示した構成要素のうち、一部がソフトウェアにより構成されてもよい。図1に示した構成要素のうちソフトウェアにより実現されるものがある場合、例えば、ソフトウェアにより実現される構成要素は図2に示す制御回路200により実現される。図2に示すように制御回路200は、外部から入力されたデータを受信する受信部である入力部201と、プロセッサ202と、メモリ203と、データを外部へ送信する送信部である出力部204とを備える。入力部201は、制御回路200の外部から入力されたデータを受信してプロセッサ202に与えるインターフェース回路であり、出力部204は、プロセッサ202又はメモリ203からのデータを制御回路200の外部に送るインターフェース回路である。図1に示す構成要素のうち少なくとも一部が、図2に示す制御回路200により実現される場合、プロセッサ202がメモリ203に記憶された、送信装置20の各々の構成要素に対応するプログラムを読み出して実行することにより実現される。また、メモリ203は、プロセッサ202が実施する各処理における一時メモリとしても使用される。 Note that all the components of the transmission apparatus 20 shown in FIG. 1 can be realized by hardware. The data symbol generation unit 1 is a modem or a modulator, the DFT unit 5 and the IDFT unit 7 are electronic circuits using, for example, a flip-flop circuit, a shift register, etc., the storage unit 11 is a memory, and the transmission unit 10 It is a transmitter. Each of the addition processing unit 2, symbol insertion unit 3, symbol selection unit 4, oversampling processing unit 6, sample selection unit 8, and CP addition unit 9 can also be realized as an electronic circuit. However, some of the components shown in FIG. 1 may be configured by software. When some of the components shown in FIG. 1 are realized by software, for example, the components realized by software are realized by the control circuit 200 shown in FIG. As shown in FIG. 2, the control circuit 200 includes an input unit 201 that is a reception unit that receives data input from the outside, a processor 202, a memory 203, and an output unit 204 that is a transmission unit that transmits data to the outside. With. The input unit 201 is an interface circuit that receives data input from the outside of the control circuit 200 and applies the data to the processor 202, and the output unit 204 is an interface that transmits data from the processor 202 or the memory 203 to the outside of the control circuit 200. Circuit. When at least a part of the components shown in FIG. 1 is realized by the control circuit 200 shown in FIG. 2, the processor 202 reads a program corresponding to each component of the transmission device 20 stored in the memory 203. It is realized by executing. The memory 203 is also used as a temporary memory in each process executed by the processor 202.
 次に、本実施の形態の動作について説明する。まず、本実施の形態において用いる用語および変数を次のように定義する。図3は、本実施の形態で用いる用語の定義を説明するための図である。本実施の形態では、データシンボル生成部1により生成される1ブロック分のデータシンボルの数をNDとする。また、シンボル挿入部3により、データシンボルと加算処理後の過去シンボルとが多重された後の多重シンボルの1ブロック分のシンボル数をMとする。DFT部5には、M個のシンボルが入力され、M個の周波数領域のデータが出力される。DFT部5への入力単位すなわち入力される1点のデータをシンボルと呼ぶ。 Next, the operation of the present embodiment will be described. First, terms and variables used in the present embodiment are defined as follows. FIG. 3 is a diagram for explaining definitions of terms used in the present embodiment. In the present embodiment, the number of data symbols for one block generated by the data symbol generator 1 is N D. Also, let M be the number of symbols for one block of the multiplexed symbols after the data symbol and the past symbol after the addition processing are multiplexed by the symbol insertion unit 3. The DFT unit 5 receives M symbols and outputs M frequency domain data. An input unit to the DFT unit 5, that is, one point of input data is called a symbol.
 シンボル挿入部3により過去シンボルとデータシンボルとが多重された後の、k番目のブロックのN個のシンボルd(太字)kを以下の式(1)のように定義する。なお、B(太字)Tは、任意の行列B(太字)の転置を示す。 The N symbols d (bold) k in the k-th block after the past symbol and the data symbol are multiplexed by the symbol insertion unit 3 are defined as the following equation (1). B (bold) T represents transposition of an arbitrary matrix B (bold).
Figure JPOXMLDOC01-appb-M000001
Figure JPOXMLDOC01-appb-M000001
 また、オーバサンプリング処理部6が実施するオーバサンプリングのオーバサンプリングレートを前述の通りLとする。オーバサンプリング処理部6から出力される1ブロック分のデータの数は、NLである。Nは、上述した所望の帯域幅B2に対応する値である。IDFT部7には、NL個の周波数領域のデータが入力され、NL個の時間領域のデータが出力される。IDFT部7の出力単位、すなわちIDFT部7から出力される1点のデータをサンプルと呼ぶ。また、IDFT部7から1回のIDFT処理で出力されるデータ全体をブロックサンプルと呼び、CP付加部9から出力されるデータ全体であるブロック信号をCPブロックと呼ぶ。したがって、図3に示すように、1ブロックサンプルは、NL個のサンプルで構成される。このNL個のサンプルは、シンボル挿入部3から出力されるN個のシンボルすなわちNシンボルが内挿されたものである。また、1CPブロックは、(N+NCP)L個のサンプルすなわち(N+NCP)Lサンプルで構成される。 Further, the oversampling rate of oversampling performed by the oversampling processing unit 6 is L as described above. The number of data for one block output from the oversampling processing unit 6 is NL. N is a value corresponding to the desired bandwidth B 2 described above. The IDFT unit 7 receives NL frequency domain data and outputs NL time domain data. An output unit of the IDFT unit 7, that is, one point of data output from the IDFT unit 7 is called a sample. In addition, the entire data output from the IDFT unit 7 in one IDFT process is referred to as a block sample, and the block signal that is the entire data output from the CP adding unit 9 is referred to as a CP block. Therefore, as shown in FIG. 3, one block sample is composed of NL samples. The NL samples are obtained by interpolating N symbols output from the symbol insertion unit 3, that is, N symbols. One CP block is composed of (N + N CP ) L samples, that is, (N + N CP ) L samples.
 次に、本実施の形態の過去シンボルの配置について説明する。上述したように、1ブロックサンプルのうちNCPLサンプルがCP付加部9によりコピーされて先頭に配置される。従って、1つ前のブロックの最後のサンプルの次に、CP付加部9によりコピーされる部分の先頭のサンプルが送信される。ブロック間の位相および振幅の不連続を抑制することにより帯域外スペクトルを抑圧するためには、1つ前のブロックの最後のサンプルとコピーされる部分の先頭のサンプルの位相および振幅がなるべくなめらかに繋がることが望ましい。 Next, the arrangement of past symbols according to the present embodiment will be described. As described above, N CP L samples of one block sample are copied by the CP adding unit 9 and arranged at the head. Therefore, after the last sample of the previous block, the first sample of the portion copied by the CP adding unit 9 is transmitted. In order to suppress the out-of-band spectrum by suppressing the discontinuity of phase and amplitude between blocks, the phase and amplitude of the last sample of the previous block and the first sample of the copied part should be as smooth as possible. It is desirable to connect.
 本実施の形態では、DFT部5へ入力されるデータすなわちシンボル挿入部3により多重されたシンボルのうち先頭のシンボルを第1の位置と定義し、CP付加部9によりコピーされる先頭のサンプルに対応するシンボルの位置を第2の位置と定義する。第2の位置は、DFT部5へ入力されるMシンボルのうち末尾からM―X番目のシンボルである。なお、Xは、DFT部5へ入力されるMシンボルのうちの第2の位置に対応する位置のシンボルの番号を示す。 In the present embodiment, the first symbol of the data input to the DFT unit 5, that is, the symbol multiplexed by the symbol insertion unit 3, is defined as the first position, and the first sample copied by the CP adding unit 9 is defined as the first position. The position of the corresponding symbol is defined as the second position. The second position is the M−Xth symbol from the end among the M symbols input to the DFT unit 5. X indicates the symbol number at the position corresponding to the second position of the M symbols input to the DFT unit 5.
 上述したPorat文献に記載されているように、IDFT出力の循環性より、IDFT部7から出力されるブロックサンプルのうち最後のサンプルは、DFT部5に入力される最後のシンボルと先頭のシンボルとの間の内挿点となる。したがって、1つ前のブロックの先頭のシンボルと第2の位置のシンボルとが等しくなっていると、前のブロックの末尾のサンプルは、前のブロックの最後のシンボルと先頭のシンボルとの間の内挿点であるため、1つ前のブロックの最後のサンプルと、CP挿入後の先頭のサンプルとは滑らかに繋がる。前述したとおり、DFT部5に入力されるデータとIDFT部7から出力されるデータとは、いずれも1ブロック分の時間領域のデータであるが、上述したようにオーバサンプリング処理により内挿が行われるため、Lが1でない場合はデータの点数は両者で異なる。したがって、DFT部5に入力されるデータの0シンボル目が第1の位置であり、X番目が第2の位置であるとするとき、IDFT部7から出力されるデータのうち第1の位置に対応するサンプルは0サンプル目のサンプルであるが、Lが1でない場合IDFT部7から出力されるデータのうち第2の位置に対応するサンプルはX番目ではない。以下、IDFT部7から出力されるNLサンプルの先頭の位置をA1とし、IDFT部7から出力されるNLサンプルのうち第2の位置に対応するサンプルの位置をA2とする。 As described in the aforementioned Porat document, due to the cyclic nature of the IDFT output, the last sample among the block samples output from the IDFT unit 7 is the last symbol and the first symbol input to the DFT unit 5. Interpolation point between Therefore, if the first symbol of the previous block is equal to the symbol at the second position, the last sample of the previous block is between the last symbol of the previous block and the first symbol. Since it is an interpolation point, the last sample of the previous block and the first sample after CP insertion are smoothly connected. As described above, the data input to the DFT unit 5 and the data output from the IDFT unit 7 are both time domain data for one block, but are interpolated by oversampling as described above. Therefore, when L is not 1, the data points are different between the two. Therefore, when the 0th symbol of the data input to the DFT unit 5 is the first position and the Xth is the second position, the data is output from the IDFT unit 7 at the first position. The corresponding sample is the 0th sample, but when L is not 1, the sample corresponding to the second position among the data output from the IDFT unit 7 is not the Xth. Hereinafter, the head position of the NL sample output from the IDFT unit 7 is A1, and the position of the sample corresponding to the second position among the NL samples output from the IDFT unit 7 is A2.
 シンボル挿入部3が挿入する過去シンボルは、例えば、1ブロック前の先頭のK個のシンボルと、末尾のK個のシンボルとする。すなわち、データシンボル生成部1がk番目のブロックのデータシンボルを生成してシンボル挿入部3に入力したとき、シンボル挿入部3は、k-1番目のブロックを生成した際のシンボル挿入部3の出力であるd(太字)k-1のうち、の2K個のシンボル{dk-1,M-K,dk-1, M-K+1,…,dk-1, M-1,dk-1,0,dk-1,1,…,dk-1,K-1}を過去シンボルとして、入力されたデータシンボルに挿入する。本実施の形態では、dk-1,0より左側すなわちdk-1,0より前のK個のシンボル{dk-1,M-K,dk-1, M-K+1,…,dk-1, M-1}を第1のシンボル群、dk-1,0以降のK個のシンボル{dk-1,0,dk-1,1,…,dk-1,K-1}を第2のシンボル群と呼ぶ。本実施の形態では、第2の位置にdk-1,0が配置されるように過去シンボル{dk-1,M-K,dk-1, M-K+1,…,dk-1, M-1,dk-1,0,dk-1,1,…,dk-1,K-1}を配置する。 The past symbols inserted by the symbol insertion unit 3 are, for example, the first K symbols one block before and the last K symbols. That is, when the data symbol generation unit 1 generates the data symbol of the kth block and inputs the data symbol to the symbol insertion unit 3, the symbol insertion unit 3 sets the symbol insertion unit 3 when the k−1th block is generated. an output d (bold) of the k-1, the 2K symbols {d k-1, MK, d k-1, MK + 1, ..., d k-1, M-1, d k -1,0 , d k-1,1 ,..., D k-1, K-1 } are inserted as past symbols into the input data symbol. In the present embodiment, K symbols {d k−1, MK , d k−1, M−K + 1 ,..., D to the left of d k−1,0 , that is, before d k−1,0. k-1, M-1} the first symbol group, d k-1, 0 or later K symbols {d k-1,0, d k -1,1, ..., d k-1, K −1 } is called a second symbol group. In the present embodiment, the past symbols {d k−1, MK , d k−1, M−K + 1 ,..., D k−1 so that d k−1,0 is arranged at the second position. , M−1 , d k−1,0 , d k−1 ,..., D k−1, K−1 }.
 オーバサンプリング処理およびIDFT処理を実施することで、k-1番目のブロックの末尾のシンボルとk-1番目のブロックの先頭のシンボルとの内挿点となる。第2の位置にdk-1,0が配置されるように過去シンボルを配置すると、k番目の第2の位置のシンボルはk-1番目のブロックの先頭のシンボルと同じとなる。このため、CP挿入後のk番目のブロックの先頭のサンプルは、図3のA2のサンプルすなわち第2の位置に対応するサンプルとなり、k-1番目のブロック分の末尾のサンプルと滑らかに繋がる。これにより、帯域外スペクトルを低減させることができる。 By performing the oversampling process and the IDFT process, it becomes an interpolation point between the last symbol of the (k−1) th block and the leading symbol of the (k−1) th block. When past symbols are arranged such that d k−1,0 is arranged at the second position, the symbol at the kth second position is the same as the first symbol of the k−1th block. Therefore, the first sample of the k-th block after CP insertion is the sample corresponding to the A2 sample in FIG. 3, that is, the second position, and is smoothly connected to the last sample of the (k−1) -th block. Thereby, an out-of-band spectrum can be reduced.
 次に、第1の位置、第2の位置、A1,A2の位置の関係を、図3に示す例を用いて説明する。図3に示すように、データシンボル生成部1により生成されたk番目のブロックのND個のデータシンボルをgk,0,…,gk,ND-1と定義する。なお、gk,ND-1の下付き文字部分のNDはNDを示す。上述したように、データシンボルの間に過去シンボルが配置される。このため、シンボル挿入部3は、M個のデータシンボルを、第2の位置を含んで配置される過去シンボルより左側に配置されるシンボル群と、第2の位置を含んで配置される過去シンボルより右側に配置されるシンボル群とに分割する。第2の位置を含んで配置される過去シンボルより右側に配置されるシンボル群の先頭のシンボルを図3に示すように、gk,Qとする。 Next, the relationship between the first position, the second position, and the positions of A1 and A2 will be described using an example shown in FIG. As shown in FIG. 3, the N D data symbol of the k th block generated by the data symbol generator 1 g k, 0, ..., defined g k, the ND-1. Incidentally, g k, ND subscript portion of ND-1 indicates the N D. As described above, past symbols are arranged between data symbols. For this reason, the symbol insertion unit 3 includes M data symbols, a symbol group arranged on the left side of a past symbol arranged including the second position, and a past symbol arranged including the second position. It is divided into symbols arranged on the right side. As shown in FIG. 3, let g k, Q be the first symbol in the symbol group arranged on the right side of the past symbol arranged including the second position.
 ここで、M×MのDFT行列W(太字)Mの(m,n)成分は、以下の式(2)で表すことができる。 Here, the (m, n) component of the M × M DFT matrix W (bold) M can be expressed by the following equation (2).
Figure JPOXMLDOC01-appb-M000002
Figure JPOXMLDOC01-appb-M000002
 DFT部5が実施するDFT処理すなわちM点DFT処理は、以下の式(3)のように示すことができる。s(太字)kは、DFT処理結果を示し、s(太字)k=[sk,0,…,sk,M-1Tとする。 The DFT process performed by the DFT unit 5, that is, the M-point DFT process, can be expressed as the following Expression (3). s (bold) k indicates a DFT processing result, and s (bold) k = [s k, 0 ,..., s k, M−1 ] T.
Figure JPOXMLDOC01-appb-M000003
Figure JPOXMLDOC01-appb-M000003
 Mを偶数とすると、オーバサンプリング処理部6におけるオーバサンプリング処理によりNL点までゼロ挿入された周波数領域信号s(太字)k,Zは、以下の式(4)で示すことができる。 When M is an even number, the frequency domain signal s (bold) k, Z that has been zero-inserted up to the NL point by the oversampling process in the oversampling processing unit 6 can be expressed by the following equation (4).
Figure JPOXMLDOC01-appb-M000004
Figure JPOXMLDOC01-appb-M000004
 上記式(4)に示すように、オーバサンプリング処理では、(NL-N)点のゼロが中央、すなわちsk,M/2-1とsk,M/2の間に挿入される。そして、IDFT部7によるIDFT処理は以下の式(5)で示すことができる。なお、B(太字)Hは、行列B(太字)のエルミート転置を示す。 As shown in the above equation (4), in the oversampling process, the (NL−N) point zero is inserted at the center, that is, between sk, M / 2-1 and sk, M / 2 . The IDFT processing by the IDFT unit 7 can be expressed by the following equation (5). B (bold) H indicates Hermitian transpose of the matrix B (bold).
Figure JPOXMLDOC01-appb-M000005
Figure JPOXMLDOC01-appb-M000005
 なお、y(太字)kは、以下の式(6)で示すことができる。 In addition, y (bold) k can be shown by the following formula | equation (6).
Figure JPOXMLDOC01-appb-M000006
Figure JPOXMLDOC01-appb-M000006
 W(太字)M,1はW(太字)Mの0行目からM/2-1行目までの行を抽出した行列でありW(太字)M,2はW(太字)MのM/2行目からM-1行目までを抽出した行列である。0(太字)NL-M,Mは(NL-M)×Mのゼロによって成り立つ行列である。表記の簡易化のため、以下の式(7)に示す行列A(太字)を定義する。 W (bold) M, 1 is W (bold) is a matrix obtained by extracting a row of up to M / 2-1 line from the 0 line of M W (bold) M, 2 is W (bold) M of M / This is a matrix extracted from the second row to the M−1th row. 0 (bold) NL-M, M is a matrix formed by (NL-M) × M zeros. In order to simplify the notation, a matrix A (bold) shown in the following formula (7) is defined.
Figure JPOXMLDOC01-appb-M000007
Figure JPOXMLDOC01-appb-M000007
 上述の各式を用いて、第1の位置、第2の位置、A1、A2を説明する。k番目のブロックにおいて、A1のサンプルはyk,0であり、A2のサンプルは、P=NL-NCPLとするときyk,Pである。第1の位置のシンボルはdk,0であり、第2の位置のシンボルはdk,Xとなる。ここで、Qの値について説明する。Qの値は、上述したN,NCP,Lに加え、Mに依存する。言い換えるとQの値は、シンボル挿入部3が挿入する過去シンボルを構成するシンボル数に依存する。シンボル挿入部3が挿入する過去シンボルを構成するシンボル数を2Kとすると、ND=M-2Kである。また、シンボル挿入部3により過去シンボルが挿入されたM個のシンボルでは、Q-1番目のデータシンボルからK個の過去シンボル{dk-1,M-K,dk-1,M-K+1,…,dk-1,M-1}を配置した次の位置が第2の位置すなわちX番目の位置となる。したがって、Q=X-Kとなる。シンボル挿入部3は、データシンボルを0番目からQ-1番目までのデータシンボル群とQ番目からND-1番目までのデータシンボル群に分割し、前者のデータシンボル群の前に第2のシンボル群を配置し、前者のデータシンボル群の後に第1のシンボル群および第2のシンボル群を配置し、第2のシンボル群の後に後者のデータシンボル群を配置する。 The first position, the second position, A1, and A2 will be described using the above-described equations. In the k-th block, the sample of A1 is y k, 0 and the sample of A2 is y k, P when P = NL−N CP L. The symbol at the first position is d k, 0 and the symbol at the second position is d k, X. Here, the value of Q will be described. The value of Q depends on M in addition to N, N CP and L described above. In other words, the value of Q depends on the number of symbols constituting the past symbol inserted by the symbol insertion unit 3. Assuming that the number of symbols constituting the past symbol inserted by the symbol insertion unit 3 is 2K, N D = M−2K. In the M symbols in which the past symbols are inserted by the symbol insertion unit 3, the K past symbols {d k−1, MK , d k−1, M−K + 1 ) from the Q−1th data symbol. ,..., D k−1, M−1 } is the second position, that is, the Xth position. Therefore, Q = X−K. The symbol insertion unit 3 divides the data symbols into the 0th to Q−1th data symbol groups and the Qth to N D −1th data symbol groups, and the second data symbol group is preceded by the second data symbol group. A symbol group is arranged, a first symbol group and a second symbol group are arranged after the former data symbol group, and a latter data symbol group is arranged after the second symbol group.
 以上のように、CPとしてコピーされる先頭位置であるA2に対応する第2の位置を求めることができ、データシンボルへの過去シンボルの挿入位置を決定することができる。 As described above, the second position corresponding to A2 which is the head position copied as the CP can be obtained, and the insertion position of the past symbol into the data symbol can be determined.
 k番目のCPブロックの生成時にDFT部5へ入力されるM個のシンボルを式(1)で示したd(太字)kとするとき、2K個の過去シンボル{dk-1,M-K,dk-1,M-K+1,…,dk-1,M-1,dk-1,0,dk-1,1,…,dk-1,K-1}は、図3に示すX番目の位置のシンボルすなわちdk,Xにdk-1,0が配置され、かつ{dk-1,M-K,dk-1,M-K+1,…,dk-1,M-1,dk-1,0,dk-1,1,…,dk-1,K-1}が連続するように配置される。すなわち、以下の式(8)に示すように、過去シンボル{dk-1,M-K,dk-1,M-K+1,…,dk-1,M-1,dk-1,0,dk-1,1,…,dk-1,K-1}が配置される。 When M symbols inputted to the DFT unit 5 at the time of generation of the k-th CP block are d (bold) k shown in Expression (1), 2K past symbols {d k−1, MK , d k-1, M-K + 1 ,..., dk-1, M-1 , dk-1,0 , dk-1,1 ,..., dk-1, K-1 } are shown in FIG. , D k-1,0 is arranged in the symbol of the X th position shown in FIG. 1, that is, d k, X and {d k-1, MK , d k-1, M-K + 1 ,. , M−1 , d k−1,0 , d k−1 ,..., D k−1, K−1 } are arranged so as to be continuous. That is, as shown in the following equation (8), the past symbols {d k−1, MK , d k−1, M−K + 1 ,..., D k−1, M−1 , d k−1, 0 , d k-1,1 ,..., D k-1, K-1 } are arranged.
Figure JPOXMLDOC01-appb-M000008
Figure JPOXMLDOC01-appb-M000008
 また、上記の例では、第2の位置以降のシンボル数と第2の位置より前のシンボル数とを同じとしたが、第2の位置以降のシンボル数と第2の位置より前のシンボル数とを異ならせてもよい。この場合、以下の式(9)に示すように過去シンボルを配置する。Xは第2の位置を示し、K1は、第2の位置以降の過去シンボルのシンボル数を示し、K2は、第2の位置の1つ手前のシンボル以前のシンボル数を示す。 In the above example, the number of symbols after the second position and the number of symbols before the second position are the same. However, the number of symbols after the second position and the number of symbols before the second position are the same. May be different. In this case, past symbols are arranged as shown in the following equation (9). X indicates the second position, K1 indicates the number of symbols of the past symbols after the second position, and K2 indicates the number of symbols before the symbol immediately before the second position.
Figure JPOXMLDOC01-appb-M000009
Figure JPOXMLDOC01-appb-M000009
 例えば、N=32,M=24,L=4,NCP=8のときは、P=NL-NCPL=(N-NCP)L=24×4=96である。このとき、例えばXを16とすると、Qは、Q=16-Kである。なお、図3よりわかるように、1つの過去シンボルがNCP以上となるとコピーされるシンボル数を超えてしまうため、1つの過去シンボルのシンボル数であるKはM-X以下である。 For example, when N = 32, M = 24, L = 4, and N CP = 8, P = NL−N CP L = (N−N CP ) L = 24 × 4 = 96. At this time, for example, if X is 16, Q is Q = 16−K. As it can be seen from FIG. 3, for exceeds the number of symbols one past symbol is copied when the above N CP, K is the number of symbols of one past symbol is less M-X.
 一般化すると、K,M,N,L,NCPの各値を、以下の式(10)に示す関係が成り立つ範囲で任意に決定することができる。 When generalized, each value of K, M, N, L, and N CP can be arbitrarily determined within a range in which the relationship shown in the following formula (10) is satisfied.
Figure JPOXMLDOC01-appb-M000010
Figure JPOXMLDOC01-appb-M000010
 例えば、N=32,M=24,L=4,NCP=8のときは、X=nMNCPL/NL=6nとなり、Xを6の倍数、例えば6、12、18のいずれかの値に設定して良い。また、例えば、N=32,M=24,L=4,NCP=6のときは、X=4.5nとなる。この場合、X=4nまたはX=5Kと設定すればよい。また、X=4.5nとしてXの値を計算し、計算したXの値を繰り上げ処理または繰り下げ処理することにより、Xの値に対応する整数値を求めてもよい。 For example, when N = 32, M = 24, L = 4, and N CP = 8, X = nMN CP L / NL = 6n, and X is a multiple of 6, for example, any value of 6, 12, 18 May be set to For example, when N = 32, M = 24, L = 4, and N CP = 6, X = 4.5n. In this case, X = 4n or X = 5K may be set. Alternatively, an integer value corresponding to the value of X may be obtained by calculating the value of X with X = 4.5n and performing a carry-up process or a carry-down process on the calculated X value.
 図4は、本実施の形態の過去シンボルの配置例を示す図である。図4では、N=32,M=24,L=4,NCP=8,K=2としている。jは、データシンボルと過去シンボルとが多重された後のN個のシンボルにおけるシンボルの番号を示す。また、実際には、加算処理後の過去シンボルが、データシンボルに挿入されるが、図4では、過去シンボルの位置を示すために、加算処理前の過去シンボルが仮想的にデータシンボルと多重された場合の配置を示している。 FIG. 4 is a diagram illustrating an arrangement example of past symbols according to the present embodiment. In FIG. 4, N = 32, M = 24, L = 4, N CP = 8, and K = 2. j indicates the symbol number in the N symbols after the data symbol and the past symbol are multiplexed. Actually, the past symbol after the addition process is inserted into the data symbol, but in FIG. 4, the past symbol before the addition process is virtually multiplexed with the data symbol to indicate the position of the past symbol. The arrangement is shown.
 次に、本実施の形態の全体動作と加算について説明する。図5は、本実施の形態のCPブロックの生成処理手順の一例を示すフローチャートである。ここでは、データシンボル生成部1は、データシンボルを生成する(ステップS1)。加算処理部2は、1つ前のブロックの処理でサンプル選択部8により選択されたサンプルを用いて、記憶部11から読み出した過去シンボルを読み出し、読み出した過去シンボルのうち加算処理対象のシンボルに対して加算処理を行う(ステップS2)。ステップS2で、記憶部11から読み出される過去シンボルは、1つ前のCPブロックの生成時のステップS4で格納されたシンボルである。 Next, the overall operation and addition of this embodiment will be described. FIG. 5 is a flowchart illustrating an example of a CP block generation processing procedure according to the present embodiment. Here, the data symbol generation unit 1 generates a data symbol (step S1). The addition processing unit 2 reads the past symbol read from the storage unit 11 using the sample selected by the sample selection unit 8 in the processing of the previous block, and sets it as the symbol to be added among the read past symbols. Addition processing is performed for the above (step S2). The past symbol read from the storage unit 11 in step S2 is the symbol stored in step S4 when the previous CP block is generated.
 ここで、本実施の形態の加算処理部2における加算処理について式を用いて説明する。加算処理部2は、以下の式(11)に示すように、k+1番目のブロックに対応するd(太字)k+1内の加算処理対象のシンボル位置であるIG番目のシンボルに対して、後述する調整値ε(太字)k+1を加算する加算処理を実施する。なおIG番目のシンボルは1つであってもよく複数であってもよい。すなわちIGの集合の要素の数Gは1以上である。IG番目のシンボルは、後述するように、例えば第2の位置を含む第2の位置に連続するシンボルである。 Here, the addition processing in the addition processing unit 2 of the present embodiment will be described using equations. Addition processing unit 2, to the following as shown in equation (11), k + 1 th block is a symbol position of the addition processed in that d (bold) k + 1 corresponding I G th symbol, Addition processing for adding an adjustment value ε (bold) k + 1, which will be described later, is performed. The IG- th symbol may be one or plural. That is, the number G of elements in the set of I G is 1 or more. As will be described later, the IG- th symbol is, for example, a symbol that continues to the second position including the second position.
Figure JPOXMLDOC01-appb-M000011
Figure JPOXMLDOC01-appb-M000011
 なお上記の加算処理後のシンボルは平均電力が調整前と同じになるように正規化される。ここでは、k+1番目のブロックにおける加算処理について説明する。k+1番目のブロックの加算処理を実施する時点で、k番目のブロックのCPブロックは生成済みである。k番目のブロックのCPブロックの生成過程で得られるIDFT部7からの出力データをy(太字)(ハット)kとする。y(太字)(ハット)kは、k番目のブロックのCPブロックの生成過程で加算処理実施済みのデータである。 The symbols after the above addition processing are normalized so that the average power is the same as that before the adjustment. Here, the addition process in the (k + 1) th block will be described. At the time when the k + 1-th block addition process is performed, the CP block of the k-th block has already been generated. The output data from the IDFT unit 7 obtained in the process of generating the CP block of the kth block is y (bold) (hat) k . y (bold) (hat) k is data that has been subjected to addition processing in the process of generating the CP block of the k-th block.
 図6は、本実施の形態の加算処理において考慮するサンプル位置の一例を示す図である。本実施の形態では、上述したように、k+1番目のブロックのA2周辺のサンプルとk番目のブロックのA1のサンプルとが等しくなるように、第2の位置の周辺にk番目のブロックのシンボルを挿入する。これにより、フーリエ変換の循環性を用いて、k+1番目のブロックのA2周辺のサンプルとk番目のブロックのA1の巡回した周辺のサンプルが等しくなるようにする。加算処理部2は、P1およびP2を1以上の整数とするとき、以下の式(12)で示すk+1番目のブロックのA2周辺のP1+P2サンプルと、以下の式(13)で示すk番目のブロックのA1周辺のP1+P2サンプルとが等しくなるように、k+1番目のブロック内のIGの位置のシンボルに加算する調整量を決定する。本実施の形態では、図6に示すように、A1周辺のP1+P2サンプルを適宜第1のサンプル群と呼び、A2周辺のP1+P2サンプルを適宜第2のサンプル群と呼ぶ。なお、式(13)に示すk番目のブロックのA1周辺のサンプルでは、有限区間のフーリエ変換の性質により巡回させることによりA1に連続する位置となる、k番目のブロックの末尾のP2個のサンプルも含む。 FIG. 6 is a diagram illustrating an example of sample positions to be considered in the addition processing of the present embodiment. In the present embodiment, as described above, the symbols of the kth block are placed around the second position so that the samples around A2 of the (k + 1) th block are equal to the samples of A1 of the kth block. insert. Thus, the samples around A2 of the (k + 1) th block and the samples around A1 in the kth block are made equal by using the circularity of Fourier transform. When P1 and P2 are integers greater than or equal to 1, the addition processing unit 2 performs P1 + P2 samples around A2 of the (k + 1) th block represented by the following equation (12) and the kth block represented by the following equation (13): A1 so that the periphery of P1 + P2 samples equal the to determine the adjustment amount to be added to the symbol position of I G in the k + 1 th block. In the present embodiment, as shown in FIG. 6, the P1 + P2 samples around A1 are appropriately referred to as a first sample group, and the P1 + P2 samples around A2 are appropriately referred to as a second sample group. In the samples around A1 of the k-th block shown in Equation (13), P2 samples at the end of the k-th block, which are positions consecutive to A1 by being cycled by the property of Fourier transform in a finite section Including.
Figure JPOXMLDOC01-appb-M000012
Figure JPOXMLDOC01-appb-M000012
Figure JPOXMLDOC01-appb-M000013
Figure JPOXMLDOC01-appb-M000013
 具体的には、k番目のCPブロックの処理過程で、サンプル選択部8は入力された信号のうち、A1を中心とした式(13)に示すP1+P2サンプルを抽出し、加算処理部2に出力する。 Specifically, in the process of the k-th CP block, the sample selection unit 8 extracts the P1 + P2 sample shown in Expression (13) centered on A1 from the input signals and outputs the sample to the addition processing unit 2 To do.
 ここで、IOをA2の周辺のP1+P2サンプルに対応するシンボル位置IO={NL-NCPL-P2,NL-NCPL-P2+1,…,NL-NCPL-P1-1}とする。加算処理部2は、式(7)で定義した行列A(太字)において、IOに該当する行および、IGに該当する列を抽出した行列をA(太字)'とする。A(太字)'のサイズは(P1+P2)×Gとなる。ブロック境界における誤差η(太字)k+1は、以下の式(14)で表すことができる。 Here, I O is symbol position I O corresponding to P1 + P2 samples around A2 = {NL−N CP L−P2, NL−N CP L−P2 + 1,..., NL−N CP L−P1-1} To do. In the matrix A (bold) defined by the equation (7), the addition processing unit 2 defines A (bold) ′ as a matrix obtained by extracting a row corresponding to I O and a column corresponding to I G. The size of A (bold) ′ is (P1 + P2) × G. The error η (bold) k + 1 at the block boundary can be expressed by the following equation (14).
Figure JPOXMLDOC01-appb-M000014
Figure JPOXMLDOC01-appb-M000014
 G>P1+P2とすると、上記の誤差を補正するための調整値ε(太字)k+1は、以下の式(15)で表すことができる。 When G> P1 + P2, the adjustment value ε (bold) k + 1 for correcting the above error can be expressed by the following equation (15).
Figure JPOXMLDOC01-appb-M000015
Figure JPOXMLDOC01-appb-M000015
 G≦P1+P2とすると、上記の誤差を補正するための調整値ε(太字)k+1は、以下の式(16)で表すことができる。 When G ≦ P1 + P2, the adjustment value ε (bold) k + 1 for correcting the error can be expressed by the following equation (16).
Figure JPOXMLDOC01-appb-M000016
Figure JPOXMLDOC01-appb-M000016
 なお、y(太字)k+1,S1を計算するために、行列A(太字)からIOに該当する行を抽出した(P1+P2)×N行列をA(太字)SUBとすると、y(太字)k+1,S1は、以下の式(17)により算出することができる。 In order to calculate y (bold) k + 1, S1 , a row corresponding to I O is extracted from the matrix A (bold), and a (P1 + P2) × N matrix is A (bold) SUB. K + 1, S1 can be calculated by the following equation (17).
Figure JPOXMLDOC01-appb-M000017
Figure JPOXMLDOC01-appb-M000017
 加算処理部2は、y(太字)k+1,S1に対応する過去シンボルに対して、サンプル選択部8から入力されるサンプルとk+1番目のブロックのA2の周辺のP1+P2シンボルとを用いて式(14)によりη(太字)k+1を求め、η(太字)k+1と行列A(太字)’とを用いて、ε(太字)k+1を求め、加算処理対象のシンボルにε(太字)k+1を加算する。そして、加算処理後の過去シンボルをシンボル挿入部3に出力する。なお、ここでは、加算処理対象のシンボルが過去シンボル内として説明したが、加算処理対象のシンボルは過去シンボル以外であってもよい。 The addition processing unit 2 uses the samples input from the sample selection unit 8 and the P1 + P2 symbols around A2 of the k + 1-th block for the past symbols corresponding to y (bold) k + 1, S1. Η (bold) k + 1 is obtained by (14), ε (bold) k + 1 is obtained using η (bold) k + 1 and matrix A (bold) ′, and ε (Bold) Add k + 1 . Then, the past symbol after the addition processing is output to the symbol insertion unit 3. Here, although the symbol subject to addition processing is described as being in the past symbol, the symbol subject to addition processing may be other than the past symbol.
 IGの位置のシンボルは任意に選ぶことができるが、A2周辺のサンプルへの影響が大きいシンボルとすることが望ましく、また過去シンボルに調整を加えるのが望ましい。過去シンボルは過去のCPブロックでも送信されているシンボルであり、受信側で、過去のCPブロックで送信されたシンボルと合わせて処理を行うことで復調における加算処理の影響を低減させることができる。以上のことから、IGの位置のシンボルは、第2の位置周辺のシンボルであることが望ましい。 Although the symbol positions of I G can be arbitrarily selected, it is desirable to have a large Symbol impact on the A2 surrounding the sample, also to add an adjustment in the past symbols desired. Past symbols are symbols that have been transmitted even in past CP blocks, and by performing processing together with symbols transmitted in past CP blocks on the receiving side, the influence of addition processing in demodulation can be reduced. From the above, the symbol locations of the I G is preferably a symbol near the second position.
 IGの位置のシンボルは、第2の位置を含む過去シンボル全体でも良く、過去シンボルが挿入された位置の一部でも良い。第2の位置周辺のシンボルを選ぶことで、加算される変化量が減り、加算後と加算前のシンボルの変化が少なくなる。また、第2および第1の位置周辺のシンボルを選んでも良い。一般的には、加算処理対象となるシンボル数が増えることで、調整量すなわち加算量が減る。IGの位置のシンボルの数は、ブロックごとに変更してもよい。すなわち適応的に加算処理を実施することができる。例えば、η(太字)k+1が閾値以上である場合には、加算処理対象となるシンボル数をG1とし、η(太字)k+1が閾値未満である場合には、加算処理対象となるシンボル数をG2(G2<G1)とする等の処理を行うことができる。 Symbol positions of I G may even past the whole symbol including the second position, may be part of a position past symbol is inserted. By selecting symbols around the second position, the amount of change to be added is reduced, and changes in symbols after addition and before addition are reduced. Further, symbols around the second and first positions may be selected. In general, as the number of symbols to be added increases, the adjustment amount, that is, the addition amount decreases. The number of symbols of the position of the I G may be changed for each block. That is, the addition process can be performed adaptively. For example, when η (bold) k + 1 is equal to or greater than the threshold, the number of symbols to be added is G1, and when η (bold) k + 1 is less than the threshold, the addition is processed. Processing such as setting the number of symbols to G2 (G2 <G1) can be performed.
 図5の説明に戻り、シンボル挿入部3は、データシンボル生成部1から入力されるデータシンボルに加算処理後の過去シンボルを挿入する(ステップS3)。具体的には、上述したように、データシンボルを0番目からQ-1番目までのデータシンボル群とQ番目からND-1番目までのデータシンボル群に分割し、前者のデータシンボル群の前に第2のシンボル群を配置し、前者のデータシンボル群の後に第1のシンボル群および第2のシンボル群を配置し、第2のシンボル群の後に後者のデータシンボル群を配置する。Qの値は、予め上述した手順で計算されてシンボル挿入部3に設定されている。外部からの指示により、Qの値を変更可能なようにシンボル挿入部3を構成してもよい。次に、シンボル選択部4は、シンボル挿入部3から出力されるシンボルのうち選択したシンボルを記憶部11に格納する(ステップS4)。この選択したシンボルは、現在の生成対象のCPブロックがk+1番目のCPブロックであるとすると、次のブロックすなわちk+2番目のブロックのCPブロックの生成時に過去シンボルとして読み出されるシンボルである。例えば、図4に例示したように、4つの過去シンボルが第2の位置の周辺に挿入される場合、シンボル選択部4は、先頭の2個と末尾の2個のシンボルであるdk+1,22,dk+1,23,dk+1,0,dk+1,1を記憶部11に格納する。記憶部11に格納されたdk+1,22,dk+1,23,dk+1,0,dk+1,1は、k+2番目のCPブロックの生成時のステップS2で読み出されて、加算処理が施される。 Returning to the description of FIG. 5, the symbol insertion unit 3 inserts the past symbol after the addition process into the data symbol input from the data symbol generation unit 1 (step S3). Specifically, as described above, the data symbols are divided into the 0th to Q−1th data symbol groups and the Qth to N D −1th data symbol groups, and the former data symbol group The second symbol group is arranged, the first symbol group and the second symbol group are arranged after the former data symbol group, and the latter data symbol group is arranged after the second symbol group. The value of Q is calculated in advance by the procedure described above and set in the symbol insertion unit 3. The symbol insertion unit 3 may be configured so that the value of Q can be changed by an instruction from the outside. Next, the symbol selection unit 4 stores the selected symbol among the symbols output from the symbol insertion unit 3 in the storage unit 11 (step S4). This selected symbol is a symbol that is read as a past symbol when the CP block of the next block, that is, the k + 2th block is generated, assuming that the CP block to be generated is the (k + 1) th CP block. For example, as illustrated in FIG. 4, when four past symbols are inserted around the second position, the symbol selection unit 4 includes d k + 1 which is the first two symbols and the last two symbols. , 22 , d k + 1,23 , d k + 1,0 , d k + 1,1 are stored in the storage unit 11. D k + 1,22 , d k + 1,23 , d k + 1,0 , d k + 1,1 stored in the storage unit 11 are read in step S2 when the k + 2nd CP block is generated. Then, addition processing is performed.
 図5の説明に戻り、DFT部5は、過去シンボル挿入後のデータに対してDFT処理を実施する(ステップS5)。次に、オーバサンプリング処理部6は、オーバサンプリング処理を実施し(ステップS6)、処理後のデータをIDFT部7へ入力する。IDFT部7は、入力されたデータに対してIDFT処理を実施し(ステップS7)、サンプル選択部8へ処理結果を入力する。サンプル選択部8は、入力されたサンプルのうちA1を中心としたP1+P2個のサンプルを選択し(ステップS8)、加算処理部2へ入力する。なお、A1を中心としたP1+P2個のサンプルを第1のサンプル群と呼ぶ。選択されたサンプルは、次のブロックの処理のステップS3で用いられる。次に、CP付加部9は、CPを付加する(ステップS9)。以上の処理によりCPブロックが生成される。 Returning to the description of FIG. 5, the DFT unit 5 performs DFT processing on the data after the past symbol insertion (step S5). Next, the oversampling processing unit 6 performs oversampling processing (step S6), and inputs the processed data to the IDFT unit 7. The IDFT unit 7 performs IDFT processing on the input data (step S7), and inputs the processing result to the sample selection unit 8. The sample selection unit 8 selects P1 + P2 samples centering on A1 among the input samples (step S8), and inputs them to the addition processing unit 2. Note that P1 + P2 samples centering on A1 are referred to as a first sample group. The selected sample is used in step S3 of the next block processing. Next, the CP adding unit 9 adds a CP (step S9). A CP block is generated by the above processing.
 ここで、本実施の形態の加算処理の一例を説明する。図7は、加算処理対象のシンボルの一例を示す図である。図7では、N=32,M=24,L=4,NCP=8とし、K=2,P1=1,P2=1とした例を示している。図7は、シンボル多重後の配置における加算処理対象のシンボルの位置を示したものである。図7では、加算処理の前の過去シンボルがシンボル多重された配置位置を仮想的に示している。jは、データシンボルと過去シンボルとが多重された後のN個のシンボルにおけるシンボルの番号を示す。この場合、I0={NL-NCPL-1,NL-NCPL}={95,96}となる。このとき、X=18であり、第2の位置の周辺のシンボルを加算処理対象のシンボルとして選択するとし、上記式(8)に示した過去シンボルを用いた場合に、G=4とすると、IG={16,17,18,19}となる。加算処理前の過去シンボルが仮想的にデータシンボルと多重された場合の、d(太字)dk+1,IGは、以下の式(18)となる。 Here, an example of the addition processing of the present embodiment will be described. FIG. 7 is a diagram illustrating an example of symbols to be added. FIG. 7 shows an example in which N = 32, M = 24, L = 4, N CP = 8, K = 2, P1 = 1, and P2 = 1. FIG. 7 shows the positions of symbols to be added in the arrangement after symbol multiplexing. In FIG. 7, the arrangement position where the past symbols before the addition processing are symbol-multiplexed is virtually shown. j indicates the symbol number in the N symbols after the data symbol and the past symbol are multiplexed. In this case, I 0 = {NL−N CP L−1, NL−N CP L} = {95, 96}. At this time, if X = 18 and symbols around the second position are selected as symbols to be added, and the past symbol shown in the above equation (8) is used, and G = 4, I G = {16, 17, 18, 19}. When past symbols before the addition processing are virtually multiplexed with data symbols, d (bold) d k + 1, IG is expressed by the following equation (18).
Figure JPOXMLDOC01-appb-M000018
Figure JPOXMLDOC01-appb-M000018
 そして、実際には、d(太字)k+1,IGは、加算処理部2により加算処理が施されてDFT部5に入力される。加算処理後のd(太字)dk+1,IGをd(太字)(ハット)k+1,IGとするとき、d(太字)(ハット)k+1,IGを、以下の式(19)で定義する。 In practice, d (bold) k + 1, IG is added by the addition processing unit 2 and input to the DFT unit 5. When d (bold) d k + 1, IG after addition processing is d (bold) (hat) k + 1, IG , d (bold) (hat) k + 1, IG is expressed by the following equation (19) ).
Figure JPOXMLDOC01-appb-M000019
Figure JPOXMLDOC01-appb-M000019
 このとき、d(太字)(ハット)k+1,IGは、以下の式(20)で表すことができる。 At this time, d (bold) (hat) k + 1, IG can be expressed by the following equation (20).
Figure JPOXMLDOC01-appb-M000020
Figure JPOXMLDOC01-appb-M000020
 なお、上記の式(11)、(20)において、ε(太字)k+1を加算する際、ε(太字)k+1の替わりに、正規化用の計数c1を乗じたc1ε(太字)k+1を用いることにより、正規化して加算処理を行ってもよい。 The above equation (11), in (20), epsilon when adding (in bold) k + 1, epsilon instead of (bold) k + 1, c 1 epsilon obtained by multiplying the count c 1 for normalized (Bold) Normalization may be performed by using k + 1 .
 以上のように、本実施の形態では、1つ前のCPブロックの先頭および末尾のシンボルである過去シンボルを第2の位置を中心として配置し、前のブロックのA1周辺のP1+P2サンプルと、現在の処理対象のブロックのA2周辺のP1+P2サンプルが等しくなるように、加算処理部2aが、ブロック内の1つ以上のシンボルに調整量を加算するようにした。このため、前のブロックのサンプルと位相および振幅を連続させることができ、帯域外スペクトルを抑圧することができる。また、調整を行う必要が無い場合、調整量を算出する必要は無い。 As described above, in the present embodiment, past symbols that are the first and last symbols of the previous CP block are arranged around the second position, and the P1 + P2 samples around A1 of the previous block are The addition processing unit 2a adds the adjustment amount to one or more symbols in the block so that the P1 + P2 samples in the vicinity of A2 of the block to be processed are equal. For this reason, the sample and the phase and amplitude of the previous block can be made continuous, and the out-of-band spectrum can be suppressed. Further, when there is no need to make adjustments, there is no need to calculate the adjustment amount.
実施の形態2.
 図8は、本発明の実施の形態2にかかる送信装置の構成例を示す図である。本実施の形態の送信装置20aは、実施の形態1の送信装置20の加算処理部2の替わりにIDFT部7の後段に配置される加算処理部2aを備える以外は、実施の形態1の送信装置20と同様である。実施の形態1と同様の機能を有する構成要素は、実施の形態1と同一の符号を付して重複する説明を省略する。加算処理部2aは、IDFT部7から出力されるサンプル内の過去シンボルに対応するサンプルのうち少なくとも一部のサンプルに加算処理を行う加算部である。
Embodiment 2. FIG.
FIG. 8 is a diagram of a configuration example of the transmission apparatus according to the second embodiment of the present invention. The transmission device 20a according to the present embodiment includes the addition processing unit 2a arranged at the subsequent stage of the IDFT unit 7 instead of the addition processing unit 2 of the transmission device 20 according to the first embodiment. It is the same as the device 20. Components having the same functions as those in the first embodiment are denoted by the same reference numerals as those in the first embodiment, and redundant description is omitted. The addition processing unit 2a is an addition unit that performs addition processing on at least some of the samples corresponding to the past symbols in the samples output from the IDFT unit 7.
 本実施の形態では、シンボル挿入部3は、加算処理が施されていないデータシンボルおよび過去シンボルを多重する。データシンボルおよび固定シンボル系列の配置は実施の形態1と同様である。そして、実施の形態1と同等に、以下の式(21)に示すk+1番目のブロックのA2周辺のP1+P2サンプルy(太字)k+1,S1と以下の式(22)に示すk番目のブロックの巡回させたA1の周辺のサンプルy(太字)(ハット)k,S0とが等しくなるように、IDFT部7から出力されるk+1番目のブロックのサンプルのうち、実施の形態1で述べたIGの位置のシンボルに対応するサンプルであるIG’の位置のサンプルに対して加算処理を実施する。 In the present embodiment, the symbol insertion unit 3 multiplexes data symbols and past symbols that have not been subjected to addition processing. The arrangement of data symbols and fixed symbol sequences is the same as in the first embodiment. As in the first embodiment, P1 + P2 samples y (bold) k + 1, S1 around A2 of the ( k + 1 ) th block shown in the following equation (21) and the kth block shown in the following equation (22) In the sample of the (k + 1) -th block output from the IDFT unit 7 such that the samples y (bold) (hat) k, S0 around A1 that have been circulated in FIG. implementing the addition processing with respect to the sample position of the I G 'is the sample corresponding to the symbol position of G.
Figure JPOXMLDOC01-appb-M000021
Figure JPOXMLDOC01-appb-M000021
Figure JPOXMLDOC01-appb-M000022
Figure JPOXMLDOC01-appb-M000022
 この場合、y(太字)k+1,S1はIDFT部7の出力である。実施の形態1と同様、以下の式(23)に示す、ブロック境界における誤差をη(太字)k+1とすると、G>P1+P2の場合は上記の式(15)、G≦P1+P2の場合は、上記式(16)を用いてε(太字)k+1を算出する。そして、加算処理部2aは、A(太字)SUB2を行列A(太字)におけるIG’に対応する列を抽出したNL×G’行列とすると、以下の式(24)により加算処理後の信号を算出する。 In this case, y (bold) k + 1, S1 is the output of the IDFT unit 7. As in the first embodiment, when the error at the block boundary shown in the following equation (23) is η (bold) k + 1 , the above equation (15) is satisfied when G> P1 + P2, and the case where G ≦ P1 + P2 is satisfied. Ε (bold) k + 1 is calculated using the above equation (16). Then, the addition processing unit 2a assumes that A (bold) SUB2 is an NL × G ′ matrix obtained by extracting a column corresponding to IG ′ in the matrix A (bold), and the signal after the addition processing is expressed by the following equation (24). Is calculated.
Figure JPOXMLDOC01-appb-M000023
Figure JPOXMLDOC01-appb-M000023
Figure JPOXMLDOC01-appb-M000024
Figure JPOXMLDOC01-appb-M000024
 なお、y(太字)(ハット)k+1の算出後、平均電力がy(太字)k+1と等しくなるよう正規化処理を行ってもよい。また、上記の式(24)において、ε(太字)k+1の替わりに、正規化用の計数c2を乗じたc2ε(太字)k+1を用いることにより、正規化して加算処理を行ってもよい。 Note that after calculating y (bold) (hat) k + 1 , normalization processing may be performed so that the average power becomes equal to y (bold) k + 1 . In the above formula (24), epsilon instead of (bold) k + 1, by using the c 2 epsilon (bold) k + 1 multiplied by the count c 2 for normalization, addition processing by normalizing May be performed.
 以上述べた以外の本実施の形態の動作は、実施の形態1と同様である。図9は、本実施の形態のCPブロック生成処理手順の一例を示すフローチャートである。図9のステップS1は実施の形態1のステップS1と同様である。ステップS1の後、ステップS3を実施する。ただし、ステップS3では、シンボル挿入部3は、加算処理前の過去シンボルとデータシンボルとを多重する。ステップS4~S7は、実施の形態1のステップS4~S7と同様である。ステップS7の後、加算処理部2aは、前のブロックの処理においてサンプル選択部8により選択されたサンプルを用いて、加算処理対象のサンプルに対して加算処理を行う(ステップS3a)。ステップS3aの後のステップS8,S9は、実施の形態1のステップS8,S9と同様である。 The operations of the present embodiment other than those described above are the same as those of the first embodiment. FIG. 9 is a flowchart illustrating an example of a CP block generation processing procedure according to the present embodiment. Step S1 in FIG. 9 is the same as step S1 in the first embodiment. After step S1, step S3 is performed. However, in step S3, the symbol insertion unit 3 multiplexes the past symbol and the data symbol before the addition process. Steps S4 to S7 are the same as steps S4 to S7 in the first embodiment. After step S7, the addition processing unit 2a performs addition processing on the sample to be added using the sample selected by the sample selection unit 8 in the previous block processing (step S3a). Steps S8 and S9 after step S3a are the same as steps S8 and S9 of the first embodiment.
 以上のように、本実施の形態では、1つの前のCPブロックの先頭および末尾のシンボルである過去シンボルを第2の位置を中心として配置し、前のブロックのA1周辺のP1+P2サンプルと、現在の処理対象のブロックのA2周辺のP1+P2サンプルとが等しくなるように、IDFT処理後のブロック内の1つ以上のサンプルに調整量を加算するようにした。このため、実施の形態1と同様に、前のブロックのサンプルと位相および振幅を連続させることができ、帯域外スペクトルを抑圧することができる。 As described above, in the present embodiment, past symbols that are the first and last symbols of one previous CP block are arranged around the second position, and the P1 + P2 samples around A1 of the previous block and the current The adjustment amount is added to one or more samples in the block after the IDFT processing so that the P1 + P2 samples in the vicinity of A2 of the block to be processed are equal. For this reason, as in the first embodiment, the sample and the phase and amplitude of the previous block can be made continuous, and the out-of-band spectrum can be suppressed.
実施の形態3.
 図10は、本発明にかかる実施の形態3の受信装置の構成例を示す図である。図11は、本実施の形態にかかる通信システムの構成例を示す図である。図10に示す受信装置30は、実施の形態1の送信装置20から信号を受信する受信装置である。本実施の形態の通信システム50は、図11に示すように送信装置20と受信装置30とを備える。図11では、送信装置20が、無線通信によりブロック信号を送信する例を示しているが、これに限らず送信装置20は有線通信によりブロック信号を送信してもよい。なお、送信装置20に替えて送信装置20aを用いてもよい。
Embodiment 3 FIG.
FIG. 10 is a diagram of a configuration example of the receiving apparatus according to the third embodiment of the present invention. FIG. 11 is a diagram illustrating a configuration example of a communication system according to the present embodiment. A receiving device 30 illustrated in FIG. 10 is a receiving device that receives a signal from the transmitting device 20 according to the first embodiment. The communication system 50 according to the present embodiment includes a transmission device 20 and a reception device 30 as shown in FIG. Although FIG. 11 shows an example in which the transmission device 20 transmits a block signal by wireless communication, the transmission device 20 may transmit the block signal by wired communication. Note that the transmission device 20a may be used instead of the transmission device 20.
 図10に示すように、受信装置30は、受信部31、CP除去部32、DFT部33、アンダーサンプリング処理部34、FDE(Frequency Domain Equalizer)35、IDFT部36、シンボル選択部37、記憶部38および復調部39を備える。 As illustrated in FIG. 10, the reception device 30 includes a reception unit 31, a CP removal unit 32, a DFT unit 33, an undersampling processing unit 34, an FDE (Frequency Domain Equalizer) 35, an IDFT unit 36, a symbol selection unit 37, and a storage unit. 38 and a demodulator 39.
 なお、送信側で符号化が行われている場合には、復調部39を復調および復号部に替えて、復調の後に復号を行ってもよい。 If encoding is performed on the transmission side, the demodulation unit 39 may be replaced with a demodulation and decoding unit, and decoding may be performed after demodulation.
 なお、図10に示した受信装置30の構成要素は、全てをハードウェアにより実現することができる。受信部31は受信機であり、DFT部33、IDFT部36は、例えばフリップフロップ回路、シフトレジスタ等を用いた電子回路であり、記憶部38はメモリである。復調部39は、モデムまたはデモジュレータとデコーダである。CP除去部32、FDE35、アンダーサンプリング処理部34、シンボル選択部37は、各々が電子回路として実現できる。しかしながら、図10に示した構成要素のうち、一部がソフトウェアにより構成されてもよい。図10に示した構成要素のうちソフトウェアにより実現されるものがある場合、例えば、ソフトウェアにより実現される構成要素は図2に示す制御回路200により実現される。図2に示すように制御回路200は、外部から入力されたデータを受信する受信部である入力部201と、プロセッサ202と、メモリ203と、データを外部へ送信する送信部である出力部204とを備える。入力部201は、制御回路200の外部から入力されたデータを受信してプロセッサ202に与えるインターフェース回路であり、出力部204は、プロセッサ202又はメモリ203からのデータを制御回路200の外部に送るインターフェース回路である。図10に示す構成要素のうちの少なくとも一部が、図2に示す制御回路200により実現される場合、プロセッサ202がメモリ203に記憶された、受信装置30の各々の構成要素に対応するプログラムを読み出して実行することにより実現される。また、メモリ203は、プロセッサ202が実施する各処理における一時メモリとしても使用される。 Note that all the components of the receiving device 30 shown in FIG. 10 can be realized by hardware. The receiving unit 31 is a receiver, the DFT unit 33 and the IDFT unit 36 are electronic circuits using, for example, a flip-flop circuit and a shift register, and the storage unit 38 is a memory. The demodulator 39 is a modem or a demodulator and a decoder. Each of the CP removing unit 32, the FDE 35, the undersampling processing unit 34, and the symbol selecting unit 37 can be realized as an electronic circuit. However, some of the components shown in FIG. 10 may be configured by software. When some of the components shown in FIG. 10 are realized by software, for example, the components realized by software are realized by the control circuit 200 shown in FIG. As shown in FIG. 2, the control circuit 200 includes an input unit 201 that is a reception unit that receives data input from the outside, a processor 202, a memory 203, and an output unit 204 that is a transmission unit that transmits data to the outside. With. The input unit 201 is an interface circuit that receives data input from the outside of the control circuit 200 and applies the data to the processor 202, and the output unit 204 is an interface that transmits data from the processor 202 or the memory 203 to the outside of the control circuit 200. Circuit. When at least a part of the components shown in FIG. 10 is realized by the control circuit 200 shown in FIG. 2, the processor 202 stores a program corresponding to each component of the reception device 30 stored in the memory 203. This is realized by reading and executing. The memory 203 is also used as a temporary memory in each process executed by the processor 202.
 本実施の形態の受信装置30では、まず、受信部31が、ブロック信号すなわちCPブロックとして送信装置20から送信された信号を受信すると、CP除去部32が、受信した信号からCPを除去する。次に、時間周波数変換部であるDFT部33が、CP除去後の信号に対してDFT処理を実施することにより、時間領域の受信信号を周波数領域の信号に変換する。アンダーサンプリング処理部34は、DFT処理後の信号に対してアンダーサンプリング処理を実施する。アンダーサンプリング処理は、送信装置20でオーバサンプリング処理としてゼロ挿入がなされている場合には、送信装置20においてゼロが挿入された部分を削除する処理である。 In the receiving device 30 of the present embodiment, first, when the receiving unit 31 receives a block signal, that is, a signal transmitted from the transmitting device 20 as a CP block, the CP removing unit 32 removes the CP from the received signal. Next, the DFT unit 33, which is a time-frequency conversion unit, converts the received signal in the time domain into a signal in the frequency domain by performing DFT processing on the signal after CP removal. The undersampling processing unit 34 performs undersampling processing on the signal after DFT processing. The undersampling process is a process of deleting a portion in which zero is inserted in the transmission apparatus 20 when zero insertion is performed as an oversampling process in the transmission apparatus 20.
 FDE35は、アンダーサンプリング処理後の周波数領域の受信信号を用いて、周波数領域において等化処理を実施する。すなわち、FDE35は、アンダーサンプリング処理後の周波数領域の信号に対して等化処理を行う等化処理部である。なお、周波数領域の等化処理は、周波数領域における歪補正用に用いられる処理であり、最小平均二乗誤差(MMSE)規範のFDE等どのような方法を用いてもよいが、例えば、非特許文献1に記載されている手法を用いることができる。FDEでは、周波数領域における歪補正の過程で、チャネル応答を求めている。 The FDE 35 performs equalization processing in the frequency domain using the frequency domain received signal after the undersampling processing. That is, the FDE 35 is an equalization processing unit that performs an equalization process on the signal in the frequency domain after the undersampling process. The frequency domain equalization process is a process used for distortion correction in the frequency domain, and any method such as the minimum mean square error (MMSE) norm FDE may be used. 1 can be used. In FDE, the channel response is obtained in the process of distortion correction in the frequency domain.
 周波数時間変換部であるIDFT部36は、FDE後の周波数領域の信号に対してIDFT処理を実施することにより、周波数領域の信号を時間領域の信号に変換する。復調部39は、時間領域の信号内の送信装置20において過去シンボルが配置された位置のシンボルと過去に受信したブロック信号とに基づいて復調を行い、時間領域の信号内の過去シンボルが配置された位置の以外の位置のシンボルに基づいて復調を行う。 The IDFT unit 36 that is a frequency time conversion unit converts the frequency domain signal into a time domain signal by performing IDFT processing on the frequency domain signal after FDE. The demodulation unit 39 performs demodulation based on the symbol at the position where the past symbol is arranged in the transmitter 20 in the time domain signal and the block signal received in the past, and the past symbol in the time domain signal is arranged. Demodulation is performed based on symbols at positions other than the positions.
 次に、本実施の形態の復調処理について説明する。まず、k番目のブロックの信号を受信した際のIDFT部36の出力をqk,0,qk,1,…,qk,M-1とする。qk,0,qk,1,…,qk,M-1は、全て情報データの推定値であるため、以下の式(25)に従って、復調を行うことができる。なお、過去シンボルとして格納されたシンボルに対応する部分は既に復調がなされているシンボルであるため、復調に使用しなくてもよい。ここでdはシンボル候補を示し、Dはシンボル候補の集合を示す。例えば、情報シンボルがBPSKシンボルである場合、D={+1,-1}であり、情報シンボルがQPSKシンボルの場合はD={+1+j、+1-j,-1+j,-1-j}である。 Next, demodulation processing according to the present embodiment will be described. First, the output of the IDFT unit 36 when the signal of the k-th block is received is set to q k, 0 , q k, 1 ,..., Q k, M−1 . Since q k, 0 , q k, 1 ,..., q k, M−1 are all estimated values of information data, demodulation can be performed according to the following equation (25). Note that a portion corresponding to a symbol stored as a past symbol is a symbol that has already been demodulated, and thus may not be used for demodulation. Here, d indicates a symbol candidate, and D indicates a set of symbol candidates. For example, when the information symbol is a BPSK symbol, D = {+ 1, −1}, and when the information symbol is a QPSK symbol, D = {+ 1 + j, + 1−j, −1 + j, −1−j}.
Figure JPOXMLDOC01-appb-M000025
Figure JPOXMLDOC01-appb-M000025
 一方、実施の形態1または2で述べた送信装置は、過去シンボルに対応するシンボルを合計2回にわたって送信する。このため、送信装置において、k番目のCPブロックに、過去シンボルとして第2の位置以降にK1個のシンボルであるdk-1,0,dk-1,1,…,dk-1,K1と第2の位置の1つ前までのK2個のシンボルdk-1,M-K2,dk-1,M-K2+1,…,dk-1,M-1とが格納される場合、以下の式(26)、(27)に示すように、過去シンボルとして送信されるシンボルはk-1番目のブロックに対応する受信信号とk番目のブロックに対応する受信信号との両方を利用して復調処理を行ってもよい。 On the other hand, the transmission apparatus described in Embodiment 1 or 2 transmits a symbol corresponding to the past symbol twice in total. For this reason, in the transmission apparatus, the k th CP block includes the k 1 symbols d k-1,0 , d k−1,1 ,..., D k−1 as the past symbols after the second position . K1 and K2 symbols d k-1, M-K2 , d k-1, M-K2 + 1 ,..., D k-1, M-1 up to the previous second position are stored. As shown in the following equations (26) and (27), symbols transmitted as past symbols are both a received signal corresponding to the (k−1) th block and a received signal corresponding to the kth block. Demodulation processing may be performed using.
Figure JPOXMLDOC01-appb-M000026
Figure JPOXMLDOC01-appb-M000026
Figure JPOXMLDOC01-appb-M000027
Figure JPOXMLDOC01-appb-M000027
 このとき、0≦m≦K1,M-K2≦m≦M-1,X-K2≦m≦X+K1以外のシンボル、すなわちK1<m<X-K2,X+K1<m<M-K2については、以下の式(28)に従って復調処理を行う。 At this time, symbols other than 0 ≦ m ≦ K1, M−K2 ≦ m ≦ M−1, X−K2 ≦ m ≦ X + K1, that is, K1 <m <X−K2, X + K1 <m <M−K2 are as follows. Demodulation processing is performed according to equation (28).
Figure JPOXMLDOC01-appb-M000028
Figure JPOXMLDOC01-appb-M000028
 次に、本実施の形態の動作について説明する。図12は、本実施の形態の受信処理手順の一例を示すフローチャートである。ここでは、k番目のブロックの受信処理を行うとして説明する。また、復調処理は、上述した式(26)および式(27)を用いて実施すると例を説明する。本実施の形態の受信装置30では、CP除去部32が、受信部31により受信された信号からCPを除去する(ステップS11)。次に、時間周波数変換部であるDFT部33が、CP除去後の信号に対してDFT処理を実施することにより、時間領域の受信信号を周波数領域の信号に変換する(ステップS12)。アンダーサンプリング処理部34は、DFT処理後の信号に対してアンダーサンプリング処理を実施する(ステップS13)。 Next, the operation of this embodiment will be described. FIG. 12 is a flowchart illustrating an example of a reception processing procedure according to the present embodiment. Here, a description will be given assuming that the reception process of the kth block is performed. An example will be described in which the demodulation process is performed using the above-described equations (26) and (27). In receiving apparatus 30 of the present embodiment, CP removing unit 32 removes the CP from the signal received by receiving unit 31 (step S11). Next, the DFT unit 33, which is a time-frequency conversion unit, converts the received signal in the time domain into a signal in the frequency domain by performing DFT processing on the signal after CP removal (step S12). The undersampling processing unit 34 performs undersampling processing on the signal after DFT processing (step S13).
 次に、FDE35は、アンダーサンプリング処理後の周波数領域の受信信号を用いて、周波数領域において等化処理を実施する(ステップS14)。次に、周波数時間変換部であるIDFT部36は、FDE後の周波数領域の信号に対してIDFT処理を実施することにより、周波数領域の信号を時間領域の信号に変換する(ステップS15)。シンボル選択部37は、IDFT部36から出力される時間領域の信号のうち、選択対象のシンボルを選択し、選択したシンボルを記憶部38に格納する(ステップS16)。IDFT部36から出力される時間領域の信号は、送信装置20において、シンボル挿入部3により過去シンボルが挿入された後のN個のシンボルに対応する受信信号である。過去シンボルは、送信装置20において挿入された1つ前のブロックのシンボルである。上記の選択対象のシンボルは、k+1番目のブロックにおいて過去シンボルとして挿入される部分、すなわち、k番目のブロックの先頭と末尾のシンボルである。例えば、k番目のブロックに、過去シンボルとして、第2の位置以降のK1個のシンボルであるdk-1,0,dk-1,1,…,dk-1,K1と第2の位置の1つ前までのK2個のシンボルdk-1,M-K2,dk-1,M-K2+1,…,dk-1,M-1とで構成される場合、シンボル選択部37は、dk,0,dk,1,…,dk,K1とdk,M-K2,dk,M-K2+1,…,dk,M-1とを記憶部38に格納する。 Next, the FDE 35 performs equalization processing in the frequency domain using the frequency domain received signal after the undersampling processing (step S14). Next, the IDFT unit 36 that is a frequency time conversion unit converts the frequency domain signal into a time domain signal by performing IDFT processing on the frequency domain signal after FDE (step S15). The symbol selection unit 37 selects a symbol to be selected from the time domain signals output from the IDFT unit 36, and stores the selected symbol in the storage unit 38 (step S16). The time domain signal output from the IDFT unit 36 is a reception signal corresponding to N symbols after the past symbol is inserted by the symbol insertion unit 3 in the transmission device 20. The past symbol is a symbol of the previous block inserted in the transmission apparatus 20. The symbol to be selected is a portion to be inserted as a past symbol in the (k + 1) th block, that is, the first and last symbols of the kth block. For example, the k-th block, as the past symbols, d k-1, 0 is a K1 symbols after the second position, d k-1,1, ..., d k-1, K1 and second Symbol selection is made up of K2 symbols d k-1, M-K2 , d k-1, M-K2 + 1 ,..., D k-1, M-1 up to the previous position. part 37, d k, 0, d k , 1, ..., d k, K1 and d k, M-K2, d k, M-K2 + 1, ..., d k, M-1 and the storage section 38 To store.
 次に、復調部39は、復調対象のシンボルを設定する(ステップS17)。なお、復調対象のシンボルは、記憶部38に格納される位置のシンボルを除くシンボルとする。次に、復調対象のシンボルが過去シンボルであるか否かを判断する(ステップS18)。復調対象のシンボルが過去シンボルである場合(ステップS18 Yes)、復調部39は、記憶部38に格納されているk-1番目のブロックのシンボルとk番目のブロックに格納された過去シンボルとを用いて復調を行う(ステップS19)。すなわち、復調部39は、上述した式(26)に従って復調処理を実施する。 Next, the demodulator 39 sets a symbol to be demodulated (step S17). The symbol to be demodulated is a symbol excluding the symbol at the position stored in the storage unit 38. Next, it is determined whether or not the symbol to be demodulated is a past symbol (step S18). If the symbol to be demodulated is a past symbol (step S18, Yes), the demodulator 39 uses the symbol of the (k-1) th block stored in the storage unit 38 and the past symbol stored in the kth block. Demodulation is performed (step S19). That is, the demodulator 39 performs demodulation processing according to the above-described equation (26).
 その後、復調部39は、k番目のブロックのうち、記憶部38に格納される位置のシンボルを除く全シンボルの復調を行ったか否かを判断する(ステップS21)。記憶部38に格納される位置のシンボルを除く全シンボルの復調を行ったと判断した場合(ステップS21 Yes)、k番目のブロックの受信処理を終了する。 After that, the demodulator 39 determines whether or not all symbols except the symbols at the positions stored in the storage unit 38 have been demodulated in the kth block (step S21). If it is determined that all symbols excluding symbols at positions stored in the storage unit 38 have been demodulated (Yes in step S21), the reception process for the kth block is terminated.
 記憶部38に格納される位置のシンボルを除く全シンボルのうち復調を行っていないシンボルがあると判断した場合(ステップS21 No)、ステップS17へ戻り、ステップS17で復調対象のシンボルを復調が終了していないシンボルに設定して、ステップS18以降の処理を行う。 If it is determined that there is a symbol that has not been demodulated among all symbols excluding the symbol at the position stored in the storage unit 38 (No in step S21), the process returns to step S17, and the demodulation of the symbol to be demodulated is completed in step S17. The symbols that have not been set are set, and the processes in and after step S18 are performed.
 復調対象のシンボルが過去シンボルでない場合(ステップS18 No)、復調部39は、k番目のブロックに格納されたシンボルを用いて復調を行い(ステップS20)、ステップS21へ進む。すなわち、ステップS20では、復調部39は、上述した式(27)に従って復調処理を実施する。 If the symbol to be demodulated is not a past symbol (No in step S18), the demodulator 39 demodulates using the symbol stored in the kth block (step S20), and proceeds to step S21. That is, in step S20, the demodulator 39 performs demodulation processing according to the above-described equation (27).
 以上のように、本実施の形態では、実施の形態1または実施の形態2の送信装置から送信された信号を受信する受信装置30の構成および動作を説明した。過去シンボルに対して加算処理を行った場合、過去シンボルが複数回送信されることを利用して復調を行うことにより、過去シンボルの復調特性を劣化させずに復調を実施することができる。このため、復調および復号に影響を与えずに、帯域外スペクトルを抑圧することができる。 As described above, in the present embodiment, the configuration and operation of the receiving device 30 that receives a signal transmitted from the transmitting device of the first or second embodiment has been described. When addition processing is performed on past symbols, demodulation can be performed without degrading the demodulation characteristics of the past symbols by performing demodulation using the fact that past symbols are transmitted a plurality of times. For this reason, an out-of-band spectrum can be suppressed without affecting demodulation and decoding.
 以上の実施の形態に示した構成は、本発明の内容の一例を示すものであり、別の公知の技術と組み合わせることも可能であるし、本発明の要旨を逸脱しない範囲で、構成の一部を省略、変更することも可能である。 The configuration described in the above embodiment shows an example of the contents of the present invention, and can be combined with another known technique, and can be combined with other configurations without departing from the gist of the present invention. It is also possible to omit or change the part.
 1 データシンボル生成部、2,2a 加算処理部、3 シンボル挿入部、4 シンボル選択部、5,33 DFT部、6 オーバサンプリング処理部、7,36 IDFT部、8 サンプル選択部、9 CP付加部、10 送信部、11,38 記憶部、20,20a 送信装置、30 受信装置、31 受信部、32 CP除去部、34 アンダーサンプリング処理部、35 FDE、37 シンボル選択部、39 復調部、50 通信システム。 1 data symbol generation unit, 2, 2a addition processing unit, 3 symbol insertion unit, 4 symbol selection unit, 5,33 DFT unit, 6 oversampling processing unit, 7, 36 IDFT unit, 8 sample selection unit, 9 CP addition unit 10, transmission unit, 11, 38 storage unit, 20, 20a transmission device, 30 reception device, 31 reception unit, 32 CP removal unit, 34 undersampling processing unit, 35 FDE, 37 symbol selection unit, 39 demodulation unit, 50 communication system.

Claims (7)

  1.  ブロックごとにデータシンボルを生成するデータシンボル生成部と、
     前記データシンボル生成部により生成された前記データシンボルに過去のブロックの前記データシンボルである過去シンボルを挿入して多重シンボルを生成するシンボル挿入部と、
     前記多重シンボルを周波数領域のデータに変換する時間周波数変換部と、
     前記周波数領域のデータに対して補間処理を行う補間部と、
     前記補間処理後のデータを、複数のサンプルで構成される時間領域のデータに変換する周波数時間変換部と、
     過去シンボルのうち少なくとも一部のシンボル、または時間領域のデータのうち前記過去シンボルに対応するサンプルのうち少なくとも一部のサンプルに加算処理を行う加算部と、
     前記時間領域のデータから選択対象の位置のサンプルを選択して前記加算部へ入力する選択部と、
     前記時間領域のデータを含むブロック信号を送信する送信部と、
     を備え、
     前記加算部は、1つ前のブロックの前記ブロック信号の生成処理において前記選択部から入力されたサンプルに基づいて算出された調整量を、前記少なくとも一部のシンボルまたは前記少なくとも一部のサンプルに加算することを特徴とする送信装置。
    A data symbol generator for generating a data symbol for each block;
    A symbol insertion unit that generates a multiple symbol by inserting a past symbol that is the data symbol of a past block into the data symbol generated by the data symbol generation unit;
    A time-frequency converter that converts the multiple symbols into frequency-domain data;
    An interpolation unit that performs interpolation processing on the frequency domain data;
    A frequency time conversion unit for converting the data after the interpolation processing into time domain data composed of a plurality of samples;
    An adder that performs addition processing on at least some of the past symbols, or at least some of the samples corresponding to the past symbols in the time domain data;
    A selection unit that selects a sample at a position to be selected from the data in the time domain and inputs the sample to the addition unit;
    A transmission unit for transmitting a block signal including data in the time domain;
    With
    The adding unit adds the adjustment amount calculated based on the sample input from the selection unit in the block signal generation process of the previous block to the at least some symbols or the at least some samples. A transmitter characterized by adding.
  2.  前記加算部は、前記調整量を、前記少なくとも一部のシンボルに加算し、
     前記シンボル挿入部は、前記加算処理後の過去シンボルを前記データシンボルに挿入することを特徴とする請求項1に記載の送信装置。
    The adding unit adds the adjustment amount to the at least some symbols,
    The transmission apparatus according to claim 1, wherein the symbol insertion unit inserts the past symbol after the addition process into the data symbol.
  3.  前記加算部は、前記調整量を、前記少なくとも一部のサンプルに加算し、
     前記シンボル挿入部は、前記加算処理前の過去シンボルを前記データシンボルに挿入することを特徴とする請求項1に記載の送信装置。
    The adding unit adds the adjustment amount to the at least some samples,
    The transmission apparatus according to claim 1, wherein the symbol insertion unit inserts a past symbol before the addition process into the data symbol.
  4.  記憶部と、
     前記多重シンボルのうち、先頭の第1の個数のシンボルと末尾の第2の個数のシンボルとを選択し、選択したシンボルを前記記憶部に格納するシンボル選択部と、
     を備え、
     前記加算部は、前記記憶部から読み出したシンボルを前記過去シンボルとして用いることを特徴とする請求項1、2または3に記載の送信装置。
    A storage unit;
    A symbol selection unit that selects a first number of symbols at the beginning and a second number of symbols at the end of the multiple symbols, and stores the selected symbols in the storage unit;
    With
    The transmission device according to claim 1, wherein the adding unit uses a symbol read from the storage unit as the past symbol.
  5.  前記時間領域のデータに対してCyclic Prefixを付加して前記ブロック信号を生成するCP付加部、を備え、
     前記シンボル挿入部は、Cyclic Prefixとしてコピーされる先頭のサンプルに対応するシンボルの位置を含む位置に前記加算処理後の過去シンボルを配置し、
     前記選択部は、P1およびP2を1以上の整数とするとき、前記時間領域のデータの先頭のP1個のサンプルと、前記時間領域のデータの末尾のP2個のサンプルとを第1サンプル群として選択して前記加算部へ入力し、
     前記加算部は、1ブロック前のブロック信号の生成処理で選択された前記第1サンプル群と、前記時間領域のデータの前記Cyclic Prefixとしてコピーされる先頭のサンプル以降のP1個のサンプルと、前記Cyclic Prefixとしてコピーされる先頭のサンプルの1つ前のサンプル以前のP2個のサンプルとで構成される第2のサンプル群とが等しくなるように、前記調整量を決定することを特徴とする請求項1から4のいずれか1つに記載の送信装置。
    A CP adding unit that generates a block signal by adding a cyclic prefix to the time domain data;
    The symbol insertion unit arranges the past symbol after the addition processing at a position including the position of the symbol corresponding to the first sample copied as a Cyclic Prefix,
    When the selection unit sets P1 and P2 to integers of 1 or more, the first P1 samples of the time domain data and the last P2 samples of the time domain data are used as a first sample group. Select and input to the adder,
    The adding unit includes the first sample group selected in the block signal generation process one block before, the P1 samples after the first sample copied as the cyclic prefix of the time domain data, The adjustment amount is determined so that a second sample group composed of P2 samples before the first sample copied as a cyclic prefix is equal to a second sample group. Item 5. The transmission device according to any one of Items 1 to 4.
  6.  請求項1から5のいずれか1つに記載の送信装置から送信されたブロック信号を受信する受信部と、
     前記ブロック信号を周波数領域の信号に変換する時間周波数変換部と、
     前記周波数領域の信号に対して等化処理を行う等化処理部と、
     前記等化処理後の信号を時間領域の信号に変換する周波数時間変換部と、
     前記時間領域の信号内の前記送信装置において過去のブロックのシンボルである過去シンボルが配置された位置のシンボルと過去に受信した前記ブロック信号とに基づいて復調を行う、前記時間領域の信号内の過去シンボルが配置された位置以外の位置のシンボルに基づいて復調を行う復調部と、
     を備えることを特徴とする受信装置。
    A receiving unit for receiving a block signal transmitted from the transmission device according to any one of claims 1 to 5;
    A time-frequency converter that converts the block signal into a frequency-domain signal;
    An equalization processing unit for performing an equalization process on the frequency domain signal;
    A frequency time conversion unit for converting the equalized signal into a time domain signal;
    In the time domain signal, demodulation is performed based on a symbol at a position where a past symbol which is a symbol of a past block is arranged in the time domain signal and the block signal received in the past. A demodulator that performs demodulation based on a symbol at a position other than the position where the past symbol is arranged;
    A receiving apparatus comprising:
  7.  請求項1から5のいずれか1つに記載の送信装置と、
     請求項6に記載の受信装置と、
     を備えることを特徴とする通信システム。
    A transmission device according to any one of claims 1 to 5;
    A receiving device according to claim 6;
    A communication system comprising:
PCT/JP2015/061518 2015-04-14 2015-04-14 Transmission device, reception device, and communication system WO2016166822A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2017512501A JP6214822B2 (en) 2015-04-14 2015-04-14 Transmitting apparatus, receiving apparatus, and communication system
PCT/JP2015/061518 WO2016166822A1 (en) 2015-04-14 2015-04-14 Transmission device, reception device, and communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/061518 WO2016166822A1 (en) 2015-04-14 2015-04-14 Transmission device, reception device, and communication system

Publications (1)

Publication Number Publication Date
WO2016166822A1 true WO2016166822A1 (en) 2016-10-20

Family

ID=57127223

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2015/061518 WO2016166822A1 (en) 2015-04-14 2015-04-14 Transmission device, reception device, and communication system

Country Status (2)

Country Link
JP (1) JP6214822B2 (en)
WO (1) WO2016166822A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017157945A (en) * 2016-02-29 2017-09-07 三菱電機株式会社 Transmission device, reception device and communication system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008227585A (en) * 2007-03-08 2008-09-25 Toshiba Corp Transmitter and receiver

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101136894B (en) * 2007-03-23 2012-11-28 中兴通讯股份有限公司 Extendable OFDM and ofdma bandwidth distributing method and system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008227585A (en) * 2007-03-08 2008-09-25 Toshiba Corp Transmitter and receiver

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
FUMIHIRO HASEGAWA ET AL.: "Phase-Anchored SC-OFDM", WIRELESS COMMUNICATIONS LETTERS, vol. 3, no. Issue: 1, 21 February 2014 (2014-02-21), XP011540671 *
YONG JIANG ET AL.: "A New Out-Of-Band Power Suppression Scheme by Extending Effective Cyclic-Prefix of OFDM", VEHICULAR TECHNOLOGY CONFERENCE (VTC 2010-SPRING, 19 May 2010 (2010-05-19) *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017157945A (en) * 2016-02-29 2017-09-07 三菱電機株式会社 Transmission device, reception device and communication system

Also Published As

Publication number Publication date
JP6214822B2 (en) 2017-10-18
JPWO2016166822A1 (en) 2017-07-13

Similar Documents

Publication Publication Date Title
JP6657277B2 (en) Transmission device
US9866419B2 (en) Transmission apparatus, reception apparatus, and communication system
JP6026006B2 (en) Transmitting apparatus, receiving apparatus, and communication system
JP6025987B2 (en) Transmitting apparatus, receiving apparatus, and communication system
JP6214816B2 (en) Receiver
JPWO2017183631A1 (en) LOS-MIMO demodulation apparatus, communication apparatus, LOS-MIMO transmission system, LOS-MIMO demodulation method and program
JP5198212B2 (en) Multi-carrier modulation signal receiver
JP6266169B2 (en) Transmitting apparatus, receiving apparatus, and communication system
JP6214822B2 (en) Transmitting apparatus, receiving apparatus, and communication system
JP6779226B2 (en) Transmitter, communication device, transmission signal generation method, receiver and demodulation method
JP6165347B2 (en) Transmission device, transmission method, reception device, and reception method
JP6486570B2 (en) Reception device, communication device, and demodulation method
JP6491439B2 (en) Receiving apparatus and program
JP6400033B2 (en) Transmitting apparatus, receiving apparatus, and communication system
JP5878803B2 (en) Multi-carrier modulation signal receiver
JP2013026695A (en) Multi-carrier modulation signal reception device
JP2017157947A (en) Transmission device, reception device and communication system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15889160

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017512501

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15889160

Country of ref document: EP

Kind code of ref document: A1