P matrix for EHT

By employing subcarrier-specific orthogonal (±1,0) matrices, the challenges of computational complexity and reduced power in wireless communication systems are addressed, enabling efficient transmission of multi-carrier symbols with maximum power and reduced complexity for high-throughput systems.

JP7595650B2Active Publication Date: 2024-12-06TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
JP2022516017
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2019-09-16
Publication Date
2024-12-06
Estimated Expiration
2039-09-16

Smart Images

  • Figure 0007595650000022
    Figure 0007595650000022
  • Figure 0007595650000023
    Figure 0007595650000023
  • Figure 0007595650000024
    Figure 0007595650000024
Patent Text Reader

Abstract

In one example embodiment, a method is provided for simultaneously transmitting multicarrier symbols composed of multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The method includes transmitting symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of the matrix associated with the subcarrier, the row being associated with the antenna, and the matrix being selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] Examples of this disclosure relate to transmitting symbols, such as from multiple antennas and multiple subcarriers. [Background technology]

[0002] Advanced antenna systems may be used to significantly improve the performance of wireless communication systems in both the uplink (UL) and downlink (DL) directions. For example, advanced antennas may offer the possibility to use spatial regions of the channel to improve transmission reliability and / or throughput, such as by transmitting using multiple spatial streams (also called space-time streams).

[0003] For example, the 802.11-16 standard specifies a set of matrices, often called P-matrices, whose rows (and columns) define a set of orthogonal vectors, which may be employed as orthogonal cover codes for channel and pilot estimation when utilizing multiple space-time streams (e.g., non-multiple-input multiple-output, MIMO, operations). The rows or columns of these P-matrices may be applied to the Long Training Field (LTF), which in turn may be applied to pilots embedded in the data symbols during transmission.

[0004] When an 802.11 system operates in a Multiple-Input Multiple-Output (MIMO) mode (e.g., single-user SU-MIMO or multi-user MU-MIMO), the physical layer preamble of a packet contains a number of long-term training fields (LTFs), N LTF Contains: N RX A receiver with a receive antenna calculates the frequency domain channel matrix H corresponding to subcarrier k. k Estimate of TIFF0007595650000001.tif8170 can be generated as follows: TIFF0007595650000002.tif13170 where P is the P matrix, TIFF0007595650000003.tif9170 is the received signal vector corresponding to the kth subcarrier and the nth LTF symbol. Dimension N of TIFF0007595650000004.tif9170 RX ×N LTF matrix, LTF k is the frequency domain LTF symbol corresponding to the kth subcarrier. Summary of the Invention

[0005] One aspect of the present disclosure provides a method for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The method includes transmitting symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of a matrix associated with the subcarrier, the row being associated with the antenna. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0006] Another aspect of the present disclosure provides a method for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The method includes transmitting symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective column of a matrix associated with the subcarrier, the row being associated with the antenna. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0007] A further aspect of the disclosure provides an apparatus for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus comprises a processor and a memory. The memory includes instructions executable by the processor such that the apparatus is operable to transmit symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of a matrix associated with the subcarrier, the row being associated with the antenna. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0008] Yet another aspect of the present disclosure provides an apparatus for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus includes a processor and a memory. The memory includes instructions executable by the processor such that the apparatus is operable to transmit symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective column of a matrix associated with the subcarrier, the rows being associated with the antennas. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0009] An additional aspect of the present disclosure provides an apparatus for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus is operable to transmit symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of the matrix associated with the subcarrier, the row being associated with the antenna. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0010] Another aspect of the present disclosure provides an apparatus for simultaneously transmitting multicarrier symbols comprising multiple subcarriers from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus is operable to transmit symbols from the multiple antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective column of the matrix associated with the subcarrier, and a row is associated with the antenna. The matrix is ​​selected such that, from each antenna, a symbol transmitted from at least one subcarrier is multiplied by a non-zero element and a symbol transmitted from at least one other subcarrier is multiplied by a zero element.

[0011] For a better understanding of examples of the present disclosure, and to show more clearly how they may be carried into effect, reference will now be made, by way of example only, to the following drawings: [Brief description of the drawings]

[0012] [Figure 1] Here is an example of a conference matrix of order n=10: [Diagram 2] Here is an example of a conference matrix of order n=14: [Diagram 3] Here is an example of a P matrix of order n=2: [Figure 4] Here is an example of a P matrix of order n=8: [Figure 5a] 1 is a flow chart illustrating an example method for transmitting multi-carrier symbols. [Figure 5b] 1 is a flow chart illustrating an example method for transmitting multi-carrier symbols. [Figure 6] Here is an example of an orthogonal (±1,0) matrix of order n=16: [Figure 7] Here is an example of a conference matrix of order n=6: [Figure 8] Here is an example of an orthogonal (±1,0) matrix of order n=12: [Figure 9] Here is an example of a permutation matrix and a P matrix of order n=16: [Figure 10] Here is an example of a permutation matrix and a P matrix of order n=12. [Figure 11] Here is an example of a permutation matrix and a P matrix of order n=10: [Figure 12] 1 shows an example of a butterfly diagram corresponding to multiplication by a Hadamard matrix of order n=16. [Figure 13] 7 shows an example of a butterfly diagram corresponding to the multiplication by the matrix shown in FIG. [Figure 14] 1 is a schematic diagram illustrating an example of an apparatus for transmitting multi-carrier symbols. [Figure 15] 1 is a schematic diagram illustrating an example of an apparatus for transmitting multi-carrier symbols. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] Specific details such as specific embodiments and examples are described below for the purpose of explanation, but are not limited thereto. Those skilled in the art will appreciate that other examples may be employed apart from these specific details. In some examples, detailed descriptions of well-known methods, nodes, interfaces, circuits, and devices are omitted so as not to obscure the description with unnecessary details. Those skilled in the art will appreciate that the described functions may be implemented in one or more nodes using hardware circuitry (e.g., analog and / or discrete logic gates interconnected to perform specialized functions, ASICs, PLAs, etc.) and / or using software programs and data in combination with one or more digital microprocessors or general-purpose computers. Also, nodes that communicate using the air interface are equipped with appropriate wireless communication circuitry. Furthermore, where appropriate, the techniques may further be considered to be fully embodied in any form of computer-readable memory, such as solid-state memory, magnetic disk, or optical disk, that includes a set of appropriate computer instructions that would cause a processor to execute the techniques described herein.

[0014] A hardware implementation may include or encompass hardware (e.g., digital or analog) circuitry including, but not limited to, Digital Signal Processor (DSP) hardware, Reduced Instruction Set Processors, Application Specific Integrated Circuits (ASICs) and / or Field Programmable Gate Arrays (FPGAs), as well as (where appropriate) state machines capable of performing such functions.

[0015] The examples in this disclosure make use of certain orthogonal matrices. Below, we explain some relevant definitions and properties. A (±1) matrix is ​​a matrix whose elements are restricted to the values ​​{-1, +1}. Similarly, a (±1,0) matrix has all its elements in the set {-1, +1, 0}. A square matrix M of order n × n is M M H = αI n , where the superscript (.) H is the Hermitian matrix transpose, I n denotes the identity matrix of order n×n, and α is a positive constant. We can also say that M has order n. It is known that if M is an orthogonal (±1) matrix of order n, then n is an even number divisible by 1, 2 or 4 (i.e. n=1, 2, 4, 8, 12, 16, ...). It follows that orthogonal (±1) matrices of order 10 and 14 do not exist. The so-called conference matrix or C matrix of order n is an orthogonal (±1,0) matrix with zeros on the diagonal and all other elements being ±1. Conference matrices are known to exist for orders 10 and 14, and it can be shown that an orthogonal (±1,0) matrix of order n cannot have fewer than n zeros.

[0016] The orthogonality of the (±1,0) matrices can be confirmed by the following operations: Operation 1: Negate row or column. Operation 2: Permutation (i.e., swapping) of any two rows or any two columns.

[0017] Extremely High Throughput (EHT) has been proposed as an extension to the IEEE 802.11 standard. In particular, EHT may provide support for up to 16 space-time streams. Therefore, P matrices with order 9≦n≦16 are of interest.

[0018] EHT also proposes to increase the channel bandwidth to 320 MHz and multi-link operation. With multi-link, the total aggregated bandwidth using several channels can exceed 1 GHz. Since the subcarrier spacing is 78.125 kHz, about 12800 channel matrices need to be estimated, and each channel matrix estimation requires two matrix multiplications, which means that about 12800*16=204800 P matrix-vector multiplications may be required at the receiver for channel estimation. In the case of MU-MIMO, 802.11ac / ax receivers often estimate the channels of all transmitted spatial streams to cancel inter-stream interference. That is, N RX For a receiver with N receive antennas, the multiplication of the complete P matrix by the vector of received samples is done by N RX In other words, even a station with few receive antennas may need to perform many P matrix-vector multiplications.

[0019] A simple way to design a new P matrix is ​​to use a DFT matrix. However, IEEE 802.11 has traditionally preferred a P matrix consisting only of +1 and -1, as this reduces computational complexity and / or memory usage at both the transmitter and receiver, and allows for efficient hardware implementation since it only requires additions. For example, for three or seven space-time streams, the 802.11 standard utilizes P matrices of dimensions 3×4 and 7×8, respectively, which are in fact sub-matrices of the (±1)P matrix of orders 4 and 8, although they introduce certain overhead. In fact, the smaller 3×3 and 7×7 DFT matrices would have been suitable, but not the (±1)P matrix.

[0020] Therefore, there is a need for P matrices of dimensions 9≦n≦16 that support low-complexity transmitter and / or receiver implementations. Traditionally, IEEE 802.11 has only standardized P matrices of even order, and therefore the specific examples of this disclosure are for n=10, 12, 14, 16. Odd order P matrices can be generated by deleting one or more rows from an even order P matrix. For n=10, 14, it is not possible to obtain an orthogonal (±1) matrix, but it is possible to obtain an orthogonal (±1,0) matrix. For n=12, 16, it is possible to obtain an orthogonal (±1) matrix, but it may be desirable to use a (±1,0) matrix instead, since the complexity at the receiver may be significantly reduced by not having to perform a multiplication by zero.

[0021] The problem with using an orthogonal (±1,0) matrix for the P matrix is ​​that if the (m,k) element of the P matrix contains a 0, the mth transmitter chain will be muted during the period corresponding to the kth LTF, resulting in a reduction in the total transmit power relative to the maximum possible output power.

[0022] The embodiments of the present disclosure propose the use of an orthogonal (±1,0) matrix as the P matrix, providing a way to avoid the reduction in transmitter power associated with the presence of zeros (0) in the P matrix. In general, the embodiments of the present disclosure propose applying different P matrices to different subcarriers. The P matrix may be selected based on two criteria, in some examples. 1) For every transmitter chain and every LTF, there exists at least one subcarrier that has an associated P matrix with non-zero entries in the column and row indicated by said transmitter chain and said LTF. 2) The various P matrices may all be related to each other and / or to a base P matrix: for example, the result of multiplication of a vector with any P matrix can be calculated by multiplying the vector with a base P matrix and then applying an operation with negligible complexity.

[0023] The first criterion ensures that no transmitter chain is muted when transmitting an LTF. By properly scaling the signals, maximum output power can be used in all TX chains. The second criterion ensures that no circuitry or software is required to perform multiplications by more than one P matrix.

[0024] Therefore, in the examples of this disclosure, we propose orthogonal cover codes that enable IEEE 802.11 to accommodate 9 to 16 space-time streams. The examples of the proposed orthogonal cover codes are defined in terms of (±1,0) matrices that correspond to the implementation of an efficient channel estimation algorithm at the receiver. An example is given to demonstrate the favorable computational complexity compared to other efficient algorithms such as the Fast Hadamard Transform and the Fast Fourier Transform.

[0025] In the example of the present disclosure, we propose to utilize a (±1,0) matrix as the P matrix. It may be desirable to utilize an orthogonal (±1) matrix of order n=10, n=14 as the P matrix, but such a matrix does not exist. As an alternative, we can adopt an orthogonal (±1,0) matrix as the P matrix, such as a conference matrix.

[0026] FIG. 1 shows an example of a conference matrix 100 with order n=10. FIG. 2 shows an example of a conference matrix 200 with order n=14. In the following, these matrices are referred to as P 10 , P 14 1 and 2, a minus sign (-) represents a value of -1, while a plus sign (+) represents a value of +1. In other examples, a minus sign may represent any negative value, a plus sign may represent any positive value, and / or a minus sign and a plus sign may represent any complex value (including complex values ​​of magnitude 1). A zero (0) in a matrix represents a value of zero.

[0027] Also, although it is known that (±1) matrices of order n=12, n=16 exist and fast matrix multiplication algorithms are available, it may be desirable to devise P matrices with even lower matrix multiplication complexity to accommodate reduced cost, silicon area, power consumption, and / or computation time in the transmitter and / or receiver. One way to achieve this is to employ (±1,0) matrices as P matrices for orders n=12, n=16.

[0028] The IEEE 802.11-16 standard defines a P matrix P2 of order 2 and a P matrix P8 of order 8 that can be used to derive higher order P matrices. Matrix 300 is shown in FIG. 3 and matrix 400 is shown in FIG.

[0029] 5a is a flow chart of an example method 500 for transmitting a multi-carrier symbol. A multi-carrier symbol is composed of multiple sub-carriers, which are transmitted simultaneously from multiple antennas. Each sub-carrier is associated with a respective orthogonal matrix. For example, there are at least two different orthogonal matrices.

[0030] The method 500 includes, at step 502, transmitting symbols from multiple antennas such that, for each antenna, the symbols transmitted from each subcarrier are multiplied by an element of a respective column of a matrix associated with the subcarrier, with the rows associated with the antenna. The matrix is ​​selected such that, from each antenna, the symbols transmitted from at least one subcarrier are multiplied by a non-zero element and the symbols transmitted from at least one other subcarrier are multiplied by a zero element. Thus, for example, for symbols transmitted from multiple antennas at the same time, multiplying at least one subcarrier from each antenna by a zero element reduces the complexity at the transmitter and / or receiver, while multiplying at least one subcarrier from each antenna by a non-zero element and allows a total product to be transmitted from each antenna (e.g., increasing the power of the non-zero subcarriers and multiplying some subcarriers by zero).

[0031] In some examples of method 500, for each subcarrier, the symbols transmitted from each antenna are multiplied by a respective element of the column of the matrix associated with that subcarrier. In some examples, for each subcarrier, the symbols transmitted from each antenna are multiplied by a different element of the column of the matrix associated with that subcarrier.

[0032] 5b is a flow chart of an example method 510 of transmitting a multi-carrier symbol. A multi-carrier symbol is composed of multiple sub-carriers, which are transmitted simultaneously from multiple antennas. Each sub-carrier is associated with a respective orthogonal matrix. For example, there are at least two different orthogonal matrices.

[0033] The method 510 includes, at step 512, transmitting symbols from multiple antennas such that, for each antenna, the symbols transmitted from each subcarrier are multiplied by an element of a respective column of a matrix associated with the subcarrier, the column being associated with the antenna. The matrix is ​​selected such that, from each antenna, the symbols transmitted from at least one subcarrier are multiplied by a non-zero element and the symbols transmitted from at least one other subcarrier are multiplied by a zero element. Thus, for example, for symbols transmitted from multiple antennas simultaneously, multiplying at least one subcarrier from each antenna by a zero element reduces complexity at the transmitter and / or receiver, while multiplying at least one subcarrier from each antenna by a non-zero element, allowing full power to be transmitted from each antenna (e.g., boosting power to non-zero subcarriers and multiplying some subcarriers by zero).

[0034] In some examples of method 510, for each subcarrier, the symbols transmitted from each antenna are multiplied by a respective element of a row of a matrix associated with that subcarrier. In some examples, for each subcarrier, the symbols transmitted from each antenna are multiplied by a different element of a row of a matrix associated with that subcarrier.

[0035] The examples and features disclosed herein may be applied to either method 500 or method 510, as appropriate.

[0036] In some examples, the matrix associated with each subcarrier may be obtained by multiplying a permutation matrix with an orthogonal base matrix, or a matrix associated with at least one other subcarrier. While there are examples where the matrices are obtained in this manner, in other examples, this is merely a relationship between the matrices, and the matrices may be obtained in any suitable manner, such as, for example, by cyclic shifting or permutation, as described below.

[0037] In one example, a highly structured orthogonal (±1,0) matrix P of order 16 16 The formula is TIFF0007595650000005.tif7170, where TIFF0007595650000006.tif7170 shows the Kronecker matrix multiplication. Figure 6 shows this matrix 600. A structured orthogonal (±1,0) matrix P of order 12 12 is the matrix P2300 shown in FIG. 3 and the formula TIFF0007595650000007.tif7170 can be generated from the conference matrix 700U6 shown in FIG. 7. 12 Shows 800.

[0038] In some examples of the present disclosure, an orthogonal (±1,0) matrix is ​​adopted as the P matrix. The problem with adopting an orthogonal (±1,0) matrix as the P matrix is ​​that a zero in the (m,k) element of the P matrix will result in the m-th transmitter chain being muted during the period corresponding to the k-th LTF, thereby reducing the total transmission power relative to the maximum output power. To solve this problem, we propose to apply a subcarrier-specific P matrix. That is, different subcarriers can be applied for different P matrices. In a particular example, for any transmitter chain m and any LTF symbol k, there is at least one P matrix whose elements corresponding to m and k (e.g., the element at the m-th row and the k-th column in a particular example of an element arrangement in the matrix) are non-zero. This ensures that no transmitter chain is muted during the transmission of the LTF. In some examples, we also propose to derive all P matrices from a base P matrix (which may be a P matrix associated with one of the subcarriers in some examples) so that matrix multiplication by any P matrix can also be calculated, for example, from the calculation of matrix multiplication by a base matrix. This can ensure that software units and / or circuitry employed to compute, for example, base matrix multiplication products of vectors, can be reused.

[0039] One way to generate a new P matrix from a base P matrix is ​​to multiply it by a permutation matrix. A permutation is simply a rearrangement of the rows and / or columns of a matrix. In one example, a permutation matrix G of order n is a (1,0) matrix with the property that there is only one element with value 1 in each column and row, while the other elements are zero. A first example of a permutation matrix is ​​a time-reversal matrix with 1-valued elements along the antidiagonal and 0-valued elements (i.e., zeros) everywhere else. A second example of a permutation matrix is ​​a cyclic shift matrix. Note that a cyclic shift is a linear operation and thus can be described in terms of matrices. A cyclic shift by one stage is a matrix C of order n with all elements zero|except for those on the subdiagonal, the last element of the first row. n which is 1 (i.e., Cn (i+1,i)=1, C n Except for (1,n)=1, C n (All components of are zero.) In this note, the cyclic shift TIFF0007595650000008.tif9170 is given by: TIFF0007595650000009.tif39170

[0040] Periodicity: In other words, applying n successive one-step cyclic shifts to a vector of length n yields the original vector. For any permutation matrix G, there is a permutation matrix G G T =I n Therefore, P n If is an orthogonal matrix of order n and G is a permutation matrix of the same order, then the product G P n is also an orthogonal matrix The result is TIFF0007595650000011.tif9170. Matrix G P n and the vector of received samples The product of TIFF0007595650000012.tif8170 is TIFF0007595650000013.tif9170. Therefore, in some cases, the vector can be given the fundamental matrix If a computer computes the product of multiplying TIFF0007595650000014.tif7170 and then rearranges the result, it may produce the same result as multiplying a vector by a certain matrix (the certain matrix is ​​the product of a fundamental matrix and a permutation matrix).

[0041] In some examples, all of the matrices are different, while in other examples there may be slightly fewer different matrices than the number of subcarriers, e.g., at least two different matrices. For example, a first set of subcarriers is associated with a first matrix and a second subset of subcarriers is associated with a second matrix that is different from the first subset. In other examples, there may be additional subsets of subcarriers, each associated with another different matrix.

[0042] In a specific example, consider the case where the order is n=16 (e.g., there are 16 antennas). The matrix P 16 600 may be selected as the fundamental matrix, and the permutation matrix G may be a time-reversal matrix. For any integer k, the P matrix P (k) can be defined as follows: TIFF0007595650000015.tif16170

[0043] Also, P matrix P (k) may be related to the number of subcarriers k (e.g., frequency is (kΔf+F c ), where Δf is the subcarrier spacing and F c , where k is the center frequency). Figure 9 shows a permutation matrix 900 and two P matrices 902 (for k even) and 904 (for k odd). In some examples, half of the subcarriers are muted at any time during the transmission of the LTF from each transmitter, so that the LTF symbols can be boosted (e.g., by 3 dB) at all transmitter chains. For example, if the vector contains P matrices with k even, (k) Multiplying by gives us the vector P where k is an odd number. (k) , resulting in reading the results in reverse order (last component first, first component last). Reading in reverse order can, in some cases, be implemented without any added complexity (e.g., using pointer arithmetic and setting pointers so that the data is traversed in the correct order).

[0044] In another example, consider the case where the order n=12 (e.g., there are 12 transmit antennas). 12 800 is chosen as the fundamental matrix, the time reversal matrix is ​​chosen as the permutation matrix, and for any integer k, the P matrix P (k) is defined as follows: TIFF0007595650000016.tif15170

[0045] Also, P matrix P (k) is related to the number of subcarriers k. Figure 10 shows a permutation matrix 1000 and two P matrices 1002 (for k even) and 1004 (for k odd). Unlike the previous example, there are LTFs and transmitter chains where none of the subcarriers are muted. For example, P (k) (2,1)=1 for all k. This means that the second transmitter chain is never muted for any subcarriers during transmission of the first LTF. Therefore, for example, there is no need to power boost and transmit signals corresponding to such LTFs through these transmitter chains. Meanwhile, some of the subcarriers are muted in the LTFs and transmitter chains corresponding to the 0 entries of the P matrix. For example, P (1) (3,4)=0, where P (2) (3,4)=-1. This means that the third transmitter chain mutes half of the subcarriers when transmitting the fourth LTF. It is therefore possible to boost this LTF by, for example, 3 dB. Similarly, if the LTF is muted in a particular transmitter chain, for example due to an element corresponding to a zero in the P matrix in a particular subcarrier, then the LTF can be boosted by 3 dB in this transmitter chain.

[0046] In another example, consider the case of order n=10. The matrix P 10 100 is chosen as the base matrix, and the cyclic shift matrix TIFF0007595650000017.tif9170 is selected as the permutation matrix. P matrix P (k)is defined as follows for any integer k: TIFF0007595650000018.tif10170

[0047] P such that for any k there are only 10 distinct P matrices. (k) =P (k+10) 11 shows a permutation matrix 1100 and P matrices 1102-1120 corresponding to values ​​of k from 0 to 9, respectively.

[0048] Also, P matrix P (k) may be associated with subcarrier k. For any row r and any column c, P (k) Note that since there is only one k such that (c,r)=0, 1 / 10 of the subcarriers in each LTF are muted in each transmitter chain. Thus, in some examples, a power boost of 10*log10(10 / 9)=0.46 dB may be applied to each transmitter chain in all LTFs. Furthermore, any multiplication by a P matrix is ​​equivalent to a multiplication by a base matrix, followed by a cyclic shift of this result. Therefore, since this result can be read using cyclic pointer arithmetic, in some examples, applying a cyclic shift to a vector may be implemented very efficiently, e.g., with little additional complexity (compared to the case where the subcarriers are not associated with the respective matrices).

[0049] In another example, consider the case where the order is n=14. The matrix P 14 200 is selected as the base matrix, and the cyclic shift matrix is ​​selected as the permutation matrix. (k) is defined as follows for any integer k: TIFF0007595650000019.tif9170

[0050] P such that for any k there are only 14 distinct matrices. (k) =P (k+14)Note that for each transmitter chain (i.e., from each antenna), 1 / 14 of the subcarriers in each LTF are muted (i.e., the corresponding elements of the corresponding P matrix are zero). Thus, in some examples, a power boost of 10*log10(14 / 13)=0.32 dB can be applied to all transmitter chains. Furthermore, any multiplication by a P matrix is ​​equivalent to a multiplication by a base matrix, followed by a cyclic shift of this result. Hence, in some examples, application of cyclic shifts to vectors can be implemented very efficiently, often with little additional complexity.

[0051] In some examples, transmitting includes transmitting symbols from multiple subcarriers from each antenna at a predetermined total transmit power or a maximum total transmit power, which can take into account any subcarriers that are muted due to, for example, a zero element in a corresponding position in an associated matrix.

[0052] Returning to methods 500 and 510, the plurality of antennas is at least 10. As such, the order of the matrix may be at least 10. In some examples, the matrix associated with each antenna is a 10×10, 12×12, 14×14, or 16×16 matrix, although matrices of odd order may alternatively be used, e.g., 9×9, 11×11, 13×13, or 15×15.

[0053] In some examples, each row and / or each column of the matrix associated with the subcarriers has at least one zero element. This may contribute to hardware reduction and / or computational complexity at the transmitter and / or receiver. In some examples, the matrix is ​​selected such that, for each subcarrier, a symbol transmitted on that subcarrier from at least one antenna is multiplied by a non-zero element, and a symbol transmitted on that subcarrier from at least one other antenna is multiplied by a zero element. In some examples, each row and / or each column of the matrix associated with the subcarriers has at least one complex non-zero element.

[0054] Next, consider the computational complexity of multiplication by the P matrix. One way to compare this complexity is to draw a butterfly diagram corresponding to the matrix multiplications and use the total number of edges as the figure of merit. A low figure of merit is better than a high figure of merit, since it indicates a lower computational complexity. As a reference point, Consider the well-known Hadamard matrix of order 16, specified in TIFF0007595650000020.tif8170, which corresponds to a very efficient implementation and is known to be even more efficient than the Fast Fourier Transform of the same order, since the Hadamard transform does not require any multiplications. 16 FIG. 13 shows a butterfly diagram 1200 that represents multiplication by a matrix P 16 600 (shown in FIG. 6). There are 96 edges in this butterfly diagram. Thus, the matrix P 16 The figure of merit of is much better than that of the Hadamard matrix. P 16 Another fundamental matrix with the same figure of merit as TIFF0007595650000021.tif7170, which inherits the Kronecker product construction 16 has the same symmetry as H 16 There are more zeros than P 16Similarly, it can be shown that other matrices of different orders have better figures of merit than the FFT of the same order.

[0055] 14 is a schematic diagram of an example apparatus 1400 for transmitting multi-carrier symbols composed of multiple subcarriers simultaneously from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus 1400 is comprised of a processing circuit 1402 (e.g., one or more processors) and a memory 1404 in communication with the processing circuit 1402. The memory 1404 contains instructions executable by the processing circuit 1402. The apparatus 1400 also includes an interface 1406 in communication with the processing circuit 1402. Although the interface 1406, the processing circuit 1402, and the memory 1404 are shown in series, they may alternatively be interconnected in other ways, such as via a bus.

[0056] In one embodiment, the memory 1404 contains instructions executable by the processing circuitry 1402 such that the apparatus 1400 can be used to transmit symbols from multiple antennas such that, for each antenna, the symbols transmitted from each subcarrier are multiplied by elements of a respective row of a matrix associated with the subcarrier, the row being associated with the antenna. The matrix is ​​selected such that, from each antenna, the symbols transmitted from at least one subcarrier are multiplied by non-zero elements and the symbols transmitted from at least one other subcarrier are multiplied by zero elements. In some examples, the apparatus 1400 can be used to perform the method 500 described above with reference to FIG. 5a.

[0057] 15 is a schematic diagram of an example apparatus 1500 for transmitting multi-carrier symbols composed of multiple subcarriers simultaneously from multiple antennas, each subcarrier being associated with a respective orthogonal matrix. The apparatus 1500 is comprised of a processing circuit 1502 (e.g., one or more processors) and a memory 1504 in communication with the processing circuit 1502. The memory 1504 contains instructions executable by the processing circuit 1502. The apparatus 1500 also includes an interface 1506 in communication with the processing circuit 1402. Although the interface 1506, the processing circuit 1502, and the memory 1504 are shown connected in series, they may alternatively be interconnected in other ways, for example, via a bus.

[0058] In one embodiment, the instructions are executable by the processing circuitry 1502 such that the apparatus 1500 can be used to transmit symbols from multiple antennas such that, for each antenna, the symbols transmitted from each subcarrier are multiplied by elements of a respective column of a matrix associated with the subcarrier, the column being associated with the antenna. The matrix is ​​selected such that, from each antenna, the symbols transmitted from at least one subcarrier are multiplied by non-zero elements and the symbols transmitted from at least one other subcarrier are multiplied by zero elements. In some examples, the apparatus 1500 can be used to perform the method 510 described above with reference to FIG. 5b.

[0059] It should be noted that the above-mentioned examples are illustrative rather than limiting of the present invention, and that those skilled in the art can devise many alternatives without departing from the scope of the appended claims. The word "comprising" does not exclude the presence of elements or steps other than those listed in the claims, and "a" or "an" does not exclude a plurality, such that one processor or other unit may perform the functions of several units listed in the following claims. Where terms such as "first", "second", etc. are used, they should be understood as merely labels for convenient identification of particular features. In particular, unless expressly stated otherwise, these terms should not be construed as describing a first or second feature of a plurality of such features (i.e., a first or second feature of such features occurs in time or at an interval). Steps in methods disclosed herein may be performed in any order, unless expressly stated otherwise. Any reference signs herein shall not be construed as limiting their scope.

Claims

1. 1. A method for transmitting symbols simultaneously from multiple antennas using multiple subcarriers, each subcarrier associated with a respective orthogonal matrix, comprising: transmitting symbols from the plurality of antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of the matrix associated with the subcarrier, the row being associated with an antenna; the matrices are selected such that, from each antenna, symbols transmitted from one subcarrier are multiplied by non-zero elements and symbols transmitted from another subcarrier are multiplied by zero elements, and the matrix associated with one of the subcarriers is different from the matrix associated with the other of the subcarriers; a first subset of the subcarriers is associated with a first orthogonal matrix, and a second subset of the subcarriers different from the first subset is associated with a second orthogonal matrix different from the first orthogonal matrix; the matrix associated with each subcarrier is obtained by multiplication of an orthogonal base matrix with a permutation matrix, method.

2. The method of claim 1 , wherein for each subcarrier, the symbol transmitted from each antenna is multiplied by a respective element of a column of the matrix associated with that subcarrier.

3. The method of claim 2 , wherein for each subcarrier, the symbols transmitted from each antenna are multiplied by a different element of the column of the matrix associated with that subcarrier.

4. 1. A method for transmitting symbols simultaneously from multiple antennas using multiple subcarriers, each subcarrier associated with a respective orthogonal matrix, comprising: transmitting symbols from the plurality of antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective column of the matrix associated with the subcarrier, the column being associated with an antenna; the matrices are selected such that, from each antenna, symbols transmitted from one subcarrier are multiplied by non-zero elements and symbols transmitted from another subcarrier are multiplied by zero elements, and the matrix associated with one of the subcarriers is different from the matrix associated with the other of the subcarriers; a first subset of the subcarriers is associated with a first orthogonal matrix, and a second subset of the subcarriers different from the first subset is associated with a second orthogonal matrix different from the first orthogonal matrix; the matrix associated with each subcarrier is obtained by multiplication of an orthogonal base matrix with a permutation matrix, method.

5. The method of claim 4 , wherein for each subcarrier, the symbol transmitted from each antenna is multiplied by the respective element of the row of the matrix associated with that subcarrier.

6. The method of claim 5 , wherein for each subcarrier, the symbols transmitted from the multiple antennas are multiplied by different respective elements of the row of the matrix associated with the subcarrier.

7. The method of claim 1 , wherein transmitting comprises transmitting the symbols using the plurality of subcarriers from each antenna at a predetermined total transmit power or a maximum total transmit power.

8. The method of claim 1 , wherein the plurality of antennas is at least 10.

9. 9. The method of claim 1, wherein the matrix is ​​a 10x10, 12x12, 14x14, or 16x16 matrix.

10. The method of claim 1 , wherein the symbols comprise OFDM symbols.

11. The method of claim 1 , wherein the symbols include long-term training field (LTF) symbols.

12. The method according to claim 1 , wherein in each row and / or each column of the matrix associated with the subcarriers there is at least one zero element.

13. 13. The method of claim 1, wherein the matrix is ​​selected such that for each subcarrier, symbols transmitted from at least one antenna on that subcarrier are multiplied with non-zero elements and symbols transmitted from at least one other antenna on that subcarrier are multiplied with zero elements.

14. A computer program comprising instructions which, when executed on at least one processor, cause said at least one processor to perform a method according to any one of claims 1 to 13.

15. 1. An apparatus for transmitting symbols simultaneously from multiple antennas using multiple subcarriers, each subcarrier associated with a respective orthogonal matrix, the apparatus comprising a processor and a memory, the memory containing instructions executable by the processor; The apparatus, operative to transmit symbols from the plurality of antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective row of the matrix associated with the subcarrier, the row being associated with an antenna; the matrices are selected such that, from each antenna, symbols transmitted from one subcarrier are multiplied by non-zero elements and symbols transmitted from another subcarrier are multiplied by zero elements, and the matrix associated with one of the subcarriers is different from the matrix associated with the other of the subcarriers; a first subset of the subcarriers is associated with a first orthogonal matrix, and a second subset of the subcarriers different from the first subset is associated with a second orthogonal matrix different from the first orthogonal matrix; the matrix associated with each subcarrier is obtained by multiplication of an orthogonal base matrix with a permutation matrix, Device.

16. 1. An apparatus for transmitting symbols simultaneously from multiple antennas using multiple subcarriers, each subcarrier associated with a respective orthogonal matrix, the apparatus comprising a processor and a memory, the memory containing instructions executable by the processor; The apparatus, operative to transmit symbols from the plurality of antennas such that, for each antenna, a symbol transmitted from each subcarrier is multiplied by an element of a respective column of the matrix associated with the subcarrier, the column being associated with an antenna; the matrices are selected such that, from each antenna, symbols transmitted from one subcarrier are multiplied by non-zero elements and symbols transmitted from another subcarrier are multiplied by zero elements, and the matrix associated with one of the subcarriers is different from the matrix associated with the other of the subcarriers; a first subset of the subcarriers is associated with a first orthogonal matrix, and a second subset of the subcarriers different from the first subset is associated with a second orthogonal matrix different from the first orthogonal matrix; the matrix associated with each subcarrier is obtained by multiplication of an orthogonal base matrix with a permutation matrix, Device.

Citation Information

Patent Citations

  • Systems and methods for improved training field design for increased symbol duration

    JP2017519407A