[go: up one dir, main page]

WO2018168410A1 - Dispositif de codage, procédé de codage, dispositif de communication, et système de communication - Google Patents

Dispositif de codage, procédé de codage, dispositif de communication, et système de communication Download PDF

Info

Publication number
WO2018168410A1
WO2018168410A1 PCT/JP2018/006848 JP2018006848W WO2018168410A1 WO 2018168410 A1 WO2018168410 A1 WO 2018168410A1 JP 2018006848 W JP2018006848 W JP 2018006848W WO 2018168410 A1 WO2018168410 A1 WO 2018168410A1
Authority
WO
WIPO (PCT)
Prior art keywords
subspaces
subspace
orthogonal
encoding
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/JP2018/006848
Other languages
English (en)
Japanese (ja)
Inventor
ジヤンミン ウー
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Publication of WO2018168410A1 publication Critical patent/WO2018168410A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24—Cell structures
    • H04W16/28—Cell structures using beam steering

Definitions

  • the present invention relates to an encoding device, an encoding method, a communication device, and a communication system.
  • MIMO multi-input and multi-output
  • the transmitter includes a plurality of transmission antennas
  • the receiver includes a plurality of reception antennas.
  • the transmitter transmits a plurality of data signals using a plurality of transmission antennas
  • the receiver receives a plurality of data signals transmitted via the plurality of transmission antennas using a plurality of reception antennas. .
  • the plurality of data signals are required not to interfere with each other.
  • it is required to multiplex more data signals. As the number of multiplexed data signals increases, the data signals easily interfere with each other.
  • An object according to one aspect of the present invention is to avoid or suppress interference between a plurality of multiplexed signals.
  • An encoding device is implemented in a communication device that transmits data in a predetermined signal space, and includes a plurality of subspaces specified in the signal space, including subspaces that are not orthogonal to each other. Encoding that generates a plurality of subspaces that are orthogonal to each other such that the number of subspaces that are orthogonal to each other obtained by encoding is equal to or greater than the number of subspaces that are orthogonal to each other among the plurality of designated subspaces.
  • a processing unit is provided.
  • a data signal is transmitted using wavelet packet conversion. Therefore, first, the wavelet packet transform will be briefly described. Note that wavelet packet transformation is used in various fields (for example, compression of image data).
  • h [n] and g [n] are a high-pass filter and a low-pass filter (one set of wavelet filters), and have a quadrature mirror filter characteristic.
  • Wavelet packet conversion has various characteristics. For example, when wavelet packet transformation is used in wavelet packet modulation, the spectral shape is improved and side lobes are suppressed compared to multicarrier modulation based on discrete Fourier transform. As a result, interference between carriers (ICI: inter carrier ⁇ ⁇ interference) and narrowband interference (NBI) are suppressed.
  • the wavelet packet transform can divide the signal space almost arbitrarily.
  • the signal space (or resource space) corresponds to a communication resource for transmitting a signal, and is configured by, for example, time and frequency.
  • Wavelet packet transform can derive multiple functions that are orthogonal to each other. “Orthogonal” corresponds to a state where they are independent of each other, and in communication, corresponds to a state where signals do not interfere with each other.
  • the areas of the subspaces in the time-frequency plane are required to be the same. For this reason, when the bandwidth is increased, the time slot length (symbol length) is reduced. Alternatively, increasing the time slot reduces the bandwidth.
  • FIG. 1 shows an example of time-frequency plane division.
  • a binary Wellet packet tree is used.
  • ⁇ L (t) represents a scale function.
  • the area of each subspace obtained by dividing the time-frequency plane is the same.
  • the areas of the two hatched areas shown in FIG. 1 are the same as shown in equation (2).
  • the characteristics of wavelet packet modulation are described in Non-Patent Document 1 described above.
  • the filter h [n] is localized in the time domain, but is not sufficiently localized in the frequency domain.
  • the support size of the Walsh function ⁇ j p is 2 j .
  • the wavelet packet recursion relationship is expressed by equation (4).
  • FIG. 2 shows an example of a Walsh wavelet packet. These Walsh wavelet packets are calculated by giving ⁇ 0 0 (t) to equation (4). The horizontal axis represents time, and the vertical axis represents signal power.
  • the signal space includes one or more subspaces.
  • the space S includes subspaces S 1 to S M.
  • the following definitions are introduced.
  • Subspace S k is orthogonal (or independent) to subspace S i ” means that all vectors of S k are orthogonal to all vectors of S i , It is represented by
  • space S comprises only the subspace S k and S i, when the vector of the subspace S k and S i is denoted by V k and V i, respectively, of the subspace S k and the sub-space S i
  • the orthogonality is calculated by a vector inner product expressed by the equation (7).
  • FIG. 3 is a diagram for explaining the outline of subspace coding.
  • the space S is expressed by the equation (8).
  • the subspace S k corresponds to a channel resource that propagates a data signal.
  • the subspace S k may be a subcarrier in an OFDM (orthogonal frequency division multiplexing) system, a transmission antenna in a MIMO system, or a pseudo noise sequence in a code division multiple access (CDMA) system. May be.
  • the subspaces that do not overlap each other are orthogonal to each other.
  • the subspaces S 3 , S 4 , and S 5 are orthogonal to the subspace S 1 .
  • the subspaces that overlap each other in FIG. 3 are not orthogonal to each other.
  • the subspace S 2 are not orthogonal with respect to the sub-space S 1.
  • signals transmitted through subspaces overlapping each other can interfere with each other.
  • one or a plurality of new subspaces are generated from a plurality of given subspaces by the function f c shown in the equation (9).
  • S k, i represents a new subspace generated by subspace coding.
  • C k, i represents a codeword matrix for generating a new subspace from a given subspace.
  • Equation (10) represents an operation for generating two new subspaces by performing subspace coding on the subspace S 1 and the subspace S 2 . Further, (11) executes a subspace coding shows the operation of generating one new sub-space relative subspace S 3 and the sub-space S 5.
  • the subspaces S 1 and S 2 are not orthogonal to each other, and the subspaces S 3 and S 2 are not orthogonal to each other. 5 are not orthogonal to each other. That is, the number of subspaces orthogonal to each other is 3 before encoding.
  • the number of subspaces orthogonal to each other is four. Thus, the number of subspaces orthogonal to each other is increased by subspace coding.
  • the sub-space S 3 Interference may occur between the signal transmitted by the sub-space S 5 and the signal transmitted by the subspace S 5 .
  • the four subspaces obtained by the subspace coding are orthogonal to each other, so that interference is removed. Therefore, by performing sub-space coding, the number of signals transmitted without interference increases and the transmission capacity of the communication system increases.
  • the sub-space coding has the following two features.
  • Feature 1 relates to the problem of how to collect sufficient subspaces in a communication system to increase the number of subspaces orthogonal to each other.
  • each transmit antenna of a MIMO system can be considered as a subspace, but usually a MIMO system does not guarantee orthogonality between antenna subspaces. Therefore, for example, if processing based on singular value decomposition (SVD) is introduced, a MIMO channel is converted into a plurality of single-input single-output channels that are parallel and free of interference, and complete orthogonal transmission is performed. Can be realized.
  • the processing based on the singular value decomposition has the same concept as the subspace coding according to the embodiment of the present invention.
  • the subspace coding will transform the MIMO antenna into n MIMO orthogonal subspaces.
  • Feature 2 In order to ensure the degree of freedom of subspace coding, the dimensions of the subspace are required to be kept sufficiently high. The higher the subspace dimensions in subspace coding, the higher the efficiency in generating subspaces that are orthogonal to each other.
  • Feature 2 represents that in order to obtain a large number of mutually orthogonal subspaces, the dimensions of the subspaces must be high.
  • a MIMO system is required to have a sufficiently large number of antennas.
  • the maximum MIMO rank corresponds to the smaller value of the number of transmission antennas and the number of reception antennas.
  • feature 2 is that subspace coding operates in a system that combines a plurality of different communication schemes (for example, a subspace related to OFDM, a subspace based on CDMA, and a subspace based on MIMO). Represents that it is preferable.
  • FIG. 4 shows an example of subspace coding.
  • the space S is a time-frequency space.
  • the space S includes four subspaces S 1 , S 2 , S 3 and S 4 as shown in FIG. Different frequencies are assigned to the subspaces S 1 and S 2 . That is, the sub-space S 1, S 2 are orthogonal to each other. Also, different time slots are allocated to the subspaces S 3 and S 4 . That is, the subspaces S 3 and S 4 are also orthogonal to each other. This state is expressed by equation (13).
  • the space S can be realized by OFDM, for example.
  • the space S can be divided into different forms.
  • the frequency bandwidths assigned to the subspaces S 1 and S 2 are the same, and the time widths assigned to the subspaces S 1 and S 2 are also the same.
  • the frequency bandwidth allocated to the subspaces S 1 and S 2 is 1 ⁇ 2, and the frequency bandwidths allocated to the subspaces S 1 and S 2 are allocated.
  • the time span is twice.
  • the two-dimensional vector V k is expressed by equation (14). Note that a k is a vector element.
  • the sub-space orthogonal to the subspace S 1 is only S 2
  • subspace orthogonal to the subspace S 2 is only S 1.
  • the sub-space orthogonal to the subspace S 3 is only S 4
  • subspace orthogonal to the subspace S 4 is only S 3. Therefore, the maximum value of the number of subspaces orthogonal to each other is 2. In this case, the maximum number of data signals that can be transmitted simultaneously without interference is two.
  • subspace coding is performed on the space S (that is, designated subspaces S 1 to S 4 ).
  • new subspaces S 3 and 4 are generated by performing subspace coding on the subspaces S 3 and S 4 .
  • a new sub-space S 3, 4 is orthogonal to the subspace S 1, and is generated to be perpendicular to the sub-space S 2.
  • three subspaces S 1 , S 2 , S 3 and 4 orthogonal to each other are obtained. That is, the number of subspaces orthogonal to each other is increased from 2 to 3 by subspace coding.
  • the subspaces S 3 and S 4 are represented by two-dimensional vectors V 3 and V 4 , respectively.
  • the component of the vector V 3 is (a 3 , a 3 )
  • the component of the vector V 4 is (a 4 , a 4 ).
  • the subspace S3,4 is represented by a vector V3,4 .
  • Equation (15) the sub-space encoding is expressed by equation (15).
  • C 3, 4 is a codeword matrix for realizing a subspace coding.
  • a process for generating the vectors V 3 and 4 representing the subspaces S 3 and 4 is expressed by, for example, Expression (16).
  • the 4 ⁇ 4 matrix in the equation (16) represents the codeword matrix C3,4 .
  • the vector V 3,4 is generated by multiplying the sum of the vector representing the subspace S 3 and the vector representing the subspace S 4 by the codeword matrix C 3 , 4 . That is, one encoded four-dimensional vector V 3,4 is obtained from two two-dimensional vectors (V 3 and V 4 ).
  • FIG. 4B shows a new subspace obtained by the subspace coding of the equations (15) and (16).
  • Subspaces S 3 and 4 have the same time-frequency domain as the sum of subspace S 1 and subspace S 2 .
  • the component corresponding to the same region as the sub space S 1 is (a 3 , ⁇ a 3 ).
  • the components corresponding to the same region as the sub space S 2 are also (a 3 , ⁇ a 3 ).
  • the orthogonality of the three subspaces S 1 , S 2 , S 3 and 4 will be examined.
  • the orthogonality between subspaces is calculated by the inner product of vectors.
  • the inner product of the subspace S 1 and when calculating orthogonality between the "subspace S 1 except subspace” is a vector representing the subspace S 1 "vector representing the subspace S 1 except subspace” Is calculated. Therefore, first, “a subspace other than the subspace S 1 ” is calculated.
  • the “subspace other than the subspace S 1 ” is expressed by Expression (17). In the equation (17), since the subspaces S 1 and S 2 are orthogonal to each other, the overlap between them is zero.
  • FIG. 5 shows an example of sub-space coding in a communication system that transmits data signals using OFDM.
  • the communication system transmits data signals using two subspace slices.
  • Each slice is realized by a transmission antenna of a MIMO system, for example.
  • each slice transmits a data signal using frequencies f 1 and f 2 and time slots t 1 and t 2 . That is, slices S1 and S2 use the same time-frequency domain. Therefore, even if the data signal of slice S1 and the data signal of slice S2 are transmitted via different transmission antennas, these data signals may interfere with each other.
  • the communication system generates subspaces orthogonal to each other by the subspace coding shown in FIG.
  • the subspace coding shown in FIG. 5 three subspaces S 1 , S 2 , S 3 and 4 shown in FIG. 5 are generated.
  • the slice S1 is includes a sub-space S 1, S 2, slice S2 are including subspace S 3, 4.
  • slice S1 data is transmitted using subcarriers of ⁇ t ⁇ 2 ⁇ f. Specifically, subspace S 1 transmits data symbol d 1 using time slot t 1 ⁇ frequency band f 1 to f 2 . Subspace S 2 transmits data symbol d 2 using time slot t 2 ⁇ frequency bands f 1 to f 2 .
  • the slice S2 data is transmitted using subcarriers 2 ⁇ t ⁇ ⁇ f.
  • the subspaces S 3 and 4 transmit one data symbol in one symbol time. Specifically, subspaces S 3 and 4 transmit data symbol d 3 using time slots t 1 to t 2 ⁇ frequency band f 1 , and time slots t 1 to t 2 ⁇ frequency band f 2 .
  • the inverted data symbol d 3 ( ⁇ d 3 ) is transmitted. “Inversion” is realized, for example, by inverting the phase of a symbol. As an example, when the phase of d 3 is ⁇ / 2, the phase of ⁇ d 3 is 3 ⁇ / 2.
  • the subspace coding may include a mapping process for assigning data symbols to corresponding subspaces.
  • the mapping process assigns data symbol d 1 to subspace S 1 (t 1 ⁇ f 1 to f 2 ) and assigns data symbol d 2 to subspace S 2 (t 2 ⁇ f 1 to assigned to f 2), assign the data symbol d 3 into the sub-space S 3,4 (t 1 ⁇ t 2 ⁇ f 1), inverted data symbols d 3 subspace S 3,4 (t 1 ⁇ t 2 ⁇ assigned to f 2 ).
  • the codeword matrix used in the above subspace coding can be obtained by modifying the above equation (20) in consideration of the subspace based on the subcarrier in the OFDM system. However, each data symbol is required to have the same transmission quality. Therefore, the codeword matrix is determined so that each data symbol is transmitted with the same power. In this case, the codeword matrix is expressed by equation (21).
  • the three data symbols d 1 , d 2 , d 3 are represented by four subcarriers d 1 (t) to d 4 (t) in the three subspaces S 1 , S 2 , S 3 , 4. Is transmitted.
  • the sub-space S 1 is composed of a sub-carrier d 1 (t)
  • the sub-space S 2 is comprised of subcarriers d 2 (t)
  • Each subcarrier is expressed by equation (22).
  • subcarriers d 1 (t) to d 2 (t) belonging to slice S1 are transmitted via transmission antenna TX1, and subcarrier d belonging to slice S2 is transmitted.
  • 3 (t) to d 4 (t) may be transmitted via the transmission antenna TX2.
  • Each subcarrier is received by the receiver 20.
  • the receiver 20 receives the subcarriers d 1 (t) to d 4 (t) using one or a plurality of reception antennas.
  • the subcarriers d 1 (t) and d 2 (t) are transmitted in different time slots, they are orthogonal to each other.
  • the subcarriers d 3 (t) and d 4 (t) are transmitted at different frequencies, they are orthogonal to each other. Therefore, the received signals r 1 to r 4 obtained by the receiver 20 are expressed by the equation (23).
  • ⁇ 2 represents the noise energy received at each subcarrier.
  • Expression (23) is transformed using Expression (22), Expression (24) is obtained. Therefore, the receiver 20 can reproduce the data symbols d 1 and d 2 from the received signals r 1 and r 2 , respectively.
  • equation (25) is obtained. Therefore, the receiver 20 can reproduce the data symbol d 3 from the received signals r 3 and r 4 .
  • the number of orthogonal channels can be increased.
  • the number of channels orthogonal to each other is increased from 2 to 3 due to sub-space coding. Therefore, the capacity of the communication system is increased by 50%.
  • the subspace in order not to lose generality, the subspace represents the minimum transmission unit.
  • the subspaces can have differently shaped rectangles, for example in the time-frequency plane, but are required to have the same area. In this case, the data transmission capability of each subspace is substantially the same.
  • each slice has 2 M-1 subspaces.
  • the subspaces in the slice are set to be orthogonal to each other.
  • M slices are combined to form a transmission block.
  • Each slice may be realized by a transmission antenna in a MIMO system, for example.
  • FIG. 6 shows an example of a model of subspace, subspace slice, and transmission block.
  • a subspace as a minimum transmission unit corresponds to a subcarrier that transmits a data symbol.
  • each sub-space slice in order to transmit the 2 M-1 data symbols, having 2 M-1 sub-space (i.e., 2 M-1 sub-carriers).
  • Each data symbol is generated by a desired modulation scheme (for example, QPSK, 16QAM, 64QAM).
  • the shape of the subspace differs for each slice as shown in FIG. Specifically, the sub-space that is used in the slice 1 (i.e., subcarriers) duration and frequency bandwidth is ⁇ t and 2 M-1 ⁇ ⁇ f.
  • the time width and frequency bandwidth of the subspace used in slice 2 are 2 ⁇ ⁇ t and 2 M ⁇ 2 ⁇ ⁇ f.
  • the time width and frequency bandwidth of the subspace used in slice n are 2 n-1 ⁇ ⁇ t and 2 Mn ⁇ ⁇ f. Therefore, the time width and frequency bandwidth of the subspace used in the slice M are 2 M ⁇ 1 ⁇ ⁇ t and ⁇ f.
  • the communication system transmits data signals using M subspace slices. Each slice has 2 M-1 subspaces. Therefore, the communication system can transmit a maximum of M ⁇ 2 M ⁇ 1 data symbols. However, interference may occur between subspaces that are not orthogonal to each other. That is, in the communication system, it is actually difficult to transmit M ⁇ 2 M ⁇ 1 data symbols using the model shown in FIG.
  • ⁇ Wavelet sub-space transmission> it is assumed that a signal is transmitted through a channel with low fading and flat frequency characteristics. That is, it is assumed that the channel response is constant in the 1st to 2M- 1th time regions and the channel response is constant in the 1st to 2M- 1th frequency regions. In order to simplify the description, the channel response at time t k and frequency f i is assumed to be “1” below.
  • the above-mentioned channels are, for example, 7.5 kHz, 15 kHz, 30 kHz, 60 kHz, 120 kHz subcarrier frequency intervals, and 16 Tc, 8 Tc, 4 Tc, 2 Tc, This can be realized by generating a Tc subcarrier time interval (see Non-Patent Document 3 described above).
  • FIG. 7 shows an example of sub-space transmission based on wavelet packets.
  • transmitter 10 transmits data signals in parallel using M subspace slices.
  • a data signal is generated from the data symbols using inverse wavelet packet transformation. That is, the waveform of the transmission signal is formed using inverse wavelet packet transformation.
  • data signals of M slices are transmitted via different transmission antennas. Also, slices 1 to M follow the model shown in FIG.
  • the receiver 20 receives a signal via one or a plurality of reception antennas. At this time, the received signal includes data signals of M slices. In addition, noise is added to the received signal. Then, the receiver 20 reproduces a symbol from the received signal using wavelet packet conversion.
  • FIG. 8 shows a model of noise added to the received signal.
  • ⁇ k, i represents reception noise.
  • the energy (or power) of this reception noise is expressed by equation (27). Note that ⁇ 2 represents noise energy received in each subcarrier.
  • FIG. 9 shows an example of a sub-spatial channel model for wavelet packet modulation using three sub-spatial slices.
  • the transmitter 10 transmits data symbols using three slices 1-3.
  • Slices 1 to 3 correspond to MIMO transmission antennas, for example.
  • Slice 1 includes the following four subspaces.
  • S 1,1 time t 1 ⁇ frequency f 1 to f 4
  • S 1,2 time t 2 ⁇ frequency f 1 to f 4
  • S 1,3 time t 3 ⁇ frequency f 1 to f 4
  • S 1,3 time t 4 ⁇ frequency f 1 to f 4
  • Slice 2 includes the following four subspaces.
  • the receiver 20 receives signals transmitted via the slices 1 to 3 with one or a plurality of antennas.
  • the received signal R obtained by the receiver 20 is expressed by the following equations (28) and (28a) to (28d).
  • H represents a codeword matrix.
  • D represents a data symbol transmitted by the transmitter 10.
  • the data symbol d k, i is assigned to the subspace S k, i .
  • N represents a noise component.
  • Z T represents the transpose of the matrix Z.
  • equation (28) is transformed to obtain equation (29).
  • the received signal R is represented by three 1 ⁇ 4 matrices R 1 to R 3 .
  • the data symbol D is represented by three 1 ⁇ 4 matrices D 1 to D 3 .
  • the noise component N is represented by three 1 ⁇ 4 matrices N 1 to N 3 .
  • the codeword matrix H is represented by a 4 ⁇ 4 matrix A, B, C, I. I represents a unit matrix.
  • the pattern of equation (31) corresponds to the codeword matrix shown in equations (32a) to (32c). That is, codeword matrices C 1 to C 3 used for each subspace are obtained.
  • the communication system has eight data symbols (d 1 ) for each transmission block by twelve subcarriers configured in time slots t 1 to t 4 and frequencies f 1 to f 4 . , 1 , d 1,2 , d 1,3 , d 1,4 , d 2,1 , d 2,2 , d 3,1 , d 3,3 ). Specifically, as shown in FIG. 10, eight data symbols are transmitted.
  • slice 1 four data symbols (d 1,1 to d 1,4 ) are allocated to four subcarriers as described below. That is, four data symbols are transmitted by slice 1.
  • Subcarrier S 1,1 (t 1 ⁇ f 1 to f 4 ): d 1,1
  • Subcarrier S 1,2 (t 2 ⁇ f 1 to f 4 ): d 1,2
  • Subcarrier S 1,3 (t 3 ⁇ f 1 to f 4 ): d 1,3
  • Subcarrier S 1,4 (t 4 ⁇ f 1 to f 4 ): d 1,4
  • two data symbols (d 2,1 , d 2,2 ) are allocated to four subcarriers as described below. That is, two data symbols are transmitted by slice 2.
  • the same data symbols are assigned to the subcarriers S 2,1 and S 2,3 .
  • the phase of the data symbol assigned to subcarrier S 2,3 is inverted with respect to the phase of the data symbol assigned to subcarrier S 2,1 .
  • the same data symbol is allocated to the sub-carrier S 2, 2 and S 2, 4.
  • the phase of the data symbol assigned to subcarrier S 2,4 is inverted with respect to the phase of the data symbol assigned to subcarrier S 2,2 .
  • Subcarrier S 2,1 (t 1 to t 2 ⁇ f 1 to f 2 ): d 2,1
  • Subcarrier S 2,2 (t 3 to t 4 ⁇ f 1 to f 2 ): d 2,2
  • Subcarrier S 2,3 (t 1 to t 2 ⁇ f 3 to f 4 ): -d 2,1
  • Subcarrier S 2,4 (t 3 to t 4 ⁇ f 3 to f 4 ): -d 2,2
  • slice 3 two data symbols (d 3,1 , d 3,3 ) are allocated to four subcarriers as described below. That is, two data symbols are transmitted by slice 3. At this time, the same data symbols are assigned to the subcarriers S 3,1 and S 3,2 .
  • phase of the data symbol assigned to subcarrier S 3,2 is inverted with respect to the phase of the data symbol assigned to subcarrier S 3,1 .
  • the same data symbols are allocated to subcarriers S 3,3 and S 3,4 .
  • the data symbols allocated to the subcarriers S 3, 4 phase is inverted with respect to the data symbols allocated to the subcarriers S 3,3 phases.
  • Subcarrier S 3,1 (t 1 to t 4 ⁇ f 1 ): d 3,1
  • Subcarrier S 3,2 (t 1 to t 4 ⁇ f 2 ): -d 3,1
  • Subcarrier S 3,3 (t 1 to t 4 ⁇ f 3 ): d 3,3
  • Subcarrier S 3,4 (t 1 to t 4 ⁇ f 4 ): -d 3,3
  • the receiver 20 can reproduce the data symbol D 1 (d 1,1 to d 1,4 ) from the received signal R 1 .
  • the receiver 20 can reproduce the data symbol D 2 (d 2,1 , d 2,2 ) from the received signal R 2 .
  • the receiver 20 can reproduce the data symbol D 3 (d 3,1 , d 3,3 ) from the received signal R 3 .
  • the subspaces are orthogonal to each other, no interference occurs between the eight data symbols.
  • the number of symbols assigned to one transmission block is less than 2 M ⁇ 1 ⁇ M.
  • the number of symbols assigned to one transmission block is less than 2 M ⁇ 1 ⁇ M.
  • eight data symbols are allocated to one transmission block as shown in FIG.
  • eight data symbols are assigned to slice 1
  • four data symbols are assigned to slices 2 to 4, respectively. Therefore, 20 data symbols are assigned to one transmission block.
  • the number of data symbols represented by the equation (35) is transmitted in mutually orthogonal subspaces.
  • the number of subspaces orthogonal to each other is, for example, the same as the number of subspaces in one slice, which is 2 M ⁇ 1 . Therefore, compared to the case where sub-space coding is not performed, the number of symbols that can be transmitted without interference (ie, transmission capacity) is (M + 1) / 2 times by performing sub-space coding.
  • (M + 1) / 2 times the transmission power is required in the case where subspace coding is performed, compared to the case where subspace coding is not performed.
  • subspaces orthogonal to each other are generated from a plurality of given subspaces according to the following rules.
  • a plurality of subspaces allocated to the nth slice among M slices are subspace matrices each composed of 2 n-1 frequency regions and 2 Mn time slots. Shall be represented.
  • each subspace is encoded with “1”. “1” indicates that the output of the encoding device is the same as the input of the encoding device. That is, in the slice 1, substantially no encoding is performed on a given subspace.
  • each subspace arranged in the odd-numbered row is encoded with “1”, and each subspace arranged in the even-numbered row is “ ⁇ ”. 1 ”.
  • “ ⁇ 1” represents a state in which the output of the encoding device is inverted with respect to the input of the encoding device.
  • symbol 1 is assigned to the subspace corresponding to the second row and first column of the subspace matrix.
  • symbol 2 is assigned to the subspace corresponding to the second row and the second column.
  • corresponding symbols are assigned up to the last column of the second row.
  • the sign of the symbol assigned to each subspace in the second row is inverted with respect to the sign of the corresponding symbol assigned to each subspace in the first row. That is, the inverted symbols obtained by inverting the signs of the data symbols assigned to the subspaces in the first row are assigned to the corresponding subspaces in the second row.
  • a data symbol is assigned to each subspace of each odd-numbered row of the subspace matrix, and the corresponding data symbol whose code is inverted is assigned to each subspace of the next row of each odd-numbered row (ie, adjacent even-numbered row) Are assigned to each.
  • encoding is performed on slices 2 to M, and encoding is not performed on slice 1.
  • the present invention is not limited to this method. That is, the encoding apparatus may perform encoding on slices 1 to M ⁇ 1 and not perform encoding on slice M. Further, the encoding apparatus may encode each subspace of the odd-numbered row with “ ⁇ 1” and encode each subspace of the even-numbered row with “1”. Further, the encoding apparatus may execute encoding for the other M ⁇ 1 slices without performing encoding for any one of the slices 1 to M.
  • the encoding apparatus may assign inverted symbols to subspaces belonging to even rows in a certain subspace pair, and assign inverted symbols to subspaces belonging to odd rows in another subspace pair. However, even in this case, all subspaces are required to be orthogonal to each other.
  • FIG. 13 shows an example of a transmitter that transmits data using wavelet subspace coding.
  • the transmitter 10 includes a serial / parallel converter 11, a subspace encoder 12, and an inverse wavelet packet converter (IWPT) 13.
  • the transmitter 10 may further include other elements not shown in FIG.
  • transmitter 10 transmits data using M subspace slices.
  • M is an integer and is not particularly limited, and is, for example, 3, 4 or 5.
  • slice number information indicating the number of slices used by the transmitter 10 (that is, the value of M) is given to the transmitter 10.
  • the slice number information is given from, for example, a user or a network administrator.
  • the slice information given to the transmitter 10 specifies the arrangement of subspaces in each slice.
  • the arrangement of subspaces is specified in this example by frequency and time slot.
  • the transmitter 10 When transmitting data using M slices, the transmitter 10 has 2 M ⁇ 1 +2 M ⁇ 2 (M ⁇ 1) pieces per transmission block as described with reference to FIG. Subspace coding is performed to transmit data symbols. Therefore, in this case, the serial / parallel converter 11 distributes the 2 M-1 +2 M-2 (M-1) data symbols in the slice 1 ⁇ M. Specifically, it distributes 2 M-1 data symbols on the slice 1, distributes the 2 M-2 data symbols respectively slices 2 ⁇ M.
  • each data symbol transmits 2 bits of data
  • each data symbol transmits 4 bits of data
  • the sub-space encoder 12 includes encoders 12-1 to 12-M. Encoders 12-1 to 12-M are implemented for slices 1 to M, respectively. In addition, the encoders 12-1 to 12-M each perform sub-space encoding. Each of encoders 12-1 to 12-M assigns data symbols provided from serial / parallel converter 11 to a plurality of subspaces generated by subspace encoding.
  • the operations of the encoders 12-1 to 12-M will be described with reference to FIG. 6 and FIG.
  • the sub space encoder 12 (or encoders 12-1 to 12-M) has a mapping function. That is, the subspace encoder 12 can convert each input data symbol into electric field information representing the phase / amplitude corresponding to the value according to the designated modulation scheme.
  • the electric field information may represent the phase / amplitude of the symbol as a complex number (in-phase component and quadrature component).
  • encoder 12-1 encodes all subspaces with “1”. That is, the encoder 12-1 does not substantially perform sub-space encoding. Therefore, the encoder 12-1 assigns the first data symbol (d 1,1 ) to the first subspace and assigns the second data symbol (d 1,2 ) to the second subspace. Similarly, each data symbol is assigned to a corresponding subspace.
  • encoder 12-2 encodes each subspace belonging to the first row of the subspace matrix with “1”, and each subspace belonging to the second row with “ ⁇ 1”. . Therefore, the encoder 12-2 assigns the first data symbol (d 2,1 ) to the first subspace of the first row, inverts the sign of the same data symbol (d 2,1 ), and outputs 2 Assign to the first subspace of the row. Similarly, the same data symbol is assigned to the same time slot in the first row and the second row. However, the signs of the data symbols assigned to the same time slot in the first row and the second row are reversed from each other.
  • Inversion of the sign of the data symbol is realized, for example, by inverting the phase of the transmission signal.
  • the inversion of the code of the data symbol is realized by the mapping function of the encoder 12-2. For example, when the phase of the data symbol d 2,1 assigned to the first subspace in the first row is ⁇ / 2, the data symbol d 2,1 assigned to the first subspace in the second row The phase is 3 ⁇ / 2.
  • the encoder encodes the subspaces belonging to the first and third rows with “1”, respectively, and encodes the subspaces belonging to the second and fourth rows with “ ⁇ 1”, respectively. To do. Therefore, the encoder assigns the first data symbol (d 3,1 ) to the first subspace of the first row, inverts the sign of the same data symbol (d 3,1 ), and Assign to the first subspace. Similarly, the same data symbol is assigned to the same time slot in the first row and the second row. However, the signs of the data symbols assigned to the same time slot in the first row and the second row are reversed from each other. Further, data symbols are assigned to the subspaces belonging to the third and fourth rows in the same manner.
  • encoder 12 -M encodes subspaces belonging to odd rows with “1”, and encodes subspaces belonging to even rows with “ ⁇ 1”. Therefore, the encoder 12-M assigns the first data symbol (d M, 1 ) to the subspace of the first row, inverts the sign of the same data symbol (d M, 1 ), and Assign to subspace. Similarly, data symbols are assigned to the remaining subspaces.
  • the IWPT 13 includes converters 13-1 to 13-M.
  • Converters 13-1 to 13-M are implemented for slices 1 to M, respectively. Then, converters 13-1 to 13-M generate transmission signals by inverse wavelet packet conversion based on the data symbols assigned to the subspaces by corresponding encoders 12-1 to 12-M, respectively. .
  • the IWPT 13 is a resource to which the data symbol d k, i is allocated using inverse wavelet packet transformation, and the data symbol d k, i Generate a signal representing the phase / amplitude of.
  • the IWPT 13 performs inverse wavelet packet conversion on the electric field information to generate a transmission signal. Wavelet packet conversion is as described with reference to equations (1) to (4).
  • the transmitter 10 outputs a signal generated for each slice by the IWPT 13 (converters 13-1 to 13-M). At this time, the transmitter 10 may combine and output a plurality of signals generated by the converters 13-1 to 13-M. In the MIMO system, the transmitter 10 may output the signals generated by the converters 13-1 to 13-M via the corresponding transmission antennas.
  • FIG. 14 shows an example of a receiver that receives a signal generated using wavelet subspace coding.
  • the receiver 20 includes a wavelet packet converter (WPT) 21 and a sub-spatial decoder (SS decoder) 22. Note that the receiver 20 may further include other elements not shown in FIG.
  • WPT wavelet packet converter
  • SS decoder sub-spatial decoder
  • the receiver 20 receives a signal transmitted from the transmitter 10 shown in FIG. At this time, noise n (t) is added to the signal transmitted from the transmitter 10 in the transmission path. This noise n (t) is added at each frequency and in each time slot, for example, as shown in FIG.
  • the WPT 21 includes converters 21-1 to 21-M.
  • the codeword matrix H is assumed to be known.
  • FIG. 15 shows an example of the hardware configuration of the communication apparatus.
  • the communication device 30 includes a transmitter and a receiver.
  • the transmitter corresponds to, for example, the transmitter 10 illustrated in FIG.
  • the receiver corresponds to, for example, the receiver 20 illustrated in FIG.
  • the communication device 30 includes an antenna.
  • the communication device 30 includes a plurality of transmission antennas and a plurality of reception antennas.
  • the communication device 30 includes a processor 31 and a memory 32 as shown in FIG.
  • the memory 32 stores a program describing a function for generating a transmission signal based on transmission data and a function for reproducing data from the reception signal.
  • the memory 32 can also temporarily store data.
  • the processor 31 implements a function of generating a transmission signal based on an input data symbol and a function of reproducing a data symbol from a reception signal by executing a program stored in the memory 32.
  • some of the functions of the serial / parallel converter 11, the sub space encoder 12, the inverse wavelet packet converter 13, the wavelet packet converter 21, and the sub space decoder 22 may be realized by a hardware circuit. .
  • channel capacity C Wssc based on wavelet subspace coding is expressed by equation (38).
  • the gain ⁇ resulting from the wavelet subspace coding (that is, the gain of the channel capacity based on the wavelet subspace coding with respect to the Shannon channel capacity) is calculated by the equation (39).
  • M represents the maximum number of slices.
  • ⁇ represents the SNR of the symbol. Specifically, ⁇ corresponds to P / (N 0 W).
  • FIG. 16 represents channel capacity gain with respect to the number of slices and SNR in a communication system in which subspace coding is performed.
  • Each characteristic shown in FIG. 16 represents a case where the SNR of the symbol is 0, 5, 10, 15, 20 dB. According to this embodiment, the following characteristics can be obtained.
  • the channel capacity gain increases linearly with the number of slices. That is, sub-space coding provides a linear relationship between transmission power and channel capacity.
  • the higher the SNR of a data symbol the greater the channel capacity gain.
  • the channel capacity gain also becomes infinite.
  • subspace coding in the subspace coding according to the embodiment of the present invention, new subspaces orthogonal to each other are generated from the given subspace. At this time, the number of newly generated subspaces orthogonal to each other is equal to or greater than the number of subspaces orthogonal to each other included in the given subspace. Therefore, the number of data symbols transmitted without interference increases and the transmission capacity increases.
  • a codeword matrix is used so that a linear relationship is obtained between transmission power and channel capacity.
  • sub-space coding can be applied to wired communication, wireless communication, and optical fiber communication.
  • Transmitter 11 Serial / Parallel Converter 12 Sub-Space Encoder 12-1 to 12-M Encoder 13 Inverse Wavelet Packet Converter (IWPT) 13-1 to 13-M Converter 20 Receiver 21 Wavelet packet converter (WPT) 21-1 to 21-M Converter 22 Sub-spatial decoder 30 Communication device 31 Processor 32 Memory

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Transmission System (AREA)

Abstract

L'invention concerne un dispositif de codage installé dans un dispositif de communication pour transmettre des données dans un espace de signal prédéterminé, le dispositif de codage comprenant une unité de traitement de codage. L'unité de traitement de codage génère une pluralité de sous-espaces mutuellement orthogonaux, à partir d'une pluralité de sous-espaces qui ont été désignés dans le sous-espace de signal et comprennent des sous-espaces qui ne sont pas mutuellement orthogonaux. La génération des sous-espaces est telle que le nombre de sous-espaces mutuellement orthogonaux obtenus par codage devient supérieur ou égal au nombre de sous-espaces mutuellement orthogonaux parmi la pluralité désignée de sous-espaces.
PCT/JP2018/006848 2017-03-15 2018-02-26 Dispositif de codage, procédé de codage, dispositif de communication, et système de communication Ceased WO2018168410A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762471618P 2017-03-15 2017-03-15
US62/471,618 2017-03-15

Publications (1)

Publication Number Publication Date
WO2018168410A1 true WO2018168410A1 (fr) 2018-09-20

Family

ID=63523300

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2018/006848 Ceased WO2018168410A1 (fr) 2017-03-15 2018-02-26 Dispositif de codage, procédé de codage, dispositif de communication, et système de communication

Country Status (1)

Country Link
WO (1) WO2018168410A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012124852A (ja) * 2010-12-10 2012-06-28 Nagoya Institute Of Technology Ｗｐｍａ伝送方式

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012124852A (ja) * 2010-12-10 2012-06-28 Nagoya Institute Of Technology Ｗｐｍａ伝送方式

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HASSOUNA, S. I. ET AL.: "Wavelet packet modulation for multi- carrier CDMA communications", 24TH NATIONAL RADIO SCIENCE CONFERENCE (NRSC 2007), 13 March 2007 (2007-03-13) - 15 March 2007 (2007-03-15), pages c32-1 - c32-8, XP055555904, Retrieved from the Internet <URL:DOI:10.1109/NRSC.2007.371385> *
PREMA, G. ET AL.: "A new MIMO-OFDM transmit preprocessing using pilot symbol assisted rateless codes to mitigate fading and wavelet based OFDM for PAPR reduction", PROCEEDINGS OF 2011 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, COMMUNICATION, COMPUTING AND NETWORKING TECHNOLOGIES (ICSCCN 2011, 21 July 2011 (2011-07-21) - 22 July 2011 (2011-07-22), XP031940834, Retrieved from the Internet <URL:DOI:10.1109/ICSCCN.2011.6024637> *

Similar Documents

Publication Publication Date Title
US11929858B2 (en) Integrated circuit for Discrete Fourier Transforming a time signal to a frequency signal
CN101652947B (zh) 发送方法、发送装置、接收方法以及接收装置
CA2698237C (fr) Systemes et procedes de conception d&#39;un signal de reference a emettre dans un systeme cellulaire multiplexe
CA2786632C (fr) Appareil de generation de codes, appareil de generation de signaux de reference et procedes correspondants
KR101217551B1 (ko) 무선 송신 장치, 무선 수신 장치, 무선 송신 방법, 무선수신 방법, 송수신 방법 및 기록 매체
WO2018168410A1 (fr) Dispositif de codage, procédé de codage, dispositif de communication, et système de communication

Legal Events

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

Ref document number: 18767833

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18767833

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP