WO2021047613A1 - 序列生成方法及装置 - Google Patents

序列生成方法及装置 Download PDF

Info

Publication number
WO2021047613A1
WO2021047613A1 PCT/CN2020/114611 CN2020114611W WO2021047613A1 WO 2021047613 A1 WO2021047613 A1 WO 2021047613A1 CN 2020114611 W CN2020114611 W CN 2020114611W WO 2021047613 A1 WO2021047613 A1 WO 2021047613A1
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
sequence
mapping
present application
eht ltf
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/CN2020/114611
Other languages
English (en)
French (fr)
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to BR112022004525A priority Critical patent/BR112022004525A2/pt
Priority to EP20863698.5A priority patent/EP4024802A4/en
Publication of WO2021047613A1 publication Critical patent/WO2021047613A1/zh
Anticipated expiration legal-status Critical
Priority to US17/693,662 priority patent/US20220217022A1/en
Ceased legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891Spatial equalizers
    • H04L25/03898Spatial equalizers codebook-based design
    • H04L25/0391Spatial equalizers codebook-based design construction details of matrices
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2614Peak power aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03343Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2602Signal structure
    • H04L27/261Details of reference signals
    • H04L27/2613Structure of the reference signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/03592Adaptation methods
    • H04L2025/03745Timing of adaptation
    • H04L2025/03764Timing of adaptation only during predefined intervals
    • H04L2025/0377Timing of adaptation only during predefined intervals during the reception of training signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2647Arrangements specific to the receiver only
    • H04L27/2655Synchronisation arrangements
    • H04L27/2689Link with other circuits, i.e. special connections between synchronisation arrangements and other circuits for achieving synchronisation
    • H04L27/2695Link with other circuits, i.e. special connections between synchronisation arrangements and other circuits for achieving synchronisation with channel estimation, e.g. determination of delay spread, derivative or peak tracking

Definitions

  • the embodiments of the present application relate to the field of communications, and in particular, to a sequence generation method and device.
  • communication devices usually provide network access such as a local area network or the Internet.
  • Other communication devices can communicate wirelessly with communication devices that provide network access.
  • Some communication devices follow certain industry standards such as the Institute of Electrical and Electronics Engineers standards.
  • the sequence generation method and device provided in the embodiments of the present application enable the EHT LTF sequence after matrix mapping in the PPDU to have a lower PAPR value.
  • an embodiment of the present application provides a sequence generation method, including:
  • the P matrix is an n*n matrix, where n is greater than 8;
  • the P matrix described in the first aspect may refer to various P matrices in specific embodiments.
  • an embodiment of the present application provides a sequence processing method, including:
  • Channel estimation is performed according to the EHT LTF sequence after the matrix mapping.
  • an embodiment of the present application provides a sequence generation method, including:
  • the PPDU containing the EHT LTF sequence after matrix mapping, where the EHT LTF sequence after the matrix mapping is obtained by multiplying the predefined EHT LTF sequence by the P matrix, and the P matrix is n*n Matrix, where n is greater than 8;
  • the P matrix described in the third aspect may refer to various P matrices in specific embodiments.
  • an embodiment of the present application provides a sequence processing method, including:
  • the PPDU containing the EHT LTF sequence after matrix mapping, wherein the EHT LTF sequence after the matrix mapping is obtained by multiplying the predefined EHT LTF sequence by the P matrix, and the P matrix is n*n Matrix, where n is greater than 8;
  • Channel estimation is performed according to the EHT LTF sequence after the matrix mapping.
  • the P matrix described in the fourth aspect may refer to various P matrices in specific embodiments.
  • an embodiment of the present application provides a sequence generation device, the sequence generation device includes a module for executing the above-mentioned first aspect or the method described in any possible implementation manner of the first aspect.
  • an embodiment of the present application provides a sequence processing device, and the sequence generation device includes a module for executing the method described in the second aspect or any possible implementation manner of the second aspect.
  • an embodiment of the present application provides a sequence generation device, and the sequence generation device includes a module for executing the method described in the third aspect or any possible implementation manner of the third aspect.
  • an embodiment of the present application provides a sequence processing device, and the sequence generation device includes a module for executing the method described in the fourth aspect or any possible implementation manner of the fourth aspect.
  • an embodiment of the present application provides a computer-readable storage medium for storing a computer program.
  • the computer program includes instructions for executing the first aspect or any possible implementation of the first aspect, or Instructions for any possible implementation of the second or second aspect, or instructions for any possible implementation of the third aspect or the third aspect, or instructions for any possible implementation of the fourth aspect or the fourth aspect .
  • an embodiment of the present application provides a computer program.
  • the computer program includes instructions for executing any possible implementation of the first aspect or the first aspect, or any possible implementation of the second or second aspect.
  • an embodiment of the present application provides a communication system, which includes the sequence generation device provided in the fifth aspect and the sequence processing device provided in the sixth aspect.
  • an embodiment of the present application provides a communication system that includes the sequence generation device provided in the seventh aspect described above, and the sequence processing device provided in the eighth aspect described above.
  • Fig. 1 shows a communication system applied in an embodiment of the present application.
  • Figure 2 is a system diagram.
  • FIG. 3 is a flowchart of a method for generating a sequence according to an embodiment of the present application.
  • Fig. 4 is a structural diagram of a sequence generating device.
  • Fig. 5 is a structural diagram of a sequence receiving device.
  • WIFI wireless communication system global system of mobile communication (GSM) system, code division multiple access, CDMA ) System, wideband code division multiple access (WCDMA) system, general packet radio service (GPRS) system, long term evolution (LTE) system, LTE frequency division duplex ( frequency division duplex (FDD) system, LTE time division duplex (TDD) system, universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) communication system , Other future evolution systems, or other various wireless communication systems using wireless access technology, etc.
  • GSM global system of mobile communication
  • CDMA code division multiple access
  • WCDMA wideband code division multiple access
  • GPRS general packet radio service
  • LTE long term evolution
  • LTE LTE frequency division duplex
  • FDD frequency division duplex
  • TDD LTE time division duplex
  • UMTS universal mobile telecommunication system
  • WiMAX worldwide interoperability for microwave access
  • Fig. 1 shows a communication system applied in an embodiment of the present application.
  • the communication system includes a network device and at least one terminal device located in the coverage area of the network device.
  • the network device can provide communication coverage for a specific geographic area and communicate with terminal devices located in the coverage area.
  • the network equipment can be a base transceiver station (BTS) in a GSM system or a code division multiple access (CDMA) system, a base station (node B, NB) in a WCDMA system, or a base station (NB) in a WCDMA system.
  • BTS base transceiver station
  • CDMA code division multiple access
  • NB base station
  • NB base station
  • the evolved base station can be a wireless controller in a cloud radio access network (cloud radio access network, CRAN), a relay station, an access point AP, a vehicle-mounted device, and a wearable device , Network side equipment in the future network, etc.
  • the terminal equipment can be mobile or fixed.
  • the terminal equipment can be a station STA, an access terminal, a user equipment (user equipment, UE), a user unit, a user station, a mobile station, a mobile station, a remote station, a remote terminal, and a mobile device. , User terminal, wireless communication equipment, user agent or user device, etc.
  • the embodiment of the present application relates to a method and device for generating a sequence, and the sequence generated by the embodiment of the present application has a lower PAPR value.
  • PPDU PHY Protocol Data Unit, physical layer protocol data unit.
  • EHT LTF Extremely High Throughput Long Training Field, a long training sequence with extremely high throughput rate.
  • FIG. 2 a sequence generation apparatus related to an embodiment of the present application will be described.
  • the system includes a sending device 100 and a receiving device 200, where the sending device 100 is used to generate and send a sequence with a lower PAPR value, and the receiving device 200 is used to receive the sequence and according to the sequence Do channel estimation.
  • the sending device 100 includes:
  • the sequence storage/generating module 101 is used to store or generate a predefined data sequence (in the embodiment of the present application, the sequence of data positions is collectively referred to as a data sequence), and the predefined data sequence includes a plurality of different bandwidths and different modes
  • the different bandwidths may include 20M bandwidth, 40M bandwidth, 80M bandwidth, 160M bandwidth, 320M bandwidth, 160M+160M bandwidth, etc.
  • the different modes may include 1x mode, 2x mode, 4x mode, etc.
  • a number of different sequences in different bandwidths and modes including: 20M bandwidth and sequence in 1x mode, 20M bandwidth and sequence in 2x mode, 20M bandwidth and sequence in 4x mode, 40M bandwidth and sequence in 1x mode Sequence, 40M bandwidth and sequence in 2x mode, 40M bandwidth and sequence in 4x mode... 320M bandwidth and sequence in 1x mode, 320M bandwidth and sequence in 2x mode, 320M bandwidth and sequence in 4x mode, etc.
  • the data sequence is an EHT LTF sequence, that is, the sequence storage module 101 stores a predefined EHT LTF sequence.
  • the pilot generating module 102 is configured to generate a pilot sequence, and the pilot sequence is used to track the phase or frequency offset of the transmitted signal.
  • the pilot insertion module 103 is used to insert the pilot sequence into the data sequence, or in other words, the pilot insertion module 103 is used to combine the pilot sequence and the data sequence.
  • the matrix mapping module 104 is configured to apply a matrix to the combined pilot sequence and data sequence to generate a matrix-mapped sequence.
  • the matrix mapping module 104 includes a first matrix and a second matrix.
  • the first matrix provides a mapping for the data sequence
  • the second matrix provides a mapping for the pilot sequence, or in other words, the first matrix is applied to the data sequence, and the first matrix is applied to the pilot sequence.
  • Two matrix For convenience, the first matrix can be called a P matrix, the P matrix is an n*n matrix, and the second matrix can be called an R matrix.
  • the R matrix includes x copies of the first row of the P matrix, and x is the number of spatial streams. .
  • applying the P matrix to the EHT LTF sequence is specifically multiplying the EHT LTF sequence with elements in the P matrix, for example, multiplying the EHT LTF sequence by each row in the P matrix to obtain multiple matrix mappings
  • the multiple matrix-mapped sequences are respectively spatially mapped to multiple different spatial streams for transmission.
  • n*n P matrix (n is greater than 8) provided by the embodiment of this application is intended to ensure that when the number of spatial streams increases to more than 8, the matrix mapping sequence sent on each spatial stream needs to be orthogonal and has a low The PAPR value.
  • the P matrix provided by the embodiments of the present application under different spatial flow numbers is introduced. Among them, under each spatial flow number, the P matrix has multiple variations.
  • the P matrix provided in this embodiment of the application is:
  • P 5 ⁇ 5 in the above formula (12) is obtained by multiplying the second column of P original and -1, where P original is expressed as follows:
  • P 5 ⁇ 5 in the above formula (11) is specifically as described in the above formula (12).
  • the P 5 ⁇ 5 in formula (12) is obtained by multiplying the second column of P original in formula (13) by -1.
  • the above is only an example of a P 10 ⁇ 10 matrix when the number of spatial streams is 9 or 10 provided by the embodiment of the present application.
  • the embodiment of the present application also provides other P 10 ⁇ 10 matrices when the number of spatial streams is 9 or 10.
  • P 5 ⁇ 5 can be obtained by multiplying any column of P original by -1; or, P 5 ⁇ 5 can be obtained by multiplying any number of columns of P original by -1. Any number of columns here does not include all For example, the second and third columns of P original are multiplied by -1 to obtain P 5 ⁇ 5 , but the first to fifth columns excluding P original are all multiplied by -1.
  • the matrix mapping sequence obtained by the above P 10 ⁇ 10 mapping has a lower PAPR value.
  • the PAPR value of the matrix mapping sequence obtained by the above P 10 ⁇ 10 mapping is 6.2771, and the Fourier matrix mapping is used directly, or one or more columns are multiplied by -1 Fourier Matrix mapping, the PAPR value of the obtained matrix mapping sequence is 6.2851.
  • the P 10 ⁇ 10 provided in the embodiment of the present application is used to provide mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • the PAPR value of the matrix mapping sequence obtained by the above P 10 ⁇ 10 mapping is 9.2297, and the Fourier matrix mapping is directly used, or a certain column or multiple columns are multiplied by -1
  • the PAPR value of the obtained matrix mapping sequence is 9.2653.
  • the P 10 ⁇ 10 provided in the embodiment of the present application is used to provide a mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • the P matrix provided in this embodiment of the application is:
  • the P 3 ⁇ 3 in the above formula (23) is obtained by multiplying the second column of the formula (24) P original with -1. Substituting the P 3 ⁇ 3 described in (23) into the formula (22), P 6 ⁇ 6 is obtained . Then, P 6 ⁇ 6 described in (23) is inserted into formula (21) to obtain P 12 ⁇ 12 .
  • the embodiment of the present application also provides other P 12 ⁇ 12 matrices when the number of spatial streams is 11 or 12, for example, in the above formulas (21) to (24), wherein, as described in (23) P 3 ⁇ 3 can be obtained by multiplying any column of P original in formula (24) by -1, and is not limited to multiplying the second column by -1; or, P 3 ⁇ 3 in (23) can be obtained by multiplying ( 24) Any number of columns of P original are multiplied by -1. Any number of columns here does not include all columns.
  • the second and third columns of (24) P original are multiplied by -1 to get ( 23) P 3 ⁇ 3 , but not including 24)
  • the first to third columns of P original are all multiplied by -1.
  • the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping has a lower PAPR value.
  • the PAPR value of the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping is 6.2369, and Fourier matrix mapping is used directly, or a Fourier column or multiple columns multiplied by -1 is used.
  • the PAPR value of the obtained matrix mapping sequence is 6.3003.
  • the P 10 ⁇ 10 provided in the embodiment of the present application is used to provide mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • the PAPR value of the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping is 9.2236, and the Fourier matrix mapping is directly used, or a certain column or multiple columns are multiplied by -1
  • the PAPR value of the obtained matrix mapping sequence is 9.2636.
  • the P 12 ⁇ 12 provided in the embodiment of the present application is used to provide a mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • P 6 ⁇ 6 in the above formula (32) is obtained by multiplying the second and sixth columns of P original in the following formula (33) with -1, where P original is expressed as follows:
  • the embodiments of the present application also provide other P 12 ⁇ 12 matrices when the number of spatial streams is 11 or 12, for example, in the above formulas (31) to (33), wherein, as described in (32) P 6 ⁇ 6 may be any column multiplied by -1 P original is obtained by the formula (33); or (32) in said P 6 ⁇ 6 may be represented by the formula (33) a plurality of columns are arbitrary and P original -1
  • any number of columns here does not include all the columns, in addition to the second and sixth columns in equation (32) multiplied by -1, any number of other columns can be multiplied by -1
  • the second, third, and fourth columns of equation (33) P original are all multiplied by -1.
  • the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping has a lower PAPR value.
  • the PAPR value of the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping is 6.2851, and Fourier matrix mapping is used directly, or a Fourier column or multiple columns multiplied by -1 is used.
  • Matrix mapping the PAPR value of the obtained matrix mapping sequence is 6.3003.
  • the P 12 ⁇ 12 provided in the embodiment of the present application is used to provide mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • the PAPR value of the matrix mapping sequence obtained by the above P 12 ⁇ 12 mapping is 9.2499, and the Fourier matrix mapping is directly used, or a certain column or multiple columns are multiplied by -1 After Fourier matrix mapping, the PAPR value of the matrix mapping sequence is 9.2636.
  • the P 12 ⁇ 12 provided in the embodiment of the present application is used to provide a mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • P 7 ⁇ 7 in the above formula (42) is obtained by multiplying the second and sixth columns of P original in the following formula (43) by -1, where P original is expressed as follows:
  • the embodiment of the present application also provides other P 14 ⁇ 14 matrices when the number of spatial streams is 13 or 14, for example, in the above formulas (41) to (43), where the formula (42)
  • the P 7 ⁇ 7 can be obtained by multiplying any column of the formula (43) P original by -1; or, the P 7 ⁇ 7 in formula (42) can be obtained by multiplying any number of columns of the formula (43) P original with -1 is multiplied together. Any number of columns here does not include all columns.
  • any number of other columns can also be multiplied by -1. Multiply, for example, the second, third, and fourth columns of equation (43) P original are all multiplied by -1.
  • the matrix mapping sequence obtained by the above P 14 ⁇ 14 mapping has a lower PAPR value.
  • the PAPR value of the matrix mapping sequence obtained by the above P 14 ⁇ 14 mapping is 6.3115, and Fourier matrix mapping is used directly, or a Fourier column or multiple columns multiplied by -1 is used.
  • Matrix mapping the PAPR value of the obtained matrix mapping sequence is 6.3115.
  • the P 14 ⁇ 14 provided in the embodiment of the present application is used to provide mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • the PAPR value of the matrix mapping sequence obtained by the above P 14 ⁇ 14 mapping is 9.2594, and the Fourier matrix mapping is used directly, or a certain column or multiple columns are multiplied by -1
  • the PAPR value of the obtained matrix mapping sequence is 9.2611.
  • the P 14 ⁇ 14 provided in the embodiment of the present application is used to provide a mapping for the EHT LTF sequence, and the PAPR value of the obtained matrix mapping sequence is lower.
  • P 9 ⁇ 9 in the above formula (52) is obtained by multiplying the second and sixth columns of P original in the following formula (53) by -1, where P original is expressed as follows:
  • the embodiments of the present application also provide other P 14 ⁇ 14 matrices when the number of spatial streams is 17 or 18, for example, in the above formulas (51) to (53), where the formula (52)
  • the P 9 ⁇ 9 can be obtained by multiplying any column of the formula (53) P original by -1; or, the P 9 ⁇ 9 in the formula (52) can be obtained by multiplying any number of columns of the formula (53) P original with -1 is multiplied together. Any number of columns here does not include all columns.
  • any number of other columns can also be multiplied by -1. Multiply, for example, the second, third, and fourth columns of equation (53) P original are all multiplied by -1.
  • P 11 ⁇ 11 in the above formula (62) is obtained by multiplying the second, sixth, and tenth columns of P original in the following formula (63) with -1, where P original is expressed as follows:
  • the embodiment of the present application also provides other P 22 ⁇ 22 matrices when the number of spatial streams is 21 or 22, for example, in the above formulas (61) to (63), where the formula (62)
  • the P 11 ⁇ 11 can be obtained by multiplying any column of the formula (63) P original by -1; or, the P 11 ⁇ 11 in the formula (62) can be obtained by multiplying any number of columns of the formula (63) P original with -1 is multiplied together. Any number of columns here does not include all columns.
  • it can also be any number of other columns. All are multiplied by -1.
  • the second, third, and fourth columns of the formula (63) P original are all multiplied by -1.
  • P 13 ⁇ 13 in the above formula (72) is obtained by multiplying the second, sixth, and tenth columns of P original in the following formula (73) with -1, where P original is expressed as follows:
  • the embodiment of the present application also provides other P 26 ⁇ 26 matrices when the number of spatial streams is 25 or 26, for example, in the above formulas (71) to (73), where the formula (72)
  • the P 13 ⁇ 13 can be obtained by multiplying any column of the formula (73) P original by -1; or, the P 13 ⁇ 13 in formula (72) can be obtained by multiplying any number of columns of the formula (73) P original with -1 is multiplied together. Any number of columns here does not include all columns.
  • it can also be any number of other columns. All are multiplied by -1.
  • the second, third, and fourth columns of equation (73) P original are all multiplied by -1.
  • P 15 ⁇ 15 in the above formula (82) is multiplied by -1 by the second, sixth, tenth, fourteenth and fifteenth columns of P original in the following formula (83)
  • P original is expressed as follows:
  • the embodiment of the present application also provides other P 30 ⁇ 30 matrices when the number of spatial streams is 29 or 30, for example, in the above formula (81) to formula (83), where the formula (82)
  • the P 15 ⁇ 15 can be obtained by multiplying any column of the formula (83) P original by -1; or, the P 15 ⁇ 15 in formula (82) can be obtained by multiplying any number of columns of the formula (83) P original with The result of multiplying -1.
  • Any number of columns here does not include all columns.
  • it can also be any number of other columns. All are multiplied by -1.
  • the second, third, and fourth columns of equation (83) P original are all multiplied by -1.
  • the transmitting device 100 also includes: a cyclic shift module 105, a spatial mapping module 106, an inverse discrete Fourier transform module 107, a guard interval module 108, and a transmitting radio frequency module 109.
  • the matrix mapping sequence obtained by using the above P matrix mapping is placed in Send on the corresponding spatial stream.
  • the receiving device 200 is configured to receive the matrix mapping sequence sent by the sending device 100, and perform channel estimation according to the matrix mapping sequence. As shown in FIG. 2, the receiving device 200 includes: a receiving radio frequency module 201 and a channel estimation module 202, wherein the receiving radio frequency module 201 is used to receive a matrix mapping sequence sent by the transmitting device 100, and the channel estimation module 202 is used to map according to the matrix The sequence is used for channel estimation.
  • a sequence generation method includes:
  • the sending device generates a PPDU, where the PPDU includes a matrix-mapped EHT LTF sequence, where the matrix-mapped EHT LTF sequence is obtained by multiplying a predefined EHT LTF sequence by a P matrix, and the P matrix is n*n matrix, where n is greater than 8.
  • the predefined EHT LTF sequence includes multiple different sequences in different bandwidths and different modes, and the different bandwidths may include 20M bandwidth, 40M bandwidth, 80M bandwidth, 160M bandwidth, 320M bandwidth, 160M+160M bandwidth, etc.
  • the different modes may include 1x mode, 2x mode, 4x mode, and so on.
  • a number of different sequences in different bandwidths and modes including: 20M bandwidth and sequence in 1x mode, 20M bandwidth and sequence in 2x mode, 20M bandwidth and sequence in 4x mode, 40M bandwidth and sequence in 1x mode Sequence, 40M bandwidth and sequence in 2x mode, 40M bandwidth and sequence in 4x mode... 320M bandwidth and sequence in 1x mode, 320M bandwidth and sequence in 2x mode, 320M bandwidth and sequence in 4x mode, etc.
  • the multiple matrix-mapped EHT LTF sequences are spatially mapped to multiple different spatial streams for transmission. .
  • n*n P matrix (n is greater than 8) provided by the embodiment of this application is intended to ensure that when the number of spatial streams increases to more than 8, the matrix mapping sequence sent on each spatial stream needs to be orthogonal and has a low The PAPR value.
  • the sending device sends the PPDU.
  • the receiving device receives the PPDU, where the PPDU includes a matrix-mapped EHT LTF sequence, where the matrix-mapped EHT LTF sequence is obtained by multiplying a predefined EHT LTF sequence by a P matrix, and the P
  • the matrix is an n*n matrix, where n is greater than 8.
  • the receiving device performs channel estimation according to the EHT LTF sequence after the matrix mapping.
  • the matrix-mapped EHT LTF sequence in the PPDU has a lower PAPR value.
  • sequence generation method of the embodiment of the present application is described above, and the sequence generation device of the embodiment of the present application is described below. It should be understood that the sequence generation device is the sending device in the above method, and it has any function of the sending device in the above method. .
  • a sequence generation device includes:
  • the PPDU generation module 401 is configured to generate a PPDU.
  • the PPDU includes a matrix-mapped EHT LTF sequence, where the matrix-mapped EHT LTF sequence is obtained by multiplying a predefined EHT LTF sequence by a P matrix.
  • the P matrix is an n*n matrix, where n is greater than 8.
  • the PPDU sending module 402 is configured to send the PPDU.
  • the sequence generation apparatus in the embodiment of the present application has any function of the sending device in the above method, and will not be repeated here.
  • sequence receiving device is the receiving device in the above method, and it has any function of the receiving device in the above method.
  • a sequence receiving device includes:
  • the PPDU receiving module 501 is configured to receive a PPDU, the PPDU containing a matrix-mapped EHT LTF sequence, where the matrix-mapped EHT LTF sequence is obtained by multiplying a predefined EHT LTF sequence by the P matrix.
  • the P matrix is an n*n matrix, where n is greater than 8.
  • the channel estimation module 502 is configured to perform channel estimation according to the EHT LTF sequence after the matrix mapping.
  • the sequence receiving apparatus in the embodiment of the present application has any function of the receiving device in the foregoing method, and details are not described herein again.
  • the P matrix applied to the EHT LTF sequence in the embodiments of this application may include the P matrix mentioned in the process of the various embodiments above in addition to the P matrix listed in the various embodiments above.
  • Matrix for example, P 5 ⁇ 5 , P 3 ⁇ 3 , P 6 ⁇ 6 , P 7 ⁇ 7 , P 9 ⁇ 9 , P 11 ⁇ 11 , P 13 ⁇ 13 , P 15 ⁇ 15 , which is P in Figure 2
  • the matrix can be directly P 5 ⁇ 5 , P 3 ⁇ 3 , P 6 ⁇ 6 , P 7 ⁇ 7 , P 9 ⁇ 9 , P 11 ⁇ 11 , P 13 ⁇ 13 , P 15 ⁇ 15 in the above description.
  • sequence generating device and the sequence receiving device of the embodiments of the present application are described above, and the possible product forms of the sequence generating device and the sequence receiving device are described below. It should be understood that all products of any form that have the function of the sequence generating device described in FIG. 4, and all products of any form that have the function of the sequence receiving device described in FIG. 5, fall into the embodiments of the present application. protected range. It should also be understood that the following introduction is only an example, and does not limit the product form of the sequence generating device and the sequence receiving device in the embodiments of the present application.
  • sequence generating device and sequence receiving device described in the embodiments of this application can be implemented by a general bus architecture.
  • the sequence generation device includes a processor and a transceiver internally connected and communicated with the processor; the processor is used to generate a PPDU, and the PPDU includes a matrix-mapped EHT LTF sequence, wherein the matrix-mapped EHT LTF sequence The EHT LTF sequence is obtained by multiplying the predefined EHT LTF sequence by a P matrix, the P matrix being an n*n matrix, where n is greater than 8; the transceiver is used to send the PPDU.
  • the sequence generation apparatus may further include a memory, and the memory is configured to store instructions executed by the processor.
  • the sequence receiving device includes a processor and a transceiver that is internally connected and communicated with the processor; the transceiver is used to receive PPDUs, and the PPDUs include matrix-mapped EHT LTF sequences, wherein the matrix-mapped EHT LTF sequence The EHT LTF sequence is obtained by multiplying the predefined EHT LTF sequence by the P matrix.
  • the P matrix is an n*n matrix, where n is greater than 8; the processor is used to map the EHT LTF sequence according to the matrix Do channel estimation.
  • the sequence receiving apparatus may further include a memory, and the memory is configured to store instructions executed by the processor.
  • sequence generating device and sequence receiving device described in the embodiments of the present application may be implemented by a general-purpose processor.
  • the general-purpose processor that implements the sequence generation device includes a processing circuit and an output interface for internal connection and communication with the processing circuit; the processing circuit is used to generate a PPDU, and the PPDU includes a matrix-mapped EHT LTF sequence.
  • the EHT LTF sequence after the matrix mapping is obtained by multiplying the predefined EHT LTF sequence by the P matrix.
  • the P matrix is an n*n matrix, where n is greater than 8; the output interface is used to send the PPDU .
  • the general-purpose processor may further include a storage medium for storing instructions executed by the processing circuit.
  • the general-purpose processor implementing the sequence receiving device includes a processing circuit and an input interface for internal connection and communication with the processing circuit.
  • the input interface is used to receive a PPDU, and the PPDU contains a matrix-mapped EHT LTF sequence.
  • the EHT LTF sequence after the matrix mapping is obtained by multiplying the pre-defined EHT LTF sequence by the P matrix.
  • the P matrix is an n*n matrix, where n is greater than 8; the processing circuit is used for processing according to the matrix
  • the mapped EHT LTF sequence is used for channel estimation.
  • the general-purpose processor may further include a storage medium for storing instructions executed by the processing circuit.
  • sequence generating device and sequence receiving device described in the embodiments of this application can also be implemented using the following: one or more FPGA (Field Programmable Gate Array), PLD (Programmable Logic Device) ), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits capable of performing the various functions described throughout this application.
  • FPGA Field Programmable Gate Array
  • PLD Programmable Logic Device
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are merely illustrative, for example, the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may also be electrical, mechanical or other forms of connection.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments of the present application.
  • the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • the technical solution of this application is essentially or the part that contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium. It includes several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program code .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请实施例涉及通信领域,尤其涉及一种序列生成方法及装置。本申请所述的序列生成方法,包括:由预定义的EHT LTF序列乘以P矩阵,得到矩阵映射后的EHT LTF序列,所述P矩阵为n*n的矩阵,其中,n大于8;发送所述矩阵映射后的EHT LTF序列。本申请实施例提供的序列生成方法及装置,使PPDU中的矩阵映射后的EHT LTF序列具有较低的PAPR值。

Description

序列生成方法及装置
本申请要求于2019年09月12日提交国家知识产权局、申请号为201910869280.2、发明名称为“序列生成方法及装置”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信领域,尤其涉及一种序列生成方法及装置。
背景技术
通信设备的使用在过去几年已经显著地增加。例如,通信设备通常提供对诸如局域网或互联网的网络接入。其他通信设备可以与提供网络接入的通信设备进行无线通信。一些通信设备遵循诸如电气和电子工程师协会标准的某些工业标准。
随着通信设备的增加,人们寻求通信设备容量、可靠性和效率的提高。用于提高通信设备容量、可靠性或效率的系统和方法可能是有益的。
发明内容
本申请实施例提供的序列生成方法及装置,使PPDU中的矩阵映射后的EHT LTF序列具有较低的PAPR值。
第一方面,本申请实施例提供一种序列生成方法,包括:
由预定义的EHT LTF序列乘以P矩阵,得到矩阵映射后的EHT LTF序列,所述P矩阵为n*n的矩阵,其中,n大于8;
发送所述矩阵映射后的EHT LTF序列。
可选地,第一方面所述的P矩阵可参见具体实施例中的各种P矩阵。
第二方面,本申请实施例提供一种序列处理方法,包括:
接收矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列由预定义的EHT LTF序列乘以P矩阵得到,所述P矩阵为n*n的矩阵,其中,n大于8;
根据所述矩阵映射后的EHT LTF序列做信道估计。
可选地,第二方面所述的P矩阵可参见具体实施例中的各种P矩阵。
第三方面,本申请实施例提供一种序列生成方法,包括:
生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;
发送所述PPDU。
可选地,第三方面所述的P矩阵可参见具体实施例中的各种P矩阵。
第四方面,本申请实施例提供一种序列处理方法,包括:
接收PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;
根据所述矩阵映射后的EHT LTF序列做信道估计。
可选地,第四方面所述的P矩阵可参见具体实施例中的各种P矩阵。
第五方面,本申请实施例提供一种序列生成装置,所述序列生成装置包括用于执行上述第一方面或第一方面任意可能的实现方式所述方法的模块。
第六方面,本申请实施例提供一种序列处理装置,所述序列生成装置包括用于执行上述第二方面或第二方面任意可能的实现方式所述方法的模块。
第七方面,本申请实施例提供一种序列生成装置,所述序列生成装置包括用于执行上述第三方面或第三方面任意可能的实现方式所述方法的模块。
第八方面,本申请实施例提供一种序列处理装置,所述序列生成装置包括用于执行上述第四方面或第四方面任意可能的实现方式所述方法的模块。
第九方面,本申请实施例提供一种计算机可读存储介质,用于存储计算机程序,所述计算机程序包括用于执行上述第一方面或第一方面任意可能的实现方式的指令,或,上述第二方面或第二方面任意可能的实现方式的指令,或,上述第三方面或第三方面任意可能的实现方式的指令,或,上述第四方面或第四方面任意可能的实现方式的指令。
第十方面,本申请实施例提供一种计算机程序,所述计算机程序包括用于执行上述第一方面或第一方面任意可能的实现方式的指令,或,上述第二方面或第二方面任意可能的实现方式的指令,或,上述第三方面或第三方面任意可能的实现方式的指令,或,上述第四方面或第四方面任意可能的实现方式的指令。
第十一方面,本申请实施例提供一种通信系统,所述通信系统包括上述第五方面所提供的序列生成装置,和,上述第六方面所提供的序列处理装置。
第十二方面,本申请实施例提供一种通信系统,所述通信系统包括上述第七方面所提供的序列生成装置,和,上述第八方面所提供的序列处理装置。
附图说明
图1示出了本申请实施例应用的通信系统。
图2是一个系统图。
图3是本申请实施例涉及一种序列生成方法的流程图。
图4是一种序列生成装置的结构图。
图5是一种序列接收装置的结构图。
具体实施方式
下面将结合本申请实施例中的附图,对本申请实施例中的技术方案进行描述。
应理解,本申请实施例的技术方案可以应用于各种通信系统,例如:WIFI无线通信系统、全球移动通信(global system of mobile communication,GSM)系统、码分多址(code division multiple access,CDMA)系统、宽带码分多址(wideband code division multiple access,WCDMA)系统、通用分组无线业务(general packet radio service,GPRS)系统、长期演进(long term evolution,LTE)系统、LTE频分双工(frequency division duplex,FDD)系统、LTE时分双工(time division duplex,TDD)系统、通用移动通信系统(universal mobile telecommunication system,UMTS)、全球互联微波接入(worldwide interoperability for microwave access,WiMAX)通信系统、未来的其他演进系统、或其他各种采用无线接入技术的无线通信系统等。
图1示出了本申请实施例应用的通信系统。该通信系统包括一个网络设备和位于网络设备覆盖范围内的至少一个终端设备。网络设备可以为特定的地理区域提供通信覆盖,与位于该覆盖区域内的终端设备进行通信。网络设备可以是GSM系统或码分多址(code division multiple access,CDMA)系统中的基站(base transceiver station,BTS),可以是WCDMA系统中的基站(node B,NB),可以是LTE系统中的演进型基站(evolutional node B,eNB或eNodeB),可以是云无线接入网络(cloud radio access network,CRAN)中的无线控制器,可以是中继站、接入点AP、车载设备、可穿戴设备、未来网络中的网络侧设备等。终端设备可以是移动的或固定的,终端设备可以是站点STA、接入终端、用户设备(user equipment,UE)、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置等等。
具体地,本申请实施例涉及一种序列生成方法及装置,由本申请实施例生成的序列,其具有较低的PAPR值。
以下先对本申请实施例用到的技术术语,做下解释:
PPDU:PHY Protocol Data Unit,物理层协议数据单元。
EHT LTF:Extremely High Throughput Long Training Field,极高吞吐率长训练序列。
以下,以图2为例,对本申请实施例涉及的一种序列生成装置进行说明。
图2是一个系统图,该系统包括发送设备100和接收设备200,其中,发送设备100用于生成并发送具有较低PAPR值的序列,接收设备200用于接收所述序列并根据所述序列做信道估计。
如图2所示,发送设备100包括:
序列存储/生成模块101,用于存储或生成预定义的数据序列(本申请实施例,将数据位置的序列,统称为数据序列),所述预定义的数据序列包括多个不同带宽不同模式下的不同序列,所述不同带宽可以包括20M带宽、40M带宽、80M带宽、160M带宽、320M带宽、160M+160M带宽等,所述不同模式可以包括1x模式、2x模式、4x模式等。作为举例,多个不同带宽不同模式下的不同序列,包括:20M带宽且1x模式下的序列、20M带宽且2x模式下的序列、20M带宽且4x模式下的序列、40M带宽且1x模式下的序列、40M带宽且2x模式下的序列、40M带宽且4x模式下的序列……320M带宽且1x模式下的序列、320M带宽且2x模式下的序列、320M带宽且4x模式下的序列等等。可选地,所述数据序列为EHT LTF序列,即序列存储模块101存储预先定义的EHT LTF序列。
导频生成模块102,用于生成导频序列,所述导频序列用于跟踪发送信号的相位或频偏。
导频插入模块103,用于将导频序列插入数据序列,或者说,导频插入模块103用于将导频序列与数据序列组合在一起。
矩阵映射模块104,用于向组合的导频序列与数据序列应用矩阵,以产生矩阵映射的序列。矩阵映射模块104包括第一矩阵和第二矩阵,其中,第一矩阵为数据序列提供映射,第二矩阵为导频序列提供映射,或者换言之,向数据序列应用第一矩阵, 向导频序列应用第二矩阵。方便起见,第一矩阵可以称作P矩阵,所述P矩阵为n*n的矩阵,第二矩阵可以称作R矩阵,R矩阵包括P矩阵第一行的x个副本,x为空间流数。
一个示例中,向EHT LTF序列应用P矩阵,具体为,将EHT LTF序列与P矩阵中的元素进行相乘,例如,将EHT LTF序列与P矩阵中的每一行相乘,得到多个矩阵映射的序列,所述多个矩阵映射的序列分别被空间映射到多个不同的空间流上进行发送。
本申请实施例提供的n*n的P矩阵(n大于8),旨在保证当空间流数增大至超过8,每个空间流上发送的矩阵映射序列,需要保持正交且具有较低的PAPR值。
本申请实施例中,当空间流数为偶数n时,采用n*n的P矩阵;当空间流数为奇数n时,采用(n+1)*(n+1)的P矩阵。
以下,介绍本申请实施例提供的,不同空间流数下的P矩阵,其中,在每一种空间流数下,P矩阵有多种变形。
(一)空间流数为9或10下的P矩阵
当空间流数为9或10时,本申请实施例提供的P矩阵为:
Figure PCTCN2020114611-appb-000001
其中:
Figure PCTCN2020114611-appb-000002
上述式(12)中的P 5×5是由P original的第二列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000003
上述式(11)中的P 5×5,具体地如上述式(12)中所述。式(12)中所述P 5×5是由式(13)中的P original的第二列与-1相乘所得。以上,仅为本申请实施例提供的,当空间流数为9或10时的一个P 10×10矩阵的示例。
可选地,本申请实施例还提供,当空间流数为9或10时的其他P 10×10矩阵,
所述
Figure PCTCN2020114611-appb-000004
其中P 5×5可以由P original的任意一列与-1相乘所得;或者,P 5×5可以由P original的任意多 列列都与-1相乘所得,这里的任意多列不包括所有列,例如,P original的第二列和第三列都与-1相乘,得到P 5×5,但不包括P original的第一列至第五列都与-1相乘。
采用上述P 10×10映射得到的矩阵映射序列,具有较低的PAPR值。在80M带宽、4x模式下,经上述P 10×10映射得到的矩阵映射序列的PAPR值为6.2771,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为6.2851,显然,采用本申请实施例所提供的P 10×10为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。同样地,在320M带宽、4x模式下,经上述P 10×10映射得到的矩阵映射序列的PAPR值为9.2297,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为9.2653,显然,采用本申请实施例所提供的P 10×10为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。
(二)空间流数为11或12下的P矩阵
当空间流数为11或12时,本申请实施例提供的P矩阵为:
Figure PCTCN2020114611-appb-000005
其中,
Figure PCTCN2020114611-appb-000006
其中,
Figure PCTCN2020114611-appb-000007
上述P 3×3是由下述P original的第二列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000008
上述式(23)中所述P 3×3是由式(24)P original的第二列与-1相乘所得。将(23)中所述P 3×3带入式(22)中,得到P 6×6。再将(23)中所述P 6×6带入式(21)中,得到P 12×12
可选地,本申请实施例还提供,当空间流数为11或12时的其他P 12×12矩阵,例如,上述式(21)至式(24)中,其中,(23)中所述P 3×3可以由式(24)P original的任意一列与-1相乘所得,不限于第二列与-1相乘所得;或者,(23)中所述P 3×3可以由式(24)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,例如,(24)P original的第二列和第三列都与-1相乘,得到(23)中所述P 3×3,但不包括24)P original的第一列至第三列都与-1相乘。
采用上述P 12×12映射得到的矩阵映射序列,具有较低的PAPR值。在80M带宽、4x模式下,经上述P 12×12映射得到的矩阵映射序列的PAPR值为6.2369,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为6.3003,显然,采用本申请实施例所提供的P 10×10为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。同样地,在320M、4x模式带宽下,经 上述P 12×12映射得到的矩阵映射序列的PAPR值为9.2236,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为9.2636,显然,采用本申请实施例所提供的P 12×12为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。
当空间流数为11或12时,本申请实施例还提供如下P矩阵:
Figure PCTCN2020114611-appb-000009
其中,
Figure PCTCN2020114611-appb-000010
上述式(32)中的P 6×6是由下述式(33)中的P original的第二列和第六列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000011
可选地,本申请实施例还提供,当空间流数为11或12时的其他P 12×12矩阵,例如,上述式(31)至式(33)中,其中,(32)中所述P 6×6可以由式(33)P original的任意一列与-1相乘所得;或者,(32)中所述P 6×6可以由式(33)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,除了式(32)中的第二列和第六列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(33)P original的第二列、第三列和第四列都与-1相乘。
采用上述P 12×12映射得到的矩阵映射序列,具有较低的PAPR值。在80M带宽、4x模式下,经上述P 12×12映射得到的矩阵映射序列的PAPR值为6.2851,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为6.3003,显然,采用本申请实施例所提供的P 12×12为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。同样地,在320M带宽、4x模式下,经上述P 12×12映射得到的矩阵映射序列的PAPR值为9.2499,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到矩阵映射序列的PAPR值为9.2636,显然,采用本申请实施例所提供的P 12×12为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。
(三)空间流数为13或14下的P矩阵
当空间流数为13或14时,本申请实施例提供如下P矩阵:
Figure PCTCN2020114611-appb-000012
其中,
Figure PCTCN2020114611-appb-000013
上述式(42)中的P 7×7是由下述式(43)中的P original的第二列和第六列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000014
可选地,本申请实施例还提供,当空间流数为13或14时的其他P 14×14矩阵,例如,上述式(41)至式(43)中,其中,式(42)中所述P 7×7可以由式(43)P original的任意一列与-1相乘所得;或者,式(42)中所述P 7×7可以由式(43)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,除了式(42)中的第二列和第六列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(43)P original的第二列、第三列和第四列都与-1相乘。
采用上述P 14×14映射得到的矩阵映射序列,具有较低的PAPR值。在80M带宽、4x模式下,经上述P 14×14映射得到的矩阵映射序列的PAPR值为6.3115,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为6.3115,显然,采用本申请实施例所提供的P 14×14为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。同样地,在320M带宽、4x模式下,经上述P 14×14映射得到的矩阵映射序列的PAPR值为9.2594,而直接采用傅里叶矩阵映射,或者采用某一列或者多列乘以-1的傅里叶矩阵映射,得到的矩阵映射序列的PAPR值为9.2611,显然,采用本申请实施例所提供的P 14×14为EHT LTF序列提供映射,得到的矩阵映射序列的PAPR值较低。
(四)空间流数为17或18下的P矩阵
当空间流数为17或18时,本申请实施例提供如下P矩阵:
Figure PCTCN2020114611-appb-000015
其中,
Figure PCTCN2020114611-appb-000016
上述式(52)中的P 9×9是由下述式(53)中的P original的第二列和第六列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000017
可选地,本申请实施例还提供,当空间流数为17或18时的其他P 14×14矩阵,例如,上述式(51)至式(53)中,其中,式(52)中所述P 9×9可以由式(53)P original的任意一列与-1相乘所得;或者,式(52)中所述P 9×9可以由式(53)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,除了式(52)中的第二列和第六列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(53)P original的第二列、第三列和第四列都与-1相乘。
(五)空间流数为21或22下的P矩阵
当空间流数为21或22时,本申请实施例提供如下P矩阵:
Figure PCTCN2020114611-appb-000018
其中,
Figure PCTCN2020114611-appb-000019
上述式(62)中的P 11×11是由下述式(63)中的P original的第二列、第六列和第十列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000020
可选地,本申请实施例还提供,当空间流数为21或22时的其他P 22×22矩阵,例如,上述式(61)至式(63)中,其中,式(62)中所述P 11×11可以由式(63)P original的任意一列与-1相乘所得;或者,式(62)中所述P 11×11可以由式(63)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,除了式(62)中的第二列和第六列和第十列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(63)P original的第二列、第三列和第四列都与-1相乘。
(六)空间流数为25或26下的P矩阵
当空间流数为25或26时,本申请实施例提供如下P矩阵:
Figure PCTCN2020114611-appb-000021
其中,
Figure PCTCN2020114611-appb-000022
上述式(72)中的P 13×13是由下述式(73)中的P original的第二列、第六列和第十列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000023
可选地,本申请实施例还提供,当空间流数为25或26时的其他P 26×26矩阵,例如,上述式(71)至式(73)中,其中,式(72)中所述P 13×13可以由式(73)P original的任意一列与-1相乘所得;或者,式(72)中所述P 13×13可以由式(73)P original的任意多列都 与-1相乘所得,这里的任意多列不包括所有列,除了式(72)中的第二列和第六列和第十列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(73)P original的第二列、第三列和第四列都与-1相乘。
(七)空间流数为29或30下的P矩阵
当空间流数为29或30时,本申请实施例提供如下P矩阵:
Figure PCTCN2020114611-appb-000024
其中,
Figure PCTCN2020114611-appb-000025
上述式(82)中的P 15×15是由下述式(83)中的P original的第二列、第六列、第十列、第十四列和第十五列与-1相乘所得,其中,P original表达为如下:
Figure PCTCN2020114611-appb-000026
可选地,本申请实施例还提供,当空间流数为29或30时的其他P 30×30矩阵,例如,上述式(81)至式(83)中,其中,式(82)中所述P 15×15可以由式(83)P original的任意一列与-1相乘所得;或者,式(82)中所述P 15×15可以由式(83)P original的任意多列都与-1相乘所得,这里的任意多列不包括所有列,除了式(82)中的第二列和第六列和第十列与-1相乘之外,还可以是别的任意多列都与-1相乘,例如,式(83)P original的第二列、第三列和第四列都与-1相乘。
发送设备100还包括:循环移位模块105、空间映射模块106、离散傅里叶反变换模块107、保护间隔模块108和发射射频模块109,采用上述P矩阵映射得到的矩阵映射序列,被放到相应的空间流上进行发送。
接收设备200用于接收发送设备100发送的矩阵映射序列,并根据所述矩阵映射序列做信道估计。如图2所示,接收设备200包括:接收射频模块201和信道估计模块202,其中,接收射频模块201用于接收发送设备100发送的矩阵映射序列,信道估计模块202用于根据所述矩阵映射序列做信道估计。
以下,以图3的流程为例,对本申请实施例涉及一种序列生成方法进行说明。
如图3所示,一种序列生成方法,包括:
S101、发送设备生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8。
步骤S101中,所述预定义的EHT LTF序列包括多个不同带宽不同模式下的不同序列,所述不同带宽可以包括20M带宽、40M带宽、80M带宽、160M带宽、320M带宽、160M+160M带宽等,所述不同模式可以包括1x模式、2x模式、4x模式等。作为举例,多个不同带宽不同模式下的不同序列,包括:20M带宽且1x模式下的序列、20M带宽且2x模式下的序列、20M带宽且4x模式下的序列、40M带宽且1x模式下 的序列、40M带宽且2x模式下的序列、40M带宽且4x模式下的序列……320M带宽且1x模式下的序列、320M带宽且2x模式下的序列、320M带宽且4x模式下的序列等等。
将EHT LTF序列与P矩阵中的每一行相乘,得到多个矩阵映射后的EHT LTF序列,所述多个矩阵映射后的EHT LTF序列分别被空间映射到多个不同的空间流上进行发送。
本申请实施例提供的n*n的P矩阵(n大于8),旨在保证当空间流数增大至超过8,每个空间流上发送的矩阵映射序列,需要保持正交且具有较低的PAPR值。
本申请实施例中,当空间流数为偶数n时,采用n*n的P矩阵;当空间流数为奇数n时,采用(n+1)*(n+1)的P矩阵。
不同空间流数下的各种P矩阵,参见上文中的描述,此处不再赘述。
S102、发送设备发送所述PPDU。
S103、接收设备接收所述PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8。
S104、接收设备根据所述矩阵映射后的EHT LTF序列做信道估计。
本申请实施例中PPDU中的矩阵映射后的EHT LTF序列具有较低的PAPR值。
以上介绍了本申请实施例的序列生成方法,以下介绍本申请实施例的序列生成装置,应理解,所述序列生成装置即为上述方法中的发送设备,其具有上述方法中发送设备的任意功能。
如图4所示,一种序列生成装置,包括:
PPDU生成模块401,用于生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8。
PPDU发送模块402,用于发送所述PPDU。
本申请实施例的序列生成装置具有上述方法中发送设备的任意功能,此处不再赘述。
以下再简单介绍本申请实施例的序列接收装置,应理解,所述序列接收装置即为上述方法中的接收设备,其具有上述方法中接收设备的任意功能。
如图5所示,一种序列接收装置,包括:
PPDU接收模块501,用于接收PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8。
信道估计模块502,用于根据所述矩阵映射后的EHT LTF序列做信道估计。
本申请实施例的序列接收装置具有上述方法中接收设备的任意功能,此处不再赘述。
应理解,本申请实施例中所述向EHT LTF序列应用的P矩阵,除了包括上文各种实施例列举的P矩阵之外,还可以包括上文各种实施例的过程中提及的P矩阵,例如,P 5×5,P 3×3,P 6×6,P 7×7,P 9×9,P 11×11,P 13×13,P 15×15,即图2中的P矩阵可以直接为上文 中的P 5×5,P 3×3,P 6×6,P 7×7,P 9×9,P 11×11,P 13×13,P 15×15
以上介绍了本申请实施例的序列生成装置和序列接收装置,以下介绍所述序列生成装置和所述序列接收装置可能的产品形态。应理解,但凡具备上述图4所述的序列生成装置的功能的任何形态的产品,和但凡具备上述图5所述的序列接收装置的功能的任何形态的产品,都落入本申请实施例的保护范围。还应理解,以下介绍仅为举例,不限制本申请实施例的序列生成装置和序列接收装置的产品形态仅限于此。
作为一种可能的产品形态,本申请实施例所述的序列生成装置和序列接收装置,可以由一般性的总线体系结构来实现。
所述序列生成装置,包括处理器和与所述处理器内部连接通信的收发器;所述处理器用于生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;所述收发器用于发送所述PPDU。可选地,所述序列生成装置还可以包括存储器,所述存储器用于存储处理器执行的指令。
所述序列接收装置,包括处理器和与所述处理器内部连接通信的收发器;所述收发器用于接收PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;所述处理器用于根据所述矩阵映射后的EHT LTF序列做信道估计。可选地,所述序列接收装置还可以包括存储器,所述存储器用于存储处理器执行的指令。
作为一种可能的产品形态,本申请实施例所述的序列生成装置和序列接收装置,可以由通用处理器来实现。
实现所述序列生成装置的通用处理器包括处理电路和与所述处理电路内部连接通信的输出接口;所述处理电路用于生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;所述输出接口用于发送所述PPDU。可选地,该通用处理器还可以包括存储介质,所述存储介质用于存储处理电路执行的指令。
实现所述序列接收装置的通用处理器包括处理电路和与所述处理电路内部连接通信的输入接口,所述输入接口用于接收PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;所述处理电路用于根据所述矩阵映射后的EHT LTF序列做信道估计。可选地,该通用处理器还可以包括存储介质,所述存储介质用于存储处理电路执行的指令。
作为一种可能的产品形态,本申请实施例所述的序列生成装置和序列接收装置,还可以使用下述来实现:一个或多个FPGA(现场可编程门阵列)、PLD(可编程逻辑器件)、控制器、状态机、门逻辑、分立硬件部件、任何其它适合的电路、或者能够执行本申请通篇所描述的各种功能的电路的任意组合。
应理解,上述各种产品形态的序列生成装置,具有上述方法实施例中发送设备的任意功能,此处不再赘述;上述各种产品形态的序列接收装置,具有上述方法实施例 中接收设备的任意功能,此处不再赘述。
应理解,本文中术语“和/或”,仅仅是一种描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B这三种情况。另外,本文中字符“/”,一般表示前后关联对象是一种“或”的关系。
本领域普通技术人员可以意识到,结合本文中所公开的实施例中描述的各方法步骤和单元,能够以电子硬件、计算机软件或者二者的结合来实现,为了清楚地说明硬件和软件的可互换性,在上述说明中已经按照功能一般性地描述了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行,取决于技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能,但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到,为了描述的方便和简洁,上述描述的系统、装置和单元的具体工作过程,可以参见前述方法实施例中的对应过程,在此不再赘述。
在本申请所提供的几个实施例中,应该理解到,所揭露的系统、装置和方法,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式,例如多个单元或组件可以结合或者可以集成到另一个系统,或一些特征可以忽略,或不执行。另外,所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、装置或单元的间接耦合或通信连接,也可以是电的,机械的或其它的形式连接。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例方案的目的。
另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以是两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现,也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。基于这样的理解,本申请的技术方案本质上或者说对现有技术做出贡献的部分,或者该技术方案的全部或部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(read-only memory,ROM)、随机存取存储器(random access memory,RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述,仅为本申请的具体实施方式,但本申请的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本申请揭露的技术范围内,可轻易想到各种等效的修改或替换,这些修改或替换都应涵盖在本申请的保护范围之内。因此,本申请的保护范围应以权利要求的保护范围为准。

Claims (16)

  1. 一种序列生成方法,其特征在于,包括:
    生成PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;
    发送所述PPDU。
  2. 一种序列处理方法,其特征在于,包括:
    接收PPDU,所述PPDU包含矩阵映射后的EHT LTF序列,其中,所述矩阵映射后的EHT LTF序列是由预定义的EHT LTF序列乘以P矩阵得到的,所述P矩阵为n*n的矩阵,其中,n大于8;
    根据所述矩阵映射后的EHT LTF序列做信道估计。
  3. 根据权1或2所述的方法,其特征在于,当n=10时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100001
    其中,
    Figure PCTCN2020114611-appb-100002
  4. 根据权1或2所述的方法,其特征在于,当n=12时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100003
    其中,
    Figure PCTCN2020114611-appb-100004
  5. 根据权1或2所述的方法,其特征在于,当n=12时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100005
    其中,
    Figure PCTCN2020114611-appb-100006
  6. 根据权1或2所述的方法,其特征在于,当n=14时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100007
    其中,
    Figure PCTCN2020114611-appb-100008
  7. 根据权1或2所述的方法,其特征在于,当n=18时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100009
    其中,
    Figure PCTCN2020114611-appb-100010
  8. 根据权1或2所述的方法,其特征在于,当n=22时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100011
    其中,
    Figure PCTCN2020114611-appb-100012
  9. 根据权1或2所述的方法,其特征在于,当n=26时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100013
    其中,
    Figure PCTCN2020114611-appb-100014
  10. 根据权1或2所述的方法,其特征在于,当n=30时,所述P矩阵为:
    Figure PCTCN2020114611-appb-100015
    其中,
    Figure PCTCN2020114611-appb-100016
  11. 一种序列生成装置,其特征在于,包括用于执行权1、3-10中任一项方法的模块。
  12. 一种序列处理装置,其特征在于,包括用于执行权2、3-10中任一项方法的模块。
  13. 一种计算机可读存储介质,其特征在于,用于存储计算机程序,所述计算机程序包括用于执行权1-10任一项方法的指令。
  14. 一种计算机程序,其特征在于,所述计算机程序包括用于权1-10任一项方法的指令。
  15. 一种通用处理器,其特征在于,包括处理电路和与所述处理电路内部连接通信的输出接口;所述处理电路用于执行权1、3-10中任一项方法中的生成动作,所述输出接口用于执行权1、3-10中任一项方法中的发送动作。
  16. 一种通用处理器,其特征在于,包括处理电路和与所述处理电路内部连接通信的输入接口;所述输入接口用于执行权2、3-10中任一项方法中的接收动作,所述处理电路用于权2、3-10中任一项方法中的处理动作。
PCT/CN2020/114611 2019-09-12 2020-09-10 序列生成方法及装置 Ceased WO2021047613A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
BR112022004525A BR112022004525A2 (pt) 2019-09-12 2020-09-10 Método e aparelho de geração de sequência
EP20863698.5A EP4024802A4 (en) 2019-09-12 2020-09-10 SEQUENCE GENERATING METHOD AND APPARATUS
US17/693,662 US20220217022A1 (en) 2019-09-12 2022-03-14 Sequence Generation Method and Apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910869280.2A CN112491768B (zh) 2019-09-12 2019-09-12 序列生成方法及装置
CN201910869280.2 2019-09-12

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/693,662 Continuation US20220217022A1 (en) 2019-09-12 2022-03-14 Sequence Generation Method and Apparatus

Publications (1)

Publication Number Publication Date
WO2021047613A1 true WO2021047613A1 (zh) 2021-03-18

Family

ID=74866586

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/114611 Ceased WO2021047613A1 (zh) 2019-09-12 2020-09-10 序列生成方法及装置

Country Status (5)

Country Link
US (1) US20220217022A1 (zh)
EP (1) EP4024802A4 (zh)
CN (1) CN112491768B (zh)
BR (1) BR112022004525A2 (zh)
WO (1) WO2021047613A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114070697B (zh) 2020-08-05 2023-02-10 华为技术有限公司 一种传输物理层协议数据单元的方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107210987A (zh) * 2015-02-04 2017-09-26 Lg电子株式会社 在无线通信系统中用于多用户发送和接收的方法及其装置
CN109245806A (zh) * 2013-06-25 2019-01-18 华为技术有限公司 上行多用户数据传输方法及上行多用户输入输出系统
US20190097850A1 (en) * 2018-11-30 2019-03-28 Thomas Kenney Preamble design for extremely high throughput wireless communication with backward compatibility
WO2019074927A1 (en) * 2017-10-13 2019-04-18 Qualcomm Incorporated MANAGING HIGH VOLUME OF SPATIO-TEMPORAL FLOWS IN VERY HIGH-SPEED WIRELESS SYSTEMS (EHT) OF NEW GENERATION

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8798202B2 (en) * 2007-06-15 2014-08-05 Motorola Mobility Llc Method and apparatus using sounding PPDUs to provide range extension to IEEE 802.11n signals
EP2471200A4 (en) * 2009-12-10 2012-10-17 Lg Electronics Inc METHOD AND APPARATUS FOR TRANSMITTING LEARNING SIGNAL IN A WIRELESS LOCAL NETWORK SYSTEM
SG10201808652UA (en) * 2018-10-01 2020-05-28 Panasonic Ip Corp America Communication Apparatus and Communication Method for Channel Estimation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109245806A (zh) * 2013-06-25 2019-01-18 华为技术有限公司 上行多用户数据传输方法及上行多用户输入输出系统
CN107210987A (zh) * 2015-02-04 2017-09-26 Lg电子株式会社 在无线通信系统中用于多用户发送和接收的方法及其装置
WO2019074927A1 (en) * 2017-10-13 2019-04-18 Qualcomm Incorporated MANAGING HIGH VOLUME OF SPATIO-TEMPORAL FLOWS IN VERY HIGH-SPEED WIRELESS SYSTEMS (EHT) OF NEW GENERATION
US20190097850A1 (en) * 2018-11-30 2019-03-28 Thomas Kenney Preamble design for extremely high throughput wireless communication with backward compatibility

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4024802A4

Also Published As

Publication number Publication date
EP4024802A1 (en) 2022-07-06
CN112491768B (zh) 2024-07-23
EP4024802A4 (en) 2022-11-16
US20220217022A1 (en) 2022-07-07
CN112491768A (zh) 2021-03-12
BR112022004525A2 (pt) 2022-05-31

Similar Documents

Publication Publication Date Title
EP3531602B1 (en) Method for transmitting reference signal, and communication device
EP3820218B1 (en) Signal transmission method, apparatus, terminal device, network device, and system
US11160127B2 (en) Locating method in multi-connectivity network, terminal device and location management function entity
CN112333125B (zh) 信号处理的方法和装置
EP3955654B1 (en) Method for power control and network device
WO2022067726A1 (zh) 用于资源调度的通信方法及装置
EP3550761B1 (en) Data transmission method and device, and information transmission method and device
TWI759558B (zh) 用於傳輸信號的方法、網路設備和終端設備
CN109845364B (zh) 传输上行控制信息的方法、终端设备和网络设备
US20200322990A1 (en) Trs burst transmission method and apparatus
WO2020192715A1 (zh) 资源分配方法及装置
TWI769324B (zh) 傳輸資料的方法、終端設備和網路設備
WO2021249405A1 (zh) 传输/接收物理层协议数据单元的方法和装置
EP3468243B1 (en) Csi-rs transmission method and network device
WO2021047613A1 (zh) 序列生成方法及装置
EP3562059A1 (en) Information transmission method, network device and terminal device
US12120642B2 (en) Method for demodulating shared reference signal, terminal device, and network device
WO2018112934A1 (zh) 传输信息的方法、网络设备和终端设备
US20240121068A1 (en) Communication method and apparatus
EP3573388B1 (en) Method and device for transmitting signal
CN109417819B (zh) 传输系统信息的方法、网络设备、终端设备和存储介质
CN116326006B (zh) 毫米波系统中的波束切换方法
EP3531771B1 (en) Wireless communication using multiple access techniques
CN113259080B (zh) 用于指示pdcch资源的方法和设备
WO2025087086A1 (zh) 一种通信方法及装置

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: 20863698

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112022004525

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 2020863698

Country of ref document: EP

Effective date: 20220329

ENP Entry into the national phase

Ref document number: 112022004525

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20220311