# Patent

## Title
Signal generation method and signal generation device

## Abstract

A transmission method simultaneously transmitting a first modulated signal and a second modulated signal at a common frequency performs precoding on both signals using a fixed precoding matrix and regularly changes the phase of at least one of the signals, thereby improving received data signal quality for a reception device.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is based on application No. 2010-276447 filed Dec. 10, 2010 in Japan, the contents of which are hereby incorporated by reference.
TECHNICAL FIELD
The present invention relates to a signal generation method and a signal generation apparatus for communication using multiple antennas.
BACKGROUND ART
A MIMO (Multiple-Input, Multiple-Output) system is an example of a conventional communication system using multiple antennas. In multi-antenna communication, of which the MIMO system is typical, multiple transmission signals are each modulated, and each modulated signal is simultaneously transmitted from a different antenna in order to increase the transmission speed of the data.
FIG. 23 illustrates a sample configuration of a transmission and reception device having two transmit antennas and two receive antennas, and using two transmit modulated signals (transmit streams). In the transmission device, encoded data are interleaved, the interleaved data are modulated, and frequency conversion and the like are performed to generate transmission signals, which are then transmitted from antennas. In this case, the scheme for simultaneously transmitting different modulated signals from different transmit antennas at the same time and on a common frequency is a spatial multiplexing MIMO system.
In this context, Patent Literature 1 suggests using a transmission device provided with a different interleaving pattern for each transmit antenna. That is, the transmission device from FIG. 23 should use two distinct interleaving patterns performed by two interleavers (πa and πb). As for the reception device, Non-Patent Literature 1 and Non-Patent Literature 2 describe improving reception quality by iteratively using soft values for the detection scheme (by the MIMO detector of FIG. 23).
As it happens, models of actual propagation environments in wireless communications include NLOS (Non Line-Of-Sight), typified by a Rayleigh fading environment is representative, and LOS (Line-Of-Sight), typified by a Rician fading environment. When the transmission device transmits a single modulated signal, and the reception device performs maximal ratio combination on the signals received by a plurality of antennas and then demodulates and decodes the resulting signals, excellent reception quality can be achieved in a LOS environment, in particular in an environment where the Rician factor is large. The Rician factor represents the received power of direct waves relative to the received power of scattered waves. However, depending on the transmission system (e.g., a spatial multiplexing MIMO system), a problem occurs in that the reception quality deteriorates as the Rician factor increases (see Non-Patent Literature 3).
FIGS. 24A and 24B illustrate an example of simulation results of the BER (Bit Error Rate) characteristics (vertical axis: BER, horizontal axis: SNR (signal-to-noise ratio) for data encoded with LDPC (low-density parity-check) codes and transmitted over a 2×2 (two transmit antennas, two receive antennas) spatial multiplexing MIMO system in a Rayleigh fading environment and in a Rician fading environment with Rician factors of K=3, 10, and 16 dB. FIG. 24A gives the Max-Log approximation-based log-likelihood ratio (Max-log APP) BER characteristics without iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2), while FIG. 24B gives the Max-log APP BER characteristic with iterative detection (see Non-Patent Literature 1 and Non-Patent Literature 2) (number of iterations: five). FIGS. 24A and 24B clearly indicate that, regardless of whether or not iterative detection is performed, reception quality degrades in the spatial multiplexing MIMO system as the Rician factor increases. Thus, the problem of reception quality degradation upon stabilization of the propagation environment in the spatial multiplexing MIMO system, which does not occur in a conventional single-modulation signal system, is unique to the spatial multiplexing MIMO system.
Broadcast or multicast communication is a service applied to various propagation environments. The radio wave propagation environment between the broadcaster and the receivers belonging to the users is often a LOS environment. When using a spatial multiplexing MIMO system having the above problem for broadcast or multicast communication, a situation may occur in which the received electric field strength is high at the reception device, but in which degradation in reception quality makes service reception difficult. In other words, in order to use a spatial multiplexing MIMO system in broadcast or multicast communication in both the NLOS environment and the LOS environment, a MIMO system that offers a certain degree of reception quality is desirable.
Non-Patent Literature 8 describes a scheme for selecting a codebook used in precoding (i.e. a precoding matrix, also referred to as a precoding weight matrix) based on feedback information from a communication party. However, Non-Patent Literature 8 does not at all disclose a scheme for precoding in an environment in which feedback information cannot be acquired from the other party, such as in the above broadcast or multicast communication.
On the other hand, Non-Patent Literature 4 discloses a scheme for switching the precoding matrix over time. This scheme is applicable when no feedback information is available. Non-Patent Literature 4 discloses using a unitary matrix as the precoding matrix, and switching the unitary matrix at random, but does not at all disclose a scheme applicable to degradation of reception quality in the above-described LOS environment. Non-Patent Literature 4 simply recites hopping between precoding matrices at random. Obviously, Non-Patent Literature 4 makes no mention whatsoever of a precoding method, or a structure of a precoding matrix, for remedying degradation of reception quality in a LOS environment.
CITATION LIST
Patent Literature
[Patent Literature 1]


    International Patent Application Publication No. WO2005/050885


Non-Patent Literature
[Non-Patent Literature 1]


    “Achieving near-capacity on a multiple-antenna channel” IEEE Transaction on communications, vol. 51, no. 3, pp. 389-399, March 2003

[Non-Patent Literature 2]

    “Performance analysis and design optimization of LDPC-coded MIMO OFDM systems” IEEE Trans. Signal Processing, vol. 52, no. 2, pp. 348-361, February 2004

[Non-Patent Literature 3]

    “BER performance evaluation in 2×2 MIMO spatial multiplexing systems under Rician fading channels” IEICE Trans. Fundamentals, vol. E91-A, no. 10, pp. 2798-2807, October 2008

[Non-Patent Literature 4]

    “Turbo space-time codes with time varying linear transformations” IEEE Trans. Wireless communications, vol. 6, no. 2, pp. 486-493, February 2007

[Non-Patent Literature 5]

    “Likelihood function for QR-MLD suitable for soft-decision turbo decoding and its performance” IEICE Trans. Commun., vol. E88-B, no. 1, pp. 47-57, January 2004

[Non-Patent Literature 6]

    “A tutorial on ‘Parallel concatenated (Turbo) coding’, ‘Turbo (iterative) decoding’ and related topics” IEICE, Technical Report IT98-51

[Non-Patent Literature 7]

    “Advanced signal processing for PLCs: Wavelet-OFDM” Proc. of IEEE International symposium on ISPLC 2008, pp. 187-192, 2008

[Non-Patent Literature 8]

    D. J. Love and R. W. Heath Jr., “Limited feedback unitary precoding for spatial multiplexing systems” IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2967-2976, August 2005

[Non-Patent Literature 9]

    DVB Document A122, Framing structure, channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2), June 2008

[Non-Patent Literature 10]

    L. Vangelista, N. Benvenuto, and S. Tomasin “Key technologies for next-generation terrestrial digital television standard DVB-T2,” IEEE Commun. Magazine, vol. 47, no. 10, pp. 146-153, October 2009

[Non-Patent Literature 11]

    T. Ohgane, T. Nishimura, and Y. Ogawa, “Application of space division multiplexing and those performance in a MIMO channel” IEICE Trans. Commun., vol. E88-B, no. 5, pp. 1843-1851, May 2005

[Non-Patent Literature 12]

    R. G. Gallager “Low-density parity-check codes,” IRE Trans. Inform. Theory, IT-8, pp. 21-28, 1962

[Non-Patent Literature 13]

    D. J. C. Mackay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, March 1999.

[Non-Patent Literature 14]

    ETSI EN 302 307, “Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications” v.1.1.2, June 2006

[Non-Patent Literature 15]

    Y.-L. Ueng, and C.-C. Cheng “A fast-convergence decoding method and memory-efficient VLSI decoder architecture for irregular LDPC codes in the IEEE 802.16e standards” IEEE VTC-2007 Fall, pp. 1255-1259

[Non-Patent Literature 16]

    S. M. Alamouti “A simple transmit diversity technique for wireless communications” IEEE J. Select. Areas Commun., vol. 16, no. 8, pp. 1451-1458, October 1998

[Non-Patent Literature 17]

    V. Tarokh, H. Jafrkhani, and A. R. Calderbank “Space-time block coding for wireless communications: Performance results” IEEE J. Select. Areas Commun., vol. 17, no. 3, no. 3, pp. 451-460, March 1999


SUMMARY OF INVENTION
Technical Problem
An object of the present invention is to provide a MIMO system that improves reception quality in a LOS environment.
Solution to Problem
The present invention provides a signal generation scheme for generating, from a plurality of baseband signals, a plurality of signals for transmission on a common frequency band and at a common time, comprising the steps of: performing a change of phase on each of a first baseband signal s1 generated from a first set of bits and a second baseband signal s2 generated from a second set of bits, thus generating a first post-phase change baseband signal s1′ and a second post-phase change baseband signal s2′; and applying weighting to the first post-phase change baseband signal s1′ and to the second post-phase change baseband signal s2′ according to a predetermined matrix F, thus generating a first weighted signal z1 and a second weighted signal z2 as the plurality of signals for transmission on the common frequency band and at the common time, wherein the first weighted signal z1 and the second weighted signal z2 satisfy the relation: (z1, z2)T=F(s1′, s2′)T and the change of phase is performed on the first baseband signal s1 and the second baseband signal s2 using a phase modification value sequentially selected from among N phase modification value candidates, N being an integer equal to or greater than two and each of the N phase modification value candidates being selected at least once within a predetermined period.
Also, the present invention provides a signal generation apparatus for generating, from a plurality of baseband signals, a plurality of signals for transmission on a common frequency band and at a common time, comprising: a phase changer performing a change of phase on each of a first baseband signal s1 generated from a first set of bits and a second baseband signal s2 generated from a second set of bits, thus generating a first post-phase change baseband signal s1′ and a second post-phase change baseband signal s2′; and a weighting unit applying weighting to the first post-phase change baseband signal s1′ and to the second post-phase change baseband signal s2′ according to a predetermined matrix F, thus generating a first weighted signal z1 and a second weighted signal z2 as the plurality of signals for transmission on the common frequency band and at the common time, wherein the first weighted signal z1 and the second weighted signal z2 satisfy the relation: (z1, z2)T=F(s1′, s2′)T and the change of phase is performed on the first baseband signal s1 and the second baseband signal s2 using a phase modification value sequentially selected from among N phase modification value candidates, N being an integer equal to or greater than two and each of the N phase modification value candidates being selected at least once within a predetermined period.
Advantageous Effects of Invention
According to the above structure, the present invention provides a signal generation scheme and signal generation apparatus that remedy degradation of reception quality in a LOS environment, thereby providing high-quality service to LOS users during broadcast or multicast communication.



BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 illustrates an example of a transmission and reception device in a spatial multiplexing MIMO system.
FIG. 2 illustrates a sample frame configuration.
FIG. 3 illustrates an example of a transmission device applying a phase changing scheme.
FIG. 4 illustrates another example of a transmission device applying a phase changing scheme.
FIG. 5 illustrates another sample frame configuration.
FIG. 6 illustrates a sample phase changing scheme.
FIG. 7 illustrates a sample configuration of a reception device.
FIG. 8 illustrates a sample configuration of a signal processor in the reception device.
FIG. 9 illustrates another sample configuration of a signal processor in the reception device.
FIG. 10 illustrates an iterative decoding scheme.
FIG. 11 illustrates sample reception conditions.
FIG. 12 illustrates a further example of a transmission device applying a phase changing scheme.
FIG. 13 illustrates yet a further example of a transmission device applying a phase changing scheme.
FIG. 14 illustrates a further sample frame configuration.
FIG. 15 illustrates yet another sample frame configuration.
FIG. 16 illustrates still another sample frame configuration.
FIG. 17 illustrates still yet another sample frame configuration.
FIG. 18 illustrates yet a further sample frame configuration.
FIGS. 19A and 19B illustrate examples of a mapping scheme.
FIGS. 20A and 20B illustrate further examples of a mapping scheme.
FIG. 21 illustrates a sample configuration of a weighting unit.
FIG. 22 illustrates a sample symbol rearrangement scheme.
FIG. 23 illustrates another example of a transmission and reception device in a spatial multiplexing MIMO system.
FIGS. 24A and 24B illustrate sample BER characteristics.
FIG. 25 illustrates another sample phase changing scheme.
FIG. 26 illustrates yet another sample phase changing scheme.
FIG. 27 illustrates a further sample phase changing scheme.
FIG. 28 illustrates still a further sample phase changing scheme.
FIG. 29 illustrates still yet a further sample phase changing scheme.
FIG. 30 illustrates a sample symbol arrangement for a modulated signal providing high received signal quality.
FIG. 31 illustrates a sample frame configuration for a modulated signal providing high received signal quality.
FIG. 32 illustrates another sample symbol arrangement for a modulated signal providing high received signal quality.
FIG. 33 illustrates yet another sample symbol arrangement for a modulated signal providing high received signal quality.
FIG. 34 illustrates variation in numbers of symbols and slots needed per coded block when block codes are used.
FIG. 35 illustrates variation in numbers of symbols and slots needed per pair of coded blocks when block codes are used.
FIG. 36 illustrates an overall configuration of a digital broadcasting system.
FIG. 37 is a block diagram illustrating a sample receiver.
FIG. 38 illustrates multiplexed data configuration.
FIG. 39 is a schematic diagram illustrating multiplexing of encoded data into streams.
FIG. 40 is a detailed diagram illustrating a video stream as contained in a PES packet sequence.
FIG. 41 is a structural diagram of TS packets and source packets in the multiplexed data.
FIG. 42 illustrates PMT data configuration.
FIG. 43 illustrates information as configured in the multiplexed data.
FIG. 44 illustrates the configuration of stream attribute information.
FIG. 45 illustrates the configuration of a video display and audio output device.
FIG. 46 illustrates a sample configuration of a communications system.
FIGS. 47A and 47B illustrate a variant sample symbol arrangement for a modulated signal providing high received signal quality.
FIGS. 48A and 48B illustrate another variant sample symbol arrangement for a modulated signal providing high received signal quality.
FIGS. 49A and 49B illustrate yet another variant sample symbol arrangement for a modulated signal providing high received signal quality.
FIGS. 50A and 50B illustrate a further variant sample symbol arrangement for a modulated signal providing high received signal quality.
FIG. 51 illustrates a sample configuration of a transmission device.
FIG. 52 illustrates another sample configuration of a transmission device.
FIG. 53 illustrates a further sample configuration of a transmission device.
FIG. 54 illustrates yet a further sample configuration of a transmission device.
FIG. 55 illustrates a baseband signal switcher.



DESCRIPTION OF EMBODIMENTS
Embodiments of the present invention are described below with reference to the accompanying drawings.
Embodiment 1
The following describes, in detail, a transmission scheme, a transmission device, a reception scheme, and a reception device pertaining to the present Embodiment.
Before beginning the description proper, an outline of transmission schemes and decoding schemes in a conventional spatial multiplexing MIMO system is provided. FIG. 1 illustrates the structure of an Nt×Nr spatial multiplexing MIMO system. An information vector z is encoded and interleaved. The encoded bit vector u=(u1, . . . uNt) is obtained as the interleave output. Here, ui=(ui1, . . . uiM) (where M is the number of transmitted bits per symbol). For a transmit vector s=(s1, . . . SNt), a received signal si=map(ui) is found for transmit antenna #i. Normalizing the transmit energy, this is expressible as E{|si|2}=Es/Nt (where Es is the total energy per channel). The receive vector y=(y1, . . . yNr)T is expressed in Math. 1 (formula 1), below.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          1
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          
            
              y
              =
              
              ⁢
              
                
                  (
                  
                    
                      y
                      1
                    
                    ,
                    ...
                    ⁢
                    
                      
                    
                    ,
                    
                      y
                      Nr
                    
                  
                  )
                
                T
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    H
                    NtNr
                  
                  ⁢
                  s
                
                +
                n
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          1
        
        )
      
    
  




Here, HNtNr is the channel matrix, n=(n1, . . . nNr) is the noise vector, and the average value of ni is zero for independent and identically distributed (i.i.d) complex Gaussian noise of variance σ2. Based on the relationship between transmitted symbols introduced into a receiver and the received symbols, the probability distribution of the received vectors can be expressed as Math. 2 (formula 2), below, for a multi-dimensional Gaussian distribution.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          2
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          p
          ⁡
          
            (
            
              y
              |
              u
            
            )
          
        
        =
        
          
            1
            
              
                (
                
                  2
                  ⁢
                  
                    πσ
                    2
                  
                
                )
              
              
                N
                r
              
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                
                  -
                  
                    1
                    
                      2
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                
                ⁢
                
                  
                    
                    
                      y
                      -
                      
                        Hs
                        ⁡
                        
                          (
                          u
                          )
                        
                      
                    
                    
                  
                  2
                
              
              )
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          2
        
        )
      
    
  




Here, a receiver performing iterative decoding is considered. Such a receiver is illustrated in FIG. 1 as being made up of an outer soft-in/soft-out decoder and a MIMO detector. The log-likelihood ratio vector (L-value) for FIG. 1 is given by Math. 3 (formula 3) through Math. 5 (formula 5), as follows.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          3
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            u
            )
          
        
        =
        
          
            (
            
              
                L
                ⁡
                
                  (
                  
                    u
                    1
                  
                  )
                
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                L
                ⁡
                
                  (
                  
                    u
                    
                      N
                      t
                    
                  
                  )
                
              
            
            )
          
          T
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          3
        
        )
      
    
  
  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          4
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              u
              i
            
            )
          
        
        =
        
          (
          
            
              L
              ⁡
              
                (
                
                  u
                  
                    i
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                )
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              L
              ⁡
              
                (
                
                  u
                  iM
                
                )
              
            
          
          )
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          4
        
        )
      
    
  
  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          5
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              u
              ij
            
            )
          
        
        =
        
          ln
          ⁢
          
            
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  
                    u
                    ij
                  
                  =
                  
                    +
                    1
                  
                
                )
              
            
            
              P
              ⁡
              
                (
                
                  
                    u
                    ij
                  
                  =
                  
                    -
                    1
                  
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          5
        
        )
      
    
  




(Iterative Detection Scheme)

The following describes the MIMO signal iterative detection performed by the Nt×Nr spatial multiplexing MIMO system.
The log-likelihood ratio of umn is defined by Math. 6 (formula 6).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          6
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              
                u
                mn
              
              |
              y
            
            )
          
        
        =
        
          ln
          ⁢
          
            
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  
                    u
                    mn
                  
                  =
                  
                    
                      +
                      1
                    
                    |
                    y
                  
                
                )
              
            
            
              P
              ⁡
              
                (
                
                  
                    u
                    mn
                  
                  =
                  
                    
                      -
                      1
                    
                    |
                    y
                  
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          6
        
        )
      
    
  




Through application of Bayes' theorem, Math. 6 (formula 6) can be expressed as Math. 7 (formula 7).




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            7
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
            
              
                L
                ⁡
                
                  (
                  
                    
                      u
                      mn
                    
                    |
                    y
                  
                  )
                
              
              =
              
              ⁢
              
                ln
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            |
                            
                              u
                              mn
                            
                          
                          =
                          
                            +
                            1
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        P
                        ⁡
                        
                          (
                          
                            
                              u
                              mn
                            
                            =
                            
                              +
                              1
                            
                          
                          )
                        
                      
                      /
                      
                        p
                        ⁡
                        
                          (
                          y
                          )
                        
                      
                    
                  
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            |
                            
                              u
                              mn
                            
                          
                          =
                          
                            -
                            1
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        P
                        ⁡
                        
                          (
                          
                            
                              u
                              mn
                            
                            =
                            
                              -
                              1
                            
                          
                          )
                        
                      
                      /
                      
                        p
                        ⁡
                        
                          (
                          y
                          )
                        
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ln
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            u
                            mn
                          
                          =
                          
                            +
                            1
                          
                        
                        )
                      
                    
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            u
                            mn
                          
                          =
                          
                            -
                            1
                          
                        
                        )
                      
                    
                  
                
                +
                
                  ln
                  ⁢
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            |
                            
                              u
                              mn
                            
                          
                          =
                          
                            +
                            1
                          
                        
                        )
                      
                    
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            |
                            
                              u
                              mn
                            
                          
                          =
                          
                            -
                            1
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ln
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            u
                            mn
                          
                          =
                          
                            +
                            1
                          
                        
                        )
                      
                    
                    
                      P
                      ⁡
                      
                        (
                        
                          
                            u
                            mn
                          
                          =
                          
                            -
                            1
                          
                        
                        )
                      
                    
                  
                
                +
                
                  ln
                  ⁢
                  
                    
                      
                        ∑
                        
                          U
                          
                            mn
                            ,
                            
                              +
                              1
                            
                          
                        
                        
                          
                        
                      
                      ⁢
                      
                        
                          p
                          ⁡
                          
                            (
                            
                              y
                              |
                              u
                            
                            )
                          
                        
                        ⁢
                        
                          p
                          ⁡
                          
                            (
                            
                              u
                              |
                              
                                u
                                mn
                              
                            
                            )
                          
                        
                      
                    
                    
                      
                        ∑
                        
                          U
                          
                            mn
                            ,
                            
                              -
                              1
                            
                          
                        
                        
                          
                        
                      
                      ⁢
                      
                        
                          p
                          ⁡
                          
                            (
                            
                              y
                              |
                              u
                            
                            )
                          
                        
                        ⁢
                        
                          p
                          ⁡
                          
                            (
                            
                              u
                              |
                              
                                u
                                mn
                              
                            
                            )
                          
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          7
        
        )
      
    
  




Note that Umn,±1={u|umn=±1}. Through the approximation ln Σaj ̃max ln aj, Math. 7 (formula 7) can be approximated as Math. 8 (formula 8). The symbol  ̃ is herein used to signify approximation.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            8
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              
                u
                mn
              
              |
              y
            
            )
          
        
        ≈
        
        ⁢
        
          
            ln
            ⁢
            
              
            
            ⁢
            
              
                P
                ⁡
                
                  (
                  
                    
                      u
                      mn
                    
                    =
                    
                      +
                      1
                    
                  
                  )
                
              
              
                P
                ⁡
                
                  (
                  
                    
                      u
                      mn
                    
                    =
                    
                      -
                      1
                    
                  
                  )
                
              
            
          
          +
          
            
              max
              
                Umn
                ,
                
                  +
                  1
                
              
            
            ⁢
            
              {
              
                
                  ln
                  ⁢
                  
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        y
                        |
                        u
                      
                      )
                    
                  
                
                +
                
                  P
                  ⁡
                  
                    (
                    
                      u
                      |
                      
                        u
                        mn
                      
                    
                    )
                  
                
              
              }
            
          
          -
          
            
              max
              
                Umn
                ,
                
                  -
                  1
                
              
            
            ⁢
            
              {
              
                
                  ln
                  ⁢
                  
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        y
                        |
                        u
                      
                      )
                    
                  
                
                +
                
                  P
                  ⁡
                  
                    (
                    
                      u
                      |
                      
                        u
                        mn
                      
                    
                    )
                  
                
              
              }
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          8
        
        )
      
    
  




In Math. 8 (formula 8), P(u|umn) and ln P(u|umn) can be expressed as follows.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            9
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
            
              
                
              
              ⁢
              
                
                  P
                  ⁡
                  
                    (
                    
                      u
                      |
                      
                        u
                        mn
                      
                    
                    )
                  
                
                =
                
                ⁢
                
                  
                    ∏
                    
                      
                        (
                        ij
                        )
                      
                      ≠
                      
                        (
                        mn
                        )
                      
                    
                    
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        u
                        ij
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∏
                  
                    
                      (
                      ij
                      )
                    
                    ≠
                    
                      (
                      mn
                      )
                    
                  
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    exp
                    ⁡
                    
                      (
                      
                        
                          
                            u
                            ij
                          
                          ⁢
                          
                            L
                            ⁡
                            
                              (
                              
                                u
                                ij
                              
                              )
                            
                          
                        
                        2
                      
                      )
                    
                  
                  
                    
                      exp
                      ⁡
                      
                        (
                        
                          
                            L
                            ⁡
                            
                              (
                              
                                u
                                ij
                              
                              )
                            
                          
                          2
                        
                        )
                      
                    
                    +
                    
                      exp
                      ⁡
                      
                        (
                        
                          -
                          
                            
                              L
                              ⁡
                              
                                (
                                
                                  u
                                  ij
                                
                                )
                              
                            
                            2
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          9
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            10
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            ln
            ⁢
            
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  u
                  |
                  
                    u
                    mn
                  
                
                )
              
            
          
          =
          
            
              (
              
                
                  ∑
                  ij
                  
                    
                  
                
                ⁢
                
                  ln
                  ⁢
                  
                    
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        u
                        ij
                      
                      )
                    
                  
                
              
              )
            
            -
            
              ln
              ⁢
              
                
              
              ⁢
              
                P
                ⁡
                
                  (
                  
                    u
                    mn
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          10
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            11
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
            
              
                ln
                ⁢
                
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      u
                      ij
                    
                    )
                  
                
              
              =
              
              ⁢
              
                
                  
                    1
                    2
                  
                  ⁢
                  
                    u
                    ij
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        u
                        ij
                      
                      )
                    
                  
                
                -
                
                  ln
                  ⁡
                  
                    (
                    
                      
                        exp
                        ⁡
                        
                          (
                          
                            
                              L
                              ⁡
                              
                                (
                                
                                  u
                                  ij
                                
                                )
                              
                            
                            2
                          
                          )
                        
                      
                      +
                      
                        exp
                        ⁡
                        
                          (
                          
                            -
                            
                              
                                L
                                ⁡
                                
                                  (
                                  
                                    u
                                    ij
                                  
                                  )
                                
                              
                              2
                            
                          
                          )
                        
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              ≈
              
              ⁢
              
                
                  
                    1
                    2
                  
                  ⁢
                  
                    u
                    ij
                  
                  ⁢
                  
                    L
                    ⁡
                    
                      (
                      
                        u
                        ij
                      
                      )
                    
                  
                
                -
                
                  
                    1
                    2
                  
                  ⁢
                  
                    
                    
                      L
                      ⁡
                      
                        (
                        
                          u
                          ij
                        
                        )
                      
                    
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                    
                      L
                      ⁡
                      
                        (
                        
                          u
                          ij
                        
                        )
                      
                    
                    
                  
                
              
              >
              2
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                  
                    
                      L
                      ⁡
                      
                        (
                        
                          u
                          ij
                        
                        )
                      
                    
                    2
                  
                  
                
                ⁢
                
                  (
                  
                    
                      
                        u
                        ij
                      
                      ⁢
                      
                        sign
                        ⁡
                        
                          (
                          
                            L
                            ⁡
                            
                              (
                              
                                u
                                ij
                              
                              )
                            
                          
                          )
                        
                      
                    
                    -
                    1
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          11
        
        )
      
    
  




Note that the log-probability of the equation given in Math. 2 (formula 2) can be expressed as Math. 12 (formula 12).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          12
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          ln
          ⁢
          
            
          
          ⁢
          
            P
            ⁡
            
              (
              
                y
                |
                u
              
              )
            
          
        
        =
        
          
            
              -
              
                
                  N
                  r
                
                2
              
            
            ⁢
            
              ln
              ⁡
              
                (
                
                  2
                  ⁢
                  
                    πσ
                    2
                  
                
                )
              
            
          
          -
          
            
              1
              
                2
                ⁢
                
                  σ
                  2
                
              
            
            ⁢
            
              
                
                
                  y
                  -
                  
                    Hs
                    ⁡
                    
                      (
                      u
                      )
                    
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          12
        
        )
      
    
  




Accordingly, given Math. 7 (formula 7) and Math. 13 (formula 13), the posterior L-value for the MAP or APP (a posteriori probability) can be can be expressed as follows.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            13
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              
                u
                mn
              
              |
              y
            
            )
          
        
        =
        
          ln
          ⁢
          
            
              
                ∑
                
                  U
                  
                    mn
                    ,
                    
                      +
                      1
                    
                  
                
                
                  
                
              
              ⁢
              
                exp
                ⁢
                
                  {
                  
                    
                      
                        -
                        
                          1
                          
                            2
                            ⁢
                            
                              σ
                              2
                            
                          
                        
                      
                      ⁢
                      
                        
                          
                          
                            y
                            -
                            
                              Hs
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                          
                          
                        
                        2
                      
                    
                    +
                    
                      
                        ∑
                        ij
                        
                          
                        
                      
                      ⁢
                      
                        ln
                        ⁢
                        
                          
                        
                        ⁢
                        
                          P
                          ⁡
                          
                            (
                            
                              u
                              ij
                            
                            )
                          
                        
                      
                    
                  
                  }
                
              
            
            
              
                ∑
                
                  U
                  
                    mn
                    ,
                    
                      -
                      1
                    
                  
                
                
                  
                
              
              ⁢
              
                exp
                ⁢
                
                  {
                  
                    
                      
                        -
                        
                          1
                          
                            2
                            ⁢
                            
                              σ
                              2
                            
                          
                        
                      
                      ⁢
                      
                        
                          
                          
                            y
                            -
                            
                              Hs
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                          
                          
                        
                        2
                      
                    
                    +
                    
                      
                        ∑
                        ij
                        
                          
                        
                      
                      ⁢
                      
                        ln
                        ⁢
                        
                          
                        
                        ⁢
                        
                          P
                          ⁡
                          
                            (
                            
                              u
                              ij
                            
                            )
                          
                        
                      
                    
                  
                  }
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          13
        
        )
      
    
  




This is hereinafter termed iterative APP decoding. Also, given Math. 8 (formula 8) and Math. 12 (formula 12), the posterior L-value for the Max-log APP can be can be expressed as follows.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            14
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          L
          ⁡
          
            (
            
              
                u
                mn
              
              |
              y
            
            )
          
        
        ≈
        
          
            
              max
              
                Umn
                ,
                
                  +
                  1
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    u
                    ,
                    y
                    ,
                    
                      L
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                  )
                
              
              }
            
          
          -
          
            
              max
              
                Umn
                ,
                
                  -
                  1
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    u
                    ,
                    y
                    ,
                    
                      L
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                  )
                
              
              }
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          14
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            15
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            Ψ
            ⁡
            
              (
              
                u
                ,
                y
                ,
                
                  L
                  ⁡
                  
                    (
                    u
                    )
                  
                
              
              )
            
          
          =
          
            
              
                -
                
                  1
                  
                    2
                    ⁢
                    
                      σ
                      2
                    
                  
                
              
              ⁢
              
                
                  
                  
                    y
                    -
                    
                      Hs
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                  
                
                2
              
            
            +
            
              
                ∑
                ij
                
                  
                
              
              ⁢
              
                ln
                ⁢
                
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      u
                      ij
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          15
        
        )
      
    
  




This is hereinafter referred to as iterative Max-log APP decoding. As such, the external information required by the iterative decoding system is obtainable by subtracting prior input from Math. 13 (formula 13) or from Math. 14 (formula 14).
(System Model)
FIG. 23 illustrates the basic configuration of a system related to the following explanations. The illustrated system is a 2×2 spatial multiplexing MIMO system having an outer decoder for each of two streams A and B. The two outer decoders perform identical LDPC encoding (Although the present example considers a configuration in which the outer encoders use LDPC codes, the outer encoders are not restricted to the use of LDPC as the error-correcting codes. The example may also be realized using other error-correcting codes, such as turbo codes, convolutional codes, or LDPC convolutional codes. Further, while the outer encoders are presently described as individually configured for each transmit antenna, no limitation is intended in this regard. A single outer encoder may be used for a plurality of transmit antennas, or the number of outer encoders may be greater than the number of transmit antennas. The system also has interleavers (πa, πb) for each of the streams A and B. Here, the modulation scheme is 2h-QAM (i.e., h bits transmitted per symbol).
The receiver performs iterative detection (iterative APP (or Max-log APP) decoding) of MIMO signals, as described above. The LDPC codes are decoded using, for example, sum-product decoding.
FIG. 2 illustrates the frame configuration and describes the symbol order after interleaving. Here, (ia,ja) and (ib,jb) can be expressed as follows.

[Math. 16]

(ia,ja)=πa(Ωia,jaa)  (formula 16)

[Math. 17]

(ib,jb)=πb(Ωib,jba)  (formula 17)

Here, ia and ib represent the symbol order after interleaving, ja and jb represent the bit position in the modulation scheme (where ja,jb=1, . . . h), πa and πb represent the interleavers of streams A and B, and Ωaia,ja and Ωbib,jb represent the data order of streams A and B before interleaving. Note that FIG. 2 illustrates a situation where ia=ib.
(Iterative Decoding)
The following describes, in detail, the sum-product decoding used in decoding the LDPC codes and the MIMO signal iterative detection algorithm, both used by the receiver.
Sum-Product Decoding
A two-dimensional M×N matrix H={Hmn} is used as the check matrix for LDPC codes subject to decoding. For the set [1,N]={1, 2 . . . N}, the partial sets A(m) and B(n) are defined as follows.

[Math. 18]

A(m)≡{n:Hmn=1}  (formula 18)

[Math. 19]

B(n)≡{m:Hmn=1}  (formula 19)

Here, A(m) signifies the set of column indices equal to 1 for row m of check matrix H, while B(n) signifies the set of row indices equal to 1 for row n of check matrix H. The sum-product decoding algorithm is as follows.
Step A-1 (Initialization): For all pairs (m,n) satisfying Hmn=1, set the prior log ratio βmn=1. Set the loop variable (number of iterations) lsum=1, and set the maximum number of loops lsum,max.
Step A-2 (Processing): For all pairs (m,n) satisfying Hmn=1 in the order m=1, 2, . . . M, update the extrinsic value log ratio αmn using the following update formula.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            20
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          α
          mn
        
        =
        
          
            (
            
              
                ∏
                
                  
                    n
                    ′
                  
                  ∈
                  
                    
                      A
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ∖
                    n
                  
                
                
                  
                
              
              ⁢
              
                
              
              ⁢
              
                sign
                ⁡
                
                  (
                  
                    
                      λ
                      
                        n
                        ′
                      
                    
                    +
                    
                      β
                      
                        mn
                        ′
                      
                    
                  
                  )
                
              
            
            )
          
          ×
          
            f
            (
            
              
                ∑
                
                  
                    n
                    ′
                  
                  ∈
                  
                    
                      A
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ∖
                    n
                  
                
                
                  
                
              
              ⁢
              
                f
                ⁡
                
                  (
                  
                    
                      λ
                      
                        n
                        ′
                      
                    
                    +
                    
                      β
                      
                        mn
                        ′
                      
                    
                  
                  )
                
              
            
            )
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          20
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            21
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            sign
            ⁡
            
              (
              x
              )
            
          
          ≡
          
            {
            
              
                
                  1
                
                
                  
                    x
                    ≥
                    0
                  
                
              
              
                
                  
                    -
                    1
                  
                
                
                  
                    x
                    <
                    0
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          21
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            22
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            f
            ⁡
            
              (
              x
              )
            
          
          ≡
          
            ln
            ⁢
            
              
            
            ⁢
            
              
                
                  exp
                  ⁢
                  
                    (
                    x
                    )
                  
                
                +
                1
              
              
                
                  exp
                  ⁡
                  
                    (
                    x
                    )
                  
                
                -
                1
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          22
        
        )
      
    
  




where ƒ is the Gallager function. λn can then be computed as follows.
Step A-3 (Column Operations): For all pairs (m,n) satisfying Hmn=1 in the order n=1, 2, . . . N, update the extrinsic value log ratio βmn using the following update formula.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          23
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          β
          mn
        
        =
        
          
            ∑
            
              
                m
                ′
              
              ∈
              
                
                  B
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ∖
                m
              
            
            
              
            
          
          ⁢
          
            α
            
              
                m
                ′
              
              ⁢
              n
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          23
        
        )
      
    
  




Step A-4 (Log-likelihood Ratio Calculation): For nε[1,N], the log-likelihood ratio Ln is computed as follows.





  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          24
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          L
          n
        
        =
        
          
            
              ∑
              
                
                  m
                  ′
                
                ∈
                
                  
                    B
                    ⁡
                    
                      (
                      n
                      )
                    
                  
                  ∖
                  m
                
              
              
                
              
            
            ⁢
            
              α
              
                
                  m
                  ′
                
                ⁢
                n
              
            
          
          +
          
            λ
            n
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          24
        
        )
      
    
  




Step A-5 (Iteration Count): If lsum<lsum,max, then lsum is incremented and the process returns to step A-2. Sum-product decoding ends when lsum=lsum,max.

The above describes one iteration of sum-product decoding operations. Afterward, MIMO signal iterative detection is performed. The variables m, n, αmn, βmn, λn, and Ln used in the above explanation of sum-product decoding operations are expressed as ma, na, αamana, βamana, λna, and Lna for stream A and as mb, nb, αbmbnb, βbmbnb, λnb, and Lnb for stream B.
(MIMO Signal Iterative Detection)
The following describes the calculation of λn for MIMO signal iterative detection.
The following formula is derivable from Math. 1 (formula 1).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          25
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          
            
              
                y
                ⁡
                
                  (
                  t
                  )
                
              
              =
              
              ⁢
              
                
                  (
                  
                    
                      
                        y
                        1
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    ,
                    
                      
                        y
                        2
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                  )
                
                T
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    
                      H
                      22
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  ⁢
                  
                    s
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
                +
                
                  n
                  ⁡
                  
                    (
                    t
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          25
        
        )
      
    
  




Given the frame configuration illustrated in FIG. 2, the following functions are derivable from Math. 16 (formula 16) and Math. 17 (formula 17).

[Math. 26]

na=Ωia,jaa  (formula 26)

[Math. 27]

nb=Ωib,jbb  (formula 27)

where na,nbε[1,N]. For iteration k of MIMO signal iterative detection, the variables λna, Lna, λnb, and Lnb are expressed as λk,na, Lk,na, λκ,nb, and Lk,nb.
Step B-1 (Initial Detection; k=0)
For initial wave detection, λ0,na and λ0,nb are calculated as follows.
For iterative APP decoding:




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            28
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          λ
          
            0
            ⁢
            
              ,
              
                n
                X
              
            
          
        
        =
        
          ln
          ⁢
          
            
              
                ∑
                
                  U
                  
                    0
                    ,
                    
                      n
                      X
                    
                    ,
                    
                      +
                      1
                    
                  
                
                
                  
                
              
              ⁢
              
                exp
                ⁢
                
                  {
                  
                    
                      -
                      
                        1
                        
                          2
                          ⁢
                          
                            σ
                            2
                          
                        
                      
                    
                    ⁢
                    
                      
                        
                        
                          
                            y
                            ⁡
                            
                              (
                              
                                i
                                X
                              
                              )
                            
                          
                          -
                          
                            
                              
                                H
                                22
                              
                              ⁡
                              
                                (
                                
                                  i
                                  X
                                
                                )
                              
                            
                            ⁢
                            
                              s
                              ⁡
                              
                                (
                                
                                  u
                                  ⁡
                                  
                                    (
                                    
                                      i
                                      X
                                    
                                    )
                                  
                                
                                )
                              
                            
                          
                        
                        
                      
                      2
                    
                  
                  }
                
              
            
            
              
                ∑
                
                  U
                  
                    0
                    ,
                    
                      n
                      X
                    
                    ,
                    
                      -
                      1
                    
                  
                
                
                  
                
              
              ⁢
              
                exp
                ⁢
                
                  {
                  
                    
                      -
                      
                        1
                        
                          2
                          ⁢
                          
                            σ
                            2
                          
                        
                      
                    
                    ⁢
                    
                      
                        
                        
                          
                            y
                            ⁡
                            
                              (
                              
                                i
                                X
                              
                              )
                            
                          
                          -
                          
                            
                              
                                H
                                22
                              
                              ⁡
                              
                                (
                                
                                  i
                                  X
                                
                                )
                              
                            
                            ⁢
                            
                              s
                              ⁡
                              
                                (
                                
                                  u
                                  ⁡
                                  
                                    (
                                    
                                      i
                                      X
                                    
                                    )
                                  
                                
                                )
                              
                            
                          
                        
                        
                      
                      2
                    
                  
                  }
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          28
        
        )
      
    
  




For iterative Max-log APP decoding:





  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            29
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          λ
          
            0
            ⁢
            
              ,
              
                n
                X
              
            
          
        
        =
        
          
            
              max
              
                U
                
                  0
                  ,
                  
                    n
                    X
                  
                  ,
                  
                    +
                    1
                  
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    
                      u
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ,
                    
                      y
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                  
                  )
                
              
              }
            
          
          -
          
            
              max
              
                U
                
                  0
                  ,
                  
                    n
                    X
                  
                  ,
                  
                    -
                    1
                  
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    
                      u
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ,
                    
                      y
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                  
                  )
                
              
              }
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          29
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            30
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            Ψ
            ⁡
            
              (
              
                
                  u
                  ⁡
                  
                    (
                    
                      i
                      X
                    
                    )
                  
                
                ,
                
                  y
                  ⁡
                  
                    (
                    
                      i
                      X
                    
                    )
                  
                
              
              )
            
          
          =
          
            
              -
              
                1
                
                  2
                  ⁢
                  
                    σ
                    2
                  
                
              
            
            ⁢
            
              
                
                
                  
                    y
                    ⁡
                    
                      (
                      
                        i
                        X
                      
                      )
                    
                  
                  -
                  
                    
                      
                        H
                        22
                      
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ⁢
                    
                      s
                      ⁡
                      
                        (
                        
                          u
                          ⁡
                          
                            (
                            
                              i
                              X
                            
                            )
                          
                        
                        )
                      
                    
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          30
        
        )
      
    
  




where X=a,b. Next, the iteration count for the MIMO signal iterative detection is set to lmimo=0, with the maximum iteration count being lmimo,max.
Step B-2 (Iterative Detection; Iteration k): When the iteration count is k, Math. 11 (formula 11), Math. 13 (formula 13) through Math. 15 (formula 15), Math. 16 (formula 16), and Math. 17 (formula 17) can be expressed as Math. 31 (formula 31) through Math. 34 (formula 34), below. Note that (X,Y)=(a,b)(b,a).

For iterative APP decoding:





  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          31
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          λ
          
            k
            ⁢
            
              ,
              
                n
                X
              
            
          
        
        =
        
          
            
              L
              
                
                  k
                  -
                  1
                
                ,
                
                  Ω
                  
                    iX
                    ,
                    jX
                  
                  X
                
              
            
            ⁡
            
              (
              
                u
                
                  Ω
                  
                    iX
                    ,
                    jX
                  
                  X
                
              
              )
            
          
          +
          
            ln
            ⁢
            
              
                
                  ∑
                  
                    U
                    
                      k
                      ,
                      
                        n
                        X
                      
                      ,
                      
                        +
                        1
                      
                    
                  
                  
                    
                  
                
                ⁢
                
                  exp
                  ⁢
                  
                    {
                    
                      
                        
                          -
                          
                            1
                            
                              2
                              ⁢
                              
                                σ
                                2
                              
                            
                          
                        
                        ⁢
                        
                          
                            
                            
                              
                                y
                                ⁡
                                
                                  (
                                  
                                    i
                                    X
                                  
                                  )
                                
                              
                              -
                              
                                
                                  
                                    H
                                    22
                                  
                                  ⁡
                                  
                                    (
                                    
                                      i
                                      X
                                    
                                    )
                                  
                                
                                ⁢
                                
                                  s
                                  ⁡
                                  
                                    (
                                    
                                      u
                                      ⁡
                                      
                                        (
                                        
                                          i
                                          X
                                        
                                        )
                                      
                                    
                                    )
                                  
                                
                              
                            
                            
                          
                          2
                        
                      
                      +
                      
                        ρ
                        ⁡
                        
                          (
                          
                            u
                            
                              Ω
                              
                                iX
                                ,
                                jX
                              
                              X
                            
                          
                          )
                        
                      
                    
                    }
                  
                
              
              
                
                  ∑
                  
                    U
                    
                      k
                      ,
                      
                        n
                        X
                      
                      ,
                      
                        -
                        1
                      
                    
                  
                  
                    
                  
                
                ⁢
                
                  exp
                  ⁢
                  
                    {
                    
                      
                        
                          -
                          
                            1
                            
                              2
                              ⁢
                              
                                σ
                                2
                              
                            
                          
                        
                        ⁢
                        
                          
                            
                            
                              
                                y
                                ⁡
                                
                                  (
                                  
                                    i
                                    X
                                  
                                  )
                                
                              
                              -
                              
                                
                                  
                                    H
                                    22
                                  
                                  ⁡
                                  
                                    (
                                    
                                      i
                                      X
                                    
                                    )
                                  
                                
                                ⁢
                                
                                  s
                                  ⁡
                                  
                                    (
                                    
                                      u
                                      ⁡
                                      
                                        (
                                        
                                          i
                                          X
                                        
                                        )
                                      
                                    
                                    )
                                  
                                
                              
                            
                            
                          
                          2
                        
                      
                      +
                      
                        ρ
                        ⁡
                        
                          (
                          
                            u
                            
                              Ω
                              
                                iX
                                ,
                                jX
                              
                              X
                            
                          
                          )
                        
                      
                    
                    }
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          31
        
        )
      
    
  
  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          32
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          ρ
          ⁡
          
            (
            
              u
              
                Ω
                
                  iX
                  ,
                  jX
                
                X
              
            
            )
          
        
        =
        
          
            
              ∑
              
                
                  γ
                  =
                  1
                
                
                  γ
                  ≠
                  jX
                
              
              h
            
            ⁢
            
              
                
                
                  
                    
                      L
                      
                        
                          k
                          -
                          1
                        
                        ,
                        
                          Ω
                          
                            iX
                            ,
                            γ
                          
                          X
                        
                      
                    
                    ⁡
                    
                      (
                      
                        u
                        
                          Ω
                          
                            iX
                            ,
                            γ
                          
                          X
                        
                      
                      )
                    
                  
                  2
                
                
              
              ⁢
              
                (
                
                  
                    
                      u
                      
                        Ω
                        
                          iX
                          ,
                          γ
                        
                        X
                      
                    
                    ⁢
                    
                      sign
                      ⁡
                      
                        (
                        
                          
                            L
                            
                              
                                k
                                -
                                1
                              
                              ,
                              
                                Ω
                                
                                  iX
                                  ,
                                  γ
                                
                                X
                              
                            
                          
                          ⁡
                          
                            (
                            
                              u
                              
                                Ω
                                
                                  iX
                                  ,
                                  γ
                                
                                X
                              
                            
                            )
                          
                        
                        )
                      
                    
                  
                  -
                  1
                
                )
              
            
          
          +
          
            
              ∑
              
                γ
                =
                1
              
              h
            
            ⁢
            
              
                
                
                  
                    
                      L
                      
                        
                          k
                          -
                          1
                        
                        ,
                        
                          Ω
                          
                            iX
                            ,
                            γ
                          
                          Y
                        
                      
                    
                    ⁡
                    
                      (
                      
                        u
                        
                          Ω
                          
                            iX
                            ,
                            γ
                          
                          Y
                        
                      
                      )
                    
                  
                  2
                
                
              
              ⁢
              
                (
                
                  
                    
                      u
                      
                        Ω
                        
                          iX
                          ,
                          γ
                        
                        Y
                      
                    
                    ⁢
                    
                      sign
                      ⁡
                      
                        (
                        
                          
                            L
                            
                              
                                k
                                -
                                1
                              
                              ,
                              
                                Ω
                                
                                  iX
                                  ,
                                  γ
                                
                                Y
                              
                            
                          
                          ⁡
                          
                            (
                            
                              u
                              
                                Ω
                                
                                  iX
                                  ,
                                  γ
                                
                                Y
                              
                            
                            )
                          
                        
                        )
                      
                    
                  
                  -
                  1
                
                )
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          32
        
        )
      
    
  




For iterative Max-log APP decoding:





  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            33
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          λ
          
            k
            ⁢
            
              ,
              
                n
                X
              
            
          
        
        =
        
          
            
              L
              
                
                  k
                  -
                  1
                
                ,
                
                  Ω
                  
                    iX
                    ,
                    jX
                  
                  X
                
              
            
            ⁡
            
              (
              
                u
                
                  Ω
                  
                    iX
                    ,
                    jX
                  
                  X
                
              
              )
            
          
          +
          
            
              max
              
                U
                
                  k
                  ,
                  
                    n
                    X
                  
                  ,
                  
                    +
                    1
                  
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    
                      u
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ,
                    
                      y
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ,
                    
                      ρ
                      ⁡
                      
                        (
                        
                          u
                          
                            Ω
                            
                              iX
                              ,
                              jX
                            
                            X
                          
                        
                        )
                      
                    
                  
                  )
                
              
              }
            
          
          -
          
            
              max
              
                U
                
                  k
                  ,
                  
                    n
                    X
                  
                  ,
                  
                    -
                    1
                  
                
              
            
            ⁢
            
              {
              
                Ψ
                ⁡
                
                  (
                  
                    
                      u
                      ⁡
                      
                        (
                        
                          i
                          X
                        
                        )
                      
                    
                    ,
                    
                      
                        y
                        ⁡
                        
                          (
                          
                            i
                            X
                          
                          )
                        
                      
                      ⁢
                      
                        ρ
                        ⁡
                        
                          (
                          
                            u
                            
                              Ω
                              
                                iX
                                ,
                                jX
                              
                              X
                            
                          
                          )
                        
                      
                    
                  
                  )
                
              
              }
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          33
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            34
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          Ψ
          ⁡
          
            (
            
              
                u
                ⁡
                
                  (
                  
                    i
                    X
                  
                  )
                
              
              ,
              
                
                  y
                  ⁡
                  
                    (
                    
                      i
                      X
                    
                    )
                  
                
                ⁢
                
                  ρ
                  ⁡
                  
                    (
                    
                      u
                      
                        Ω
                        
                          iX
                          ,
                          jX
                        
                        X
                      
                    
                    )
                  
                
              
            
            )
          
        
        =
        
          
        
        ⁢
        
          -
          
             
            
              
                
                  1
                  
                    2
                    ⁢
                    
                      σ
                      2
                    
                  
                
                ⁢
                
                  
                    
                    
                      
                        y
                        ⁡
                        
                          (
                          
                            i
                            X
                          
                          )
                        
                      
                      -
                      
                        
                          
                            H
                            22
                          
                          ⁡
                          
                            (
                            
                              i
                              X
                            
                            )
                          
                        
                        ⁢
                        
                          s
                          ⁡
                          
                            (
                            
                              u
                              ⁡
                              
                                (
                                
                                  i
                                  X
                                
                                )
                              
                            
                            )
                          
                        
                      
                    
                    
                  
                  2
                
              
              +
              
                ρ
                ⁡
                
                  (
                  
                    u
                    
                      Ω
                      
                        iX
                        ,
                        jX
                      
                      X
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          34
        
        )
      
    
  




Step B-3 (Iteration Count and Codeword Estimation) If lmimo<lmimo,max, then lmimo is incremented and the process returns to step B-2. When lmimo=lmimo,max, an estimated codeword is found, as follows.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          35
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          
            u
            ^
          
          
            n
            X
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  
                    L
                    
                      
                        l
                        mimo
                      
                      ,
                      
                        n
                        X
                      
                    
                  
                  ≥
                  0
                
              
            
            
              
                
                  -
                  1
                
              
              
                
                  
                    L
                    
                      
                        l
                        mimo
                      
                      ,
                      
                        n
                        X
                      
                    
                  
                  <
                  0
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          35
        
        )
      
    
  




where X=a,b.
FIG. 3 shows a sample configuration of a transmission device 300 pertaining to the present Embodiment. An encoder 302A takes information (data) 301A and a frame configuration signal 313 as input (which includes the error-correction scheme, coding rate, block length, and other information used by the encoder 302A in error correction codes of the data, such that the scheme designated by the frame configuration signal 313 is used. The error-correction scheme may be switched). In accordance with the frame configuration signal 313, the encoder 302A performs error-correction coding, such as convolutional encoding, LDPC encoding, turbo encoding or similar, and outputs encoded data 303A.
An interleaver 304A takes the encoded data 303A and the frame configuration signal 313 as input, performs interleaving, i.e., rearranges the order thereof, and then outputs interleaved data 305A. (Depending on the frame configuration signal 313, the interleaving scheme may be switched.)
A mapper 306A takes the interleaved data 305A and the frame configuration signal 313 as input and performs modulation, such as QPSK (Quadrature Phase Shift Keying), 16-QAM (16-Quadradature Amplitude Modulation), or 64-QAM (64-Quadradture Amplitude Modulation) thereon, then outputs a baseband signal 307A. (Depending on the frame configuration signal 313, the modulation scheme may be switched.)
FIGS. 19A and 19B illustrate an example of a QPSK modulation mapping scheme for a baseband signal made up of an in-phase component I and a quadrature component Q in the IQ plane. For example, as shown in FIG. 19A, when the input data are 00, then the output is I=1.0, Q=1.0. Similarly, when the input data are 01, the output is I=−1.0, Q=1.0, and so on. FIG. 19B illustrates an example of a QPSK modulation mapping scheme in the IQ plane differing from FIG. 19A in that the signal points of FIG. 19A have been rotated about the origin to obtain the signal points of FIG. 19B. Non-Patent Literature 9 and Non-Patent Literature 10 describe such a constellation rotation scheme. Alternatively, the Cyclic Q Delay described in Non-Patent Literature 9 and Non-Patent Literature 10 may also be adopted. An alternate example, distinct from FIGS. 19A and 19B, is shown in FIGS. 20A and 20B, which illustrate a signal point layout for 16-QAM in the IQ plane. The example of FIG. 20A corresponds to FIG. 19A, while that of FIG. 20B corresponds to FIG. 19B.
An encoder 302B takes information (data) 301B and the frame configuration signal 313 as input (which includes the error-correction scheme, coding rate, block length, and other information used by the encoder 302A in error correction codes of the data, such that the scheme designated by the frame configuration signal 313 is used. The error-correction scheme may be switched). In accordance with the frame configuration signal 313, the encoder 302B performs error-correction coding, such as convolutional encoding, LDPC encoding, turbo encoding or similar, and outputs encoded data 303B.
An interleaver 304B takes the encoded data 303B and the frame configuration signal 313 as input, performs interleaving, i.e., rearranges the order thereof, and outputs interleaved data 305B. (Depending on the frame configuration signal 313, the interleaving scheme may be switched.)
A mapper 306B takes the interleaved data 305B and the frame configuration signal 313 as input and performs modulation, such as QPSK, 16-QAM, or 64-QAM thereon, then outputs a baseband signal 307B. (Depending on the frame configuration signal 313, the modulation scheme may be switched.)
A signal processing scheme information generator 314 takes the frame configuration signal 313 as input and accordingly outputs signal processing scheme information 315. The signal processing scheme information 315 designates the fixed precoding matrix to be used, and includes information on the pattern of phase changes used for changing the phase.
A weighting unit 308A takes baseband signal 307A, baseband signal 307B, and the signal processing scheme information 315 as input and, in accordance with the signal processing scheme information 315, performs weighting on the baseband signals 307A and 307B, then outputs a weighted signal 309A. The weighting scheme is described in detail, later.
A wireless unit 310A takes weighted signal 309A as input and performs processing such as quadrature modulation, band limitation, frequency conversion, amplification, and so on, then outputs transmit signal 311A. Transmit signal 311A is then output as radio waves by an antenna 312A.
A weighting unit 308B takes baseband signal 307A, baseband signal 307B, and the signal processing scheme information 315 as input and, in accordance with the signal processing scheme information 315, performs weighting on the baseband signals 307A and 307B, then outputs weighted signal 316B.
FIG. 21 illustrates the configuration of the weighting units 308A and 308B. The area of FIG. 21 enclosed in the dashed line represents one of the weighting units. Baseband signal 307A is multiplied by w11 to obtain w11·s1(t), and multiplied by w21 to obtain w21·s1(t). Similarly, baseband signal 307B is multiplied by w12 to obtain w12·s2(t), and multiplied by w22 to obtain w22·s2(t). Next, z1(t)=w11·s1(t)+w12·s2(t) and z2(t)=w21·s1(t)+w22·s22(t) are obtained. Here, as explained above, s1(t) and s2(t) are baseband signals modulated according to a modulation scheme such as BPSK (Binary Phase Shift Keying), QPSK, 8-PSK (8-Phase Shift Keying), 16-QAM, 32-QAM (32-Quadrature Amplitude Modulation), 64-QAM, 256-QAM 16-APSK (16-Amplitude Phase Shift Keying) and so on.
Both weighting units perform weighting using a fixed precoding matrix. The precoding matrix uses, for example, the scheme of Math. 36 (formula 36), and satisfies the conditions of Math. 37 (formula 37) or Math. 38 (formula 38), all found below. However, this is only an example. The value of α is not restricted to Math. 37 (formula 37) and Math. 38 (formula 38), and may take on other values, e.g., α=1.
Here, the precoding matrix is:




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          36
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          (
          
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  11
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  12
                
              
            
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  21
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  22
                
              
            
          
          )
        
        =
        
          
            1
            
              
                
                  α
                  2
                
                +
                1
              
            
          
          ⁢
          
            (
            
              
                
                  
                    e
                    j0
                  
                
                
                  
                    α
                    ×
                    
                      e
                      j0
                    
                  
                
              
              
                
                  
                    α
                    ×
                    
                      e
                      j0
                    
                  
                
                
                  
                    e
                    jπ
                  
                
              
            
            )
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          36
        
        )
      
    
  




In Math. 36 (formula 36), above, α may be given by:




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          37
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        α
        =
        
          
            
              2
            
            +
            4
          
          
            
              2
            
            +
            2
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          37
        
        )
      
    
  




Alternatively, in Math. 36 (formula 36), above, α may be given by:




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          38
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        α
        =
        
          
            
              2
            
            +
            3
            +
            
              5
            
          
          
            
              2
            
            +
            3
            -
            
              5
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          38
        
        )
      
    
  




The precoding matrix is not restricted to that of Math. 36 (formula 36), but may also be as indicated by Math. 39 (formula 39).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          39
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          (
          
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  11
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  12
                
              
            
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  21
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  22
                
              
            
          
          )
        
        =
        
          (
          
            
              
                a
              
              
                b
              
            
            
              
                c
              
              
                d
              
            
          
          )
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          39
        
        )
      
    
  




In Math. 39 (formula 39), let a=Aejδ11, b=Bejδ12, c=Cejδ21, and d=Dejδ22. Further, one of a, b, c, and d may be zero. For example, the following configurations are possible: (1) a may be zero while b, c, and d are non-zero, (2) b may be zero while a, c, and d are non-zero, (3) c may be zero while a, b, and d are non-zero, or (4) d may be zero while a, b, and c are non-zero.
When any of the modulation scheme, error-correcting codes, and the coding rate thereof are changed, the precoding matrix may also be set, changed, and fixed for use.
A phase changer 317B takes weighted signal 316B and the signal processing scheme information 315 as input, then regularly changes the phase of the signal 316B for output. This regular change is a change of phase performed according to a predetermined phase changing pattern having a predetermined period (cycle) (e.g., every n symbols (n being an integer, n≧1) or at a predetermined interval). The details of the phase changing pattern are explained below, in Embodiment 4.
Wireless unit 310B takes post-phase change signal 309B as input and performs processing such as quadrature modulation, band limitation, frequency conversion, amplification, and so on, then outputs transmit signal 311B. Transmit signal 311B is then output as radio waves by an antenna 312B.
FIG. 4 illustrates a sample configuration of a transmission device 400 that differs from that of FIG. 3. The points of difference of FIG. 4 from FIG. 3 are described next.
An encoder 402 takes information (data) 401 and the frame configuration signal 313 as input, and, in accordance with the frame configuration signal 313, performs error-correction coding and outputs encoded data 402.
A distributor 404 takes the encoded data 403 as input, performs distribution thereof, and outputs data 405A and data 405B. Although FIG. 4 illustrates only one encoder, the number of encoders is not limited as such. The present invention may also be realized using m encoders (m being an integer, m≧1) such that the distributor divides the encoded data created by each encoder into two groups for distribution.
FIG. 5 illustrates an example of a frame configuration in the time domain for a transmission device according to the present Embodiment. Symbol 500_1 is for notifying the reception device of the transmission scheme. For example, symbol 500_1 conveys information such as the error-correction scheme used for transmitting data symbols, the coding rate thereof, and the modulation scheme used for transmitting data symbols.
Symbol 501_1 is for estimating channel fluctuations for modulated signal z1(t) (where t is time) transmitted by the transmission device. Symbol 502_1 is a data symbol transmitted by modulated signal z1(t) as symbol number u (in the time domain). Symbol 503_1 is a data symbol transmitted by modulated signal z1(t) as symbol number u+1.
Symbol 501_2 is for estimating channel fluctuations for modulated signal z2(t) (where t is time) transmitted by the transmission device. Symbol 502_2 is a data symbol transmitted by modulated signal z2(t) as symbol number u (in the time domain). Symbol 503_2 is a data symbol transmitted by modulated signal z1(t) as symbol number u+1.
Here, the symbols of z1(t) and of z2(t) having the same time (identical timing) are transmitted from the transmit antenna using the same (shared/common) frequency.
The following describes the relationships between the modulated signals z1(t) and z2(t) transmitted by the transmission device and the received signals r1(t) and r2(t) received by the reception device.
In FIG. 5, 504#1 and 504#2 indicate transmit antennas of the transmission device, while 505#1 and 505#2 indicate receive antennas of the reception device. The transmission device transmits modulated signal z1(t) from transmit antenna 504#1 and transmits modulated signal z2(t) from transmit antenna 504#2. Here, the modulated signals z1(t) and z2(t) are assumed to occupy the same (shared/common) frequency (bandwidth). The channel fluctuations in the transmit antennas of the transmission device and the antennas of the reception device are h11(t), h12(t), h21(t), and h22(t), respectively. Assuming that receive antenna 505#1 of the reception device receives received signal r1(t) and that receive antenna 505#2 of the reception device receives received signal r2(t), the following relationship holds.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          40
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          (
          
            
              
                
                  r
                  ⁢
                  
                    
                  
                  ⁢
                  1
                  ⁢
                  
                    (
                    t
                    )
                  
                
              
            
            
              
                
                  r
                  ⁢
                  
                    
                  
                  ⁢
                  2
                  ⁢
                  
                    (
                    t
                    )
                  
                
              
            
          
          )
        
        =
        
          
            (
            
              
                
                  
                    
                      h
                      11
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
                
                  
                    
                      h
                      12
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
              
              
                
                  
                    
                      h
                      21
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
                
                  
                    
                      h
                      22
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    z
                    ⁢
                    
                      
                    
                    ⁢
                    1
                    ⁢
                    
                      (
                      t
                      )
                    
                  
                
              
              
                
                  
                    z
                    ⁢
                    
                      
                    
                    ⁢
                    2
                    ⁢
                    
                      (
                      t
                      )
                    
                  
                
              
            
            )
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          40
        
        )
      
    
  




FIG. 6 pertains to the weighting scheme (precoding scheme) and the phase changing scheme of the present Embodiment. A weighting unit 600 is a combined version of the weighting units 308A and 308B from FIG. 3. As shown, stream s1(t) and stream s2(t) correspond to the baseband signals 307A and 307B of FIG. 3. That is, the streams s1(t) and s2(t) are baseband signals made up of an in-phase component I and a quadrature component Q conforming to mapping by a modulation scheme such as QPSK, 16-QAM, and 64-QAM. As indicated by the frame configuration of FIG. 6, stream s1(t) is represented as s1(u) at symbol number u, as s1(u+1) at symbol number u+1, and so forth. Similarly, stream s2(t) is represented as s2(u) at symbol number u, as s2(u+1) at symbol number u+1, and so forth. The weighting unit 600 takes the baseband signals 307A (s1(t)) and 307B (s2(t)) as well as the signal processing scheme information 315 from FIG. 3 as input, performs weighting in accordance with the signal processing scheme information 315, and outputs the weighted signals 309A (z1(t)) and 316B (z2′(t)) from FIG. 3. The phase changer 317B changes the phase of weighted signal 316B (z2′(t)) and outputs post-phase change signal 309B (z2(t)).
Here, given vector W1=(w11,w12) from the first row of the fixed precoding matrix F, z1(t) is expressible as Math. 41 (formula 41), below.

[Math. 41]

z1(t)=W1×(s1(t),s2(t))T  (formula 41)

Similarly, given vector W2=(w21,w22) from the second row of the fixed precoding matrix F, and letting the phase changing formula applied by the phase changer by y(t), then z2(t) is expressible as Math. 42 (formula 42), below.

[Math. 42]

z2(t)=y(t)×W2×(s1(t),s2(t))T  (formula 42)

Here, y(t) is a phase changing formula following a predetermined scheme. For example, given a period (cycle) of four and time u, the phase changing formula is expressible as Math. 43 (formula 43), below.

[Math. 43]

y(u)=ej0  (formula 43)

Similarly, the phase changing formula for time u+1 may be, for example, as given by Math. 44 (formula 44).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          44
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          y
          ⁡
          
            (
            
              u
              +
              1
            
            )
          
        
        =
        
          e
          
            j
            ⁢
            
              π
              2
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          44
        
        )
      
    
  




That is, the phase changing formula for time u+k is expressible as Math. 45 (formula 45).




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          45
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          y
          ⁡
          
            (
            
              u
              +
              k
            
            )
          
        
        =
        
          e
          
            j
            ⁢
            
              
                k
                ⁢
                
                  
                
                ⁢
                π
              
              2
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          45
        
        )
      
    
  




Note that Math. 43 (formula 43) through Math. 45 (formula 45) are given only as an example of regular phase changing.
The regular change of phase is not restricted to a period (cycle) of four. Improved reception capabilities (the error-correction capabilities, to be exact) may potentially be promoted in the reception device by increasing the period (cycle) number (this does not mean that a greater period (cycle) is better, though avoiding small numbers such as two is likely ideal).
Furthermore, although Math. 43 (formula 43) through Math. 45 (formula 45), above, represent a configuration in which a change in phase is carried out through rotation by consecutive predetermined phases (in the above formula, every π/2), the change in phase need not be rotation by a constant amount, but may also be random. For example, in accordance with the predetermined period (cycle) of y(t), the phase may be changed through sequential multiplication as shown in Math. 46 (formula 46) and Math. 47 (formula 47). The key point of regular phase changing is that the phase of the modulated signal is regularly changed. The degree of phase change is preferably as even as possible, such as from −π radians to π radians. However, given that this describes a distribution, random changes are also possible.




  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            46
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          e
          j0
        
        →
        
          
            e
            
              j
              ⁢
              
                π
                5
              
            
          
          →
          
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    π
                  
                  5
                
              
            
            →
            
              
                e
                
                  j
                  ⁢
                  
                    
                      3
                      ⁢
                      π
                    
                    5
                  
                
              
              →
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                        4
                        ⁢
                        π
                      
                      5
                    
                  
                
                →
                
                  
                    e
                    jπ
                  
                  →
                  
                    
                      e
                      
                        j
                        ⁢
                        
                          
                            6
                            ⁢
                            π
                          
                          5
                        
                      
                    
                    →
                    
                      
                        e
                        
                          j
                          ⁢
                          
                            
                              7
                              ⁢
                              π
                            
                            5
                          
                        
                      
                      →
                      
                        
                          e
                          
                            j
                            ⁢
                            
                              
                                8
                                ⁢
                                π
                              
                              5
                            
                          
                        
                        →
                        
                          e
                          
                            j
                            ⁢
                            
                              
                                9
                                ⁢
                                π
                              
                              5
                            
                          
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          46
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          [
          
            Math
            .
            
              
            
            ⁢
            47
          
          ]
        
      
    
    
      
        
      
    
  
  
    
      
        
          e
          
            j
            ⁢
            
              π
              2
            
          
        
        →
        
          
            e
            jπ
          
          →
          
            
              e
              
                j
                ⁢
                
                  
                    3
                    ⁢
                    π
                  
                  2
                
              
            
            →
            
              
                e
                j2π
              
              →
              
                
                  e
                  
                    j
                    ⁢
                    
                      π
                      4
                    
                  
                
                →
                
                  
                    e
                    
                      j
                      ⁢
                      
                        3
                        4
                      
                      ⁢
                      π
                    
                  
                  →
                  
                    
                      e
                      
                        j
                        ⁢
                        
                          
                            5
                            ⁢
                            π
                          
                          4
                        
                      
                    
                    →
                    
                      e
                      
                        j
                        ⁢
                        
                          
                            7
                            ⁢
                            π
                          
                          4
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          47
        
        )
      
    
  




As such, the weighting unit 600 of FIG. 6 performs precoding using fixed, predetermined precoding weights, and the phase changer 317B changes the phase of the signal input thereto while regularly varying the phase changing degree.
When a specialized precoding matrix is used in a LOS environment, the reception quality is likely to improve tremendously. However, depending on the direct wave conditions, the phase and amplitude components of the direct wave may greatly differ from the specialized precoding matrix, upon reception. The LOS environment has certain rules. Thus, data reception quality is tremendously improved through a regular change applied to a transmit signal that obeys those rules. The present invention offers a signal processing scheme for improvements in the LOS environment.
FIG. 7 illustrates a sample configuration of a reception device 700 pertaining to the present embodiment. Wireless unit 703_X receives, as input, received signal 702_X received by antenna 701_X, performs processing such as frequency conversion, quadrature demodulation, and the like, and outputs baseband signal 704_X.
Channel fluctuation estimator 705_1 for modulated signal z1 transmitted by the transmission device takes baseband signal 704_X as input, extracts reference symbol 501_1 for channel estimation from FIG. 5, estimates the value of h11 from Math. 40 (formula 40), and outputs channel estimation signal 706_1.
Channel fluctuation estimator 705_2 for modulated signal z2 transmitted by the transmission device takes baseband signal 704_X as input, extracts reference symbol 501_2 for channel estimation from FIG. 5, estimates the value of h12 from Math. 40 (formula 40), and outputs channel estimation signal 706_2.
Wireless unit 703_Y receives, as input, received signal 702_Y received by antenna 701_X, performs processing such as frequency conversion, quadrature demodulation, and the like, and outputs baseband signal 704_Y.
Channel fluctuation estimator 707_1 for modulated signal z1 transmitted by the transmission device takes baseband signal 704_Y as input, extracts reference symbol 501_1 for channel estimation from FIG. 5, estimates the value of h21 from Math. 40 (formula 40), and outputs channel estimation signal 708_1.
Channel fluctuation estimator 707_2 for modulated signal z2 transmitted by the transmission device takes baseband signal 704_Y as input, extracts reference symbol 501_2 for channel estimation from FIG. 5, estimates the value of h22 from Math. 40 (formula 40), and outputs channel estimation signal 708_2.
A control information decoder 709 receives baseband signal 704_X and baseband signal 704_Y as input, detects symbol 500_1 that indicates the transmission scheme from FIG. 5, and outputs a transmission scheme information signal 710 for the transmission device.
A signal processor 711 takes the baseband signals 704_X and 704_Y, the channel estimation signals 706_1, 706_2, 708_1, and 708_2, and the transmission scheme information signal 710 as input, performs detection and decoding, and then outputs received data 712_1 and 712_2.
Next, the operations of the signal processor 711 from FIG. 7 are described in detail. FIG. 8 illustrates a sample configuration of the signal processor 711 pertaining to the present embodiment. As shown, the signal processor 711 is primarily made up of an inner MIMO detector, soft-in/soft-out decoders, and a coefficient generator. Non-Patent Literature 2 and Non-Patent Literature 3 describe a scheme of iterative decoding using this structure. The MIMO system described in Non-Patent Literature 2 and Non-Patent Literature 3 is a spatial multiplexing MIMO system, while the present Embodiment differs from Non-Patent Literature 2 and Non-Patent Literature 3 in describing a MIMO system that regularly changes the phase over time while using the same precoding matrix. Taking the (channel) matrix H(t) of Math. 36 (formula 36), then by letting the precoding weight matrix from FIG. 6 be F (here, a fixed precoding matrix remaining unchanged for a given received signal) and letting the phase changing formula used by the phase changer from FIG. 6 be Y(t) (here, Y(t) changes over time t), then the receive vector R(t)=(r1(t),r2(t))T and the stream vector S(t)=(s1(t),s2(t))T the following function is derived:




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          48
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          
            R
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              H
              ⁡
              
                (
                t
                )
              
            
            ×
            
              Y
              ⁡
              
                (
                t
                )
              
            
            ×
            F
            ×
            
              S
              ⁡
              
                (
                t
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        where
        ⁢
        
          

        
        ⁢
        
          
            Y
            ⁡
            
              (
              t
              )
            
          
          =
          
            (
            
              
                
                  1
                
                
                  0
                
              
              
                
                  0
                
                
                  
                    y
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                
              
            
            )
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          48
        
        )
      
    
  




Here, the reception device may use the decoding schemes of Non-Patent Literature 2 and 3 on R(t) by computing H(t)×Y(t)×F.
Accordingly, the coefficient generator 819 from FIG. 8 takes a transmission scheme information signal 818 (corresponding to 710 from FIG. 7) indicated by the transmission device (information for specifying the fixed precoding matrix in use and the phase changing pattern used when the phase is changed) and outputs a signal processing scheme information signal 820.
The inner MIMO detector 803 takes the signal processing scheme information signal as input and performs iterative detection and decoding using the signal and the relationship thereof to Math. 48 (formula 48). The operations thereof are described below.
The processing unit illustrated in FIG. 8 uses a processing scheme, as illustrated by FIG. 10, to perform iterative decoding (iterative detection). First, detection of one codeword (or one frame) of modulated signal (stream) s1 and of one codeword (or one frame) of modulated signal (stream) s2 is performed. As a result, the soft-in/soft-out decoder obtains the log-likelihood ratio of each bit of the codeword (or frame) of modulated signal (stream) s1 and of the codeword (or frame) of modulated signal (stream) s2. Next, the log-likelihood ratio is used to perform a second round of detection and decoding. These operations are performed multiple times (these operations are hereinafter referred to as iterative decoding (iterative detection)). The following explanations center on the creation scheme of the log-likelihood ratio of a symbol at a specific time within one frame.
In FIG. 8, a memory 815 takes baseband signal 801X (corresponding to baseband signal 704_X from FIG. 7), channel estimation signal group 802X (corresponding to channel estimation signals 706_1 and 706_2 from FIG. 7), baseband signal 801Y (corresponding to baseband signal 704_Y from FIG. 7), and channel estimation signal group 802Y (corresponding to channel estimation signals 708_1 and 708_2 from FIG. 7) as input, executes (computes) H(t)×Y(t)×F from Math. 48 (formula 48) in order to perform iterative decoding (iterative detection) and stores the resulting matrix as a transformed channel signal group. The memory 815 then outputs the above-described signals as needed, specifically as baseband signal 816X, transformed channel estimation signal group 817X, baseband signal 816Y, and transformed channel estimation signal group 817Y.
Subsequent operations are described separately for initial detection and for iterative decoding (iterative detection).
(Initial Detection)
The inner MIMO detector 803 takes baseband signal 801X, channel estimation signal group 802X, baseband signal 801Y, and channel estimation signal group 802Y as input. Here, the modulation scheme for modulated signal (stream) s1 and modulated signal (stream) s2 is taken to be 16-QAM.
The inner MIMO detector 803 first computes H(t)×Y(t)×F from the channel estimation signal groups 802X and 802Y, thus calculating a candidate signal point corresponding to baseband signal 801X. FIG. 11 represents such a calculation. In FIG. 11, each black dot is a candidate signal point in the IQ plane. Given that the modulation scheme is 16-QAM, 256 candidate signal points exist. (However, FIG. 11 is only a representation and does not indicate all 256 candidate signal points.) Letting the four bits transmitted in modulated signal s1 be b0, b1, b2, and b3 and the four bits transmitted in modulated signal s2 be b4, b5, b6, and b7, candidate signal points corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) are found in FIG. 11. The Euclidean squared distance between each candidate signal point and each received signal point 1101 (corresponding to baseband signal 801X) is then computed. The Euclidian squared distance between each point is divided by the noise variance σ2. Accordingly, EX(b0, b1, b2, b3, b4, b5, b6, b7) is calculated. That is, EX is the Euclidian squared distance between a candidate signal point corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) and a received signal point, divided by the noise variance. Here, each of the baseband signals and the modulated signals s1 and s2 is a complex signal.
Similarly, the inner MIMO detector 803 computes H(t)×Y(t)×F from the channel estimation signal groups 802X and 802Y, calculates candidate signal points corresponding to baseband signal 801Y, computes the Euclidean squared distance between each of the candidate signal points and the received signal points (corresponding to baseband signal 801Y), and divides the Euclidean squared distance by the noise variance σ2. Accordingly, EY(b0, b1, b2, b3, b4, b5, b6, b7) is calculated. That is, EY is the Euclidian squared distance between a candidate signal point corresponding to (b0, b1, b2, b3, b4, b5, b6, b7) and a received signal point, divided by the noise variance.
Next, EX(b0, b1, b2, b3, b4, b5, b6, b7)+EY(b0, b1, b2, b3, b4, b5, b6, b7)=E(b0, b1, b2, b3, b4, b5, b6, b7) is computed.
The inner MIMO detector 803 outputs E(b0, b1, b2, b3, b4, b5, b6, b7) as a signal 804.
Log-likelihood calculator 805A takes the signal 804 as input, calculates the log-likelihood of bits b0, b1, b2, and b3, and outputs log-likelihood signal 806A. Note that this log-likelihood calculation produces the log-likelihood of a bit being 1 and the log-likelihood of a bit being 0. The calculation scheme is as shown in Math. 28 (formula 28), Math. 29 (formula 29), and Math. 30 (formula 30), and the details are given by Non-Patent Literature 2 and 3.
Similarly, log-likelihood calculator 805A takes the signal 804 as input, calculates the log-likelihood of bits b0, b1, b2, and b3, and outputs log-likelihood signal 806B. A deinterleaver (807A) takes log-likelihood signal 806A as input, performs deinterleaving corresponding to that of the interleaver (the interleaver (304A) from FIG. 3), and outputs deinterleaved log-likelihood signal 808A.
Similarly, a deinterleaver (807B) takes log-likelihood signal 806B as input, performs deinterleaving corresponding to that of the interleaver (the interleaver (304B) from FIG. 3), and outputs deinterleaved log-likelihood signal 808B.
Log-likelihood ratio calculator 809A takes deinterleaved log-likelihood signal 808A as input, calculates the log-likelihood ratio of the bits encoded by encoder 302A from FIG. 3, and outputs log-likelihood ratio signal 810A.
Similarly, log-likelihood ratio calculator 809B takes deinterleaved log-likelihood signal 808B as input, calculates the log-likelihood ratio of the bits encoded by encoder 302B from FIG. 3, and outputs log-likelihood ratio signal 810B.
Soft-in/soft-out decoder 811A takes log-likelihood ratio signal 810A as input, performs decoding, and outputs decoded log-likelihood ratio 812A.
Similarly, soft-in/soft-out decoder 811B takes log-likelihood ratio signal 810B as input, performs decoding, and outputs decoded log-likelihood ratio 812B.
(Iterative Decoding (Iterative Detection), k Iterations)
The interleaver (813A) takes the k−1th decoded log-likelihood ratio 812A decoded by the soft-in/soft-out decoder as input, performs interleaving, and outputs interleaved log-likelihood ratio 814A. Here, the interleaving pattern used by the interleaver (813A) is identical to that of the interleaver (304A) from FIG. 3.
Another interleaver (813B) takes the k−1th decoded log-likelihood ratio 812B decoded by the soft-in/soft-out decoder as input, performs interleaving, and outputs interleaved log-likelihood ratio 814B. Here, the interleaving pattern used by the other interleaver (813B) is identical to that of another interleaver (304B) from FIG. 3.
The inner MIMO detector 803 takes baseband signal 816X, transformed channel estimation signal group 817X, baseband signal 816Y, transformed channel estimation signal group 817Y, interleaved log-likelihood ratio 814A, and interleaved log-likelihood ratio 814B as input. Here, baseband signal 816X, transformed channel estimation signal group 817X, baseband signal 816Y, and transformed channel estimation signal group 817Y are used instead of baseband signal 801X, channel estimation signal group 802X, baseband signal 801Y, and channel estimation signal group 802Y because the latter cause delays due to the iterative decoding.
The iterative decoding operations of the inner MIMO detector 803 differ from the initial detection operations thereof in that the interleaved log-likelihood ratios 814A and 814B are used in signal processing for the former. The inner MIMO detector 803 first calculates E(b0, b1, b2, b3, b4, b5, b6, b7) in the same manner as for initial detection. In addition, the coefficients corresponding to Math. 11 (formula 11) and Math. 32 (formula 32) are computed from the interleaved log-likelihood ratios 814A and 814B. The value of E(b0, b1, b2, b3, b4, b5, b6, b7) is corrected using the coefficients so calculated to obtain E′(b0, b1, b2, b3, b4, b5, b6, b7), which is output as the signal 804.
Log-likelihood calculator 805A takes the signal 804 as input, calculates the log-likelihood of bits b0, b1, b2, and b3, and outputs the log-likelihood signal 806A. Note that this log-likelihood calculation produces the log-likelihood of a bit being 1 and the log-likelihood of a bit being 0. The calculation scheme is as shown in Math. 31 (formula 31) through Math. 35 (formula 35), and the details are given by Non-Patent Literature 2 and 3.
Similarly, log-likelihood calculator 805B takes the signal 804 as input, calculates the log-likelihood of bits b4, b5, b6, and b7, and outputs the log-likelihood signal 806A. Operations performed by the deinterleaver onwards are similar to those performed for initial detection.
While FIG. 8 illustrates the configuration of the signal processor when performing iterative detection, this structure is not absolutely necessary as good reception improvements are obtainable by iterative detection alone. As long as the components needed for iterative detection are present, the configuration need not include the interleavers 813A and 813B. In such a case, the inner MIMO detector 803 does not perform iterative detection.
The key point for the present Embodiment is the calculation of H(t)×Y(t)×F. As shown in Non-Patent Literature 5 and the like, QR decomposition may also be used to perform initial detection and iterative detection.
Also, as indicated by Non-Patent Literature 11, MMSE (Minimum Mean-Square Error) and ZF (Zero-Forcing) linear operations may be performed based on H(t)×Y(t)×F when performing initial detection.
FIG. 9 illustrates the configuration of a signal processor, unlike that of FIG. 8, that serves as the signal processor for modulated signals transmitted by the transmission device from FIG. 4. The point of difference from FIG. 8 is the number of soft-in/soft-out decoders. A soft-in/soft-out decoder 901 takes the log-likelihood ratio signals 810A and 810B as input, performs decoding, and outputs a decoded log-likelihood ratio 902. A distributor 903 takes the decoded log-likelihood ratio 902 as input for distribution. Otherwise, the operations are identical to those explained for FIG. 8.
As described above, when a transmission device according to the present Embodiment using a MIMO system transmits a plurality of modulated signals from a plurality of antennas, changing the phase over time while multiplying by the precoding matrix so as to regularly change the phase results in improvements to data reception quality for a reception device in a LOS environment where direct waves are dominant, in contrast to a conventional spatial multiplexing MIMO system.
In the present Embodiment, and particularly in the configuration of the reception device, the number of antennas is limited and explanations are given accordingly. However, the Embodiment may also be applied to a greater number of antennas. In other words, the number of antennas in the reception device does not affect the operations or advantageous effects of the present Embodiment.
Also, although LDPC codes are described as a particular example, the present Embodiment is not limited in this manner. Furthermore, the decoding scheme is not limited to the sum-product decoding example given for the soft-in/soft-out decoder. Other soft-in/soft-out decoding schemes, such as the BCJR algorithm, SOYA, and the Max-Log-Map algorithm may also be used. Details are provided in Non-Patent Literature 6.
In addition, although the present Embodiment is described using a single-carrier scheme, no limitation is intended in this regard. The present Embodiment is also applicable to multi-carrier transmission. Accordingly, the present Embodiment may also be realized using, for example, spread-spectrum communications, OFDM (Orthogonal Frequency-Division Multiplexing), SC-FDMA (Single Carrier Frequency-Division Multiple Access), SC-OFDM (Single Carrier Orthogonal Frequency-Division Multiplexing), wavelet OFDM as described in Non-Patent Literature 7, and so on. Furthermore, in the present Embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, etc) or symbols transmitting control information, may be arranged within the frame in any manner.
The following describes an example in which OFDM is used as a multi-carrier scheme.
FIG. 12 illustrates the configuration of a transmission device using OFDM. In FIG. 12, components operating in the manner described for FIG. 3 use identical reference numbers.
OFDM-related processor 1201A takes weighted signal 309A as input, performs OFDM-related processing thereon, and outputs transmit signal 1202A. Similarly, OFDM-related processor 1201B takes post-phase change 309B as input, performs OFDM-related processing thereon, and outputs transmit signal 1202A
FIG. 13 illustrates a sample configuration of the OFDM-related processors 1201A and 1201B and onward from FIG. 12. Components 1301A through 1310A belong between 1201A and 312A from FIG. 12, while components 1301B through 1310B belong between 1201B and 312B.
Serial-to-parallel converter 1302A performs serial-to-parallel conversion on weighted signal 1301A (corresponding to weighted signal 309A from FIG. 12) and outputs parallel signal 1303A.
Reorderer 1304A takes parallel signal 1303A as input, performs reordering thereof, and outputs reordered signal 1305A. Reordering is described in detail later.
IFFT (Inverse Fast Fourier Transform) unit 1306A takes reordered signal 1305A as input, applies an IFFT thereto, and outputs post-IFFT signal 1307A.
Wireless unit 1308A takes post-IFFT signal 1307A as input, performs processing such as frequency conversion and amplification, thereon, and outputs modulated signal 1309A. Modulated signal 1309A is then output as radio waves by antenna 1310A.
Serial-to-parallel converter 1302B performs serial-to-parallel conversion on weighted signal 1301B (corresponding to post-phase change 309B from FIG. 12) and outputs parallel signal 1303B.
Reorderer 1304B takes parallel signal 1303B as input, performs reordering thereof, and outputs reordered signal 1305B. Reordering is described in detail later.
IFFT unit 1306B takes reordered signal 1305B as input, applies an IFFT thereto, and outputs post-IFFT signal 1307B.
Wireless unit 1308B takes post-IFFT signal 1307B as input, performs processing such as frequency conversion and amplification thereon, and outputs modulated signal 1309B. Modulated signal 1309B is then output as radio waves by antenna 1310A.
The transmission device from FIG. 3 does not use a multi-carrier transmission scheme. Thus, as shown in FIG. 6, the change of phase is performed to achieve a period (cycle) of four and the post-phase change symbols are arranged with respect to the time domain. As shown in FIG. 12, when multi-carrier transmission, such as OFDM, is used, then, naturally, precoded post-phase change symbols may be arranged with respect to the time domain as in FIG. 3, and this applies to each (sub-)carrier. However, for multi-carrier transmission, the arrangement may also be in the frequency domain, or in both the frequency domain and the time domain. The following describes these arrangements.
FIGS. 14A and 14B indicate frequency on the horizontal axes and time on the vertical axes thereof, and illustrate an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13. The frequency axes are made up of (sub-)carriers 0 through 9. The modulated signals z1 and z2 share common times (timing) and use a common frequency band. FIG. 14A illustrates a reordering scheme for the symbols of modulated signal z1, while FIG. 14B illustrates a reordering scheme for the symbols of modulated signal z2. With respect to the symbols of weighted signal 1301A input to serial-to-parallel converter 1302A, the assigned ordering is #0, #1, #2, #3, and so on. Here, given that the example deals with a period (cycle) of four, #0, #1, #2, and #3 are equivalent to one period (cycle). Similarly, #4n, #4n+1, #4n+2, and #4n+3 (n being a non-zero positive integer) are also equivalent to one period (cycle).
As shown in FIG. 14A, symbols #0, #1, #2, #3, and so on are arranged in order, beginning at carrier 0. Symbols #0 through #9 are given time $1, followed by symbols #10 through #19 which are given time #2, and so on in a regular arrangement. Note that the modulated signals z1 and z2 are complex signals.
Similarly, with respect to the symbols of weighted signal 1301B input to serial-to-parallel converter 1302B, the assigned ordering is #0, #1, #2, #3, and so on. Here, given that the example deals with a period (cycle) of four, a different change of phase is applied to each of #0, #1, #2, and #3, which are equivalent to one period (cycle). Similarly, a different change of phase is applied to each of #4n, #4n+1, #4n+2, and #4n+3 (n being a non-zero positive integer), which are also equivalent to one period (cycle)
As shown in FIG. 14B, symbols #0, #1, #2, #3, and so on are arranged in order, beginning at carrier 0. Symbols #0 through #9 are given time $1, followed by symbols #10 through #19 which are given time #2, and so on in a regular arrangement.
The symbol group 1402 shown in FIG. 14B corresponds to one period (cycle) of symbols when the phase changing scheme of FIG. 6 is used. Symbol #0 is the symbol obtained by using the phase at time u in FIG. 6, symbol #1 is the symbol obtained by using the phase at time u+1 in FIG. 6, symbol #2 is the symbol obtained by using the phase at time u+2 in FIG. 6, and symbol #3 is the symbol obtained by using the phase at time u+3 in FIG. 6. Accordingly, for any symbol #x, symbol #x is the symbol obtained by using the phase at time u in FIG. 6 when x mod 4 equals 0 (i.e., when the remainder of x divided by 4 is 0, mod being the modulo operator), symbol #x is the symbol obtained by using the phase at time u+1 in FIG. 6 when x mod 4 equals 1, symbol #x is the symbol obtained by using the phase at time u+2 in FIG. 6 when x mod 4 equals 2, and symbol #x is the symbol obtained by using the phase at time u+3 in FIG. 6 when x mod 4 equals 3.
In the present Embodiment, modulated signal z1 shown in FIG. 14A has not undergone a change of phase.
As such, when using a multi-carrier transmission scheme such as OFDM, and unlike single carrier transmission, symbols may be arranged with respect to the frequency domain. Of course, the symbol arrangement scheme is not limited to those illustrated by FIGS. 14A and 14B. Further examples are shown in FIGS. 15A, 15B, 16A, and 16B.
FIGS. 15A and 15B indicate frequency on the horizontal axes and time on the vertical axes thereof, and illustrate an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13 that differs from that of FIGS. 14A and 14B. FIG. 15A illustrates a reordering scheme for the symbols of modulated signal z1, while FIG. 15B illustrates a reordering scheme for the symbols of modulated signal z2. FIGS. 15A and 15B differ from FIGS. 14A and 14B in that different reordering schemes are applied to the symbols of modulated signal z1 and to the symbols of modulated signal z2. In FIG. 15B, symbols #0 through #5 are arranged at carriers 4 through 9, symbols #6 though #9 are arranged at carriers 0 through 3, and this arrangement is repeated for symbols #10 through #19. Here, as in FIG. 14B, symbol group 1502 shown in FIG. 15B corresponds to one period (cycle) of symbols when the phase changing scheme of FIG. 6 is used.
FIGS. 16A and 16B indicate frequency on the horizontal axes and time on the vertical axes thereof, and illustrate an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13 that differs from that of FIGS. 14A and 14B. FIG. 16A illustrates a reordering scheme for the symbols of modulated signal z1, while FIG. 16B illustrates a reordering scheme for the symbols of modulated signal z2. FIGS. 16A and 16B differ from FIGS. 14A and 14B in that, while FIGS. 14A and 14B showed symbols arranged at sequential carriers, FIGS. 16A and 16B do not arrange the symbols at sequential carriers. Obviously, for FIGS. 16A and 16B, different reordering schemes may be applied to the symbols of modulated signal z1 and to the symbols of modulated signal z2 as in FIGS. 15A and 15B.
FIGS. 17A and 17B indicate frequency on the horizontal axes and time on the vertical axes thereof, and illustrate an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13 that differs from those of FIGS. 14A through 16B. FIG. 17A illustrates a reordering scheme for the symbols of modulated signal z1 and FIG. 17B illustrates a reordering scheme for the symbols of modulated signal z2. While FIGS. 14A through 16B show symbols arranged with respect to the frequency axis, FIGS. 17A and 17B use the frequency and time axes together in a single arrangement.
While FIG. 6 describes an example where a change of phase is performed in a four slot period (cycle), the following example describes an eight slot period (cycle). In FIGS. 17A and 17B, the symbol group 1702 is equivalent to one period (cycle) of symbols when the phase changing scheme is used (i.e., to eight symbols) such that symbol #0 is the symbol obtained by using the phase at time u, symbol #1 is the symbol obtained by using the phase at time u+1, symbol #2 is the symbol obtained by using the phase at time u+2, symbol #3 is the symbol obtained by using the phase at time u+3, symbol #4 is the symbol obtained by using the phase at time u+4, symbol #5 is the symbol obtained by using the phase at time u+5, symbol #6 is the symbol obtained by using the phase at time u+6, and symbol #7 is the symbol obtained by using the phase at time u+7. Accordingly, for any symbol #x, symbol #x is the symbol obtained by using the phase at time u when x mod 8 equals 0, symbol #x is the symbol obtained by using the phase at time u+1 when x mod 8 equals 1, symbol #x is the symbol obtained by using the phase at time u+2 when x mod 8 equals 2, symbol #x is the symbol obtained by using the phase at time u+3 when x mod 8 equals 3, symbol #x is the symbol obtained by using the phase at time u+4 when x mod 8 equals 4, symbol #x is the symbol obtained by using the phase at time u+5 when x mod 8 equals 5, symbol #x is the symbol obtained by using the phase at time u+6 when x mod 8 equals 6, and symbol #x is the symbol obtained by using the phase at time u+7 when x mod 8 equals 7. In FIGS. 17A and 17B four slots along the time axis and two slots along the frequency axis are used for a total of 4×2=8 slots, in which one period (cycle) of symbols is arranged. Here, given m×n symbols per period (cycle) (i.e., m×n different phases are available for multiplication), then n slots (carriers) in the frequency domain and m slots in the time domain should be used to arrange the symbols of each period (cycle), such that m>n. This is because the phase of direct waves fluctuates slowly in the time domain relative to the frequency domain. Accordingly, the present Embodiment performs a regular change of phase that reduces the influence of steady direct waves. Thus, the phase changing period (cycle) should preferably reduce direct wave fluctuations. Accordingly, m should be greater than n. Taking the above into consideration, using the time and frequency domains together for reordering, as shown in FIGS. 17A and 17B, is preferable to using either of the frequency domain or the time domain alone due to the strong probability of the direct waves becoming regular. As a result, the effects of the present invention are more easily obtained. However, reordering in the frequency domain may lead to diversity gain due the fact that frequency-domain fluctuations are abrupt. As such, using the frequency and time domains together for reordering is not always ideal.
FIGS. 18A and 18B indicate frequency on the horizontal axes and time on the vertical axes thereof, and illustrate an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13 that differs from that of FIGS. 17A and 14B. FIG. 18A illustrates a reordering scheme for the symbols of modulated signal z1, while FIG. 18B illustrates a reordering scheme for the symbols of modulated signal z2. Much like FIGS. 17A and 17B, FIGS. 18A and 18B illustrate the use of the time and frequency domains, together. However, in contrast to FIGS. 17A and 17B, where the frequency domain is prioritized and the time domain is used for secondary symbol arrangement, FIGS. 18A and 18B prioritize the time domain and use the frequency domain for secondary symbol arrangement. In FIG. 18B, symbol group 1802 corresponds to one period (cycle) of symbols when the phase changing scheme is used.
In FIGS. 17A, 17B, 18A, and 18B, the reordering scheme applied to the symbols of modulated signal z1 and the symbols of modulated signal z2 may be identical or may differ as in FIGS. 15A and 15B. Both approaches allow good reception quality to be obtained. Also, in FIGS. 17A, 17B, 18A, and 18B, the symbols may be arranged non-sequentially as in FIGS. 16A and 16B. Both approaches allows good reception quality to be obtained.
FIG. 22 indicates frequency on the horizontal axis and time on the vertical axis thereof, and illustrates an example of a symbol reordering scheme used by the reorderers 1301A and 1301B from FIG. 13 that differs from the above. FIG. 22 illustrates a regular phase changing scheme using four slots, similar to times u through u+3 from FIG. 6. The characteristic feature of FIG. 22 is that, although the symbols are reordered with respect the frequency domain, when read along the time axis, a periodic shift of n (n=1 in the example of FIG. 22) symbols is apparent. The frequency-domain symbol group 2210 in FIG. 22 indicates four symbols to which the change of phase is applied at times u through u+3 from FIG. 6.
Here, symbol #0 is obtained through a change of phase at time u, symbol #1 is obtained through a change of phase at time u+1, symbol #2 is obtained through a change of phase at time u+2, and symbol #3 is obtained through a change of phase at time u+3.
Similarly, for frequency-domain symbol group 2220, symbol #4 is obtained through a change of phase at time u, symbol #5 is obtained through a change of phase at time u+1, symbol #6 is obtained through a change of phase at time u+2, and symbol #7 is obtained through a change of phase at time u+3.
The above-described change of phase is applied to the symbol at time $1. However, in order to apply periodic shifting in the time domain, the following phase changes are applied to symbol groups 2201, 2202, 2203, and 2204.
For time-domain symbol group 2201, symbol #0 is obtained through a change of phase at time u, symbol #9 is obtained through a change of phase at time u+1, symbol #18 is obtained through a change of phase at time u+2, and symbol #27 is obtained through a change of phase at time u+3.
For time-domain symbol group 2202, symbol #28 is obtained through a change of phase at time u, symbol #1 is obtained through a change of phase at time u+1, symbol #10 is obtained through a change of phase at time u+2, and symbol #19 is obtained through a change of phase at time u+3.
For time-domain symbol group 2203, symbol #20 is obtained through a change of phase at time u, symbol #29 is obtained through a change of phase at time u+1, symbol #2 is obtained through a change of phase at time u+2, and symbol #11 is obtained through a change of phase at time u+3.
For time-domain symbol group 2204, symbol #12 is obtained through a change of phase at time u, symbol #21 is obtained through a change of phase at time u+1, symbol #30 is obtained through a change of phase at time u+2, and symbol #3 is obtained through a change of phase at time u+3.
The characteristic feature of FIG. 22 is seen in that, taking symbol #11 as an example, the two neighbouring symbols thereof having the same time in the frequency domain (#10 and #12) are both symbols changed using a different phase than symbol #11, and the two neighbouring symbols thereof having the same carrier in the time domain (#2 and #20) are both symbols changed using a different phase than symbol #11. This holds not only for symbol #11, but also for any symbol having two neighboring symbols in the frequency domain and the time domain. Accordingly, phase changing is effectively carried out. This is highly likely to improve date reception quality as influence from regularizing direct waves is less prone to reception.
Although FIG. 22 illustrates an example in which n=1, the invention is not limited in this manner. The same may be applied to a case in which n=3. Furthermore, although FIG. 22 illustrates the realization of the above-described effects by arranging the symbols in the frequency domain and advancing in the time domain so as to achieve the characteristic effect of imparting a periodic shift to the symbol arrangement order, the symbols may also be randomly (or regularly) arranged to the same effect.
Embodiment 2
In Embodiment 1, described above, phase changing is applied to a weighted (precoded with a fixed precoding matrix) signal z(t). The following Embodiments describe various phase changing schemes by which the effects of Embodiment 1 may be obtained.
In the above-described Embodiment, as shown in FIGS. 3 and 6, phase changer 317B is configured to perform a change of phase on only one of the signals output by the weighting unit 600.
However, phase changing may also be applied before precoding is performed by the weighting unit 600. In addition to the components illustrated in FIG. 6, the transmission device may also feature the weighting unit 600 before the phase changer 317B, as shown in FIG. 25.
In such circumstances, the following configuration is possible. The phase changer 317B performs a regular change of phase with respect to baseband signal s2(t), on which mapping has been performed according to a selected modulation scheme, and outputs s2′(t)=s2(t) y(t) (where y(t) varies over time t). The weighting unit 600 executes precoding on s2′t, outputs z2(t)=W2s2′(t) (see Math. 42 (formula 42)) and the result is then transmitted.
Alternatively, phase changing may be performed on both modulated signals s1(t) and s2(t). As such, the transmission device is configured so as to include a phase changer taking both signals output by the weighting unit 600, as shown in FIG. 26.
Like phase changer 317B, phase changer 317A performs regular a regular change of phase on the signal input thereto, and as such changes the phase of signal z1′(t) precoded by the weighting unit. Post-phase change signal z1(t) is then output to a transmitter.
However, the phase changing rate applied by the phase changers 317A and 317B varies simultaneously in order to perform the phase changing shown in FIG. 26. (The following describes a non-limiting example of the phase changing scheme.) For time u, phase changer 317A from FIG. 26 performs the change of phase such that z1(t)=y1(t) z1′(t), while phase changer 317B performs the change of phase such that z2(t)=y2(t) z2′(t). For example, as shown in FIG. 26, for time u, y1(u)=ej0 and y2(u)=e−jπ/2, for time u+1, y1(u+1)=ejπ/4 and y2(u+1)=e−j3π/4, and for time u+k, y1(u+k)=ejkx/4 and y2(u+k)=ej(k3π/4-π/2). Here, the regular phase changing period (cycle) may be the same for both phase changers 317A and 317B, or may vary for each.
Also, as described above, a change of phase may be performed before precoding is performed by the weighting unit. In such a case, the transmission device should be configured as illustrated in FIG. 27.
When a change of phase is carried out on both modulated signals, each of the transmit signals is, for example, control information that includes information about the phase changing pattern. By obtaining the control information, the reception device knows the phase changing scheme by which the transmission device regularly varies the change, i.e., the phase changing pattern, and is thus able to demodulate (decode) the signals correctly.
Next, variants of the sample configurations shown in FIGS. 6 and 25 are described with reference to FIGS. 28 and 29. FIG. 28 differs from FIG. 6 in the inclusion of phase change ON/OFF information 2800 and in that the change of phase is performed on only one of z1′(t) and z2′(t) (i.e., performed on one of z1′(t) and z2′(t), which have identical times or a common frequency). Accordingly, in order to perform the change of phase on one of z1′(t) and z2′(t), the phase changers 317A and 317B shown in FIG. 28 may each be ON, and performing the change of phase, or OFF, and not performing the change of phase. The phase change ON/OFF information 2800 is control information therefor. The phase change ON/OFF information 2800 is output by the signal processing scheme information generator 314 shown in FIG. 3.
Phase changer 317A of FIG. 28 changes the phase to produce z1(t)=y1(t) z1′(t), while phase changer 317B changes the phase to produce z2(t)=y2(t) z2′(t).
Here, a change of phase having a period (cycle) of four is, for example, applied to z1′(t). (Meanwhile, the phase of z2′(t) is not changed.) Accordingly, for time u, y1(u)=ej0 and y2(u)=1, for time u+1, y1(u+1)=ejπ/2 and y2(u+1)=1, for time u+2, y1(u+2)=ejπ and y2(u+2)=1, and for time u+3, y1(u+3)=ej3π/2 and y2(u+3)=1.
Next, a change of phase having a period (cycle) of four is, for example, applied to z2′(t). (Meanwhile, the phase of z1′(t) is not changed.) Accordingly, for time u+4, y1(u+4)=1 and y2(u+4)=ej0, for time u+5, y1(u+5)=1 and y2(u+5)=ejπ/2, for time u+6, y1(u+6)=1 and y2(u+6)=ejπ, and for time u+7, y1(u+7)=1 and y2(u+7)=ej3π/2.
Accordingly, given the above examples.
for any time 8k, y1(8k)=ej0 and y2(8k)=1,
for any time 8k+1, y1(8k+1)=ejπ/2 and y2(8k+1)=1,
for any time 8k+2, y1(8k+2)=ejπ and y2(8k+2)=1,
for any time 8k+3, y1(8k+3)=ej3π/2 and y2(8k+3)=1,
for any time 8k+4, y1(8k+4)=1 and y2(8k+4)=ej0,
for any time 8k+5, y1(8k+3)=1 and y2(8k+5)=ejπ/2,
for any time 8k+6, y1(8k+6)=1 and y2(8k+6)=ejπ, and
for any time 8k+7, y1(8k+7)=1 and y2(8k+7)=ej3π/2.
As described above, there are two intervals, one where the change of phase is performed on z1′(t) only, and one where the change of phase is performed on z2′(t) only. Furthermore, the two intervals form a phase changing period (cycle). While the above explanation describes the interval where the change of phase is performed on z1′(t) only and the interval where the change of phase is performed on z2′(t) only as being equal, no limitation is intended in this manner. The two intervals may also differ. In addition, while the above explanation describes performing a change of phase having a period (cycle) of four on z1′(t) only and then performing a change of phase having a period (cycle) of four on z2′(t) only, no limitation is intended in this manner. The changes of phase may be performed on z1′(t) and on z2′(t) in any order (e.g., the change of phase may alternate between being performed on z1′(t) and on z2′(t), or may be performed in random order).
Phase changer 317A of FIG. 29 changes the phase to produce s1′(t)=y1(t)s1(t), while phase changer 317B changes the phase to produce s2′(t)=y2(t) s2(t).
Here, a change of phase having a period (cycle) of four is, for example, applied to s1(t). (Meanwhile, s2(t) remains unchanged). Accordingly, for time u, y1(u)=ej0 and y2(u)=1, for time u+1, y1(u+1)=ejπ/2 and y2(u+1)=1, for time u+2, y1(u+2)=ejπ and y2(u+2)=1, and for time u+3, y1(u+3)=ej3π/2 and y2(u+3)=1.
Next, a change of phase having a period (cycle) of four is, for example, applied to s2(t). (Meanwhile, s1(t) remains unchanged). Accordingly, for time u+4, y1(u+4)=1 and y2(u+4)=ej0, for time u+5, y1(u+5)=1 and y2(u+5)=ejπ/2, for time u+6, y1(u+6)=1 and y2(u+6)=ejπ, and for time u+7, y1(u+7)=1 and y2(u+7)=ej3π/2.
Accordingly, given the above examples,
for any time 8k, y1(8k)=ej0 and y2(8k)=1,
for any time 8k+1, y1(8k+1)=ejπ/2 and y2(8k+1)=1,
for any time 8k+2, y1(8k+2)=ejπ and y2(8k+2)=1,
for any time 8k+3, y1(8k+3)=ej3π/2 and y2(8k+3)=1,
for any time 8k+4, y1(8k+4)=1 and y2(8k+4)=ej0,
for any time 8k+5, y1(8k+5)=1 and y2(8k+5)=ejπ/2,
for any time 8k+6, y1(8k+6)=1 and y2(8k+6)=ejπ, and
for any time 8k+7, y1(8k+7)=1 and y2(8k+7)=ej3π/2.
As described above, there are two intervals, one where the change of phase is performed on s1(t) only, and one where the change of phase is performed on s2(t) only. Furthermore, the two intervals form a phase changing period (cycle). Although the above explanation describes the interval where the change of phase is performed on s1(t) only and the interval where the change of phase is performed on s2(t) only as being equal, no limitation is intended in this manner. The two intervals may also differ. In addition, while the above explanation describes performing the change of phase having a period (cycle) of four on s1(t) only and then performing the change of phase having a period (cycle) of four on s2(t) only, no limitation is intended in this manner. The changes of phase may be performed on s1(t) and on s2(t) in any order (e.g., may alternate between being performed on s1(t) and on s2(t), or may be performed in random order).
Accordingly, the reception conditions under which the reception device receives each transmit signal z1(t) and z2(t) are equalized. By periodically switching the phase of the symbols in the received signals z1(t) and z2(t), the ability of the error corrected codes to correct errors may be improved, thus ameliorating received signal quality in the LOS environment.
Accordingly, Embodiment 2 as described above is able to produce the same results as the previously described Embodiment 1.
Although the present Embodiment used a single-carrier scheme, i.e., time domain phase changing, as an example, no limitation is intended in this regard. The same effects are also achievable using multi-carrier transmission. Accordingly, the present Embodiment may also be realized using, for example, spread-spectrum communications, OFDM, SC-FDMA (Single Carrier Frequency-Division Multiple Access), SC-OFDM, wavelet OFDM as described in Non-Patent Literature 7, and so on. As previously described, while the present Embodiment explains the change of phase as changing the phase with respect to the time domain t, the phase may alternatively be changed with respect to the frequency domain as described in Embodiment 1. That is, considering the phase changing scheme in the time domain t described in the present Embodiment and replacing t with f (f being the ((sub-)carrier) frequency) leads to a change of phase applicable to the frequency domain. Also, as explained above for Embodiment 1, the phase changing scheme of the present Embodiment is also applicable to changing the phase with respect both the time domain and the frequency domain.
Accordingly, although FIGS. 6, 25, 26, and 27 illustrate changes of phase in the time domain, replacing time t with carrier f in each of FIGS. 6, 25, 26, and 27 corresponds to a change of phase in the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing the change of phase on time-frequency blocks.
Furthermore, in the present Embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, etc) or symbols transmitting control information, may be arranged within the frame in any manner.
Embodiment 3
Embodiments 1 and 2, described above, discuss regular changes of phase. Embodiment 3 describes a scheme of allowing the reception device to obtain good received signal quality for data, regardless of the reception device arrangement, by considering the location of the reception device with respect to the transmission device.
Embodiment 3 concerns the symbol arrangement within signals obtained through a change of phase.
FIG. 31 illustrates an example of frame configuration for a portion of the symbols within a signal in the time-frequency domain, given a transmission scheme where a regular change of phase is performed for a multi-carrier scheme such as OFDM.
First, an example is explained in which the change of phase is performed one of two baseband signals, precoded as explained in Embodiment 1 (see FIG. 6).
(Although FIG. 6 illustrates a change of phase in the time domain, switching time t with carrier f in FIG. 6 corresponds to a change of phase in the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing phase changes on time-frequency blocks.)
FIG. 31 illustrates the frame configuration of modulated signal z2′, which is input to phase changer 317B from FIG. 12. Each square represents one symbol (although both signals s1 and s2 are included for precoding purposes, depending on the precoding matrix, only one of signals s1 and s2 may be used).
Consider symbol 3100 at carrier 2 and time $2 of FIG. 31. The carrier here described may alternatively be termed a sub-carrier.
Within carrier 2, there is a very strong correlation between the channel conditions for symbol 3100 at carrier 2, time $2 and the channel conditions for the time domain nearest-neighbour symbols to time $2, i.e., symbol 3013 at time $1 and symbol 3101 at time $3 within carrier 2.
Similarly, for time $2, there is a very strong correlation between the channel conditions for symbol 3100 at carrier 2, time $2 and the channel conditions for the frequency-domain nearest-neighbour symbols to carrier 2, i.e., symbol 3104 at carrier 1, time $2 and symbol 3104 at time $2, carrier 3.
As described above, there is a very strong correlation between the channel conditions for symbol 3100 and the channel conditions for symbols 3101, 3102, 3103, and 3104.
The present description considers N different phases (N being an integer, N≧2) for multiplication in a transmission scheme where the phase is regularly changed. The symbols illustrated in FIG. 31 are indicated as ej0, for example. This signifies that this symbol is signal z2′ from FIG. 6 phase-changed through multiplication by ej0. That is, the values indicated in FIG. 31 for each of the symbols are the values of y(t) from Math. 42 (formula 42), which are also the values of z2(t)=y2(t) z2′(t) described in Embodiment 2.
The present Embodiment takes advantage of the high correlation in channel conditions existing between neighbouring symbols in the frequency domain and/or neighbouring symbols in the time domain in a symbol arrangement enabling high data reception quality to be obtained by the reception device receiving the phase-changed symbols.
In order to achieve this high data reception quality, conditions #1 and #2 are necessary.
(Condition #1)
As shown in FIG. 6, for a transmission scheme involving a regular change of phase performed on precoded baseband signal z2′ using multi-carrier transmission such as OFDM, time X, carrier Y is a symbol for transmitting data (hereinafter, data symbol), neighbouring symbols in the time domain, i.e., at time X−1, carrier Y and at time X+1, carrier Y are also data symbols, and a different change of phase should be performed on precoded baseband signal z2′ corresponding to each of these three data symbols, i.e., on precoded baseband signal z2′ at time X, carrier Y, at time X−1, carrier Y and at time X+1, carrier Y.
(Condition #2)
As shown in FIG. 6, for a transmission scheme involving a regular change of phase performed on precoded baseband signal z2′ using multi-carrier transmission such as OFDM, time X, carrier Y is a data symbol, neighbouring symbols in the frequency domain, i.e., at time X, carrier Y−1 and at time X, carrier Y+1 are also data symbols, and a different change of phase should be performed on precoded baseband signal z2′ corresponding to each of these three data symbols, i.e., on precoded baseband signal z2′ at time X, carrier Y, at time X, carrier Y−1 and at time X, carrier Y+1.
Ideally, data symbols satisfying Condition #1 should be present. Similarly, data symbols satisfying Condition #2 should be present.
The reasons supporting Conditions #1 and #2 are as follows.
A very strong correlation exists between the channel conditions of given symbol of a transmit signal (hereinafter, symbol A) and the channel conditions of the symbols neighbouring symbol A in the time domain, as described above.
Accordingly, when three neighbouring symbols in the time domain each have different phases, then despite reception quality degradation in the LOS environment (poor signal quality caused by degradation in conditions due to direct wave phase relationships despite high signal quality in terms of SNR) for symbol A, the two remaining symbols neighbouring symbol A are highly likely to provide good reception quality. As a result, good received signal quality is achievable after error correction and decoding.
Similarly, a very strong correlation exists between the channel conditions of given symbol of a transmit signal (hereinafter, symbol A) and the channel conditions of the symbols neighbouring symbol A in the frequency domain, as described above.
Accordingly, when three neighbouring symbols in the frequency domain each have different phases, then despite reception quality degradation in the LOS environment (poor signal quality caused by degradation in conditions due to direct wave phase relationships despite high signal quality in terms of SNR) for symbol A, the two remaining symbols neighbouring symbol A are highly likely to provide good reception quality. As a result, good received signal quality is achievable after error correction and decoding.
Combining Conditions #1 and #2, ever greater data reception quality is likely achievable for the reception device. Accordingly, the following Condition #3 can be derived.
(Condition #3)
As shown in FIG. 6, for a transmission scheme involving a regular change of phase performed on precoded baseband signal z2′ using multi-carrier transmission such as OFDM, time X, carrier Y is a data symbol, neighbouring symbols in the time domain, i.e., at time X−1, carrier Y and at time X+1, carrier Y are also data symbols, and neighbouring symbols in the frequency domain, i.e., at time X, carrier Y−1 and at time X, carrier Y+1 are also data symbols, and a different change in phase should be performed on precoded baseband signal z2′ corresponding to each of these five data symbols, i.e., on precoded baseband signal z2′ at time X, carrier Y, at time X, carrier Y−1, at time X, carrier Y+1, at a time X−1, carrier Y, and at time X+1, carrier Y.
Here, the different changes in phase are as follows. Changes in phase are defined from 0 radians to 2π radians. For example, for time X, carrier Y, a phase change of ejθX,Y is applied to precoded baseband signal z2′ from FIG. 6, for time X−1, carrier Y, a phase change of ejθX−1,Y is applied to precoded baseband signal z2′ from FIG. 6, for time X+1, carrier Y, a phase change of ejθX+1,Y is applied to precoded baseband signal z2′ from FIG. 6, such that 0≦θX,Y≦2π, 0≦θX−1,Y<2π, and 0≦θX+1,Y<2π, all units being in radians. Accordingly, for Condition #1, it follows that θX,Y≠θX−1,Y, θX,Y≠θX+1,Y, and that θX−1,Y≠θX+1,Y. Similarly, for Condition #2, it follows that θX,Y≠θX,Y−1, θX,Y≠θX,Y+1, and that θX,Y−1≠θX,Y+1. And, for Condition #3, it follows that θX,Y≠θX−1,Y, θX,Y≠θX+1,Y, θX,Y≠θX,Y−1, θX,Y≠θX,Y−1, θX−1,Y≠θX+1,Y, θX−1,Y≠θX,Y−1, θX−1,Y≠θX+1,Y, θX+1,Y≠θX−1,Y, θX+1,Y≠θX,Y+1, and that θX,Y−1≠θX,Y+1.
Ideally, a data symbol should satisfy Condition #3.
FIG. 31 illustrates an example of Condition #3 where symbol A corresponds to symbol 3100. The symbols are arranged such that the phase by which precoded baseband signal z2′ from FIG. 6 is multiplied differs for symbol 3100, for both neighbouring symbols thereof in the time domain 3101 and 3102, and for both neighbouring symbols thereof in the frequency domain 3102 and 3104. Accordingly, despite received signal quality degradation of symbol 3100 for the receiver, good signal quality is highly likely for the neighbouring signals, thus guaranteeing good signal quality after error correction.
FIG. 32 illustrates a symbol arrangement obtained through phase changes under these conditions.
As evident from FIG. 32, with respect to any data symbol, a different change in phase is applied to each neighbouring symbol in the time domain and in the frequency domain. As such, the ability of the reception device to correct errors may be improved.
In other words, in FIG. 32, when all neighbouring symbols in the time domain are data symbols, Condition #1 is satisfied for all Xs and all Ys.
Similarly, in FIG. 32, when all neighbouring symbols in the frequency domain are data symbols, Condition #2 is satisfied for all Xs and all Ys.
Similarly, in FIG. 32, when all neighbouring symbols in the frequency domain are data symbols and all neighbouring symbols in the time domain are data symbols, Condition #3 is satisfied for all Xs and all Ys.
The following describes an example in which a change of phase is performed on two precoded baseband signals, as explained in Embodiment 2 (see FIG. 26).
When a change of phase is performed on precoded baseband signal z1′ and precoded baseband signal z2′ as shown in FIG. 26, several phase changing schemes are possible. The details thereof are explained below.
Scheme 1 involves a change in phase performed on precoded baseband signal z2′ as described above, to achieve the change in phase illustrated by FIG. 32. In FIG. 32, a change of phase having a period (cycle) of 10 is applied to precoded baseband signal z2′. However, as described above, in order to satisfy Conditions #1, #2, and #3, the change in phase applied to precoded baseband signal z2′ at each (sub-)carrier varies over time. (Although such changes are applied in FIG. 32 with a period (cycle) of ten, other phase changing schemes are also possible.) Then, as shown in FIG. 33, the change in phase performed on precoded baseband signal z1′ produces a constant value that is one-tenth of that of the change in phase performed on precoded baseband signal z2′. In FIG. 33, for a period (cycle) (of change in phase performed on precoded baseband signal z2′) including time $1, the value of the change in phase performed on precoded baseband signal z1′ is ej0. Then, for the next period (cycle) (of change in phase performed on precoded baseband signal z2′) including time $2, the value of the change in phase performed on precoded baseband signal z1′ is ejπ/9, and so on.
The symbols illustrated in FIG. 33 are indicated as ej0, for example. This signifies that this symbol is signal z1′ from FIG. 26 on which a change in phase as been applied through multiplication by ej0. That is, the values indicated in FIG. 33 for each of the symbols are the values of z1′(t)=y2(t) z1′(t) described in Embodiment 2 for y1(t).
As shown in FIG. 33, the change in phase performed on precoded baseband signal z1′ produces a constant value that is one-tenth that of the change in phase performed on precoded baseband signal z2′ such that the post-phase change value varies with the number of each period (cycle). (As described above, in FIG. 33, the value is ej0 for the first period (cycle), ejπ/9 for the second period (cycle), and so on.)
As described above, the change in phase performed on precoded baseband signal z2′ has a period (cycle) of ten, but the period (cycle) can be effectively made greater than ten by taking the change in phase applied to precoded baseband signal z1′ and to precoded baseband signal z2′ into consideration. Accordingly, data reception quality may be improved for the reception device.
Scheme 2 involves a change in phase of precoded baseband signal z2′ as described above, to achieve the change in phase illustrated by FIG. 32. In FIG. 32, a change of phase having a period (cycle) of ten is applied to precoded baseband signal z2′. However, as described above, in order to satisfy Conditions #1, #2, and #3, the change in phase applied to precoded baseband signal z2′ at each (sub-)carrier varies over time. (Although such changes are applied in FIG. 32 with a period (cycle) of ten, other phase changing schemes are also possible.) Then, as shown in FIG. 30, the change in phase performed on precoded baseband signal z1′ differs from that performed on precoded baseband signal z2′ in having a period (cycle) of three rather than ten.
The symbols illustrated in FIG. 30 are indicated as ej0, for example. This signifies that this symbol is signal z1′ from FIG. 26 to which a change in phase has been applied through multiplication by ej0. That is, the values indicated in FIG. 30 for each of the symbols are the values of z1(t)=y1(t)z1′(t) described in Embodiment 2 for y1(t).
As described above, the change in phase performed on precoded baseband signal z2′ has a period (cycle) of ten, but by taking the changes in phase applied to precoded baseband signal z1′ and precoded baseband signal z2′ into consideration, the period (cycle) can be effectively made equivalent to 30 for both precoded baseband signals z1′ and z2′. Accordingly, data reception quality may be improved for the reception device. An effective way of applying scheme 2 is to perform a change in phase on precoded baseband signal z1′ with a period (cycle) of N and perform a change in phase on precoded baseband signal z2′ with a period (cycle) of M such that N and M are coprime. As such, by taking both precoded baseband signals z1′ and z2′ into consideration, a period (cycle) of N×M is easily achievable, effectively making the period (cycle) greater when N and M are coprime.
The above describes an example of the phase changing scheme pertaining to Embodiment 3. The present invention is not limited in this manner. As explained for Embodiments 1 and 2, a change in phase may be performed with respect the frequency domain or the time domain, or on time-frequency blocks. Similar improvement to the data reception quality can be obtained for the reception device in all cases.
The same also applies to frames having a configuration other than that described above, where pilot symbols (SP (Scattered Pilot) and symbols transmitting control information are inserted among the data symbols. The details of change in phase in such circumstances are as follows.
FIGS. 47A and 47B illustrate the frame configuration of modulated signals (precoded baseband signals) z1 or z1′ and z2′ in the time-frequency domain. FIG. 47A illustrates the frame configuration of modulated signal (precoded baseband signals) z1 or z1′ while FIG. 47B illustrates the frame configuration of modulated signal (precoded baseband signals) z2′. In FIGS. 47A and 47B, 4701 marks pilot symbols while 4702 marks data symbols. The data symbols 4702 are symbols on which precoding or precoding and a change in phase have been performed.
FIGS. 47A and 47B, like FIG. 6, indicate the arrangement of symbols when a change in phase is applied to precoded baseband signal z2′ (while no change of phase is performed on precoded baseband signal z1). (Although FIG. 6 illustrates a change in phase with respect to the time domain, switching time t with carrier f in FIG. 6 corresponds to a change in phase with respect to the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing a change of phase on time-frequency blocks.) Accordingly, the numerical values indicated in FIGS. 47A and 47B for each of the symbols are the values of precoded baseband signal z2′ after the change in phase. No values are given for the symbols of precoded baseband signal z1′ (z1) as no change in phase is performed thereon.
The key point of FIGS. 47A and 47B is that the change in phase is performed on the data symbols of precoded baseband signal z2′, i.e., on precoded symbols. (The symbols under discussion, being precoded, actually include both symbols s1 and s2.) Accordingly, no change of phase is performed on the pilot symbols inserted into z2′.
FIGS. 48A and 48B illustrate the frame configuration of modulated signals (precoded baseband signals) z1 or z1′ and z2′ in the time-frequency domain. FIG. 48A illustrates the frame configuration of modulated signal (precoded baseband signals) z1 or z1′ while FIG. 47B illustrates the frame configuration of modulated signal (precoded baseband signals) z2′. In FIGS. 48A and 48B, 4701 marks pilot symbols while 4702 marks data symbols. The data symbols 4702 are symbols on which precoding, or precoding and a change in phase, have been performed.
FIGS. 48A and 48B, like FIG. 26, indicate the arrangement of symbols when a change in phase is applied to precoded baseband signal z1′ and to precoded baseband signal z2′. (Although FIG. 26 illustrates a change in phase with respect to the time domain, switching time t with carrier f in FIG. 26 corresponds to a change in phase with respect to the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing a change of phase on time-frequency blocks.) Accordingly, the numerical values indicated in FIGS. 48A and 48B for each of the symbols are the values of precoded baseband signal z1′ and z2′ after the change in phase.
The key point of FIG. 47 is that a change of phase is performed on the data symbols of precoded baseband signal z1′, that is, on the precoded symbols thereof, and on the data symbols of precoded baseband signal z2′, that is, on the precoded symbols thereof. (The symbols under discussion, being precoded, actually include both symbols s1 and s2.) Accordingly, no change of phase is performed on the pilot symbols inserted in z1′, nor on the pilot symbols inserted in z2′.
FIGS. 49A and 49B illustrate the frame configuration of modulated signals (precoded baseband signals) z1 or z1′ and z2′ in the time-frequency domain. FIG. 49A illustrates the frame configuration of modulated signal (precoded baseband signals) z1 or z1′ while FIG. 49B illustrates the frame configuration of modulated signal (precoded baseband signal) z2′. In FIGS. 49A and 49B, 4701 marks pilot symbols, 4702 marks data symbols, and 4901 marks null symbols for which the in-phase component of the baseband signal I=0 and the quadrature component Q=0. As such, data symbols 4702 are symbols on which precoding or precoding and the change in phase have been performed. FIGS. 49A and 49B differ from FIGS. 47A and 47B in the configuration scheme for symbols other than data symbols. The times and carriers at which pilot symbols are inserted into modulated signal z1′ are null symbols in modulated signal z2′. Conversely, the times and carriers at which pilot symbols are inserted into modulated signal z2′ are null symbols in modulated signal z1′.
FIGS. 49A and 49B, like FIG. 6, indicate the arrangement of symbols when a change in phase is applied to precoded baseband signal z2′ (while no change of phase is performed on precoded baseband signal z1). (Although FIG. 6 illustrates a change of phase with respect to the time domain, switching time t with carrier f in FIG. 6 corresponds to a change of phase with respect to the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing a change of phase on time-frequency blocks.) Accordingly, the numerical values indicated in FIGS. 49A and 49B for each of the symbols are the values of precoded baseband signal z2′ after a change of phase is performed. No values are given for the symbols of precoded baseband signal z1′ (z1) as no change of phase is performed thereon.
The key point of FIGS. 49A and 49B is that a change of phase is performed on the data symbols of precoded baseband signal z2′, i.e., on precoded symbols. (The symbols under discussion, being precoded, actually include both symbols s1 and s2.) Accordingly, no change of phase is performed on the pilot symbols inserted into z2′.
FIGS. 50A and 50B illustrate the frame configuration of modulated signals (precoded baseband signals) z1 or z1′ and z2′ in the time-frequency domain. FIG. 50A illustrates the frame configuration of modulated signal (precoded baseband signal) z1 or z1′ while FIG. 50B illustrates the frame configuration of modulated signal (precoded baseband signal) z2′. In FIGS. 50A and 50B, 4701 marks pilot symbols, 4702 marks data symbols, and 4901 marks null symbols for which the in-phase component of the baseband signal I=0 and the quadrature component Q=0. As such, data symbols 4702 are symbols on which precoding, or precoding and a change of phase, have been performed. FIGS. 50A and 50B differ from FIGS. 48A and 48B in the configuration scheme for symbols other than data symbols. The times and carriers at which pilot symbols are inserted into modulated signal z1′ are null symbols in modulated signal z2′. Conversely, the times and carriers at which pilot symbols are inserted into modulated signal z2′ are null symbols in modulated signal z1′.
FIGS. 50A and 50B, like FIG. 26, indicate the arrangement of symbols when a change of phase is applied to precoded baseband signal z1′ and to precoded baseband signal z2′. (Although FIG. 26 illustrates a change of phase with respect to the time domain, switching time t with carrier f in FIG. 26 corresponds to a change of phase with respect to the frequency domain. In other words, replacing (t) with (t, f) where t is time and f is frequency corresponds to performing a change of phase on time-frequency blocks.) Accordingly, the numerical values indicated in FIGS. 50A and 50B for each of the symbols are the values of precoded baseband signal z1′ and z2′ after a change of phase.
The key point of FIGS. 50A and 50B is that a change of phase is performed on the data symbols of precoded baseband signal z1′, that is, on the precoded symbols thereof, and on the data symbols of precoded baseband signal z2′, that is, on the precoded symbols thereof. (The symbols under discussion, being precoded, actually include both symbols s1 and s2.) Accordingly, no change of phase is performed on the pilot symbols inserted in z1′, nor on the pilot symbols inserted in z2′.
FIG. 51 illustrates a sample configuration of a transmission device generating and transmitting modulated signal having the frame configuration of FIGS. 47A, 47B, 49A, and 49B. Components thereof performing the same operations as those of FIG. 4 use the same reference symbols thereas.
In FIG. 51, the weighting units 308A and 308B and phase changer 317B only operate at times indicated by the frame configuration signal 313 as corresponding to data symbols.
In FIG. 51, a pilot symbol generator 5101 (that also generates null symbols) outputs baseband signals 5102A and 5102B for a pilot symbol whenever the frame configuration signal 313 indicates a pilot symbol (or a null symbol).
Although not indicated in the frame configurations from FIGS. 47A through 50B, when precoding (or phase rotation) is not performed, such as when transmitting a modulated signal using only one antenna (such that the other antenna transmits no signal) or when using a space-time coding transmission scheme (particularly, space-time block coding) to transmit control information symbols, then the frame configuration signal 313 takes control information symbols 5104 and control information 5103 as input. When the frame configuration signal 313 indicates a control information symbol, baseband signals 5102A and 5102B thereof are output.
Wireless units 310A and 310B of FIG. 51 take a plurality of baseband signals as input and select a desired baseband signal according to the frame configuration signal 313. Wireless units 310A and 310B then apply OFDM signal processing and output modulated signals 311A and 311B conforming to the frame configuration.
FIG. 52 illustrates a sample configuration of a transmission device generating and transmitting modulated signal having the frame configuration of FIGS. 48A, 48B, 50A, and 50B. Components thereof performing the same operations as those of FIGS. 4 and 51 use the same reference symbols thereas. FIG. 51 features an additional phase changer 317A that only operates when the frame configuration signal 313 indicates a data symbol. At all other times, the operations are identical to those explained for FIG. 51.
FIG. 53 illustrates a sample configuration of a transmission device that differs from that of FIG. 51. The following describes the points of difference. As shown in FIG. 53, phase changer 317B takes a plurality of baseband signals as input. Then, when the frame configuration signal 313 indicates a data symbol, phase changer 317B performs a change of phase on precoded baseband signal 316B. When frame configuration signal 313 indicates a pilot symbol (or null symbol) or a control information symbol, phase changer 317B pauses phase changing operations, such that the symbols of the baseband signal are output as-is. (This may be interpreted as performing forced rotation corresponding to ej0.)
A selector 5301 takes the plurality of baseband signals as input and selects a baseband signal having a symbol indicated by the frame configuration signal 313 for output.
FIG. 54 illustrates a sample configuration of a transmission device that differs from that of FIG. 52. The following describes the points of difference. As shown in FIG. 54, phase changer 317B takes a plurality of baseband signals as input. Then, when the frame configuration signal 313 indicates a data symbol, phase changer 317B performs a change of phase on precoded baseband signal 316B. When frame configuration signal 313 indicates a pilot symbol (or null symbol) or a control information symbol, phase changer 317B pauses phase changing operations such that the symbols of the baseband signal are output as-is. (This may be interpreted as performing forced rotation corresponding to ej0.)
Similarly, as shown in FIG. 54, phase changer 5201 takes a plurality of baseband signals as input. Then, when the frame configuration signal 313 indicates a data symbol, phase changer 5201 performs a change of phase on precoded baseband signal 309A. When frame configuration signal 313 indicates a pilot symbol (or null symbol) or a control information symbol, phase changer 5201 pauses phase changing operations such that the symbols of the baseband signal are output as-is. (This may be interpreted as performing forced rotation corresponding to ej0.)
The above explanations are given using pilot symbols, control symbols, and data symbols as examples. However, the present invention is not limited in this manner. When symbols are transmitted using schemes other than precoding, such as single-antenna transmission or transmission using space-time block coding, not performing a change of phase is important. Conversely, performing a change of phase on symbols that have been precoded is the key point of the present invention.
Accordingly, a characteristic feature of the present invention is that the change of phase is not performed on all symbols within the frame configuration in the time-frequency domain, but only performed on signals that have been precoded.
Embodiment 4
Embodiments 1 and 2, described above, discuss a regular change of phase. Embodiment 3, however, discloses performing a different change of phase on neighbouring symbols.
The present Embodiment describes a phase changing scheme that varies according to the modulation scheme and the coding rate of the error-correcting codes used by the transmission device.
Table 1, below, is a list of phase changing scheme settings corresponding to the settings and parameters of the transmission device.










TABLE 1





No.





of Modulated


Phase


Transmission


Changing


Signals
Modulation Scheme
Coding Rate
Pattern







2
#1: QPSK, #2: QPSK
#1: 1/2, #2 2/3
#1: —, #2: A


2
#1: QPSK, #2: QPSK
#1: 1/2, #2:
#1: A, #2: B




3/4


2
#1: QPSK, #2: QPSK
#1: 2/3, #2:
#1: A, #2: C




3/5


2
#1: QPSK, #2: QPSK
#1: 2/3, #2:
#1: C, #2: —




2/3


2
#1: QPSK, #2: QPSK
#1: 3/3, #2:
#1: D, #2: E




2/3


2
#1: QPSK, #2: 16-QAM
#1: 1/2, #2:
#1: B, #2: A




2/3


2
#1: QPSK, #2: 16-QAM
#1: 1/2, #2:
#1: A, #2: C




3/4


2
#1: QPSK, #2: 16-QAM
#1: 1/2, #2:
#1: —, #2: E




3/5


2
#1: QPSK, #2: 16-QAM
#1: 2/3, #2:
#1: D, #2: —




3/4


2
#1: QPSK, #2: 16-QAM
#1: 2/3, #2:
#1: D, #2: B




5/6


2
#1: 16-QAM, #2:
#1: 1/2, #2:
#1: —, #2: E



16-QAM
2/3


.
.
.
.


.
.
.
.


.
.
.
.









In Table 1, #1 denotes modulated signal s1 from Embodiment 1 described above (baseband signal s1 modulated with the modulation scheme set by the transmission device) and #2 denotes modulated signal s2 (baseband signal s2 modulated with the modulation scheme set by the transmission device). The coding rate column of Table 1 indicates the coding rate of the error-correcting codes for modulation schemes #1 and #2. The phase changing pattern column of Table 1 indicates the phase changing scheme applied to precoded baseband signals z1 (z1′) and z2 (z2′), as explained in Embodiments 1 through 3. Although the phase changing patterns are labeled A, B, C, D, E, and so on, this refers to the phase change degree applied, for example, in a phase changing pattern given by Math. 46 (formula 46) and Math. 47 (formula 47), above. In the phase changing pattern column of Table 1, the dash signifies that no change of phase is applied.
The combinations of modulation scheme and coding rate listed in Table 1 are examples. Other modulation schemes (such as 128-QAM and 256-QAM) and coding rates (such as 7⁄8) not listed in Table 1 may also be included. Also, as described in Embodiment 1, the error-correcting codes used for s1 and s2 may differ (Table 1 is given for cases where a single type of error-correcting codes is used, as in FIG. 4). Furthermore, the same modulation scheme and coding rate may be used with different phase changing patterns. The transmission device transmits information indicating the phase changing patterns to the reception device. The reception device specifies the phase changing pattern by cross-referencing the information and Table 1, then performs demodulation and decoding. When the modulation scheme and error-correction scheme determine a unique phase changing pattern, then as long as the transmission device transmits the modulation scheme and information regarding the error-correction scheme, the reception device knows the phase changing pattern by obtaining that information. As such, information pertaining to the phase changing pattern is not strictly necessary.
In Embodiments 1 through 3, the change of phase is applied to precoded baseband signals. However, the amplitude may also be modified along with the phase in order to apply periodical, regular changes. Accordingly, an amplification modification pattern regularly modifying the amplitude of the modulated signals may also be made to conform to Table 1. In such circumstances, the transmission device should include an amplification modifier that modifies the amplification after weighting unit 308A or weighting unit 308B from FIG. 3 or 4. In addition, amplification modification may be performed on only one of or on both of the precoded baseband signals z1(t) and z2(t) (in the former case, the amplification modifier is only needed after one of weighting unit 308A and 308B).
Furthermore, although not indicated in Table 1 above, the mapping scheme may also be regularly modified by the mapper, without a regular change of phase.
That is, when the mapping scheme for modulated signal s 1(t) is 16-QAM and the mapping scheme for modulated signal s2(t) is also 16-QAM, the mapping scheme applied to modulated signal s2(t) may be regularly changed as follows: from 16-QAM to 16-APSK, to 16-QAM in the IQ plane, to a first mapping scheme producing a signal point layout unlike 16-APSK, to 16-QAM in the IQ plane, to a second mapping scheme producing a signal point layout unlike 16-APSK, and so on. As such, the data reception quality can be improved for the reception device, much like the results obtained by a regular change of phase described above.
In addition, the present invention may use any combination of schemes for a regular change of phase, mapping scheme, and amplitude, and the transmit signal may transmit with all of these taken into consideration.
The present Embodiment may be realized using single-carrier schemes as well as multi-carrier schemes. Accordingly, the present Embodiment may also be realized using, for example, spread-spectrum communications, OFDM, SC-FDM, SC-OFDM, wavelet OFDM as described in Non-Patent Literature 7, and so on. As described above, the present Embodiment describes changing the phase, amplitude, and mapping schemes by performing phase, amplitude, and mapping scheme modifications with respect to the time domain t. However, much like Embodiment 1, the same changes may be carried out with respect to the frequency domain. That is, considering the phase, amplitude, and mapping scheme modification in the time domain t described in the present Embodiment and replacing t with f (f being the ((sub-)carrier) frequency) leads to phase, amplitude, and mapping scheme modification applicable to the frequency domain. Also, the phase, amplitude, and mapping scheme modification of the present Embodiment is also applicable to phase, amplitude, and mapping scheme modification in both the time domain and the frequency domain.
Furthermore, in the present Embodiment, symbols other than data symbols, such as pilot symbols (preamble, unique word, etc) or symbols transmitting control information, may be arranged within the frame in any manner.
Embodiment A1
The present Embodiment describes a scheme for regularly changing the phase when encoding is performed using block codes as described in Non-Patent Literature 12 through 15, such as QC (Quasi-Cyclic) LDPC Codes (not only QC-LDPC but also LDPC codes may be used), concatenated LDPC and BCH (Bose-Chaudhuri-Hocquenghem) codes, Turbo codes or Duo-Binary Turbo Codes using tail-biting, and so on. The following example considers a case where two streams s1 and s2 are transmitted. However, when encoding has been performed using block codes and control information and the like is not required, the number of bits making up each coded block matches the number of bits making up each block code (control information and so on described below may yet be included). When encoding has been performed using block codes or the like and control information or the like (e.g., CRC (cyclic redundancy check) transmission parameters) is required, then the number of bits making up each coded block is the sum of the number of bits making up the block codes and the number of bits making up the information.
FIG. 34 illustrates the varying numbers of symbols and slots needed in each coded block when block codes are used. FIG. 34 illustrates the varying numbers of symbols and slots needed in each coded block when block codes are used when, for example, two streams s1 and s2 are transmitted as indicated by the transmission device from FIG. 4, and the transmission device has only one encoder. (Here, the transmission scheme may be any single-carrier scheme or multi-carrier scheme such as OFDM.)
As shown in FIG. 34, when block codes are used, there are 6000 bits making up a single coded block. In order to transmit these 6000 bits, the number of required symbols depends on the modulation scheme, being 3000 symbols for QPSK, 1500 symbols for 16-QAM, and 1000 symbols for 64-QAM.
Then, given that the transmission device from FIG. 4 transmits two streams simultaneously, 1500 of the aforementioned 3000 symbols needed when the modulation scheme is QPSK are assigned to s1 and the other 1500 symbols are assigned to s2. As such, 1500 slots for transmitting the 1500 symbols (hereinafter, slots) are required for each of s1 and s2.
By the same reasoning, when the modulation scheme is 16-QAM, 750 slots are needed to transmit all of the bits making up a single coded block, and when the modulation scheme is 64-QAM, 500 slots are needed to transmit all of the bits making up a single coded block.
The following describes the relationship between the above-defined slots and the phase of multiplication, as pertains to schemes for a regular change of phase.
Here, five different phase changing values (or phase changing sets) are assumed as having been prepared for use in the scheme for a regular change of phase. That is, five different phase changing values (or phase changing sets) have been prepared for the phase changer of the transmission device from FIG. 4 (equivalent to the period (cycle) from Embodiments 1 through 4) (As in FIG. 6, five phase changing values are needed in order to perform a change of phase with a period (cycle) of five on precoded baseband signal z2′ only. Also, as in FIG. 26, two phase changing values are needed for each slot in order to perform the change of phase on both precoded baseband signals z1′ and z2′. These two phase changing values are termed a phase changing set. Accordingly, five phase changing sets should ideally be prepared in order to perform the change of phase with a period (cycle) of five in such circumstances). These five phase changing values (or phase changing sets) are expressed as PHASE[0], PHASE[1], PHASE[2], PHASE[3], and PHASE[4].
For the above-described 1500 slots needed to transmit the 6000 bits making up a single coded block when the modulation scheme is QPSK, PHASE[0] is used on 300 slots, PHASE[1] is used on 300 slots, PHASE[2] is used on 300 slots, PHASE[3] is used on 300 slots, and PHASE[4] is used on 300 slots. This is due to the fact that any bias in phase usage causes great influence to be exerted by the more frequently used phase, and that the reception device is dependent on such influence for data reception quality.
Similarly, for the above-described 700 slots needed to transmit the 6000 bits making up a single coded block when the modulation scheme is 16-QAM, PHASE[0] is used on 150 slots, PHASE[1] is used on 150 slots, PHASE[2] is used on 150 slots, PHASE[3] is used on 150 slots, and PHASE[4] is used on 150 slots.
Furthermore, for the above-described 500 slots needed to transmit the 6000 bits making up a single coded block when the modulation scheme is 64-QAM, PHASE[0] is used on 100 slots, PHASE[1] is used on 100 slots, PHASE[2] is used on 100 slots, PHASE[3] is used on 100 slots, and PHASE[4] is used on 100 slots.
As described above, a scheme for a regular change of phase requires the preparation of N phase changing values (or phase changing sets) (where the N different phases are expressed as PHASE[0], PHASE[1], PHASE[2] . . . PHASE[N−2], PHASE[N−1]). As such, in order to transmit all of the bits making up a single coded block, PHASE[0] is used on K0 slots, PHASE[1] is used on K1 slots, PHASE[i] is used on Ki slots (where i=0, 1, 2 . . . N−1 (i denotes an integer that satisfies 0≦i≦N−1)), and PHASE[N−1] is used on KN-1 slots, such that Condition #A01 is met.
(Condition #A01)
K0=K1 . . . =Ki= . . . KN-1. That is, Ka=Kb (∀a and ∀b where a, b, =0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).
Then, when a communication system that supports multiple modulation schemes selects one such supported modulation scheme for use, Condition #A01 is preferably satisfied for the supported modulation scheme.
However, when multiple modulation schemes are supported, each such modulation scheme typically uses symbols transmitting a different number of bits per symbols (though some may happen to use the same number), Condition #A01 may not be satisfied for some modulation schemes. In such a case, the following condition applies instead of Condition #A01.
(Condition #A02)
The difference between Ka and Kb satisfies 0 or 1. That is, |Ka−Kb| satisfies 0 or 1 (∀a, ∀b, where a, b=0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b)
FIG. 35 illustrates the varying numbers of symbols and slots needed in two coded blocks when block codes are used. FIG. 35 illustrates the varying numbers of symbols and slots needed in each coded block when block codes are used when, for example, two streams s1 and s2 are transmitted as indicated by the transmission device from FIG. 3 and FIG. 12, and the transmission device has two encoders. (Here, the transmission scheme may be any single-carrier scheme or multi-carrier scheme such as OFDM.)
As shown in FIG. 35, when block codes are used, there are 6000 bits making up a single coded block. In order to transmit these 6000 bits, the number of required symbols depends on the modulation scheme, being 3000 symbols for QPSK, 1500 symbols for 16-QAM, and 1000 symbols for 64-QAM.
The transmission device from FIG. 3 and the transmission device from FIG. 12 each transmit two streams at once, and have two encoders. As such, the two streams each transmit different code blocks. Accordingly, when the modulation scheme is QPSK, two coded blocks drawn from s1 and s2 are transmitted within the same interval, e.g., a first coded block drawn from s1 is transmitted, then a second coded block drawn from s2 is transmitted. As such, 3000 slots are needed in order to transmit the first and second coded blocks.
By the same reasoning, when the modulation scheme is 16-QAM, 1500 slots are needed to transmit all of the bits making up the two coded blocks, and when the modulation scheme is 64-QAM, 1000 slots are needed to transmit all of the bits making up the two coded blocks.
The following describes the relationship between the above-defined slots and the phase of multiplication, as pertains to schemes for a regular change of phase.
Here, five different phase changing values (or phase changing sets) are assumed as having been prepared for use in the scheme for a regular change of phase. That is, five different phase changing values (or phase changing sets) have been prepared for the phase changers of the transmission devices from FIGS. 3 and 12 (equivalent to the period (cycle) from Embodiments 1 through 4) (As in FIG. 6, five phase changing values are needed in order to perform a change of phase having a period (cycle) of five on precoded baseband signal z2′ only. Also, as in FIG. 26, two phase changing values are needed for each slot in order to perform the change of phase on both precoded baseband signals z1′ and z2′. These two phase changing values are termed a phase changing set. Accordingly, five phase changing sets should ideally be prepared in order to perform the change of phase with a period (cycle) of five in such circumstances). These five phase changing values (or phase changing sets) are expressed as PHASE[0], PHASE[1], PHASE[2], PHASE[3], and PHASE[4].
For the above-described 3000 slots needed to transmit the 6000×2 bits making up a single coded block when the modulation scheme is QPSK, PHASE[0] is used on 600 slots, PHASE[1] is used on 600 slots, PHASE[2] is used on 600 slots, PHASE[3] is used on 600 slots, and PHASE[4] is used on 600 slots. This is due to the fact that any bias in phase usage causes great influence to be exerted by the more frequently used phase, and that the reception device is dependent on such influence for data reception quality.
Furthermore, in order to transmit the first coded block, PHASE[0] is used on slots 600 times, PHASE[1] is used on slots 600 times, PHASE[2] is used on slots 600 times, PHASE[3] is used on slots 600 times, and PHASE[4] is used on slots 600 times. Furthermore, in order to transmit the second coded block, PHASE[0] is used on slots 600 times, PHASE[1] is used on slots 600 times, PHASE[2] is used on slots 600 times, PHASE[3] is used on slots 600 times, and PHASE[4] is used on slots 600 times.
Similarly, for the above-described 1500 slots needed to transmit the 6000×2 bits making up the two coded blocks when the modulation scheme is 16-QAM, PHASE[0] is used on 300 slots, PHASE[1] is used on 300 slots, PHASE[2] is used on 300 slots, PHASE[3] is used on 300 slots, and PHASE[4] is used on 300 slots.
Furthermore, in order to transmit the first coded block, PHASE[0] is used on slots 300 times, PHASE[1] is used on slots 300 times, PHASE[2] is used on slots 300 times, PHASE[3] is used on slots 300 times, and PHASE[4] is used on slots 300 times. Furthermore, in order to transmit the second coded block, PHASE[0] is used on slots 300 times, PHASE[1] is used on slots 300 times, PHASE[2] is used on slots 300 times, PHASE[3] is used on slots 300 times, and PHASE[4] is used on slots 300 times.
Similarly, for the above-described 1000 slots needed to transmit the 6000×2 bits making up the two coded blocks when the modulation scheme is 64-QAM, PHASE[0] is used on 200 slots, PHASE[1] is used on 200 slots, PHASE[2] is used on 200 slots, PHASE[3] is used on 200 slots, and PHASE[4] is used on 200 slots.
Furthermore, in order to transmit the first coded block, PHASE[0] is used on slots 200 times, PHASE[1] is used on slots 200 times, PHASE[2] is used on slots 200 times, PHASE[3] is used on slots 200 times, and PHASE[4] is used on slots 200 times. Furthermore, in order to transmit the second coded block, PHASE[0] is used on slots 200 times, PHASE[1] is used on slots 200 times, PHASE[2] is used on slots 200 times, PHASE[3] is used on slots 200 times, and PHASE[4] is used on slots 200 times.
As described above, a scheme for regularly changing the phase requires the preparation of phase changing values (or phase changing sets) expressed as PHASE[0], PHASE[1], PHASE[2] . . . PHASE[N−2], PHASE[N−1]. As such, in order to transmit all of the bits making up two coded blocks, PHASE[0] is used on K0 slots, PHASE[1] is used on K1 slots, PHASE[i] is used on Ki slots (where i=0, 1, 2 . . . N−1 (i denotes an integer that satisfies 0≦i≦N−1), and PHASE[N−1] is used on KN-1 slots, such that Condition #A03 is met.
(Condition #A03)
K0=K1 . . . =Ki= . . . KN-1. That is, Ka=Kb (∀a and ∀b where a, b, =0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).
Further, in order to transmit all of the bits making up the first coded block, PHASE[0] is used K0,1 times, PHASE[1] is used K1,1 times, PHASE[i] is used Ki,1 times (where i=0, 1, 2 . . . N−1 (i denotes an integer that satisfies 0≦i≦N−1), and PHASE[N−1] is used KN-1,1 times, such that Condition #A04 is met.

(Condition #A04)

K0,1=K1,1= . . . Ki,1= . . . KN-1,1. That is, Ka,1=Kb,1 (∀a and ∀b where a, b, =0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).

Furthermore, in order to transmit all of the bits making up the second coded block, PHASE[0] is used K0,2 times, PHASE[1] is used K1,2 times, PHASE[i] is used Ki,2 times (where i=0, 1, 2 . . . N−1 (i denotes an integer that satisfies 0≦i≦N−1), and PHASE[N−1] is used KN-1,2 times, such that Condition #A05 is met.

(Condition #A05)

K0,2=K1,2= . . . =Ki,2= . . . KN-1,2. That is, Ka,2=Kb,2 (∀a and ∀b where a, b, =0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).

Then, when a communication system that supports multiple modulation schemes selects one such supported modulation scheme for use, Condition #A03, #A04, and #A05 should preferably be met for the supported modulation scheme.
However, when multiple modulation schemes are supported, each such modulation scheme typically uses symbols transmitting a different number of bits per symbol (though some may happen to use the same number), Conditions #A03, #A04, and #A05 may not be satisfied for some modulation schemes. In such a case, the following conditions apply instead of Condition #A03, #A04, and #A05.
(Condition #A06)
The difference between Ka and Kb satisfies 0 or 1. That is, |Ka−Kb| satisfies 0 or 1 (∀a, ∀b, where a, b=0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).
(Condition #A07)
The difference between Ka,1 and Kb,1 satisfies 0 or 1. That is, |Ka,1−Kb,1| satisfies 0 or 1 (∀a, ∀b, where a, b=0, 1, 2 . . . N−1, (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1) a≠b).
(Condition #A08)
The difference between Ka,2 and Kb,2 satisfies 0 or 1. That is, |Ka,2−Kb,2| satisfies 0 or 1 (∀, ∀b, where a, b=0, 1, 2 . . . N−1 (a denotes an integer that satisfies 0≦a≦N−1, b denotes an integer that satisfies 0≦b≦N−1), a≠b).
As described above, bias among the phases being used to transmit the coded blocks is removed by creating a relationship between the coded block and the phase of multiplication. As such, data reception quality can be improved for the reception device.
In the present Embodiment N phase changing values (or phase changing sets) are needed in order to perform a change of phase having a period (cycle) of N with the scheme for a regular change of phase. As such, N phase changing values (or phase changing sets) PHASE[0], PHASE[1], PHASE[2] . . . PHASE[N−2], and PHASE[N−1] are prepared. However, schemes exist for reordering the phases in the stated order with respect to the frequency domain. No limitation is intended in this regard. The N phase changing values (or phase changing sets) may also change the phases of blocks in the time domain or in the time-frequency domain to obtain a symbol arrangement as described in Embodiment 1. Although the above examples discuss a phase changing scheme with a period (cycle) of N, the same effects are obtainable using N phase changing values (or phase changing sets) at random. That is, the N phase changing values (or phase changing sets) need not always for a regular period (cycle). As long as the above-described conditions are satisfied, great quality data reception improvements are realizable for the reception device.
Furthermore, given the existence of modes for spatial multiplexing MIMO schemes, MIMO schemes using a fixed precoding matrix, space-time block coding schemes, single-stream transmission, and schemes using a regular change of phase (the transmission schemes described in Embodiments 1 through 4), the transmission device (broadcaster, base station) may select any one of these transmission schemes.
As described in Non-Patent Literature 3, spatial multiplexing MIMO schemes involve transmitting signals s1 and s2, which are mapped using a selected modulation scheme, on each of two different antennas. As described in Embodiments 1 through 4, MIMO schemes using a fixed precoding matrix involve performing precoding only (with no change of phase). Further, space-time block coding schemes are described in Non-Patent Literature 9, 16, and 17. Single-stream transmission schemes involve transmitting signal s1, mapped with a selected modulation scheme, from an antenna after performing predetermined processing.
Schemes using multi-carrier transmission such as OFDM involve a first carrier group made up of a plurality of carriers and a second carrier group made up of a plurality of carriers different from the first carrier group, and so on, such that multi-carrier transmission is realized with a plurality of carrier groups. For each carrier group, any of spatial multiplexing MIMO schemes, MIMO schemes using a fixed precoding matrix, space-time block coding schemes, single-stream transmission, and schemes using a regular change of phase may be used. In particular, schemes using a regular change of phase on a selected (sub-)carrier group are preferably used to realize the present Embodiment.
When a change of phase is performed, then for example, a phase changing value for PHASE[i] of X radians is performed on only one precoded baseband signal, the phase changers of FIGS. 3, 4, 5, 12, 25, 29, 51, and 53 multiplies precoded baseband signal z2′ by ejX. Then, for a change of phase by, for example, a phase changing set for PHASE[i] of X radians and Y radians is performed on both precoded baseband signals, the phase changers from FIGS. 26, 27, 28, 52, and 54 multiplies precoded baseband signal z2′ by ejX and multiplies precoded baseband signal z1′ by ejY.
Embodiment B1
The following describes a sample configuration of an application of the transmission schemes and reception schemes discussed in the above embodiments and a system using the application.
FIG. 36 illustrates the configuration of a system that includes devices executing transmission schemes and reception schemes described in the above Embodiments. As shown in FIG. 36, the devices executing transmission schemes and reception schemes described in the above Embodiments include various receivers such as a broadcaster, a television 3611, a DVD recorder 3612, a STB (set-top box) 3613, a computer 3620, a vehicle-mounted television 3641, a mobile phone 3630 and so on within a digital broadcasting system 3600. Specifically, the broadcaster 3601 uses a transmission scheme discussed in the above-described Embodiments to transmit multiplexed data, in which video, audio, and other data are multiplexed, over a predetermined transmission band.
The signals transmitted by the broadcaster 3601 are received by an antenna (such as antenna 3660 or 3640) embedded within or externally connected to each of the receivers. Each receiver obtains the multiplexed data by using reception schemes discussed in the above-described Embodiments to demodulate the signals received by the antenna. Accordingly, the digital broadcasting system 3600 is able to realize the effects of the present invention, as discussed in the above-described Embodiments.
The video data included in the multiplexed data are coded with a video coding method compliant with a standard such as MPEG-2 (Moving Picture Experts Group), MPEG4-AVC (Advanced Video Coding), VC-1, or the like. The audio data included in the multiplexed data are encoded with an audio coding method compliant with a standard such as Dolby AC-3 (Audio Coding), Dolby Digital Plus, MLP (Meridian Lossless Packing), DTS (Digital Theater Systems), DTS-HD, PCM (Pulse-Code Modulation), or the like.
FIG. 37 illustrates the configuration of a receiver 7900 that executes a reception scheme described in the above-described Embodiments. The receiver 3700 corresponds to a receiver included in one of the television 3611, the DVD recorder 3612, the STB 3613, the computer 3620, the vehicle-mounted television 3641, the mobile phone 3630 and so on from FIG. 36. The receiver 3700 includes a tuner 3701 converting a high-frequency signal received by an antenna 3760 into a baseband signal, and a demodulator 3702 demodulating the baseband signal so converted to obtain the multiplexed data. The demodulator 3702 executes a reception scheme discussed in the above-described Embodiments, and thus achieves the effects of the present invention as explained above.
The receiver 3700 further includes a stream interface 3720 that demultiplexes the audio and video data in the multiplexed data obtained by the demodulator 3702, a signal processor 3704 that decodes the video data obtained from the demultiplexed video data into a video signal by applying a video decoding method corresponding thereto and decodes the audio data obtained from the demultiplexed audio data into an audio signal by applying an audio decoding method corresponding thereto, an audio output unit 3706 that outputs the decoded audio signal through a speaker or the like, and a video display unit 3707 that outputs the decoded video signal on a display or the like.
When, for example, a user uses a remote control 3750, information for a selected channel (selected (television) program or audio broadcast) is transmitted to an operation input unit 3710. Then, the receiver 3700 performs processing on the received signal received by the antenna 3760 that includes demodulating the signal corresponding to the selected channel, performing error-correcting decoding, and so on, in order to obtain the received data. At this point, the receiver 3700 obtains control symbol information that includes information on the transmission scheme (the transmission scheme, modulation scheme, error-correction scheme, and so on from the above-described Embodiments) (as described using FIGS. 5 and 41) from control symbols included the signal corresponding to the selected channel. As such, the receiver 3700 is able to correctly set the reception operations, demodulation scheme, error-correction scheme and so on, thus enabling the data included in the data symbols transmitted by the broadcaster (base station) to be obtained. Although the above description is given for an example of the user using the remote control 3750, the same operations apply when the user presses a selection key embedded in the receiver 3700 to select a channel.
According to this configuration, the user is able to view programs received by the receiver 3700.
The receiver 3700 pertaining to the present Embodiment further includes a drive 3708 that may be a magnetic disk, an optical disc, a non-volatile semiconductor memory, or a similar recording medium. The receiver 3700 stores data included in the demultiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding (in some circumstances, the data obtained through demodulation by the demodulator 3702 may not be subject to error correction. Also, the receiver 3700 may perform further processing after error correction. The same hereinafter applies to similar statements concerning other components), data corresponding to such data (e.g., data obtained through compression of such data), data obtained through audio and video processing, and so on, on the drive 3708. Here, an optical disc is a recording medium, such as DVD (Digital Versatile Disc) or BD (Blu-ray Disc), that is readable and writable with the use of a laser beam. A magnetic disk is a floppy disk, a hard disk, or similar recording medium on which information is storable through the use of magnetic flux to magnetize a magnetic body. A non-volatile semiconductor memory is a recording medium, such as flash memory or ferroelectric random access memory, composed of semiconductor element(s). Specific examples of non-volatile semiconductor memory include an SD card using flash memory and a Flash SSD (Solid State Drive). Naturally, the specific types of recording media mentioned herein are merely examples. Other types of recording mediums may also be used.
According to this structure, the user is able to record and store programs received by the receiver 3700, and is thereby able to view programs at any given time after broadcasting by reading out the recorded data thereof.
Although the above explanations describe the receiver 3700 storing multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding on the drive 3708, a portion of the data included in the multiplexed data may instead be extracted and recorded. For example, when data broadcasting services or similar content is included along with the audio and video data in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, the audio and video data may be extracted from the multiplexed data demodulated by the demodulator 3702 and stored as new multiplexed data. Furthermore, the drive 3708 may store either the audio data or the video data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding as new multiplexed data. The aforementioned data broadcasting service content included in the multiplexed data may also be stored on the drive 3708.
Furthermore, when a television, recording device (e.g., a DVD recorder, BD recorder HDD recorder, SD card, or similar), or mobile phone incorporating the receiver 3700 of the present invention receives multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding that includes data for correcting bugs in software used to operate the television or recording device, for correcting bugs in software for preventing personal information and recorded data from being leaked, and so on, such software bugs may be corrected by installing the data on the television or recording device. As such, bugs in the receiver 3700 are corrected through the inclusion of data for correcting bugs in the software of the receiver 3700. Accordingly, the television, recording device, or mobile phone incorporating the receiver 3700 may be made to operate more reliably.
Here, the process of extracting a portion of the data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding is performed by, for example, the stream interface 3703. Specifically, the stream interface 3703, demultiplexes the various data included in the multiplexed data demodulated by the demodulator 3702, such as audio data, video data, data broadcasting service content, and so on, as instructed by a non-diagrammed controller such as a CPU. The stream interface 3703 then extracts and multiplexes only the indicated demultiplexed data, thus generating new multiplexed data. The data to be extracted from the demultiplexed data may be determined by the user or may be determined in advance according to the type of recording medium.
According to such a structure, the receiver 3700 is able to extract and record only the data needed in order to view the recorded program. As such, the amount of data to be recorded can be reduced.
Although the above explanation describes the drive 3708 as storing multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, the video data included in the multiplexed data so obtained may be converted by using a different video coding method than the original video coding method applied thereto, so as to reduce the amount of data or the bit rate thereof. The drive 3708 may then store the converted video data as new multiplexed data. Here, the video coding method used to generate the new video data may conform to a different standard than that used to generate the original video data. Alternatively, the same video coding method may be used with different parameters. Similarly, the audio data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding may be converted by using a different audio coding method than the original audio coding method applied thereto, so as to reduce the amount of data or the bit rate thereof. The drive 3708 may then store the converted audio data as new multiplexed data.
Here, the process by which the audio or video data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding is converted so as to reduce the amount of data or the bit rate thereof is performed by, for example, the stream interface 3703 or the signal processor 3704. Specifically, the stream interface 3703 demultiplexes the various data included in the multiplexed data demodulated by the demodulator 3702, such as audio data, video data, data broadcasting service content, and so on, as instructed by an undiagrammed controller such as a CPU. The signal processor 3704 then performs processing to convert the video data so demultiplexed by using a different video coding method than the original video coding method applied thereto, and performs processing to convert the audio data so demultiplexed by using a different video coding method than the original audio coding method applied thereto. As instructed by the controller, the stream interface 3703 then multiplexes the converted audio and video data, thus generating new multiplexed data. The signal processor 3704 may, in accordance with instructions from the controller, performing conversion processing on either the video data or the audio data, alone, or may perform conversion processing on both types of data. In addition, the amounts of video data and audio data or the bit rate thereof to be obtained by conversion may be specified by the user or determined in advance according to the type of recording medium.
According to such a structure, the receiver 3700 is able to modify the amount of data or the bitrate of the audio and video data for storage according to the data storage capacity of the recording medium, or according to the data reading or writing speed of the drive 3708. Therefore, programs can be stored on the drive despite the storage capacity of the recording medium being less than the amount of multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, or the data reading or writing speed of the drive being lower than the bit rate of the demultiplexed data obtained through demodulation by the demodulator 3702. As such, the user is able to view programs at any given time after broadcasting by reading out the recorded data.
The receiver 3700 further includes a stream output interface 3709 that transmits the multiplexed data demultiplexed by the demodulator 3702 to external devices through a communications medium 3730. The stream output interface 3709 may be, for example, a wireless communication device transmitting modulated multiplexed data to an external device using a wireless transmission scheme conforming to a wireless communication standard such as Wi-FiTM (IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, IEEE 802.11n, and so on), WiGig, WirelessHD, Bluetooth, ZigBee, and so on through a wireless medium (corresponding to the communications medium 3730). The stream output interface 3709 may also be a wired communication device transmitting modulated multiplexed data to an external device using a communication scheme conforming to a wired communication standard such as EthernetTM, USB (Universal Serial Bus), PLC (Power Line Communication), HDMI (High-Definition Multimedia Interface) and so on through a wired transmission path (corresponding to the communications medium 3730) connected to the stream output interface 3709.
According to this configuration, the user is able to use an external device with the multiplexed data received by the receiver 3700 using the reception scheme described in the above-described Embodiments. The usage of multiplexed data by the user here includes use of the multiplexed data for real-time viewing on an external device, recording of the multiplexed data by a recording unit included in an external device, and transmission of the multiplexed data from an external device to a yet another external device.
Although the above explanations describe the receiver 3700 outputting multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding through the stream output interface 3709, a portion of the data included in the multiplexed data may instead be extracted and output. For example, when data broadcasting services or similar content is included along with the audio and video data in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, the audio and video data may be extracted from the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, multiplexed and output by the stream output interface 3709 as new multiplexed data. In addition, the stream output interface 3709 may store either the audio data or the video data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding as new multiplexed data.
Here, the process of extracting a portion of the data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding is performed by, for example, the stream interface 3703. Specifically, the stream interface 3703 demultiplexes the various data included in the multiplexed data demodulated by the demodulator 3702, such as audio data, video data, data broadcasting service content, and so on, as instructed by an undiagrammed controller such as a CPU. The stream interface 3703 then extracts and multiplexes only the indicated demultiplexed data, thus generating new multiplexed data. The data to be extracted from the demultiplexed data may be determined by the user or may be determined in advance according to the type of stream output interface 3709.
According to this structure, the receiver 3700 is able to extract and output only the required data to an external device. As such, fewer multiplexed data are output using less communication bandwidth.
Although the above explanation describes the stream output interface 3709 as outputting multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, the video data included in the multiplexed data so obtained may be converted by using a different video coding method than the original video coding method applied thereto, so as to reduce the amount of data or the bit rate thereof. The stream output interface 3709 may then output the converted video data as new multiplexed data. Here, the video coding method used to generate the new video data may conform to a different standard than that used to generate the original video data. Alternatively, the same video coding method may be used with different parameters. Similarly, the audio data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding may be converted by using a different audio coding method than the original audio coding method applied thereto, so as to reduce the amount of data or the bit rate thereof. The stream output interface 3709 may then output the converted audio data as new multiplexed data.
Here, the process by which the audio or video data included in the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding is converted so as to reduce the amount of data or the bit rate thereof is performed by, for example, the stream interface 3703 or the signal processor 3704. Specifically, the stream interface 3703 demultiplexes the various data included in the multiplexed data demodulated by the demodulator 3702, such as audio data, video data, data broadcasting service content, and so on, as instructed by an undiagrammed controller. The signal processor 3704 then performs processing to convert the video data so demultiplexed by using a different video coding method than the original video coding method applied thereto, and performs processing to convert the audio data so demultiplexed by using a different video coding method than the original audio coding method applied thereto. As instructed by the controller, the stream interface 3703 then multiplexes the converted audio and video data, thus generating new multiplexed data. The signal processor 3704 may, in accordance with instructions from the controller, performing conversion processing on either the video data or the audio data, alone, or may perform conversion processing on both types of data. In addition, the amounts of video data and audio data or the bit rate thereof to be obtained by conversion may be specified by the user or determined in advance according to the type of stream output interface 3709.
According to this structure, the receiver 3700 is able to modify the bit rate of the video and audio data for output according to the speed of communication with the external device. Thus, despite the speed of communication with an external device being slower than the bit rate of the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding, by outputting new multiplexed data from the stream output interface to the external device, the user is able to use the new multiplexed data with other communication devices.
The receiver 3700 further includes an audiovisual output interface 3711 that outputs audio and video signals decoded by the signal processor 3704 to the external device through an external communications medium. The audiovisual output interface 3711 may be, for example, a wireless communication device transmitting modulated audiovisual data to an external device using a wireless transmission scheme conforming to a wireless communication standard such as Wi-FiTM (IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, IEEE 802.11n, and so on), WiGig, WirelessHD, Bluetooth, ZigBee, and so on through a wireless medium. The stream output interface 3709 may also be a wired communication device transmitting modulated audiovisual data to an external device using a communication scheme conforming to a wired communication standard such as EthernetTM, USB, PLC, HDMI, and so on through a wired transmission path connected to the stream output interface 3709. Furthermore, the stream output interface 3709 may be a terminal for connecting a cable that outputs analogue audio signals and video signals as-is.
According to such a structure, the user is able to use the audio signals and video signals decoded by the signal processor 3704 with an external device.
Further, the receiver 3700 includes an operation input unit 3710 that receives user operations as input. The receiver 3700 behaves in accordance with control signals input by the operation input unit 3710 according to user operations, such as by switching the power supply ON or OFF, changing the channel being received, switching subtitle display ON or OFF, switching between languages, changing the volume output by the audio output unit 3706, and various other operations, including modifying the settings for receivable channels and the like.
The receiver 3700 may further include functionality for displaying an antenna level representing the received signal quality while the receiver 3700 is receiving a signal. The antenna level may be, for example, a index displaying the received signal quality calculated according to the RSSI (Received Signal Strength Indicator), the received signal magnetic field strength, the C/N (carrier-to-noise) ratio, the BER, the packet error rate, the frame error rate, the channel state information, and so on, received by the receiver 3700 and indicating the level and the quality of a received signal. In such circumstances, the demodulator 3702 includes a signal quality calibrator that measures the RSSI, the received signal magnetic field strength, the C/N ratio, the BER, the packet error rate, the frame error rate, the channel state information, and so on. In response to user operations, the receiver 3700 displays the antenna level (signal level, signal quality) in a user-recognizable format on the video display unit 3707. The display format for the antenna level (signal level, signal quality) may be a numerical value displayed according to the RSSI, the received signal magnetic field strength, the C/N ratio, the BER, the packet error rate, the frame error rate, the channel state information, and so on, or may be an image display that varies according to the RSSI, the received signal magnetic field strength, the C/N ratio, the BER, the packet error rate, the frame error rate, the channel state information, and so on. The receiver 3700 may display multiple antenna level (signal level, signal quality) calculated for each stream s1, s2, and so on demultiplexed using the reception scheme discussed in the above-described Embodiments, or may display a single antenna level (signal level, signal quality) calculated for all such streams. When the video data and audio data composing a program are transmitted hierarchically, the signal level (signal quality) may also be displayed for each hierarchical level.
According to the above structure, the user is given an understanding of the antenna level (signal level, signal quality) numerically or visually during reception using the reception schemes discussed in the above-described Embodiments.
Although the above example describes the receiver 3700 as including the audio output unit 3706, the video display unit 3707, the drive 3708, the stream output interface 3709, and the audiovisual output interface 3711, all of these components are not strictly necessary. As long as the receiver 3700 includes at least one of the above-described components, the user is able to use the multiplexed data obtained through demodulation by the demodulator 3702 and error-correcting decoding. Any receiver may be freely combined with the above-described components according to the usage scheme.
(Multiplexed Data)
The following is a detailed description of a sample configuration of multiplexed data. The data configuration typically used in broadcasting is an MPEG-2 transport stream (TS). Therefore the following description describes an example related to MPEG2-TS. However, the data configuration of the multiplexed data transmitted by the transmission and reception schemes discussed in the above-described Embodiments is not limited to MPEG2-TS. The advantageous effects of the above-described Embodiments are also achievable using any other data structure.
FIG. 38 illustrates a sample configuration for multiplexed data. As shown, the multiplexed data are elements making up programmes (or events, being a portion thereof) currently provided by various services. For example, one or more video streams, audio streams, presentation graphics (PG) streams, interactive graphics (IG) streams, and other such element streams are multiplexed to obtain the multiplexed data. When a broadcast program provided by the multiplexed data is a movie, the video streams represent main video and sub video of the movie, the audio streams represent main audio of the movie and sub-audio to be mixed with the main audio, and the presentation graphics streams represent subtitles for the movie. Main video refers to video images normally presented on a screen, whereas sub-video refers to video images (for example, images of text explaining the outline of the movie) to be presented in a small window inserted within the video images. The interactive graphics streams represent an interactive display made up of GUI (Graphical User Interface) components presented on a screen.
Each stream included in the multiplexed data is identified by an identifier, termed a PID, uniquely assigned to the stream. For example, PID 0x1011 is assigned to the video stream used for the main video of the movie, PIDs 0x1100 through 0x111F are assigned to the audio streams, PIDs 0x1200 through 0x121F are assigned to the presentation graphics, PIDs 0x1400 through 0x141F are assigned to the interactive graphics, PIDs 0x1B00 through 0x1B1F are assigned to the video streams used for the sub-video of the movie, and PIDs 0x1A00 through 0x1A1F are assigned to the audio streams used as sub-audio to be mixed with the main audio of the movie.
FIG. 39 is a schematic diagram illustrating an example of the multiplexed data being multiplexed. First, a video stream 3901, made up of a plurality of frames, and an audio stream 3904, made up of a plurality of audio frames, are respectively converted into PES packet sequence 3902 and 3905, then further converted into TS packets 3903 and 3906. Similarly, a presentation graphics stream 3911 and an interactive graphics stream 3914 are respectively converted into PES packet sequence 3912 and 3915, then further converted into TS packets 3913 and 3916. The multiplexed data 3917 is made up of the TS packets 3903, 3906, 3913, and 3916 multiplexed into a single stream.
FIG. 40 illustrates further details of a PES packet sequence as contained in the video stream. The first tier of FIG. 40 shows a video frame sequence in the video stream. The second tier shows a PES packet sequence. Arrows yy1, yy2, yy3, and yy4 indicate the plurality of Video Presentation Units, which are I-pictures, B-pictures, and P-pictures, in the video stream as divided and individually stored as the payload of a PES packet. Each PES packet has a PES header. A PES header contains a PTS (Presentation Time Stamp) at which the picture is to be displayed, a DTS (Decoding Time Stamp) at which the picture is to be decoded, and so on.
FIG. 41 illustrates the structure of a TS packet as ultimately written into the multiplexed data. A TS packet is a 188-byte fixed-length packet made up of a 4-byte PID identifying the stream and of a 184-byte TS payload containing the data. The above-described PES packets are divided and individually stored as the TS payload. For a BD-ROM, each TS packet has a 4-byte TP_Extra_Header affixed thereto to build a 192-byte source packet, which is to be written as the multiplexed data. The TP_Extra_Header contains information such as an Arrival_Time_Stamp (ATS). The ATS indicates a time for starring transfer of the TS packet to the PID filter of a decoder. The multiplexed data are made up of source packets arranged as indicated in the bottom tier of FIG. 41. A SPN (source packet number) is incremented for each packet, beginning at the head of the multiplexed data.
In addition to the video streams, audio streams, presentation graphics streams, and the like, the TS packets included in the multiplexed data also include a PAT (Program Association Table), a PMT (Program Map Table), a PCR (Program Clock Reference) and so on. The PAT indicates the PID of a PMT used in the multiplexed data, and the PID of the PAT itself is registered as 0. The PMT includes PIDs identifying the respective streams, such as video, audio and subtitles, contained in the multiplexed data and attribute information (frame rate, aspect ratio, and the like) of the streams identified by the respective PIDs. In addition, the PMT includes various types of descriptors relating to the multiplexed data. One such descriptor may be copy control information indicating whether or not copying of the multiplexed data is permitted. The PCR includes information for synchronizing the ATC (Arrival Time Clock) serving as the chronological axis of the ATS to the STC (System Time Clock) serving as the chronological axis of the PTS and DTS. Each PCR packet includes an STC time corresponding to the ATS at which the packet is to be transferred to the decoder.
FIG. 42 illustrates the detailed data configuration of a PMT. The PMT starts with a PMT header indicating the length of the data contained in the PMT. Following the PMT header, descriptors pertaining to the multiplexed data are arranged. One example of a descriptor included in the PMT is the copy control information described above. Following the descriptors, stream information pertaining to the respective streams included in the multiplexed data is arranged. Each piece of stream information is composed of stream descriptors indicating a stream type identifying a compression codec employed for a corresponding stream, a PID for the stream, and attribute information (frame rate, aspect ratio, and the like) of the stream. The PMT includes the same number of stream descriptors as the number of streams included in the multiplexed data.
When recorded onto a recoding medium or the like, the multiplexed data are recorded along with a multiplexed data information file.
FIG. 43 illustrates a sample configuration for the multiplexed data information file. As shown, the multiplexed data information file is management information for the multiplexed data, is provided in one-to-one correspondence with the multiplexed data, and is made up of multiplexed data information, stream attribute information, and an entry map.
The multiplexed data information is made up of a system rate, a playback start time, and a playback end time. The system rate indicates the maximum transfer rate of the multiplexed data to the PID filter of a later-described system target decoder. The multiplexed data includes ATS at an interval set so as not to exceed the system rate. The playback start time is set to the time specified by the PTS of the first video frame in the multiplexed data, whereas the playback end time is set to the time calculated by adding the playback duration of one frame to the PTS of the last video frame in the multiplexed data.
FIG. 44 illustrates a sample configuration for the stream attribute information included in the multiplexed data information file. As shown, the stream attribute information is attribute information for each stream included in the multiplexed data, registered for each PID. That is, different pieces of attribute information are provided for different streams, namely for the video streams, the audio streams, the presentation graphics streams, and the interactive graphics streams. The video stream attribute information indicates the compression codec employed to compress the video stream, the resolution of individual pictures constituting the video stream, the aspect ratio, the frame rate, and so on. The audio stream attribute information indicates the compression codec employed to compress the audio stream, the number of channels included in the audio stream, the language of the audio stream, the sampling frequency, and so on. This information is used to initialize the decoder before playback by a player.
In the present Embodiment, the stream type included in the PMT is used among the information included in the multiplexed data. When the multiplexed data are recorded on a recording medium, the video stream attribute information included in the multiplexed data information file is used. Specifically, the video coding method and device described in any of the above Embodiments may be modified to additionally include a step or unit of setting a specific piece of information in the stream type included in the PMT or in the video stream attribute information. The specific piece of information is for indicating that the video data are generated by the video coding method and device described in the Embodiment. According to such a structure, video data generated by the video coding method and device described in any of the above Embodiments is distinguishable from video data compliant with other standards.
FIG. 45 illustrates a sample configuration of an audiovisual output device 4500 that includes a reception device 4504 receiving a modulated signal that includes audio and video data transmitted by a broadcaster (base station) or data intended for broadcasting. The configuration of the reception device 4504 corresponds to the reception device 3700 from FIG. 37. The audiovisual output device 4500 incorporates, for example, an OS (Operating System), or incorporates a communication device 4506 for connecting to the Internet (e.g., a communication device intended for a wireless LAN (Local Area Network) or for EthernetTM). As such, a video display unit 4501 is able to simultaneously display audio and video data, or video in video data for broadcast 4502, and hypertext 4503 (from the World Wide Web) provided over the Internet. By operating a remote control 4507 (alternatively, a mobile phone or keyboard), either of the video in video data for broadcast 4502 and the hypertext 4503 provided over the Internet may be selected to change operations. For example, when the hypertext 4503 provided over the Internet is selected, the website displayed may be changed by remote control operations. When audio and video data, or video in video data for broadcast 4502 is selected, information from a selected channel (selected (television) program or audio broadcast) may be transmitted by the remote control 4507. As such, an interface 4505 obtains the information transmitted by the remote control. The reception device 4504 performs processing such as demodulation and error-correction corresponding to the selected channel, thereby obtaining the received data. At this point, the reception device 4504 obtains control symbol information that includes information on the transmission scheme (as described using FIG. 5) from control symbols included the signal corresponding to the selected channel. As such, the reception device 4504 is able to correctly set the reception operations, demodulation scheme, error-correction scheme and so on, thus enabling the data included in the data symbols transmitted by the broadcaster (base station) to be obtained. Although the above description is given for an example of the user using the remote control 4507, the same operations apply when the user presses a selection key embedded in the audiovisual output device 4500 to select a channel.
In addition, the audiovisual output device 4500 may be operated using the Internet. For example, the audiovisual output device 4500 may be made to record (store) a program through another terminal connected to the Internet. (Accordingly, the audiovisual output device 4500 should include the drive 3708 from FIG. 37.) The channel is selected before recording begins. As such, the reception device 4504 performs processing such as demodulation and error-correction corresponding to the selected channel, thereby obtaining the received data. At this point, the reception device 4504 obtains control symbol information that includes information on the transmission scheme (the transmission scheme, modulation scheme, error-correction scheme, and so on from the above-described Embodiments) (as described using FIG. 5) from control symbols included the signal corresponding to the selected channel. As such, the reception device 4504 is able to correctly set the reception operations, demodulation scheme, error-correction scheme and so on, thus enabling the data included in the data symbols transmitted by the broadcaster (base station) to be obtained.
(Supplement)
The present description considers a communications/broadcasting device such as a broadcaster, a base station, an access point, a terminal, a mobile phone, or the like provided with the transmission device, and a communications device such as a television, radio, terminal, personal computer, mobile phone, access point, base station, or the like provided with the reception device. The transmission device and the reception device pertaining to the present invention are communication devices in a form able to execute applications, such as a television, radio, personal computer, mobile phone, or similar, through connection to some sort of interface (e.g., USB).
Furthermore, in the present Embodiment, symbols other than data symbols, such as pilot symbols (namely preamble, unique word, postamble, reference symbols, scattered pilot symbols and so on), symbols intended for control information, and so on may be freely arranged within the frame. Although pilot symbols and symbols intended for control information are presently named, such symbols may be freely named otherwise as the function thereof remains the important consideration.
Provided that a pilot symbol, for example, is a known symbol modulated with PSK modulation in the transmitter and receiver (alternatively, the receiver may be synchronized such that the receiver knows the symbols transmitted by the transmitter), the receiver is able to use this symbol for frequency synchronization, time synchronization, channel estimation (CSI (Channel State Information) estimation for each modulated signal), signal detection, and the like.
The symbols intended for control information are symbols transmitting information (such as the modulation scheme, error-correcting coding scheme, coding rate of error-correcting codes, and setting information for the top layer used in communications) transmitted to the receiving party in order to execute transmission of non-data (i.e., applications).
The present invention is not limited to the Embodiments, but may also be realized in various other ways. For example, while the above Embodiments describe communication devices, the present invention is not limited to such devices and may be implemented as software for the corresponding communications scheme.
Although the above-described Embodiments describe phase changing schemes for schemes of transmitting two modulated signals from two antennas, no limitation is intended in this regard. Precoding and a change of phase may be performed on four signals that have been mapped to generate four modulated signals transmitted using four antennas. That is, the present invention is applicable to performing a change of phase on N signals that have been mapped and precoded to generate N modulated signals transmitted using N antennas.
Although the above-described Embodiments describe examples of systems where two modulated signals are transmitted from two antennas and received by two respective antennas in a MIMO system, the present invention is not limited in this regard and is also applicable to MISO (Multiple Input Single Output) systems. In a MISO system, the reception device does not include antenna 701_Y, wireless unit 703_Y, channel fluctuation estimator 707_1 for modulated signal z1, and channel fluctuation estimator 707_2 for modulated signal z2 from FIG. 7. However, the processing described in Embodiment 1 may still be executed to estimate r1 and r2. Technology for receiving and decoding a plurality of signals transmitted simultaneously at a common frequency are received by a single antenna is widely known. The present invention is additional processing supplementing conventional technology for a signal processor reverting a phase changed by the transmitter.
Although the present invention describes examples of systems where two modulated signals are transmitted from two antennas and received by two respective antennas in a MIMO system, the present invention is not limited in this regard and is also applicable to MISO systems. In a MISO system, the transmission device performs precoding and change of phase such that the points described thus far are applicable. However, the reception device does not include antenna 701_Y, wireless unit 703_Y, channel fluctuation estimator 707_1 for modulated signal z1, and channel fluctuation estimator 707_2 for modulated signal z2 from FIG. 7. However, the processing described in the present description may still be executed to estimate the data transmitted by the transmission device. Technology for receiving and decoding a plurality of signals transmitted simultaneously at a common frequency are received by a single antenna is widely known (a single-antenna receiver may apply ML operations (Max-log APP or similar)). The present invention may have the signal processor 711 from FIG. 7 perform demodulation (detection) by taking the precoding and change of phase applied by the transmitter into consideration.
The present description uses terms such as precoding, precoding weights, precoding matrix, and so on. The terminology itself may be otherwise (e.g., may be alternatively termed a codebook) as the key point of the present invention is the signal processing itself.
Furthermore, although the present description discusses examples mainly using OFDM as the transmission scheme, the invention is not limited in this manner. Multi-carrier schemes other than OFDM and single-carrier schemes may all be used to achieve similar Embodiments. Here, spread-spectrum communications may also be used. When single-carrier schemes are used, a change of phase is performed with respect to the time domain.
In addition, although the present description discusses the use of ML operations, APP, Max-log APP, ZF, MMSE and so on by the reception device, these operations may all be generalized as wave detection, demodulation, detection, estimation, and demultiplexing as the soft results (log-likelihood and log-likelihood ratio) and the hard results (zeroes and ones) obtained thereby are the individual bits of data transmitted by the transmission device.
Different data may be transmitted by each stream s1(t) and s2(t) (s1(i), s2(i)), or identical data may be transmitted thereby.
The two stream baseband signals s1(i) and s2(i) (where i indicates sequence (with respect to time or (carrier) frequency)) undergo precoding and a regular change of phase (the order of operations may be freely reversed) to generate two post-processing baseband signals z1(i) and z2(i). For post-processing baseband signal z1(i), the in-phase component I is I1(i) while the quadrature component is Q1(i), and for post processing baseband signal z2(i), the in-phase component is I1(i) while the quadrature component is Q2(i). The baseband components may be switched, as long as the following holds.
Let the in-phase component and the quadrature component of switched baseband signal r1(i) be I1(i) and Q2(i), and the in-phase component and the quadrature component of switched baseband signal r2(i) be I2(i) and Q1(i). The modulated signal corresponding to switched baseband signal r1(i) is transmitted by transmit antenna 1 and the modulated signal corresponding to switched baseband signal r2(i) is transmitted from transmit antenna 2, simultaneously on a common frequency. As such, the modulated signal corresponding to switched baseband signal r1(i) and the modulated signal corresponding to switched baseband signal r2(i) are transmitted from different antennas, simultaneously on a common frequency. Alternatively,
For switched baseband signal r1(i), the in-phase component may be I1(i) while the quadrature component may be I2(i), and for switched baseband signal r2(i), the in-phase component may be Q1(i) while the quadrature component may be Q2(i).
For switched baseband signal r1(i), the in-phase component may be I2(i) while the quadrature component may be I1(i), and for switched baseband signal r2(i), the in-phase component may be Q1(i) while the quadrature component may be Q2(i).
For switched baseband signal r1(i), the in-phase component may be I1(i) while the quadrature component may be I2(i), and for switched baseband signal r2(i), the in-phase component may be Q2(i) while the quadrature component may be Q1(i).
For switched baseband signal r1(i), the in-phase component may be I2(i) while the quadrature component may be I1(i), and for switched baseband signal r2(i), the in-phase component may be Q2(i) while the quadrature component may be Q1(i).
For switched baseband signal r1(i), the in-phase component may be I1(i) while the quadrature component may be Q2(i), and for switched baseband signal r2(i), the in-phase component may be Q1(i) while the quadrature component may be I2(i).
For switched baseband signal r1(i), the in-phase component may be Q2(i) while the quadrature component may be I1(i), and for switched baseband signal r2(i), the in-phase component may be I2(i) while the quadrature component may be Q1(i).
For switched baseband signal r1(i), the in-phase component may be Q2(i) while the quadrature component may be I1(i), and for switched baseband signal r2(i), the in-phase component may be Q1(i) while the quadrature component may be I2(i).
For switched baseband signal r2(i), the in-phase component may be I1(i) while the quadrature component may be I2(i), and for switched baseband signal r1(i), the in-phase component may be Q1(i) while the quadrature component may be Q2(i).
For switched baseband signal r2(i), the in-phase component may be I2(i) while the quadrature component may be I1(i), and for switched baseband signal r1(i), the in-phase component may be Q1(i) while the quadrature component may be Q2(i).
For switched baseband signal r2(i), the in-phase component may be I1(i) while the quadrature component may be I2(i), and for switched baseband signal r1(i), the in-phase component may be Q2(i) while the quadrature component may be Q1(i).
For switched baseband signal r2(i), the in-phase component may be I2(i) while the quadrature component may be I1(i), and for switched baseband signal r1(i), the in-phase component may be Q2(i) while the quadrature component may be Q1(i).
For switched baseband signal r2(i), the in-phase component may be I1(i) while the quadrature component may be Q2(i), and for switched baseband signal r1(i), the in-phase component may be I2(i) while the quadrature component may be Q1(i).
For switched baseband signal r2(i), the in-phase component may be I1(i) while the quadrature component may be Q2(i), and for switched baseband signal r1(i), the in-phase component may be Q1(i) while the quadrature component may be I2(i).
For switched baseband signal r2(i), the in-phase component may be Q2(i) while the quadrature component may be I1(i), and for switched baseband signal r1(i), the in-phase component may be I2(i) while the quadrature component may be Q1(i).
For switched baseband signal r2(i), the in-phase component may be Q2(i) while the quadrature component may be I1(i), and for switched baseband signal r1(i), the in-phase component may be Q1(i) while the quadrature component may be I2(i). Alternatively, although the above description discusses performing two types of signal processing on both stream signals so as to switch the in-phase component and quadrature component of the two signals, the invention is not limited in this manner. The two types of signal processing may be performed on more than two streams, so as to switch the in-phase component and quadrature component thereof.
Alternatively, although the above examples describe switching baseband signals having a common time (common (sub-)carrier) frequency), the baseband signals being switched need not necessarily have a common time. For example, any of the following are possible.
For switched baseband signal r1(i), the in-phase component may be I1(i+v) while the quadrature component may be Q2(i+w), and for switched baseband signal r2(i), the in-phase component may be I2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r1(i), the in-phase component may be I1(i+v) while the quadrature component may be I2(i+w), and for switched baseband signal r2(i), the in-phase component may be Q1(i+v) while the quadrature component may be Q2(i+w).
For switched baseband signal r1(i), the in-phase component may be I2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r2(i), the in-phase component may be Q1(i+v) while the quadrature component may be Q2(i+w).
For switched baseband signal r1(i), the in-phase component may be I1(i+v) while the quadrature component may be I2(i+w), and for switched baseband signal r2(i), the in-phase component may be Q2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r1(i), the in-phase component may be I2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r2(i), the in-phase component may be Q2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r1(i), the in-phase component may be I1(i+v) while the quadrature component may be Q2(i+w), and for switched baseband signal r2(i), the in-phase component may be Q1(i+v) while the quadrature component may be I2(i+w).
For switched baseband signal r1(i), the in-phase component may be Q2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r2(i), the in-phase component may be I2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r1(i), the in-phase component may be Q2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r2(i), the in-phase component may be Q1(i+v) while the quadrature component may be I2(i+w).
For switched baseband signal r2(i), the in-phase component may be I1(i+v) while the quadrature component may be I2(i+w), and for switched baseband signal r1(i), the in-phase component may be Q1(i+v) while the quadrature component may be Q2(i+w).
For switched baseband signal r2(i), the in-phase component may be I2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r1(i), the in-phase component may be Q1(i+v) while the quadrature component may be Q2(i+w).
For switched baseband signal r2(i), the in-phase component may be I1(i+v) while the quadrature component may be I2(i+w), and for switched baseband signal r1(i), the in-phase component may be Q2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r2(i), the in-phase component may be I2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r1(i), the in-phase component may be Q2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r2(i), the in-phase component may be I1(i+v) while the quadrature component may be Q2(i+w), and for switched baseband signal r1(i), the in-phase component may be I2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r2(i), the in-phase component may be I1(i+v) while the quadrature component may be Q2(i+w), and for switched baseband signal r1(i), the in-phase component may be Q1(i+v) while the quadrature component may be I2(i+w).
For switched baseband signal r2(i), the in-phase component may be Q2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r1(i), the in-phase component may be I2(i+w) while the quadrature component may be Q1(i+v).
For switched baseband signal r2(i), the in-phase component may be Q2(i+w) while the quadrature component may be I1(i+v), and for switched baseband signal r1(i), the in-phase component may be Q1(i+v) while the quadrature component may be I2(i+w).
FIG. 55 illustrates a baseband signal switcher 5502 explaining the above. As shown, of the two processed baseband signals z1(i) 5501_1 and z2(i) 5501_2, processed baseband signal z1(i) 5501_1 has in-phase component I1(i) and quadrature component Q1(i), while processed baseband signal z2(i) 5501_2 has in-phase component I2(i) and quadrature component Q2(i). Then, after switching, switched baseband signal r1(i) 5503_1 has in-phase component Ir1(i) and quadrature component Qr1(i), while switched baseband signal r2(i) 5503_2 has in-phase component Ir2(i) and quadrature component Qr2(i). The in-phase component Ir1(i) and quadrature component Qr1(i) of switched baseband signal r1(i) 5503_1 and the in-phase component Ir2(i) and quadrature component Qr2(i) of switched baseband signal r2(i) 5503_2 may be expressed as any of the above. Although this example describes switching performed on baseband signals having a common time (common ((sub-)carrier) frequency) and having undergone two types of signal processing, the same may be applied to baseband signals having undergone two types of signal processing but having different times (different ((sub-)carrier) frequencies).
Each of the transmit antennas of the transmission device and each of the receive antennas of the reception device shown in the figures may be formed by a plurality of antennas.
The present description uses the symbol ∀, which is the universal quantifier, and the symbol ∃, which is the existential quantifier.
Furthermore, the present description uses the radian as the unit of phase in the complex plane, e.g., for the argument thereof.
When dealing with the complex plane, the coordinates of complex numbers are expressible by way of polar coordinates. For a complex number z=a+jb (where a and b are real numbers and j is the imaginary unit), the corresponding point (a, b) on the complex plane is expressed with the polar coordinates [r, θ], converted as follows:

a=r×cos θ

b=r×sin θ

[Math. 49]

r=√{square root over (a2+b2)}  (formula 49)

where r is the absolute value of z (r=|z|), and θ is the argument thereof. As such, z=a+jb is expressible as rejθ.
In the present invention, the baseband signals s1, s2, z1, and z2 are described as being complex signals. A complex signal made up of in-phase signal I and quadrature signal Q is also expressible as complex signal I+jQ. Here, either of I and Q may be equal to zero.
FIG. 46 illustrates a sample broadcasting system using the phase changing scheme described in the present description. As shown, a video encoder 4601 takes video as input, performs video encoding, and outputs encoded video data 4602. An audio encoder takes audio as input, performs audio encoding, and outputs encoded audio data 4604. A data encoder 4605 takes data as input, performs data encoding (e.g., data compression), and outputs encoded data 4606. Taken as a whole, these components form a source information encoder 4600.
A transmitter 4607 takes the encoded video data 4602, the encoded audio data 4604, and the encoded data 4606 as input, performs error-correcting coding, modulation, precoding, and phase changing (e.g., the signal processing by the transmission device from FIG. 3) on a subset of or on the entirety of these, and outputs transmit signals 4608_1 through 4608_N. Transmit signals 4608_1 through 4608_N are then transmitted by antennas 4609_1 through 4609_N as radio waves.
A receiver 4612 takes received signals 4611_1 through 4611_M received by antennas 4610_1 through 4610_M as input, performs processing such as frequency conversion, change of phase, decoding of the precoding, log-likelihood ratio calculation, and error-correcting decoding (e.g., the processing by the reception device from FIG. 7), and outputs received data 4613, 4615, and 4617. A source information decoder 4619 takes the received data 4613, 4615, and 4617 as input. A video decoder 4614 takes received data 4613 as input, performs video decoding, and outputs a video signal. The video is then displayed on a television display. An audio decoder 4616 takes received data 4615 as input. The audio decoder 4616 performs audio decoding and outputs an audio signal. the audio is then played through speakers. A data decoder 4618 takes received data 4617 as input, performs data decoding, and outputs information.
In the above-described Embodiments pertaining to the present invention, the number of encoders in the transmission device using a multi-carrier transmission scheme such as OFDM may be any number, as described above. Therefore, as in FIG. 4, for example, the transmission device may have only one encoder and apply a scheme for distributing output to the multi-carrier transmission scheme such as OFDM. In such circumstances, the wireless units 310A and 310B from FIG. 4 should replace the OFDM-related processors 1301A and 1301B from FIG. 12. The description of the OFDM-related processors is as given for Embodiment 1.
Although Embodiment 1 gives Math. 36 (formula 36) as an example of a precoding matrix, another precoding matrix may also be used, when the following scheme is applied.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          50
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          (
          
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  11
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  12
                
              
            
            
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  21
                
              
              
                
                  w
                  ⁢
                  
                    
                  
                  ⁢
                  22
                
              
            
          
          )
        
        =
        
          
            1
            
              
                
                  α
                  2
                
                +
                1
              
            
          
          ⁢
          
            (
            
              
                
                  
                    e
                    j0
                  
                
                
                  
                    α
                    ×
                    
                      e
                      jπ
                    
                  
                
              
              
                
                  
                    α
                    ×
                    
                      e
                      j0
                    
                  
                
                
                  
                    e
                    j0
                  
                
              
            
            )
          
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          50
        
        )
      
    
  




In the precoding matrices of Math. 36 (formula 36) and Math. 50 (formula 50), the value of α is set as given by Math. 37 (formula 37) and Math. 38 (formula 38). However, no limitation is intended in this manner. A simple precoding matrix is obtainable by setting α=1, which is also a valid value.
In Embodiment A1, the phase changers from FIGS. 3, 4, 6, 12, 25, 29, 51, and 53 are indicated as having a phase changing value of PHASE[i] (where i=0, 1, 2 . . . N−2, N−1 (i denotes an integer that satisfies 0≦i≦N−1)) to achieve a period (cycle) of N (value reached given that FIGS. 3, 4, 6, 12, 25, 29, 51, and 53 perform a change of phase on only one baseband signal). The present description discusses performing a change of phase on one precoded baseband signal (i.e., in FIGS. 3, 4, 6, 12, 25, 29, and 51) namely on precoded baseband signal z2′. Here, PHASE[k] is calculated as follows.




  
    
      
        [
        
          Math
          .
          
            
          
          ⁢
          51
        
        ]
      
    
    
      
        
      
    
  
  
    
      
        
          PHASE
          ⁢
          
            
          
          [
          k
          ]
        
        =
        
          
            
              2
              ⁢
              k
              ⁢
              
                
              
              ⁢
              π
            
            N
          
          ⁢
          
            
          
          ⁢
          radians
        
      
    
    
      
        (
        
          formula
          ⁢
          
            
          
          ⁢
          51
        
        )
      
    
  




where k=0, 1, 2 . . . N−2, N−1 (k denotes an integer that satisfies 0≦k≦N−1). When N=5, 7, 9, 11, or 15, the reception device is able to obtain good data reception quality.
Although the present description discusses the details of phase changing schemes involving two modulated signals transmitted by a plurality of antennas, no limitation is intended in this regard. Precoding and a change of phase may be performed on three or more baseband signals on which mapping has been performed according to a modulation scheme, followed by predetermined processing on the post-phase change baseband signals and transmission using a plurality of antennas, to realize the same results.
Programs for executing the above transmission scheme may, for example, be stored in advance in ROM (Read-Only Memory) and be read out for operation by a CPU.
Furthermore, the programs for executing the above transmission scheme may be stored on a computer-readable recording medium, the programs stored in the recording medium may be loaded in the RAM (Random Access Memory) of the computer, and the computer may be operated in accordance with the programs.
The components of the above-described Embodiments may be typically assembled as an LSI (Large Scale Integration), a type of integrated circuit. Individual components may respectively be made into discrete chips, or a subset or entirety of the components may be made into a single chip. Although an LSI is mentioned above, the terms IC (Integrated Circuit), system LSI, super LSI, or ultra LSI may also apply, depending on the degree of integration. Furthermore, the method of integrated circuit assembly is not limited to LSI. A dedicated circuit or a general-purpose processor may be used. After LSI assembly, a FPGA (Field Programmable Gate Array) or reconfigurable processor may be used.
Furthermore, should progress in the field of semiconductors or emerging technologies lead to replacement of LSI with other integrated circuit methods, then such technology may of course be used to integrate the functional blocks. Applications to biotechnology are also plausible.
INDUSTRIAL APPLICABILITY
The present invention is widely applicable to wireless systems that transmit a plurality of different modulated signals from a plurality of antennas, such as an OFDM-MIMO system. Furthermore, in a wired communication system with a plurality of transmission locations (such as a PLC (Power Line Communication) system, optical communication system, or DSL (Digital Subscriber Line) system), the present invention may be adapted to a MIMO system, where a plurality of transmission locations are used to transmit a plurality of modulated signals as described by the present invention. Modulated signals may also be transmitted from a plurality of transmission locations.
REFERENCE SIGNS LIST


    
    
        302A, 302B Encoders
        304A, 304B Interleavers
        306A, 306B Mappers
        314 Signal processing scheme information generator
        308A, 308B Weighting units
        310A, 310B Wireless units
        312A, 312B Antennas
        317A, 317B Phase changers
        402 Encoder
        404 Distributor
        504#1, 504#2 Transmit antennas
        505#1, 505#2 Receive antennas
        600 Weighting unit
        701_X, 701_Y Antennas
        703_X, 703_Y Wireless units
        705_1 Channel fluctuation estimator
        705_2 Channel fluctuation estimator
        707_1 Channel fluctuation estimator
        707_2 Channel fluctuation estimator
        709 Control information decoder
        711 Signal processor
        803 Inner MIMO detector
        805A, 805B Log-likelihood calculators
        807A, 807B Deinterleavers
        809A, 809B Log-likelihood ratio calculators
        811A, 811B Soft-in/soft-out decoders
        813A, 813B Interleavers
        815 Memory
        819 Coefficient generator
        901 Soft-in/soft-out decoder
        903 Distributor
        1201A, 1201B OFDM-related processors
        1302A, 1302A Serial-to-parallel converters
        1304A, 1304B Reorderers
        1306A, 1306B IFFT units
        1308A, 1308B Wireless units

## Claims

1. A signal generation method for generating, from a plurality of baseband signals, a plurality of signals for transmission on a common frequency band and at a common time, comprising the steps of:
performing a change of phase on each of a first baseband signal s1 generated from a first set of bits and a second baseband signal s2 generated from a second set of bits, thus generating a first post-phase change baseband signal s1′ and a second post-phase change baseband signal s2′; and
applying weighting to the first post-phase change baseband signal s1′ and to the second post-phase change baseband signal s2′ according to a predetermined matrix F, thus generating a first weighted signal z1 and a second weighted signal z2 as the plurality of signals for transmission on the common frequency band and at the common time, wherein
the first weighted signal z1 and the second weighted signal z2 satisfy the relation:


(z1,z2)T=F(s1′,s2′)T, where


(z1, z2)T denotes a transposed matrix of (z1, z2), and
(s1′, s2′)T denotes a transposed matrix of (s1′, s2′),
and the change of phase is performed on the first baseband signal s1 and the second baseband signal s2 using a phase modification value sequentially selected from among N phase modification value candidates, N being an integer equal to or greater than two and each of the N phase modification value candidates being selected at least once within a predetermined period.

2. A signal generation apparatus for generating, from a plurality of baseband signals, a plurality of signals for transmission on a common frequency band and at a common time, comprising:
a phase changer performing a change of phase on each of a first baseband signal s1 generated from a first set of bits and a second baseband signal s2 generated from a second set of bits, thus generating a first post-phase change baseband signal s1′ and a second post-phase change baseband signal s2′; and
a weighting unit applying weighting to the first post-phase change baseband signal s1′ and to the second post-phase change baseband signal s2′ according to a predetermined matrix F, thus generating a first weighted signal z1 and a second weighted signal z2 as the plurality of signals for transmission on the common frequency band and at the common time, wherein
the first weighted signal z1 and the second weighted signal z2 satisfy the relation:


(z1,z2)T=F(s1′,s2′)T, where


(z1, z2)T denotes a transposed matrix of (z1, z2), and
(s1′, s2′)T denotes a transposed matrix of (s1′, s2′),
and the change of phase is performed on the first baseband signal s1 and the second baseband signal s2 using a phase modification value sequentially selected from among N phase modification value candidates, N being an integer equal to or greater than two and each of the N phase modification value candidates being selected at least once within a predetermined period.