Communication method and apparatus

Abstract

A communication method and apparatus. The method comprises: determining a first codeword, the first codeword comprising a first sequence, and the first codeword belonging to a codeword set; and sending a first signal on the basis of the first codeword. In this way, the first signal is sent by using the first codeword, so that signals of different antenna ports on a same resource can be distinguished by means of codewords. Therefore, limited resources can support signal transmission of more antenna ports, thereby improving the capacity of a communication system. In addition, the first codeword may be one codeword in the codeword set, which enables more codewords to be selected for signal transmission.

Description

A communication method and apparatus

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202510073856.X, filed on January 16, 2025, entitled "A Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of communication technology, and in particular to a communication method and apparatus. Background Technology

[0004] In communication systems, different antenna ports can transmit signals on different resources, such as transmitting reference signals. An antenna port can be understood as a channel or a signal (e.g., a reference signal). However, resources in communication systems (such as frequency domain resources or time domain resources) are very limited. Furthermore, with the continuous development of communication technology, on the one hand, the number of antenna ports supported by a single device is increasing; on the other hand, the number and types of devices capable of communicating with network devices are also increasing. This leads to an explosive increase in the number of connections in communication systems, and correspondingly, the demand for signal transmission is also growing. Therefore, how to utilize limited resources to transmit more signals is a problem that urgently needs to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus for providing more codewords.

[0006] In a first aspect, embodiments of this application provide a communication method. This method can be applied to a first device. The first device can be the first device itself or a module within the first device. The first device is, for example, a terminal device or a network device. A module within the first device is, for example, a communication module within the first device, a circuit or chip responsible for communication functions. The chip is, for example, a modem chip, also known as a baseband chip, or a system-on-a-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip, etc. For ease of description, the following description uses the execution of this method by a first device as an example. The method includes: determining a first codeword, the first codeword including a first sequence, the first codeword belonging to a codeword set, and sending a first signal according to the first codeword.

[0007] Optionally, the codeword set may contain two identical codewords, or any two codewords in the codeword set may be different. The codeword set may be predetermined by a protocol or indicated by a network device, and is not limited thereto. The first codeword including the first sequence can be: some elements in the first codeword constitute the first sequence, in which case the length of the first sequence is equal to the length of the first codeword; or the first codeword may be the first sequence, in which case the length of the first sequence is less than the length of the first codeword.

[0008] In this embodiment, when transmitting the first signal, a first codeword can be used to send the first signal, allowing signals from different antenna ports on the same resource to be distinguished by the codeword. This enables limited resources to support signal transmission from more antenna ports, increasing the capacity of the communication system. Furthermore, the first codeword can be one from a set of codewords, providing a wider selection of codewords for signal transmission. Also, the first codeword includes a first sequence; if the first sequence has multiple possibilities, then the first codeword also has multiple possibilities, expanding the codeword set.

[0009] In one possible implementation, the number of distinct codewords in the codeword set is greater than the length of a single codeword in the codeword set, or the number of distinct codeword sets in the codeword set is less than the length of a single codeword in the codeword set, or the number of distinct codeword sets in the codeword set is equal to the length of a single codeword in the codeword set. Optionally, a codeword can be any codeword in the codeword set or a specific codeword in the codeword set, such as the first codeword or the last codeword in the codeword set. The length of a codeword refers to the number of elements (or code symbols) included in the codeword.

[0010] Thus, when the number of different codewords in the codeword set is greater than the length of a single codeword in the codeword set, it's equivalent to the codeword set containing a larger number of codewords, enriching the codewords within the set and providing more selectable codewords for signal transmission, thereby improving the flexibility of signal transmission. When the number of different codeword sets in the codeword set is less than the length of a single codeword in the set, the codeword set includes relatively longer codewords, which is suitable for transmitting longer signals and helps improve the system's fault tolerance and anti-interference capabilities. When the number of different codeword sets in the codeword set is equal to the length of a single codeword in the set, the orthogonality of the different codewords in the codeword set can be guaranteed to the greatest extent, which helps improve the anti-interference capability of the codeword set when used for signal transmission.

[0011] In one possible implementation, the first sequence is a row vector in a first matrix, which satisfies the following relationship: C = HZ, where C is the first matrix, and the number of rows and columns of C are both N, where N is a positive integer. Indicates to conduct The Kronecker product of order n is given by Z, which is a diagonal matrix with N rows and N columns. The (n+1)th element on the diagonal of Z is z. f(n) f(n) = nA n n∈{0,1,2,…,N-1} or Both M and A are positive integers.

[0012] Thus, determining more first sequences based on the above relationships is beneficial for providing more codewords to meet the needs of transmitting more signals. Furthermore, since any two row vectors in the first matrix are orthogonal, for example, if multiple row vectors in the first matrix are used to generate codewords, more orthogonal codewords can be provided, thereby improving the codewords' anti-interference capability.

[0013] In one possible implementation, A can be either 3 or 4. Thus, different values ​​of A result in different first matrices, which also facilitates providing more codewords.

[0014] In one possible implementation, M is a power of 2. Thus, different values ​​of M result in different first matrices, which also allows for the provision of more codewords.

[0015] In one possible implementation, when N=4, and In this case, the first matrix is ​​specifically:

[0016] Specifically, when M=4 and A=3, Z is:

[0017] Therefore, the first matrix is ​​specifically as follows:

[0018] In one possible implementation, when N=4, In this case, the first matrix is:

[0019] Specifically, when M=4 and A=3, Z is:

[0020] Therefore, the first matrix is:

[0021] The first sequence is the row vector in the first matrix.

[0022] In one possible implementation, the first sequence is a row vector in the second matrix, and the second matrix satisfies the following relationship: P = QS wLet P be a second matrix, with N rows and N columns, where N is a positive integer. Let S be a rearranged row matrix of the identity matrix, and w be a positive integer less than or equal to N. Let Q satisfy the following relationship: Q = FZ, where F is a discrete Fourier transform matrix with N rows and N columns, and Z is a diagonal matrix with N rows and N columns, where the (n+1)th element on the diagonal of Z is z. f(u,n) , f(u,n)=u(n)(n+1), n∈{0,1,2,…,N-1}, or K and u are both positive integers. Optionally, u ∈ {1, 2, ..., N-1}. Optionally, K equals N.

[0023] Thus, more first sequences can be determined based on the above relationships, where, given a value of w, multiple row vectors in the second matrix are orthogonal, that is, any two row vectors in the second matrix are orthogonal; the inner product of any two row vectors in multiple different second matrices obtained with different values ​​of w is cross-correlated and satisfies Because the cross-correlation is very low and uniformly low, it helps to improve the codeword's anti-interference ability and simplifies the cost of coordinating the use of codewords.

[0024] In one possible implementation, M is a power of 2. For example, M can be 2, 4, 8, 16, 32, or 64. Thus, different values ​​of M result in different first matrices, allowing for the provision of more codewords.

[0025] In one possible implementation, when N = 4, w ∈ {1, 2, 3, 4}, S satisfies the following relation:

[0026] Where, if u = 4, then

[0027] Where j is an imaginary number, j 2 =-1;

[0028] Furthermore, for different values ​​of w, the second matrix is ​​as follows:

[0029] The first sequence is the row vector in the second matrix.

[0030] In one possible implementation, the first sequence includes one of the following: [+1, -1, +1, +1], [+1, +1, +1, -1], [+1, -1, -1, -1], [+1, +1, -1, +1], or Here, j is the imaginary unit. This provides several examples of the first sequence.

[0031] In one possible implementation, the first codeword is a frequency domain codeword or a time domain codeword.

[0032] In one possible implementation, the first signal is the result of data being processed by the first codeword, i.e., a data channel signal. The data channel signal is used to indicate or carry data. Alternatively, the first signal is the result of a reference signal sequence being processed by the first codeword, i.e., a reference signal. Alternatively, the first signal is the result of control information being processed by the first codeword, i.e., a control channel signal. The control channel signal is used to indicate or carry control information (or signaling or control signaling). The purpose of the first codeword is not limited.

[0033] In one possible implementation, the codeword set includes two non-orthogonal codewords. Alternatively, the codeword set includes two distinct code groups.

[0034] In one possible implementation, the total number of codewords in the codeword set is 8, 10, 12, 14, 32, 48, 64, 96, or 160. This implementation is merely an example of the total number of codewords in the codeword set, and is not limited to that specific number.

[0035] In one possible implementation, determining the first codeword includes: receiving first information indicating the first codeword; or selecting the first codeword from a codeword set; or sending first information indicating the first codeword. For example, if the first device is a terminal device, then the first device can receive a first signal from a second device. Alternatively, if the first device is a network device, the network device can select the first codeword from the codeword set.

[0036] In one possible implementation, the first information is used to indicate the first codeword, including at least one of the following: information indicating the port number of the first antenna port, information indexing the port number of the first antenna port, or information indexing the first codeword. The index of the first codeword, for example, is used to distinguish the first codeword in a codeword set.

[0037] In this way, the first information does not need to indicate the content of the first codeword, which helps to save the number of bits of the first information.

[0038] Secondly, embodiments of this application provide a communication method. This method can be applied to a second device. The second device can be the second device itself or a module within the second device. The second device is, for example, a terminal device or a network device. A module within the second device is, for example, a communication module within the second device, a circuit or chip responsible for communication functions. A chip may be, for example, a modem chip, also known as a baseband chip, or a SoC chip or SIP chip containing a modem core. For ease of description, the following description uses the execution of this method by a second device as an example. The method includes: receiving a first signal, and processing the first signal based on a first codeword to obtain a reference signal sequence, data, or control information, wherein the first codeword includes a first sequence and belongs to a codeword set.

[0039] In one possible implementation, the number of different codewords included in the codeword set is greater than the length of a single codeword in the codeword set, or the number of different codewords included in the codeword set is less than the length of a single codeword in the codeword set, or the number of different codewords included in the codeword set is equal to the length of a single codeword in the codeword set.

[0040] In one possible implementation, the first sequence is a row vector in a first matrix, which satisfies the following relationship: C = HZ, where C is the first matrix, and the number of rows and columns of C are both N, where N is a positive integer. Indicates to conduct The Kronecker product of order n is given by Z, which is a diagonal matrix with N rows and N columns. The (n+1)th element on the diagonal of Z is z. f(n) f(n) = nA n n∈{0,1,2,…,N-1} or Both M and A are positive integers.

[0041] In one possible implementation, A can be either 3 or 4.

[0042] In one possible implementation, M is a power of 2.

[0043] In one possible implementation, the first sequence is a row vector in the second matrix, and the second matrix satisfies the following relationship: P = QS w Let P be a second matrix, with N rows and N columns, where N is a positive integer. Let S be a rearranged row matrix of the identity matrix, and w be a positive integer less than or equal to N. Let Q satisfy the following relationship: Q = FZ, where F is a discrete Fourier transform matrix with N rows and N columns, and Z is a diagonal matrix with N rows and N columns, where the (n+1)th element on the diagonal of Z is z. f(u,n), f(u,n)=u(n)(n+1), n∈{0,1,2,…,N-1}, u∈{1,2,…,N-1}, or K and u are both positive integers.

[0044] In one possible implementation, K takes the value of a power of 2.

[0045] In one possible implementation, the first sequence includes one of the following: [+1, -1, +1, +1], [+1, +1, +1, -1], [+1, -1, -1, -1], [+1, +1, -1, +1], or Where j is the imaginary unit.

[0046] In one possible implementation, the first codeword is a frequency domain codeword or a time domain codeword.

[0047] In one possible implementation, the first signal is either a data channel signal or a reference signal. That is, the first codeword can process data or a reference signal sequence; the purpose of the first codeword is not limited. If the first signal is a data channel signal, processing the first signal based on the first codeword yields data. If the first signal is a reference signal, processing the first signal based on the first codeword yields a reference signal sequence.

[0048] In one possible implementation, the codeword set includes two non-orthogonal codewords. Alternatively, the codeword set includes two distinct code groups.

[0049] In one possible implementation, the codeword set includes a total number of codewords of 8, 10, 12, 14, 32, 48, 64, 96, or 160.

[0050] In one possible implementation, determining the first codeword includes: sending first information, the first information indicating the first codeword; or receiving first information, the first information indicating the first codeword.

[0051] In one possible implementation, the first information is used to indicate the first codeword, including: the first information includes at least one of information indicating the port number of the first antenna port, information indicating the index of the port number of the first antenna port, or information indicating the index of the first codeword.

[0052] Thirdly, embodiments of this application provide a communication device. The communication device has the functions described in the first aspect above. For example, the communication device includes modules, units, or means corresponding to the operations described in the first aspect. These functions, units, or means can be implemented by software, hardware, or hardware executing corresponding software.

[0053] In one possible implementation, the communication device includes a processing unit and a communication unit. The communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the first aspect described above.

[0054] In one possible implementation, the communication device includes a processor that can be coupled to a memory. The memory can store computer programs or instructions necessary to implement the functions described in the first aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods described in any of the possible implementations of the first aspect above, when the computer programs or instructions are executed.

[0055] In one possible implementation, the communication device includes a processor and a memory, the memory storing necessary computer programs or instructions for implementing the functions described in the first aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the method in any of the possible implementations of the first aspect above when the computer programs or instructions are executed.

[0056] In one possible implementation, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to perform the method described in any of the possible implementations of the first aspect above.

[0057] Fourthly, embodiments of this application provide a communication device. The communication device has the functions described in the first or second aspect above. For example, the communication device includes modules, units, or means corresponding to the operations described in the second aspect above. These functions, units, or means can be implemented by software, hardware, or hardware executing corresponding software.

[0058] In one possible implementation, the communication device includes a processing unit and a communication unit. The communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the second aspect described above.

[0059] In one possible implementation, the communication device includes a processor that can be coupled to a memory. The memory can store computer programs or instructions necessary to implement the functions described in the second aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any of the possible implementations of the second aspect above, when the computer programs or instructions are executed.

[0060] In one possible implementation, the communication device includes a processor and a memory, the memory storing necessary computer programs or instructions for implementing the functions described in the first or second aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the method in any possible implementation of the second aspect above when the computer programs or instructions are executed.

[0061] In one possible implementation, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to perform the method described in any of the possible implementations of the second aspect above.

[0062] Understandably, in the third or fourth aspect described above, the processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0063] Fifthly, embodiments of this application provide a communication system. The communication system may include a first device and a second device; wherein the first device is used to perform the method described in the first aspect, and the second device is used to perform the method described in the second aspect.

[0064] Sixthly, embodiments of this application provide a chip (or chip system). The chip includes a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, causing the method in any of the possible implementations of the first or second aspect described above to be executed.

[0065] In a seventh aspect, embodiments of this application provide a computer-readable storage medium. The computer storage medium stores a computer program (or computer-readable instructions), and when a computer reads and executes some or all of the computer-readable instructions, the method in any of the possible implementations of the first or second aspect described above is performed.

[0066] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD-ROM or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.

[0067] Eighthly, embodiments of this application provide a computer program product. When a computer reads and executes the computer program product, the method in any of the possible implementations of the first or second aspect described above is performed.

[0068] Regarding the beneficial effects of any of the technical solutions in the second to eighth aspects mentioned above, refer to the discussion of the beneficial effects of the corresponding technical solutions in the first aspect; repeated examples will not be listed here. Attached Figure Description

[0069] Figure 1 is a schematic diagram of a signal processing flow for the signal source and sink;

[0070] Figure 2 is a schematic diagram of a communication system applicable to an embodiment of this application;

[0071] Figure 3 illustrates the transmission process of a reference signal;

[0072] Figure 4 is a schematic diagram of a communication system applicable to an embodiment of this application;

[0073] Figure 5 is a schematic diagram of a communication system provided in an embodiment of this application;

[0074] Figure 6 is a schematic diagram of a communication method provided in an embodiment of this application;

[0075] Figures 7 to 9 are schematic diagrams of the three mapping signals provided in the embodiments of this application;

[0076] Figures 10 and 11 are schematic diagrams of the structures of two communication devices provided in the embodiments of this application. Detailed Implementation

[0077] The embodiments of this application will now be described in further detail with reference to the accompanying drawings.

[0078] The following is an explanation of the relevant terms and nouns used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.

[0079] 1. Channel coding and channel decoding (or channel decoding)

[0080] Figure 1 illustrates a signal processing flow diagram for both the source and the sink. Before transmitting the signal, the transmitting end (an example of a source) obtains the bit sequence to be encoded (i.e., the information bit sequence) through source coding, and then performs channel coding on the information bit sequence to obtain the encoded bit sequence. Correspondingly, the receiving end (an example of a sink) receives the symbol sequence to be decoded, and performs channel decoding on the symbol sequence to obtain the information bit sequence, which is then used for source recovery to obtain useful information. There are various channel coding methods, such as polar codes.

[0081] 2. Modulation and demodulation

[0082] Please refer to Figure 1. The receiver can also map the encoded bit sequence to multiple modulation symbols and then send multiple modulation symbols. Correspondingly, the receiver can receive multiple modulation symbols and then demodulate them to obtain the sequence of symbols to be decoded.

[0083] Modulation refers to the process by which the transmitting end maps the encoded bit sequence to a constellation based on a constellation diagram to obtain the modulation symbol. Demodulation is the reverse process of modulation. Common modulation methods include quadrature amplitude modulation (QAM) and amplitude shift keying (ASK) modulation. For example, the encoded bit sequence can be mapped to the modulation symbol by referring to a lookup table or according to a preset rule.

[0084] 3. Reference signal (RS)

[0085] A reference signal, also known as a pilot signal or pilot signal, is a known signal. Reference signals can be categorized according to their purpose, such as channel state information reference signals, demodulation reference signals, or phase tracking reference signals.

[0086] Channel state information reference signals are used to probe the channel. Examples of channel state information reference signals include sounding reference signals (SRS) or channel state information-reference signals (CSI-RS).

[0087] The demodulation reference signal (DMRS) is used for data demodulation. Depending on the channel on which the DMRS operates, it can be further categorized into DMRS for demodulating the physical uplink control channel (PUCCH), DMRS for demodulating the physical uplink share channel (PUSCH), DMRS for demodulating the physical downlink control channel (PDCCH), and DMRS for demodulating the physical uplink share channel (PDSCH).

[0088] Phase tracking reference signals are used for tracking. These signals include, for example, positioning reference signals (P-RS / PRS) or cell-specific reference signals (C-RS / CRS). PTRS can be categorized into PTRS for PDSCH, PTRS for PUSCH, etc.

[0089] Reference signals can also be classified into uplink reference signals and downlink reference signals according to their transmission direction. Uplink reference signals are those transmitted from the terminal device to the network device, while downlink reference signals are those transmitted from the network device to the terminal device. Examples of uplink reference signals include SRS, PUCCH DMRS, or PUSCH DMRS. Examples of downlink reference signals include CSI-RS.

[0090] There are various types of reference signals. As the standard continues to evolve, the names of the above reference signals may change, and more reference signals may appear. DMRS may also have more configuration types, which are not limited here.

[0091] 4. Resources

[0092] Resources include time-domain resources and / or frequency-domain resources. Time-domain resources and frequency-domain resources can be referred to simply as time-domain resources, etc.

[0093] 5. Frequency domain resources

[0094] Frequency domain resources include subchannels, bands, carriers, bandwidth parts (BWPs), resource blocks (RBs), or resource pools. A subchannel is the unit of frequency domain resources occupied by a channel, and a subchannel may include one or more resource blocks (RBs). The bandwidth of a wireless communication system in the frequency domain may include multiple RBs. For example, in the various possible bandwidths of a Long Term Evolution (LTE) system, the number of physical resource blocks (PRBs) included may be 6, 15, 25, or 50, etc.

[0095] In the frequency domain, an RB can include several subcarriers. For example, in LTE and new radio (NR) systems, an RB includes 12 subcarriers, where the spacing between each subcarrier can be 15 kHz. Of course, other subcarrier spacings can also be used, such as 3.75 kHz, 30 kHz, 60 kHz or 120 kHz subcarrier spacings, which are not limited here.

[0096] A resource element (RE) or subcarrier refers to the smallest frequency resource unit on a specific symbol in a multicarrier system. An RE can refer to the resource unit of time-frequency resources, and can be considered the smallest unit of time-frequency resources. For example, one RE occupies one symbol in the time domain and one subcarrier in the frequency domain; that is, one subcarrier within one symbol in the time domain is one RE.

[0097] 6. Time-domain resources

[0098] Temporal resources include symbols, slots, mini-slots (or micro-slots), partial slots, sub-frames, radio frames (or frames), or sensing slots, etc.

[0099] A time slot is a basic unit of time-frequency resource, comprising at least one symbol. For example, a time slot may occupy 7 or 14 consecutive symbols in the time domain; this is not limited. Symbols include, but are not limited to, orthogonal frequency division multiplexing (OFDM) symbols, sparse code multiplexing access (SCMA) symbols, filtered orthogonal frequency division multiplexing (F-OFDM) symbols, or non-orthogonal multiple access (NOMA) symbols. Time slots can have different types, each containing a different number of symbols. For example, a mini slot may contain fewer than 7 symbols, 2 symbols, 3 symbols, or 4 symbols, while a regular time slot may contain 7 or 14 symbols.

[0100] Depending on the subcarrier spacing, the length of each symbol can vary, and therefore the time slot length can also vary. For example, a time slot with a subcarrier spacing of 15 kHz has a length of 0.5 milliseconds (ms), while a time slot with a subcarrier spacing of 60 kHz has a length of 0.125 ms, and so on.

[0101] A subframe is a unit of time-frequency resources that occupies the entire system bandwidth in the frequency domain and is a unit of time-frequency resources of a fixed length in the time domain, such as 1ms.

[0102] 7. Antenna port

[0103] An antenna port can also be simply called a port. For the receiver, signals from different transmitting and receiving antennas are mixed together and indistinguishable. Therefore, the concept of an antenna port is introduced in communication systems. That is, an antenna port can be used to distinguish multiple signals that occupy the same time-frequency resources but different spatial resources. The channel environment changes in the same antenna port in the same way. In other words, an antenna port can be understood as a channel. Reference signals and data signals are transmitted on the same antenna port. The receiver can perform channel estimation based on this reference signal and then demodulate the data signal. The antenna port of the reference signal is determined by its frequency domain location, time domain location, and multiplexing code. Reference signals belonging to different antenna ports are orthogonal. For example, if the reference signal is DMRS, then the antenna port used to transmit DMRS can be called a DMRS port.

[0104] 8. Typing

[0105] Codewords are used to process sequences (such as reference signal sequences) or data, such as scrambling and / or precoding, thereby enabling efficient multiplexing of multiple different signals within the same resource (such as time domain resources, frequency domain resources, and / or spatial domain resources). A codeword includes at least one element (or symbol), and the value of the at least one element can be 0, +1, -1, +j, or -j, etc.

[0106] Codewords can be classified into orthogonal covering codes (OCC) (also known as orthogonal codes or orthogonal covering codes) or non-orthogonal codes based on their orthogonality. Orthogonal covering codes possess orthogonality, meaning the inner products of two orthogonal covering codes are cross-correlated (i.e., the inner product equals 0), making them more resistant to interference. Non-orthogonal codes do not possess orthogonality, meaning the inner product of two non-orthogonal codes is not equal to 0. Specifically, for codewords [a0 a1 …a…]… N-1 ] and codewords [b0 b1 …b N-1 The inner product correlation of ] is, b k * For b k Take the conjugate operation.

[0107] For example, codeword 1 is [+1 +1 +1 +1], codeword 2 is [+1 -1 +1 -1], and codeword 3 is [-1 -1 +1 -1]. Since the inner product of orthogonal superposition codeword 1 and orthogonal superposition codeword 2 is 0, codeword 1 and codeword 2 are orthogonal. However, the inner product of codeword 3 and codeword 1 is not 0, therefore codeword 3 and codeword 1 are not orthogonal. Furthermore, codeword 3 and codeword 2 are also not orthogonal.

[0108] For example, codeword 1 is: Code word 2 is: Code character 3 is: Since the inner product of orthogonal superposition code 1 and orthogonal superposition code 2 is equal to 0, codeword 1 and codeword 2 are orthogonal. However, the inner product of codeword 3 and codeword 1 is not 0, therefore codeword 3 and codeword 1 are not orthogonal. In addition, codeword 3 and codeword 2 are also not orthogonal.

[0109] Based on whether the codeword operates in the frequency domain or the time domain, codewords can be divided into frequency domain codewords and time domain codewords. Frequency domain codewords are used to distinguish signals occupying the same set of frequency repeaters (REs) (such as reference signals). Time domain codewords are used to distinguish signals occupying adjacent REs in the same set of time domain repeaters (such as reference signals).

[0110] The length of a codeword can be simply referred to as the code length. The length of a codeword can be represented by the number of elements it contains. For example, if a codeword contains 4 elements, then the length of the codeword is 4.

[0111] A code group is a set of codewords that includes at least two codewords, and the inner product of any two codewords is cross-correlated with zero. Each codeword in a code group can be composed of sequences designed to be orthogonal to each other, meaning that the inner product of any pair of sequences is cross-correlated with zero. For example, if there are four mutually orthogonal codewords, then a code group consisting of these four mutually orthogonal codewords contains four codewords.

[0112] 9. Sequence

[0113] A sequence is an ordered arrangement of at least one element. Elements can be real or complex numbers, binary or decimal numbers, etc., without limitation. The length of a sequence can be arbitrary, expressed as the number of elements it contains. For example, the length of a sequence can be 1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 24, 32, or 48, etc., without limitation. One way to implement a codeword is as a sequence; for example, a codeword consists of one or more sequences. Alternatively, the concept of a codeword can also be replaced by a sequence.

[0114] 10. Code Division Multiplexing Group (CDM group)

[0115] CDM groups are obtained by dividing different ports (such as DMRS ports) in the frequency domain. DMRS ports within the same CDM group are extended in the time and frequency domain using orthogonal cover code (OCC) to ensure orthogonality on different ports.

[0116] 11. DMRS Configuration Type

[0117] The configuration type of DMRS refers to the configuration types that DMRS can support. For example, it includes configuration type 1 and configuration type 2. In addition, DMRS also distinguishes between single-front-loaded symbols and double-front-loaded symbols. Configuration types can also be called pattern types or types, etc., without restriction. Optionally, configuration type 1 can be denoted as Type 1, and configuration type 2 can be denoted as Type 2. Type 1 and Type 2 are described below.

[0118] In one possible implementation, Type 1: The frequency domain is comb-shaped, divided into two CDM groups, with code division multiplexing used between ports within each CDM group. For Type 1, a single-prefix DMRS supports a maximum of 4 antenna ports, such as two CDM groups {1000, 1001} and {1002, 1003}. For Type 1, a dual-prefix DMRS supports a maximum of 8 antenna ports, such as two CDM groups {1000, 1001, 1004, 1005} and {1002, 1003, 1006, 1007}.

[0119] In one possible implementation, Type 2: Compared to Type 1, Type 2 can reduce the frequency domain density of the DMRS by dividing it into three CDM groups, with code division multiplexing used between ports within each CDM group. For Type 2, a single-prefix DMRS supports a maximum of 6 antenna ports, such as being divided into three CDM groups: {1000,1001}, {1002,1003}, and {1004,1005}. For Type 2, a dual-prefix DMRS supports a maximum of 12 antenna ports, such as being divided into three CDM groups: {1000,1001,1006,1007}, {1002,1003,1008,1009}, and {1004,1005,1010,1011}.

[0120] In future communication systems, DMRS configuration types may change. For example, more configuration types may appear, or DMRS configuration types 1 and 2 may support more antenna ports. This is not limited.

[0121] In one possible implementation, in addition to the preceding DMRS, the DMRS may also include additional DMRS to accommodate higher mobility speeds. For example, the DMRS may include a preceding DMRS and one or more sets of additional DMRS. Each set of additional DMRS patterns in the set of additional DMRS patterns is a repetition of the preceding DMRS pattern. That is, each set of additional DMRS occupies the same subcarrier and the same number of symbols as the preceding DMRS. For example, for a single-symbol DMRS, up to three sets of additional DMRS can be added. For example, for a two-symbol DMRS, up to one set of additional DMRS can be added.

[0122] 12. Terminal equipment

[0123] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminal equipment, terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, mobile stations (MS), subscriber units, cellular phones, smartphones, wireless data cards, personal digital assistant (PDA) computers, tablet computers, wireless modems, handsets, laptop computers, machine-type communication (MTC) terminals, or smart terminals, etc. Terminal devices typically contain communication modules, circuits, or chips that perform the corresponding communication functions. They may also be configured with program instructions for performing these functions.

[0124] In various embodiments of this application, the means for implementing the functions of the terminal device may be implemented by the terminal device itself, or by a module (such as a chip or modem) in the terminal device, or by a logic module or software that can implement all or part of the functions.

[0125] 13. Network equipment

[0126] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device, equipment, or module located on the network side of a communication system and possessing corresponding communication functions. Network devices typically contain communication modules, circuits, or chips that perform the corresponding communication functions. They also contain program instructions for performing these functions, as well as corresponding program instructions. Network devices can include core network devices and / or access network devices. Access network devices can be devices in a radio access network (RAN) that provide wireless communication functions for terminal devices; they can be referred to as RAN equipment. The RAN can be an access network in the 3rd Generation Partnership Project (3GPP), for example, a fourth-generation (4G) network. th RAN can be a future-oriented communication network, such as 4G (4G), 5G (5th generation), or a network designed for future evolution. RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of the above.

[0127] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a wireless fidelity (Wi-Fi) system, etc.

[0128] RAN equipment can also be a module or unit that performs some of the functions of a base station. For example, it can be a central unit / control unit (CU), a distributed unit (DU), or a radio unit (RU). The CU and DU can be set up separately or included in the same network element, such as in a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). The embodiments of this application do not limit the specific technology or equipment form used in the network equipment.

[0129] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open (O)-RAN system, CU can also be called an O-RAN central unit (O-CU), DU can also be called an O-RAN distributed unit (O-DU), CU-CP can also be called an O-RAN central unit control plane (O-CU-CP), CU-UP can also be called an O-RAN Central Unit User Plane (O-CU-UP), and RU can also be called an O-RU. Any of the units CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. RA equipment can be a macro base station, a micro base station, an indoor station, a relay node, or a donor node, etc.

[0130] In various embodiments of this application, the functions of the network device can be implemented by the network device itself, or by modules (such as chips) within the network device, or by logic modules or software capable of implementing all or part of the functions, or by a control subsystem that includes network device functions. This control subsystem, including network device functions, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0131] In this application embodiment, the number of nouns, unless otherwise specified, refers to "singular nouns or plural nouns," that is, "one or more." "At least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, or B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. For example, A / B means: A or B. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c means: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, and c can be single or multiple.

[0132] In this application, the ordinal numbers such as "first" and "second" are used to distinguish multiple objects, and are not used to limit the size, content, order, timing, priority, or importance of the multiple objects. For example, the first sequence and the second sequence refer to two different sequences, and do not indicate that the content, priority, or importance of these two sequences are different. For a technical feature, the technical features within that technical feature are distinguished by "A", "B", "C", and "D", and the technical features described by "A", "B", "C", and "D" have no sequential or size order.

[0133] In the embodiments of this application, "when," "if," and "if" all refer to the device taking corresponding actions under certain objective circumstances, and are not time-limited, nor do they require the device to perform a judgment action, nor do they imply any other limitations. Unless otherwise specified, "if" and "if" can be substituted, and "when" and "in the case of" can be substituted. "When" and "if" / "if" can be substituted.

[0134] In this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0135] The following provides examples of communication systems applicable to the embodiments of this application.

[0136] The solutions provided in this application can be applied to various communication systems, such as 4G mobile communication systems (e.g., Long Term Evolution (LTE) networks), 5G mobile communication systems (e.g., New Radio (NR) systems), future mobile communication systems, non-terrestrial networks (NTN) systems, integrated systems of one or more of the above communication systems, or other communication systems. NTN, for example, is a satellite communication system. An integrated system could be a system that combines a satellite communication system with other communication systems.

[0137] Figure 2 illustrates a schematic diagram of a communication system applicable to an embodiment of this application. As shown in Figure 2, the communication system 1000 includes an access network (AN) 100. Optionally, the communication system may also include a core network (CN) 200 and an Internet 300. The access network 100 may include at least one network device (or network-side device), as shown in Figure 2 (110a and 110b). 110a is a base station, and 110b is a micro-station. The communication system 1000 may also include at least one terminal device (or terminal equipment), as shown in Figure 2 (120a to 120j). 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a gas pump, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop computer, 120h is a printer, and 120i is a drone. The same terminal device or the same network device can provide different functions in different application scenarios. For example, the mobile phones in Figure 2 include 120a, 120e, 120f, and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e, and access the HAP. Car 120b can access the HAP and communicate directly with mobile phone 120a. Mobile phone 120f can be connected to micro-station 110b, connect to laptop 120g, and connect to printer 120h. Mobile phone 120j can control drone 120i. The devices in the various embodiments of this application can also be replaced or understood as devices, modules, entities, or nodes in devices, etc., and are not limited thereto.

[0138] For example, a terminal device can access the Internet 300 through access network 100 and core network 200, thereby utilizing the services provided by Internet 300. For instance, Internet 300 may have one or more servers deployed, and the terminal device can access one or more servers through an application (APP). The content of the terminal device and network device can be referred to the previously discussed content of terminal devices and network devices, and will not be listed here again.

[0139] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

[0140] The roles of network devices and terminal devices can be relative. For example, the helicopter or drone 120i in Figure 2 can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 through 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device. That is, 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol. In this case, relative to 110a, 120i is also a network device. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 2 can be called communication devices with network device functions, and 120a-120j in Figure 2 can be called communication devices with terminal device functions.

[0141] To improve the communication quality between terminal devices and network devices, terminal devices and / or network devices can perform channel acquisition, channel estimation, equalization and demodulation, signal detection, etc., based on reference signals.

[0142] Figure 3 illustrates a transmission process of a reference signal. Figure 3 uses an uplink reference signal as an example. The terminal device involved in Figure 3 is, for example, any of the terminal devices shown in Figure 1, and the network device involved in Figure 3 is, for example, any of the network devices shown in Figure 3.

[0143] As shown in Figure 3, the terminal device can generate a reference signal sequence, map the reference signal sequence onto resources, generate a reference signal (or baseband reference signal), and send the reference signal to the network device. The network device receives the reference signal and performs channel estimation or channel sounding based on the reference signal.

[0144] In one possible implementation, the process of generating a reference signal (such as PDSCH DMRS) can be referred to the processes shown in S1.1 and S1.2 below.

[0145] S1.1, the sequence is determined based on the following formula 1:

[0146] Where r(n) represents the sequence signal, c(i) represents the pseudo-random sequence, and n is a parameter. The initial value of c(i) is ci. init This can be expressed as Formula 2 below:

[0147] in, This indicates the number of symbols included in a time slot, where l represents the index of the OFDM symbol used to transmit the reference signal. This indicates the slot index included within a radio frame. The value of ∈{0,1}, or It equals 0. ∈{0,1…,65535}. λ represents the identifier of the CDM group.

[0148] S1.2 After resource mapping of the reference signal sequence, the reference signal is obtained. The reference signal can be defined using the following formula 3:

[0149] in, Indicates a reference signal. This represents the power factor. The expression for r(4n+k′) can be found in the previous section on the expression for r(n). f (k′) represents the frequency domain codeword. t (l′) represents the time-domain codeword.

[0150] in, Where: k′=0,1,2,3 n = 0, 1, ..., j = 0, 1, ..., υ-1

[0151] or, in: k′=0,1 n = 0, 1, ..., j = 0, 1, ..., υ-1

[0152] Among them, Δ, w f (k′), w t (l′) can be defined by Table 1 and Table 2 below.

[0153] Please refer to Table 1 below for the parameters corresponding to PDSCH DMRS type 1. These parameters include the DMRS port number P, the frequency domain codeword (e.g., [w...]), and the... f (0) … w f (3)]), and time-domain codewords (e.g., [w t (0) w t (1)]).

[0154] Table 1

[0155] As shown in Table 1, if the DMRS port number is 1011, then the frequency domain codeword corresponding to this DMRS is [+1 -1 -1 +1], and the time domain codeword is [+1 +1], and so on. They are not listed one by one here.

[0156] Please refer to Table 2 below for the parameters corresponding to PDSCH DMRS type 2. These parameters include the DMRS port number P, the frequency domain codeword (e.g., [w...]), and the... f (0) … w f (3)]), and time-domain codewords (e.g., [w t (0) w t (1)]).

[0157] Table 2

[0158] As shown in Table 2, if the DMRS port number is 23, then the frequency domain codeword corresponding to this DMRS is [+1 -1 -1 +1], and the time domain codeword is [+1 -1], and so on. They are not listed one by one here.

[0159] In one possible implementation, the process of generating a reference signal (such as PUSCH DMRS) can refer to the process shown in S2.1 and S2.2 below.

[0160] S2.1, the expression for the sequence can be found in Formula 4 below:

[0161] Where r(n) represents the sequence, and c(i) (e.g., c(2n) or c(2n+1)) represents the pseudo-random sequence. The initial value of c(i) is ci. init You can refer to the content of Formula 2 above.

[0162] S2.2 After resource mapping of the reference signal sequence, the reference signal is obtained. The reference signal can be represented by the following formula 5:

[0163] in, This represents the reference signal. The expression for r(4n+k′) can be found in the previous expression for r(n).f (k′) represents the frequency domain codeword. t (l′) represents the time-domain codeword, where: k′=0,1,2,3 n = 0, 1, ..., j = 0, 1, ..., υ-1

[0164] or, Where: k = 4n + 2k′ + Δk′ = 0, 1 n = 0, 1, ...

[0165] Table 3 illustrates some parameters in the above formulas under the PUSCH DMRS type. Please see Table 3.

[0166] Table 3

[0167] As shown in Table 3, if the index of the DMRS port number is 12, then the frequency domain codeword corresponding to this DMRS is [+1 +j -1 -j], the time domain codeword is [+1 -1], and so on. They will not be listed one by one here.

[0168] Table 4 illustrates some parameters in the above formulas under the PUSCH DMRS type. Please see Table 4.

[0169] Table 4

[0170] As shown in Table 4, if the index of the DMRS port number is 19, then the frequency domain codeword corresponding to this DMRS is [+1 -j -1 +j], and the time domain codeword is [+1 -1], and so on. They will not be listed one by one here.

[0171] For example, taking the first codeword as the frequency domain codeword, assuming that two adjacent REs in the frequency domain have the same reference signals except for the different frequency domain codewords used by the two different antenna ports, the received signals of the two adjacent REs in the frequency domain can be expressed by the following formula 6: Y = S a H0+S b H1+N

[0172] Among them, S a S b Each column vector represents the sequence signal of the code division corresponding to a given antenna port, including two parts: a pseudo-random sequence and a codeword group. Here, α and β represent the complex values ​​of the pseudo-random signal sequence on different REs, while [1,1], [1,-1], [1,j], and [1,-j] represent partial codewords in the orthogonal codeword groups corresponding to the four different antenna ports, respectively; H i[k] represents the channel information; N is the background noise signal caused by thermal noise and / or the received signal. Furthermore, the received signals from the four antenna ports can be processed as shown in Formula 7 to obtain the channel information:

[0173] in,

[0174] The channel matrix for four ports needs to be estimated, with codewords for the four ports being [1,1], [1,-1], [1,j], and [1,-j]. This is then modeled as an LMMSE estimation problem for the four-port channel H, as shown in Equation 8: Y = S a H0+S b H1+N

[0175] Therefore, we have the following formula 9:

[0176] Since Y0: includes not only the estimated target parameters There are also interference terms, which require noise reduction of the processed signal using the LMMSE criterion. This yields the following formula 10:

[0177] in, This is the prior statistics for channel H.

[0178] The above implementation provides some codewords to increase the transmission of the antenna port. However, with the continuous development of communication technology, massive connection scenarios have emerged, that is, the number and types of terminal devices connected to network devices are more numerous. For example, there may be terminals based on generative AI (such as AI phones and AI glasses), or intelligent devices of the Embodied Intelligence type, such as humanoid robots, drone inspections, law enforcement recorders, live streaming equipment, and IoT devices such as driverless taxis. The codewords listed in Tables 1 to 4 above are limited and may not be able to meet the needs of these scenarios.

[0179] Massive connectivity scenarios include, for example, enhanced mobile broadband (eMBB) or enhanced machine-type communication (eMTC). eMBB has at least one of the following characteristics: high-speed data transmission, high bandwidth requirements, low latency sensitivity, or wide-area coverage and high capacity. eMTC has at least one of the following characteristics: wide coverage and low cost, low power consumption and massive connectivity, or congestion control.

[0180] In summary, eMBB primarily serves applications requiring high data rates and high bandwidth, while eMTC focuses more on the Internet of Things (IoT) field, providing support for low cost, low power consumption, and massive connectivity. eMBB can be applied to various services such as augmented reality (AR) or virtual reality (VR), and high-definition video playback. eMTC can be applied to various services such as smart cities and vehicle-to-everything (V2X) networks. Optionally, some services can use both eMBB and eMTC; there is no limitation on this.

[0181] Figure 4 illustrates a communication system provided in an embodiment of this application. As shown in Figure 4, terminals based on generative AI (e.g., AI phones, AI glasses), or intelligent devices based on embodied intelligence (IoT), such as surveillance cameras or humanoid robots, all need to connect to network devices, which in turn provide services to the corresponding terminal devices. This leads to a significant increase in the transmission requirements of the antenna ports. Furthermore, the number of antenna ports supported by a single terminal device may continue to increase, further increasing the transmission requirements of the antenna ports. In short, these scenarios require more codeword support.

[0182] In view of this, embodiments of this application provide a communication method for providing more elements to provide more codewords.

[0183] The method provided in this application embodiment is applicable not only to the communication systems shown in Figure 2 or Figure 4 above, but also to many other communication scenarios. For example, please refer to Figure 5, which is a schematic diagram of a communication system provided in this application embodiment. Figure 5 illustrates a first device and a second device capable of communicating with the first device.

[0184] For example, the first device can send a signal to the second device. The possible implementations of the first and second devices are described below.

[0185] In the first possible implementation, the first device can be a terminal device or a module in a terminal device (such as a software module or a hardware module), and the second device can be a network device or a module in a network device.

[0186] In the second possible implementation, the first device can be a network device or a module in a network device, and the second device can be a terminal device or a module in a terminal device.

[0187] In the third possible implementation, the first device can be a terminal device or a module in a terminal device, and the second device can be another terminal device or a module in another terminal device.

[0188] The content on terminal devices and network devices can be found in the previous sections on terminal devices and network devices, and will not be listed here individually.

[0189] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0190] The method provided by the embodiments of this application is described below with reference to the accompanying drawings. In the accompanying drawings corresponding to the various embodiments of this application, all steps indicated by dashed lines are optional steps. Furthermore, the first device involved in the embodiments of this application may be, for example, the first device involved in FIG. 5, and the second device may be, for example, any terminal device involved in FIG. 2 or FIG. 4, and the second device may be, for example, the network device involved in FIG. 2 or FIG. 4; or, the first device involved in the embodiments of this application may be, for example, any network device involved in FIG. 2 or FIG. 4, and the second device may be, for example, the terminal device involved in FIG. 2 or FIG. 4; or, one of the first device and the second device involved in the embodiments of this application may be a terminal device involved in FIG. 2, and the other may be another terminal device involved in FIG. 2. Alternatively, the first device involved in the embodiments of this application may be, for example, the network device involved in FIG. 2 or FIG. 4, and the second device may be, for example, the terminal device involved in FIG. 2 or FIG. 4, etc. The names of the devices involved here can also be various, and there is no limitation thereto. Furthermore, if the technical solutions provided in the various embodiments of this application are applied to other communication systems or as standards continue to evolve, the name and / or functions of the devices may change, but this is not a limitation.

[0191] The communication method provided in the embodiments of this application will be described below with reference to the accompanying drawings. Figure 6 is a schematic diagram of a communication method provided in an embodiment of this application, and the steps illustrated in Figure 6 will be described below.

[0192] S601. The first device determines the first codeword, the first codeword includes the first sequence, and the first codeword belongs to the codeword set.

[0193] The first codeword is used to transmit signals, or in other words, to generate signals. The first codeword is one of the codewords in a set of codewords, which can be predetermined by a protocol, configured by the network device, or pre-stored in the first device; there is no limitation on this.

[0194] For example, a network device sends first information to a first device, the first information indicating a first codeword. Optionally, the first information includes at least one of the following: information indicating a port number of a first antenna port, information indicating an index of the port number of the first antenna port, or information indicating an index of a first codeword. At least one of the following is used to determine the first codeword: the information indicating a port number of the first antenna port, the information indicating an index of the port number of the first antenna port, or information indicating an index of a first codeword. The index of the first codeword, for example, is used to distinguish the first codeword in a codeword set.

[0195] Optionally, the first device may determine the first codeword indicated by the first information based on at least one of the following: information indicating the port number of the first antenna port, information indicating the index of the port number of the first antenna port, or information indicating the index of the first codeword, and a first correspondence. For example, the first correspondence indicates the correspondence between at least one of the following: the port number of the first antenna port, the index of the port number of the first antenna port, or the index of the first codeword, and the first codeword. The first correspondence may be predetermined by a protocol, configured to the first device by the network device, or pre-stored in the first device; there is no limitation on this.

[0196] The codeword set may include frequency domain codewords, time domain codewords, or a combination of both, without limitation. Optionally, a codeword in the codeword set may include an even number of elements or an odd number of elements, without limitation. Optionally, the codeword set may include one or more code groups, such as one code group, two code groups, or three code groups. When the codeword set includes multiple code groups, any two code groups may contain the same number of codewords, or two code groups may contain different numbers of codewords. Furthermore, the codeword set may be in the form of a table, sequence, bit stream, or functional relation, without limitation.

[0197] In one possible implementation, the codeword set contains at least two identical codewords; in other words, the codeword set contains duplicate codewords. Two identical codewords are those with the same length and identical elements at corresponding positions. Alternatively, two identical codewords are those whose constituent sequences are identical, or whose elements are identical and arranged in the same way.

[0198] For example, the codeword set includes codeword 1 and codeword 2. Codeword 1 is [+1 +1 +1 -1], and codeword 2 is [+1 +1 +1 -1]. The element in the first position of codeword 1 is the same as the element in the first position of codeword 2, the element in the second position of codeword 1 is the same as the element in the second position of codeword 2, the element in the third position of codeword 1 is the same as the element in the third position of codeword 2, and the element in the fourth position of codeword 1 is the same as the element in the fourth position of codeword 2. That is, codeword 1 and codeword 2 are two identical codewords.

[0199] In another possible implementation, the codeword set contains no two identical codewords; that is, any two codewords in the codeword set are different, meaning there are no duplicate codewords in the codeword set. Two different codewords satisfy the following conditions: the two codewords have different lengths and / or the elements at corresponding positions in the two codewords are different.

[0200] For example, the codeword set includes codeword 1 and codeword 3. Codeword 1 is [+1 +1 +1 -1] and codeword 3 is [+1 -1 -1 -1]. Codeword 1 and codeword 3 have the same length, but the element at the second position and the corresponding element at the third position are different. Therefore, codeword 1 and codeword 3 are different.

[0201] There are multiple possible implementations of codeword sets. The following section will introduce the implementation methods involved in A1 to A3.

[0202] Implementation method A1: The number of different codewords included in the codeword set is greater than the length of a single codeword in the codeword set. A single codeword can be any codeword in the codeword set, or it can be a specific codeword in the codeword set, such as the d-th codeword in the codeword set, where d is a positive integer and d is less than or equal to the number of codewords included in the codeword set, for example, d = 1 or 2.

[0203] The content of different codewords can be referenced from the content of the two different codewords discussed earlier, and will not be listed here again. The number of different codewords included in the codeword set can be, for example, 8, 10, 12, 14, 32, 48, 64, 96, or 160. Any two codewords in the codeword set can have the same length, such as both being 4, 7, 8, 12, 16, or 32, etc., without limitation. Alternatively, the codeword set can also contain two codewords of different lengths, without limitation.

[0204] In implementation A1, the codeword set contains both non-orthogonal and orthogonal codewords; that is, some codewords in the codeword set are orthogonal, and some are not. The codeword set does not contain any orthogonal codewords (i.e., any two different codewords in the codeword set are orthogonal), which is not a limitation. Optionally, implementation A1 can also be described as the codeword set including non-orthogonal codewords.

[0205] In implementation A1, optionally, the number of different codewords included in the codeword set is greater than a first threshold. The first threshold is, for example, the number of different frequency domain codewords included in any of Tables 1 to 4 above, such as 4. Alternatively, the first threshold is the number of different frequency domain codewords included in all of Tables 1 to 4 above, such as 6. Optionally, implementation A1 can also be described as the number of different codewords included in the codeword set being greater than the first threshold.

[0206] In one possible implementation, the codeword set includes: [w f (0) … w f (S)]. The value of S is the length of the codeword minus one.

[0207] Example 1: A set of codewords under implementation method A1 includes: [+1 -1 +1 +1], [+1 +1 +1 -1], [+1 -1 -1 -1], [+1 +1 -1 +1], [+1 +1 +1 +1], [+1 -1 +1 -1], [+1 -1 -1 +1], [+1 +1 -1 -1].

[0208] The codeword set in Example 1 contains 8 distinct codewords, and the length of any codeword in the set is 4. That is, the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, in Example 1, any two of the first four codewords are orthogonal, and the last four codewords are orthogonal, but no codeword in the first four is orthogonal to any codeword in the last four. Also, the codeword set shown in Example 1 contains 8 distinct codewords, which is greater than 4.

[0209] Please refer to Table 5 below for another example of the codeword set in Example 1.

[0210] Table 5

[0211] Table 5 lists P1 to P8 as examples of antenna ports corresponding to codewords. The specific port numbers and number of antenna ports are not actually restricted; for example, antenna port P1 may correspond to one or more antennas. Furthermore, the codewords in Table 5 may not be associated with antenna ports, and this is not a limitation. The content of the codeword set referred to in Table 5 can be found in the codeword set under Example 1, and will not be listed here.

[0212] Example 2, a codeword set under implementation method A1 includes: [+1 -1 +1 +1], [+1 +1 +1 -1], [+1 -1 -1 -1], [+1 +1 -1 +1], [+1 +1 +1 +1], [+1 -1 +1 -1], [+1 -j -1 +j], [+1 +j -1 -j].

[0213] Where j is the imaginary unit. The codeword set in Example 2 contains 8 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of a single codeword. Furthermore, in Example 2, any two of the first four codewords are orthogonal, and the last four are orthogonal, but no codeword in the first four is orthogonal to any codeword in the last four. Also, the codeword set shown in Example 2 contains 8 distinct codewords, which is greater than 4.

[0214] Please refer to Table 6 below for another form of the codeword set in Example 2.

[0215] Table 6

[0216] Table 6 lists P1 to P8 as examples of antenna ports corresponding to codewords. The specific port numbers and number of antenna ports are not actually restricted. Furthermore, the codewords in Table 6 may not be associated with antenna ports; this is not a limitation. The contents of the codeword set shown in Table 6 can be found in the codeword set in Example 2, and will not be listed here again.

[0217] Example 3, a codeword set under implementation method A1 includes: [+1 -1 +1 +1], [+1 +1 +1 -1], [+1 -1 -1 -1], [+1 +1 -1 +1], [+1 +1 +1 +1], [+1 -1 +1 -1], [+1 -1 -1 +1], [+1 +1 -1 -1], [+1 -j -1 +j], [+1 +j -1 -j].

[0218] The codeword set in Example 3 contains 10 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, Example 3 contains both orthogonal and non-orthogonal codewords. Also, the codeword set shown in Example 3 contains 10 distinct codewords, which is greater than 6.

[0219] Please refer to Table 7 below for another form of the codeword set in Example 3.

[0220] Table 7

[0221] Table 7 lists P1 to P10 as examples of antenna ports corresponding to codewords; the specific port numbers of these antenna ports are not actually restricted. Furthermore, the codewords in Table 7 may not be associated with antenna ports, and this is not a limitation. The contents of the codeword set shown in Table 7 can be found in the codeword set in Example 3, and will not be listed here again.

[0222] Example 4, a codeword set under implementation method A1 includes: [+1 +1 +1 +1]、[+1 -1 +1 -1]、[+1 -1 -1 +1]、[+1 +1 -1 -1].

[0223] The codeword set in Example 4 contains 8 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, in Example 4, any two of the first four codewords are orthogonal, and the last four are orthogonal, but no codeword in the first four is orthogonal to any codeword in the last four. Also, the codeword set shown in Example 1 contains 8 distinct codewords, which is greater than 4.

[0224] Please refer to Table 8 below for another example of the codeword set in Example 4.

[0225] Table 8

[0226] In Table 8, j represents the imaginary unit. As shown in Table 8 above, the codewords corresponding to antenna port P1 include the following four elements: +1, +α(-1+j), +j, and +α(1+j), and so on. P1 to P8 in Table 8 are examples of antenna ports corresponding to codewords; the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 8 may not be associated with antenna ports, and this is not a limitation. The contents of the codeword set shown in Table 8 can be referenced from the codeword set in Example 4, and will not be listed here.

[0227] Example 5, a codeword set under implementation method A1 includes: [+1 +1 +1 +1], [+1 -1 +1 -1], [+1 -j -1 +j], [+1 -j -1 +j].

[0228] Example 5 contains 8 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, Example 5 contains both orthogonal and non-orthogonal codewords. Also, the set of codewords shown in Example 5 contains 8 distinct codewords, which is greater than 4.

[0229] Please refer to Table 9 below for another form of the codeword set in Example 5.

[0230] Table 9

[0231] In Table 9, j represents the imaginary unit. P1 to P8 in Table 9 are examples of antenna ports corresponding to codewords; the specific port numbers of these antenna ports are not actually restricted. Furthermore, the codewords in Table 9 may not be associated with antenna ports, and this is not a limitation. The contents of the codeword set shown in Table 9 can be referenced from the codeword set shown in Example 5, and will not be listed here again.

[0232] Example 6, a codeword set under implementation method A1 includes: [+1 +1 +1 +1], [+1 -1 +1 -1], [+1 -j -1 +j], [+1 -j -1 +j], [+1 -1 -1 +1], [+1 +1 -1 -1].

[0233] The codeword set in Example 6 contains 10 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, Example 6 contains both orthogonal and non-orthogonal codewords. Also, the codeword set shown in Example 6 contains 10 distinct codewords, which is greater than 4.

[0234] Please refer to Table 10 below for an example of a codeword set under implementation method A1.

[0235] Table 10

[0236] In Table 10, j is the imaginary unit. P1 to P10 in Table 10 are examples of antenna ports corresponding to codewords; the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 10 may not be associated with antenna ports, which is not a limitation. The contents of the codeword set shown in Table 10 can be referenced from the codeword set shown in Example 6, and will not be listed here again.

[0237] Example 7, a codeword set under implementation method A1 includes: [+1 -1 +1 +1]、[+1 +1 +1 -1]、[+1 -1 -1 -1]、[+1 +1 -1 +1].

[0238] The codeword set in Example 7 contains 8 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is greater than the length of any single codeword. Furthermore, Example 7 contains both orthogonal and non-orthogonal codewords. Also, the set of codewords shown in Example 7 contains 8 distinct codewords, which is greater than 4.

[0239] Please refer to Table 11 below for an example of a codeword set under implementation method A1.

[0240] Table 11

[0241] In Table 11, j is the imaginary unit. P1 to P8 in Table 11 are examples of antenna ports corresponding to codewords; the specific port numbers of these antenna ports are not actually restricted. Furthermore, the codewords in Table 11 may not be associated with antenna ports, and this is not a limitation. The codeword set shown in Table 11 can be referenced from the codeword set shown in Example 7, and will not be listed here again.

[0242] Optionally, a codeword set under implementation A1 includes: [-j, +j, -1, +1], [-1, -j, -j, +1], [+j, +j, +1, +1], [+1, -j, +j, +1], [+j, -1, +1, -j], [-j, -j, +1, -1], [+j, +1, +1, +j], [-j, +j, +1, +1], [-1, +1, -j, +j], [-j, +1, -1, -j], [+1, +1, +j, +j], [+j, +1, +1, -j], [+1, -j, +j, -1], [+1, -1, -j, -j], [+1, +j, +j, +1], [+1, +1, -j, +j].

[0243] Tables 5 to 11 above are examples of codeword sets. In reality, there are many other possibilities for codeword sets. For example, a codeword set may include different codewords from Tables 5 and 8, different codewords from Tables 6 and 9, or different codewords from Tables 7 and 10. Of course, codeword sets may also take many forms, which are not limited here.

[0244] Implementation method A2: The number of different codewords included in the codeword set is equal to the length of a single codeword in the codeword set.

[0245] In implementation A2, optionally, any two codewords in the codeword set can be orthogonal. The length of a codeword in this codeword set can be 4, 8, 12, or other values, and is not limited thereto.

[0246] Example 8, a codeword set under implementation method A2 includes: [+1 -1 +1 +1], [+1 +1 +1 -1], [+1 -1 -1 -1], [+1 +1 -1 +1].

[0247] The codeword set shown in Example 8 contains 4 distinct codewords, but the length of any codeword in the set is 4. That is, the number of distinct codewords in the set is equal to the length of a single codeword. Furthermore, any two codewords in Example 8 are orthogonal.

[0248] Please refer to Table 12 below for another form of the codeword set shown in Example 8.

[0249] Table 12

[0250] Table 12 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 12 may not be associated with antenna ports, and this is not a limitation. The content of the codeword set in Table 12 can be compared to the codeword set shown in Example 8.

[0251] Example 9, a codeword set under implementation method A2 includes:

[0252] The codeword set shown in Example 9 contains 4 distinct codewords, but the length of any codeword in the set is 4. That is, the number of distinct codewords in the set is equal to the length of a single codeword. Furthermore, any two codewords shown in Example 9 are orthogonal.

[0253] Please refer to Table 13 below for another form of the codeword set shown in Example 9.

[0254] Table 13

[0255] Table 13 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 13 may not be associated with antenna ports, and this is not a limitation. The content of the codeword set in Table 13 can be compared to the codeword set shown in Example 9.

[0256] Example 10, a codeword set under implementation method A2 includes:

[0257] The codeword set shown in Example 10 includes 4 distinct codewords, but the length of any codeword in the set is 4, meaning the number of distinct codewords in the set is equal to the length of a single codeword. Furthermore, any two codewords shown in Example 10 are orthogonal.

[0258] Please refer to Table 14 below for another example of the codeword set shown in Example 10.

[0259] Table 14

[0260] Table 14 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 14 may not be associated with antenna ports, and this is not a limitation. The content of the codeword set in Table 14 can be compared to the codeword set shown in Example 10.

[0261] Optionally, the codeword set includes each codeword corresponding to antenna ports P1 to P8 in Table 11, and a codeword formed by sequentially combining it with one of the different codewords included in Table 2. Alternatively, the codeword set includes each codeword included in Table 2, and a codeword formed by sequentially combining it with one of the different codewords included in Table 11, and an codeword formed by sequentially combining it with one of the different codewords included in Table 2, and an ...

[0262] Optionally, please refer to Table 15 below for an example of a codeword set under implementation method A2.

[0263] Table 15

[0264] Table 15 lists P1 to P8 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 15 may not be associated with antenna ports, and this is not a limitation.

[0265] As shown in Table 15, the codeword set includes 8 different codewords, but the length of any codeword in the codeword set is 8. That is, the number of different codewords in the codeword set is equal to the length of a single codeword in the codeword set. In addition, some codewords in Table 15 are orthogonal, while others are not.

[0266] Optionally, the codeword set includes each codeword corresponding to antenna ports P1 to P8 in Table 11, and a codeword formed by sequentially combining it with one of the different codewords included in Table 4. Alternatively, the codeword set includes each codeword included in Table 4, and a codeword formed by sequentially combining it with one of the different codewords included in Table 11, and an codeword formed by sequentially combining it with one of the different codewords included in Table 4, and an ...4, and an codeword formed by sequentially combining it with one of the different codewords

[0267] Optionally, please refer to Table 16 below for an example of a codeword set under implementation method A2.

[0268] Table 16

[0269] Table 16 lists P1 to P8 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 16 may not be associated with antenna ports, and this is not a limitation.

[0270] As shown in Table 16, the codeword set includes 8 different codewords, but the length of any codeword in the codeword set is 8. That is, the number of different codewords in the codeword set is equal to the length of a single codeword in the codeword set. In addition, some codewords in Table 16 are orthogonal, while others are not.

[0271] Tables 12 to 16 above are examples of codeword sets, and the actual content of the codeword sets is not limited.

[0272] Optionally, a codeword set under implementation A2 includes: [-j, +j, -1, +1], [-1, -j, -j, +1], [+j, +j, +1, +1], [+1, -j, +j, +1].

[0273] Optionally, a codeword set under implementation A2 includes: [+j, -1, +1, -j], [-j, -j, +1, -1], [+j, +1, +1, +j], [-j, +j, +1, +1].

[0274] Optionally, a codeword set under implementation A2 includes: [-1, +1, -j, +j], [-j, +1, -1, -j], [+1, +1, +j, +j], [+j, +1, +1, -j].

[0275] Optionally, a codeword set under implementation A2 includes: [+1, -j, +j, -1], [+1, -1, -j, -j], [+1, +j, +j, +1], [+1, +1, -j, +j].

[0276] Implementation method A3: The number of distinct codewords in the codeword set is less than the length of a single codeword in the codeword set. For example, the number of distinct codewords in the codeword set is 4, and the length of a single codeword in the codeword set is 8. Optionally, any two codewords in the codeword set are orthogonal.

[0277] Optionally, the codeword set includes each codeword in Table 12, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 5. Alternatively, the codeword set includes each codeword from the different codewords included in Table 12, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 5.

[0278] Optionally, please refer to Table 17 below for an example of a codeword set under implementation method A3.

[0279] Table 17

[0280] Table 17 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 17 may not be associated with antenna ports, and this is not a limitation.

[0281] As shown in Table 17, the codeword set includes 4 different codewords, but the length of any codeword in the codeword set is 8, meaning that the number of different codewords in the codeword set is less than the length of a single codeword in the codeword set. Furthermore, any two codewords in Table 17 are orthogonal.

[0282] Optionally, the codeword set includes each codeword in Table 12, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 6. Alternatively, the codeword set includes each codeword from the different codewords included in Table 12, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 6. Please refer to Table 18 below for an example of a codeword set under implementation method A3; it will not be listed here.

[0283] Optionally, please refer to Table 18 below for an example of a codeword set under implementation method A3.

[0284] Table 18

[0285] Table 18 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 18 may not be associated with antenna ports, and this is not a limitation.

[0286] As shown in Table 18, the codeword set includes 4 different codewords, but the length of any codeword in the codeword set is 8, meaning that the number of different codewords in the codeword set is less than the length of a single codeword in the codeword set. Furthermore, any two codewords in Table 18 are orthogonal.

[0287] Optionally, the codeword set includes each codeword in Table 13, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 8. Alternatively, the codeword set includes each codeword from the different codewords included in Table 13, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 8.

[0288] Optionally, please refer to Table 19 below for an example of a codeword set under implementation method A3.

[0289] Table 19

[0290] Table 19 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 19 may not be associated with antenna ports, and this is not a limitation.

[0291] As shown in Table 19, the codeword set includes 4 different codewords, but the length of any codeword in the codeword set is 8, meaning that the number of different codewords in the codeword set is less than the length of a single codeword in the codeword set. Furthermore, any two codewords in Table 19 are orthogonal.

[0292] Optionally, the codeword set includes each codeword in Table 13, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 9. Alternatively, the codeword set includes each codeword from the different codewords included in Table 13, and a codeword formed by sequentially combining one codeword from the codewords corresponding to antenna ports P5 to P8 in Table 9.

[0293] Optionally, please refer to Table 20 below for an example of a codeword set under implementation method A3.

[0294] Table 20

[0295] Table 20 lists P1 to P4 as examples of antenna ports corresponding to codewords, but the specific values ​​of these port numbers are not actually restricted. Furthermore, the codewords in Table 20 may not be associated with antenna ports, and this is not a limitation.

[0296] As shown in Table 20, the codeword set includes 4 different codewords, but the length of any codeword in the codeword set is 8, meaning that the number of different codewords in the codeword set is less than the length of a single codeword in the codeword set. Furthermore, any two codewords in Table 20 are orthogonal.

[0297] Tables 17 to 20 above are examples of codeword sets, but the content of the codeword set is not actually limited.

[0298] The following section introduces two implementation methods for the first codeword including the first sequence, using either B1 or B2.

[0299] B1, where some elements in the first codeword form the first sequence. In this case, the length of the first codeword is greater than the length of the first sequence.

[0300] In one possible design, these elements in the first codeword can be a consecutive subset of elements within the first codeword. For example, the first sequence can be the elements at positions n to (n+g) in the first codeword, or the elements from the nth to (n+g)th elements in the first codeword. Here, n is an integer greater than or equal to 1, g is a positive integer, and (n+g) is less than or equal to the number of elements included in the first codeword.

[0301] Optionally, the first sequence can be one of the following: [+1, -1, +1, +1], [+1, +1, +1, -1], [+1, -1, -1, -1], [+1, +1, -1, +1], [-j, +j, -1, +1], [-1, -j, -j, +1], [+j, +j, +1, +1], [+1, -j, +j, +1], [+j, -1, +1, -j], [-j, -j, +1, -1], [+j, +1, +1, +j], [-j, +j, +1, +1], [-1, +1, -j, +j], [-j, +1, -1, -j], [+1, +1, +j, +j], [+j, +1, +1, -j], [+1, -j, +j, -1], [+1, -1, -j, -j], [+1, +j, +j, +1], [+1, +1, -j, +j], or Where j is the imaginary unit.

[0302] Based on Equation 10 above, it can be seen that the main factor affecting the accuracy of channel estimation is S0. H The value of S1 is determined by verification. If the first sequence is one of the above, then the determinant |S0 in formula 10 is... H S1| will be smaller, and S0 HThe average energy of the main diagonal elements in S1 will be lower. This allows the second device to obtain more accurate channel estimation results or data demodulation results based on the first signal.

[0303] Alternatively, the first codeword can be the codeword corresponding to any one of the antenna ports P1 to P4 in Table 17 above, and the first sequence can include the first to fourth elements of the first codeword. For example, if the first codeword is the codeword corresponding to antenna port P2 in Table 16 above, the first sequence can be the first to fourth elements of the first codeword, i.e., +1, +1, +1, -1.

[0304] Alternatively, the first codeword is the codeword corresponding to any one of the antenna ports P1 to P4 in Table 19 above, and the first sequence includes the first element to the fourth element in the first codeword.

[0305] In another possible design, these elements in the first codeword can be discontinuous elements within the first codeword. Discontinuous means that there are two adjacent elements in the first sequence that are not consecutive in the first codeword. For example, if the first codeword is: [0 0 +1 +α(-1+j) +j 0 +α(1+j) 0], the first sequence can be the third, fourth, fifth, and seventh elements of the first codeword, i.e., the first sequence is: +1 +α(-1+j)+j +α(1+j).

[0306] B2, the first codeword is the first sequence. In this case, the length of the first codeword is equal to the length of the first sequence.

[0307] For example, the first codeword is the codeword corresponding to any one of the antenna ports from antenna port P1 to antenna port P4 in Table 5, and the first sequence is the first codeword, which will not be listed one by one here.

[0308] Alternatively, the first codeword is the codeword corresponding to any one of the antenna ports P1 to P4 in Table 8, and the first sequence is the first codeword, which will not be listed one by one here.

[0309] The above is an example of the first sequence. In fact, there are many other ways to implement the first sequence, which will not be specifically limited here.

[0310] In one possible implementation, the first sequence can be a row vector in a first matrix. For example, the first matrix can satisfy the following formula 11: C = HZ

[0311] Where C is the first matrix, and C has N rows and N columns, where N is a positive integer. Indicates to conduct The Kronecker product of order n is given by Z, which is a diagonal matrix with N rows and N columns. The (n+1)th element on the diagonal of Z is z. f(n) f(n) = nA n n∈{0,1,2,…,N-1} or Both M and A are positive integers.

[0312] Optionally, the value of A can be 3, 4, or 8, etc. Optionally, the value of M in Formula 11 can be a power of 2, such as 4, 8, 16, or 32, etc.

[0313] Example 1, If M = 4 and A = 4, then the first matrix is ​​as follows:

[0314] The first sequence can be any row vector in the first matrix. For example, the first sequence could be: +1, -1, +1, +1.

[0315] Example 2, With M=4 and A=3, the first matrix is ​​as follows:

[0316] The first sequence can be any row vector in the first matrix, for example, the first sequence is: +1, +1j、

[0317] In one possible implementation, the first sequence can be a row vector in the second matrix. For example, the second matrix can satisfy the following formula 12: P = QS w

[0318] Where P is the second matrix, with N rows and N columns, S is the row rearrangement matrix of the identity matrix, w is a positive integer less than or equal to N, and Q satisfies the following formula 13: Q = FZ

[0319] Where F is the Discrete Fourier Transform matrix, with N rows and N columns, where N is a positive integer; Z is a diagonal matrix, with N rows and N columns, and the (n+1)th element on the diagonal of Z is z. f(u,n) , f(u,n)=u(n)(n+1), n∈{0,1,2,…,N-1}, or K and u are both positive integers, u∈{1,2,…,N-1}.

[0320] Optionally, the value of M in Formula 13 can be a power of 2, such as 4, 8, 16 or 32.

[0321] Thus, based on Formulas 11 and 12, more first sequences can be calculated, and based on more first sequences, more codewords can be obtained to meet more transmission requirements.

[0322] S602. The first device sends a first signal according to the first codeword. Correspondingly, the second device receives the first signal from the first device.

[0323] For example, the first device can process the reference signal sequence according to the first codeword (such as by scrambling) to obtain the first signal. The specific processing procedure can be referred to the content of Formula 3 or Formula 5 above. In this case, the obtained first signal is the reference signal.

[0324] Alternatively, the first device can process the data based on the first codeword (such as by scrambling or precoding) to obtain the first signal. In this case, the obtained first signal is the data channel signal. The data channel signal is used to carry data.

[0325] Alternatively, the first device can process the control information based on the first codeword (e.g., scrambling or precoding) to obtain the first signal. In this case, the obtained first signal is the control channel signal. The control channel signal is used to carry control information.

[0326] For example, the process by which the first device processes control information or data based on the first codeword can be referred to the following formula 14.

[0327] Where k = 0, 1, ..., M sc -1, l = 0, 1, ..., (N) SF M symb / M sc )-1

[0328] Among them, y(lM sc +k) represents data channel signals and / or control channel signals, such as data or control information carried in the first channel, which can be an example of the first signal; d represents data or control information in complex form; M sc N represents the number of subcarriers occupied by the first channel; SF M represents the multiplexing factor of the codeword, and M represents the number of repetitions of the channel signal within the frequency domain resources of the first channel to be mapped. symb Indicates the number of time slots occupied by the first channel; w n This indicates the codeword used for data processing; for example, it can be the first codeword. The first channel can be an uplink channel, such as PUSCH or PUCCH. The first channel can also be a downlink channel, such as PDSCH or PDCCH.

[0329] When processing control information, data, or reference signal sequences using the first codeword, the length of the first codeword cannot be divided evenly by the length of the control information, data, or reference signal sequence. In one possible implementation, the first device can repeat the first codeword D times and truncate the last repeated first codeword, ensuring that the first codeword from the previous (D-1) repetitions and the truncated first codeword are aligned with the length of the control information, data, or reference signal sequence, thereby facilitating the processing of the data or reference signal sequence. D equals the result of a first value plus 1, where the first value is the quotient of the length of the data or reference signal sequence divided by the length of the first codeword.

[0330] For example, please refer to Figure 7, which is a schematic diagram of a first signal provided in an embodiment of this application. Each rectangle in Figure 7 can represent a RE.

[0331] Given that the RE resource indices of the reference signal sequence to be mapped within an OFDM symbol are 24 elements from a0 to a23, and the first codeword is, for example, [+1,+1,-1,+1], according to the reference signal sequence acquisition method, the first codeword is scrambled onto the reference signal sequence to be mapped by frequency domain repetition, thereby obtaining the sequence signal elements mapped sequentially on the 24 REs as follows: +a0,+a1,-a2,+a3,+a4,+a5,-a6,+a7,+a8,+a9,-a10,+a11,+a12,+a13,-a14,+a15,+a16,+a17,-a18,+a19,+a20,+a21,-a22,+a23.

[0332] If the first codeword is a frequency domain codeword, it can be used to scramble or precode elements in the frequency domain, allowing signals in the frequency domain to be distinguished based on the codeword. For example, the first codeword can distinguish the first signal from signals transmitted by other ports on the same time domain resource. Other antenna ports may be antenna ports on the first device or antenna ports on other devices; this is not limited.

[0333] For example, please refer to Figure 8, which is a schematic diagram of the first signal provided in an embodiment of this application. Figure 8 illustrates an example where the first port of the first device transmits the first signal using a first codeword, and the second port of the first device transmits the second signal using a second codeword from a codeword set, with both the first and second signals being reference signal sequences. The second codeword and the first codeword belong to the same code group in the codeword set. For example, the first codeword is [+1,+1,-1,+1], and the second codeword is [+1,+1,+1,-1].

[0334] As shown in Figure 8, both the first signal and the second signal are transmitted on resource 1 and resource 2. For example, resource 1 includes symbol 1 and the 24 REs corresponding to symbol 1, and resource 2 includes symbol 2 and the 24 REs corresponding to symbol 2.

[0335] For example, one reference signal sequence is: a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11, and another reference signal sequence is: b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b10,b11. A first device processes the one reference signal sequence using a first codeword to obtain a first signal, namely: +a0,+a1,-a2,a3,+a4,+a5,-a6,+a7,+a8,+a9,-a10,+a11. The first device processes the other reference signal sequence using a second codeword to obtain a second signal, namely: +b0,+b1,+b2,-b3,+b4,+b5,+b6,-b7,+b8,+b9,+b10,-b11. Thus, as shown in Figure 8(1), the first device sends the first signal corresponding to the first port on resource 1 and resource 2, namely +a0,+a1,-a2,a3,+a4,+a5,-a6,+a7,+a8,+a9,-a10,+a11,+a0,+a1,-a2,a3,+a4,+a5,-a6,+a7,+a8,+a9,-a10,+a11, As shown in Figure 8(2), the first device sends the second signal corresponding to the second port on resource 1 and resource 2, namely +b0,+b1,+b2,-b3,+b4,+b5,+b6,-b7,+b8,+b9,+b10,-b11,+b0,+b1,+b2,-b3,+b4,+b5,+b6,-b7,+b8,+b9,+b10,-b11.

[0336] Alternatively, if the first codeword is a time-domain codeword, then it can be used to scramble or precode elements in the time domain, enabling it to distinguish signals in the time domain. For example, the first codeword can distinguish the first signal from signals transmitted by other antenna ports on the same frequency domain resource. The contents of other ports can be referred to the discussion of other ports above, and will not be listed here.

[0337] For example, please refer to Figure 9, which is a schematic diagram of the first signal provided in an embodiment of this application. Figure 9 shows an example where the first port of the first device transmits the first signal using the first codeword, and the second port transmits the second signal using the second codeword from the codeword set, and both the first and second signals are reference signal sequences. The second codeword and the first codeword belong to the same code group in the codeword set. For example, the first codeword is [+1,-1,-1,-1], and the second codeword is [+1,+1,-1,+1].

[0338] As shown in Figure 9, both the first and second signals are transmitted on time slots 0 to 3. For example, the reference signal sequence is: A0, A1, A2, A3. The first device processes the reference signal sequence using a first codeword to obtain the first signal, i.e., +A0, -A1, -A2, -A3. The first device processes the reference signal sequence using a second codeword to obtain the second signal, i.e., +A0, +A1, -A2, +A3. Thus, the first device transmits the first signal corresponding to the first port and the second signal corresponding to the second port on time slots 0 to 3.

[0339] S603. The second device processes the first signal based on the first codeword to obtain a reference signal sequence or data.

[0340] The first codeword can be pre-stored in the second device, predetermined by a protocol, or received from a network device; there is no limitation on this. After receiving the first signal, the second device can process the first signal based on the first codeword (such as decoding or descrambling) to obtain a reference signal sequence or data.

[0341] For example, if the first signal is a data channel signal, the second device can decode or descramble the first signal based on the first codeword to obtain the data. Alternatively, if the first signal is a control channel signal, the second device can decode or descramble the first signal based on the first codeword to obtain control information. Or, if the first signal is a reference signal, the second device can descramble the first signal based on the first codeword to obtain a reference signal sequence. If the first signal is a reference signal, the second device can also perform channel estimation based on the first signal.

[0342] Based on the same inventive concept, this application provides a communication device. The following describes any of the communication devices shown in FIG10 or FIG11. This communication device may be, for example, any of the terminal devices involved in FIG2 or FIG4, or the network devices involved in FIG2 or FIG4, or the first or second device involved in FIG5, or a module of these devices, or a device capable of implementing the functions of these devices; it is not limited thereto.

[0343] As shown in Figure 10, the communication device 1000 may include modules or units for implementing the methods described in the embodiments above. In one possible design, the communication device 1000 includes a processing unit 1010 and a communication unit 1020. The communication unit 1020 is used to perform transmit and receive operations, such as functions related to sending and receiving; the communication unit 1020 may be referred to as a transceiver unit; optionally, the communication unit 1020 includes a receiving unit and a transmitting unit. The processing unit 1010 is used to perform processing operations. Alternatively, the communication unit 1020 may be a transmitter and a receiver, or a transmitter and a receiver. Optionally, the communication device 1000 may also include a storage unit 1030. The storage unit 1030 is used to store the device's program code or data. The storage unit 1030 is indicated by a dashed box in Figure 10 as an optional unit.

[0344] In a first possible implementation, the communication device 1000 may be the first device in the method embodiment shown in FIG6, the communication module in the first device, or the circuit or chip in the first device responsible for communication functions, or implement the functions of the first device in the method embodiment shown in FIG6.

[0345] In the above embodiment, the processing unit 1010 is used to determine the first codeword, and the communication unit 1020 is used to send the first signal according to the first codeword.

[0346] The communication device 1000 can also perform other steps executed by the first device in the method implementation shown in Figure 6 above, which will not be listed here one by one.

[0347] In a second possible implementation, the communication device 1000 may be the second device in the method embodiment shown in FIG6, the communication module in the second device, or the circuit or chip in the second device responsible for communication functions, or implement the functions of the second device in the method embodiment shown in FIG6.

[0348] In the above embodiment, the communication unit 1020 is used to receive the first signal, and the processing unit 1010 is used to process the first signal based on the first codeword.

[0349] The communication device 1000 can also perform other steps executed by the second device in the method implementation shown in Figure 6 above, which will not be listed here one by one.

[0350] In one possible design, when the communication device 1000 is a terminal device, a communication module within a terminal device, an access network device, or a communication module within an access network device, the function of the processing unit 1010 can be implemented by one or more processors. Specifically, the processor may include a modem chip, or a system-on-a-chip (SoC) chip or a SIP chip containing a modem core. The function of the communication unit 1020 can be implemented by transceiver circuitry.

[0351] In one possible design, when the communication device 1000 is a circuit or chip responsible for communication functions in a terminal device, or a circuit or chip responsible for communication functions in an access network device, such as a modem chip or a system-on-a-chip (SoC) chip or SIP chip containing a modem core, the function of the processing unit 1010 can be implemented by a circuit system including one or more processors or processor cores in the aforementioned chip. The function of the communication unit 1020 can be implemented by interface circuits or data transceiver circuits on the aforementioned chip.

[0352] It is understood that the division of units in the above-described device is merely a logical functional division. Each function can correspond to a functional unit, or two or more functions can be integrated into one functional unit. In actual implementation, all or some units can be integrated into a single physical entity, or they can be distributed across different physical entities. Furthermore, the aforementioned functional units can be implemented in hardware, software, or a combination of both. Whether a function is executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0353] In one example, the functional unit in any of the above devices may be one or more integrated circuits configured to implement the above methods, such as: one or more application-specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more DSPs, or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0354] In one example, storage unit 1030 may include random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory and / or registers, etc.

[0355] The communication device shown in Figure 11 will now be described. As shown in Figure 11, the communication device 1100 includes a modem 1110 and a processor 1130. Optionally, the communication device 1100 may also include a memory 1140 and a transceiver 1120. The processor 1130 may also be referred to as a controller.

[0356] Modem 1110 is used for encoding and decoding. Modem 1110 includes encoder 1111, modulator 1112, decoder 1113, and demodulator 1114. Encoder 1111 is used for channel coding, modulator 1112 is used for modulation, decoder 1113 is used for channel decoding, and demodulator 1114 is used for demodulation.

[0357] The modem 1110 and the processor 1130 are coupled to each other. The processor 1130 and the memory 1140 may also be coupled together. It is understood that the transceiver 1120 may be a transceiver or an input / output interface.

[0358] The memory 1140 is used to store instructions executed by the processor 1130, or to store input data required by the processor 1130 to run instructions, or to store data generated after the processor 1130 runs instructions.

[0359] In addition, Figure 11 uses one processor 1130 and one memory 1140 as an example, but the number of processors 1130 and memory 1140 is not actually limited.

[0360] The communication device 1100 is used to implement the method embodiment described in FIG6. Optionally, the processor 1130 is used to implement the functions of the processing unit 1010, and the transceiver 1120 is used to implement the functions of the communication unit 1020.

[0361] In a first possible design, the communication device 1100 can be used to implement the functions of the first device involved in the method embodiment shown in FIG6.

[0362] In a second possible design, the communication device 1100 can be used to implement the functions of the second device involved in the method embodiment shown in FIG6.

[0363] When the aforementioned communication device 1100 is a chip applied to a device (such as the terminal device or network device mentioned above), the device chip implements the functions of the device in the above method embodiments. The device chip receives information from other modules (such as radio frequency modules or antennas) within the device, the information being sent to the device by other devices; or, the device chip sends information to other modules (such as radio frequency modules or antennas) within the device, the information being sent to other devices by the device. Here, the communication device 800 can be a baseband chip of a device, or a DU or other modules. The DU here can be a DU under an open radio access network (O-RAN) architecture.

[0364] The processor 810 can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), accelerators, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor. An accelerator includes at least one of a graphics processing unit (GPU), a neural network processing unit (NPU), or a data processing unit (DPU).

[0365] Furthermore, the memory involved in the various embodiments of this application may include volatile memory, such as random access memory (RAM). The memory may also include non-volatile memory, such as read-only memory (ROM), flash memory, hard disk drive (HDD), or solid state drive (SSD).

[0366] Based on the same inventive concept, embodiments of this application provide a communication system. The communication system includes: a first device and a second device.

[0367] The first device can be used to implement the functions of the first device involved in the method embodiment shown in FIG6. And the second device can be used to implement the functions of the second device involved in the method embodiment shown in FIG6.

[0368] This application provides a chip system comprising a processor and an interface. The processor is used to call and execute instructions from the interface, and when the processor executes the instructions, it implements the method embodiment shown in Figure 6 above.

[0369] This application provides a computer-readable storage medium for storing computer programs or instructions that, when run, implement the method embodiment shown in FIG6.

[0370] This application provides a program product that, when executed, enables a processor to implement the method embodiment shown in FIG6. This program product is, for example, a computer program product, specifically a computer program and / or instructions. The processor is, for example, a processor running in a computer.

[0371] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device (or network apparatus), a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or non-volatile storage medium, or may include both types of storage media.

[0372] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0373] The various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be based on its function and internal logic.

Claims

1. A communication method, characterized in that, include: A first codeword is determined, the first codeword includes a first sequence, the first codeword belongs to a codeword set, and the number of different codewords included in the codeword set is greater than the length of a codeword in the codeword set; Based on the first codeword, send the first signal.

2. The method according to claim 1, characterized in that, The first sequence is a row vector in a first matrix, and the first matrix satisfies the following relationship: C = HZ Wherein, C is a first matrix, the number of rows and columns of C are both N, and N is a positive integer. Indicates to conduct The Kronecker product is given by Z, which is a diagonal matrix with N rows and N columns. The (n+1)th element on the diagonal of Z is z. f(n) f(n) = nA n n∈{0,1,2,…,N-1} or Both M and A are positive integers.

3. The method according to claim 2, characterized in that, The value of A is 3 or 4, and / or the value of M is a power of 2.

4. The method according to claim 1, characterized in that, The first sequence is a row vector in the second matrix, and the second matrix satisfies the following relationship: P = QS w Wherein, P is the second matrix, the number of rows and columns of P are both N, N is a positive integer, S is the row rearrangement matrix of the identity matrix, w is a positive integer less than or equal to N, and Q satisfies the following relationship: Q = FZ Where F is the Discrete Fourier Transform matrix, with N rows and N columns, and Z is a diagonal matrix with N rows and N columns, where the (n+1)th element on the diagonal of Z is z. f(u,n) , f(u,n)=u(n)(n+1), n∈{0,1,2,…,N-1}, u∈{1,2,…,N-1}, or K is a positive integer.

5. The method according to claim 4, characterized in that, The value of K is a power of 2.

6. The method according to any one of claims 1-5, characterized in that, The first sequence includes one of the following: [+1，-1，+1，+1]； [+1，+1，+1，-1]； [+1，-1，-1，-1]； [+1，+1，-1，+1]； Where j is the imaginary unit; Where j is the imaginary unit; Where j is the imaginary unit; or, Where j is the imaginary unit.

7. The method according to any one of claims 1-6, characterized in that, The length of the first sequence is less than or equal to the length of the first codeword.

8. The method according to any one of claims 1-7, characterized in that, The first codeword is a frequency domain codeword or a time domain codeword.

9. The method according to any one of claims 1-8, characterized in that, The first signal is a control channel signal, a data channel signal, or a reference signal.

10. The method according to any one of claims 1-9, characterized in that, The codeword set includes two non-orthogonal codewords.

11. The method according to any one of claims 1-10, characterized in that, The codeword set includes a total number of codewords of 8, 10, 12, 14, 32, 48, 64, 96, or 160.

12. The method according to any one of claims 1-11, characterized in that, Determine the first codeword, including: Receive first information, which indicates the first codeword; or, Select the first codeword from the set of codewords.

13. The method according to claim 12, characterized in that, The first information is used to indicate the first codeword, including: The first information includes at least one of the following: information indicating the port number of the first antenna port, information indexing the port number of the first antenna port, or information indexing the first codeword.

14. A communication method, characterized in that, include: Receive the first signal; Based on the first codeword, the first signal is processed to obtain a reference signal sequence, data, or control information. The first codeword includes a first sequence and belongs to a codeword set. The number of different codewords included in the codeword set is greater than the length of a codeword in the codeword set.

15. The method according to claim 14, characterized in that, The first sequence is a row vector in a first matrix, and the first matrix satisfies the following relationship: C = HZ Wherein, C is a first matrix, the number of rows and columns of C are both N, and N is a positive integer. Indicates to conduct The Kronecker product is given by Z, which is a diagonal matrix with N rows and N columns. The (n+1)th element on the diagonal of Z is z. f(n) f(n) = nA n n∈{0,1,2,…,N-1} or Both M and A are positive integers.

16. The method according to claim 15, characterized in that, The value of A is either 3 or 4.

17. The method according to claim 14, characterized in that, The first sequence is a row vector in the second matrix, and the second matrix satisfies the following relationship: P = QS w Wherein, P is the second matrix, the number of rows and columns of P are both N, N is a positive integer, S is the row rearrangement matrix of the identity matrix, w is a positive integer less than or equal to N, and Q satisfies the following relationship: Q = FZ Where F is the Discrete Fourier Transform matrix, with N rows and N columns, and Z is a diagonal matrix with N rows and N columns, where the (n+1)th element on the diagonal of Z is z. f(u,n) , f(u,n)=u(n)(n+1), n∈{0,1,2,…,N-1}, u∈{1,2,…,N-1}, or K is a positive integer.

18. The method according to claim 17, characterized in that, The value of M is a power of 2.

19. The method according to any one of claims 14-18, characterized in that, The first sequence includes one of the following: [1，-1，1，1]； [1，1，1，-1]； [1，-1，-1，-1]； [1，1，-1，1]； Where j is the imaginary unit; Where j is the imaginary unit; Where j is the imaginary unit; or, Where j is the imaginary unit.

20. The method according to any one of claims 14-19, characterized in that, The length of the first sequence is less than or equal to the length of the first codeword.

21. The method according to any one of claims 14-19, characterized in that, The first codeword is a frequency domain codeword or a time domain codeword.

22. The method according to any one of claims 14-21, characterized in that, The codeword set includes two non-orthogonal codewords.

23. The method according to any one of claims 14-22, characterized in that, The codeword set includes a total number of codewords of 8, 10, 12, 14, 32, 48, 64, 96, or 160.

24. The method according to any one of claims 14-23, characterized in that, Determine the first codeword, including: Send a first message, which is used to indicate the first codeword.

25. The method according to claim 24, characterized in that, The first information is used to indicate the first codeword, including: The first information includes at least one of the following: information indicating the port number of the first antenna port, information indexing the port number of the first antenna port, or information indexing the first codeword.

26. A communication device, characterized in that, The device includes one or more processors, which are configured to execute computer programs or instructions in memory to cause the communication device to perform the method as described in any one of claims 1-13, or to perform the method as described in any one of claims 14-25.

27. A computer program product, characterized in that, When the computer program product is executed, it causes the processor to perform the method as described in any one of claims 1-13, or the method as described in any one of claims 14-25.

28. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions that, when executed by a communication device, implement the method as described in any one of claims 1-13, or perform the method as described in any one of claims 14-25.

Images