Transmitting device, receiving device, communication apparatus and method for random access communication

By using encoding circuits in OFDM systems to generate d-order rank 1 tensor structure and time-frequency mapping, combined with rotation matrix, the problems of decoding errors based on tensor modulation and insufficient communication reliability in traditional OFDM systems are solved, and a higher level of communication reliability and spectrum efficiency.

CN119096496APending Publication Date: 2024-12-06HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202280094474.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2022-04-12
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

There is residual asynchronousness in traditional OFDM systems, resulting in problems such as decoding errors and insufficient communication reliability in tensor-based modulation.

Method used

The input message is encoded into a bit sequence by using the coding circuit, and the d-order rank 1 tensor structure is generated through the Cronek product, combining time-frequency mapping and rotation matrix to realize the construction and mapping of symbol vectors to reduce the probability of decoding errors and improve the Communication reliability.

Benefits of technology

In non-simultaneous communication systems, the probability of decoding error is reduced, communication reliability and spectrum efficiency are improved, and timing offsets and carrier frequency offsets can be accurately estimated and compensated.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119096496A_ABST
    Figure CN119096496A_ABST
Patent Text Reader

Abstract

A transmitting device for random access communication includes an encoding circuit to encode an input message into a bit sequence, divide the bit sequence into d bit blocks, and determine d vectors from the d bit blocks. The transmitting device includes a Kronecker product circuit configured to construct a symbol vector by calculating a Kronecker product of the d vectors to generate a d-order rank-1 tensor structure; the mapping circuitry is configured to map each element of the symbol vector onto one of a plurality of time-frequency resources to generate a vector of time-frequency modulated symbols. The transmitting device comprises at least one antenna, and the at least one antenna is used for transmitting each time frequency modulation symbol in the time frequency modulation symbols to a receiving device through a radio frequency signal. In a large-scale random access scenario, the transmitting device exhibits a reduced decoding error probability and improved communication reliability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure generally relates to the field of wireless communications, and more particularly, to a transmitting device, a receiving device, a communication apparatus including the transmitting device and the receiving device, and a method for random access communication. Background Art

[0002] As the number of communication devices in a network increases rapidly, concerns about communication reliability are becoming more prominent. Traditionally, conventional communication devices use multiple access methods with fixed resource allocation for data communication in a network. In these multiple access methods, a given communication device is allocated dedicated time-frequency resources in order to send data via a communication channel. These conventional multiple access methods are inefficient in terms of channel utilization because a given communication device may not have any data to transmit in the dedicated time-frequency resources, resulting in a loss in spectral efficiency.

[0003] In some scenarios, a conventional random access method is used instead of a conventional fixed access method to relatively better utilize the communication channel. In a conventional random access method, a conventional communication device (e.g., a transmitter) can send data on a communication channel when it has some data to transmit. Data transmission does not require a pre-assigned time slot or a fixed frequency. Conventional random access methods are generally divided into coherent methods and non-coherent methods. In a coherent method, the channel state is known to the communication device (i.e., the transmitter and the receiver). In a non-coherent method, the channel state is considered to be unknown to both the conventional transmitter and the conventional receiver. In the implementation scenario of the non-coherent method, tensor-based modulation is used for random access communication between multiple conventional transmitters and conventional receivers. Tensor-based modulation is performed on the basis of orthogonal frequency division multiplexing (OFDM) modulation technology. In general, OFDM modulation technology can be defined as a signal modulation technology in which a high data rate modulation stream is divided into multiple closely spaced orthogonal subcarriers that are transmitted in parallel. In this implementation scenario, the timing and carrier frequency synchronization of closely spaced orthogonal subcarriers is not perfect, which further results in timing offset and carrier frequency offset in the transmitted data of each conventional transmitter. This further results in an increased probability of decoding errors and, therefore, erroneous (or unreliable) recovery of data at the conventional receiver. Therefore, there is a technical problem that there is residual asynchronism in the conventional OFDM system, and thus an increased probability of decoding errors and insufficient communication reliability in the tensor-based modulation used in conjunction with the conventional OFDM system.

[0004] Therefore, based on the above discussion, there is a need to overcome the above-mentioned shortcomings associated with tensor-based modulation used in conjunction with conventional OFDM systems. Summary of the invention

[0005] The present disclosure provides a transmitting device, a receiving device, a communication apparatus including the transmitting device and the receiving device, and a method for random access communication. The present disclosure provides a solution to the existing problem that residual asynchronism exists in a conventional OFDM system, thereby increasing the probability of decoding errors and insufficient communication reliability in tensor-based modulation used in conjunction with the conventional OFDM system. The purpose of the present disclosure is to provide a solution that at least partially overcomes the problems encountered in the prior art, and to provide an improved transmitting device, an improved receiving device, an improved communication apparatus including the improved transmitting device and the improved receiving device, and an improved method for random access communication.

[0006] The objects of the present disclosure are achieved by what is provided in the attached independent claim. Advantageous implementations of the present disclosure are further defined in the dependent claims.

[0007] On the one hand, the present disclosure provides a transmitting device for random access communication, including a coding circuit for encoding an input message into a bit sequence, dividing the bit sequence into d bit blocks, where d>1, and determining d vectors from the d bit blocks. The transmitting device also includes a Kronecker product circuit for generating a d-order rank-1 tensor structure by calculating the Kronecker product of the d vectors to construct a symbol vector. The transmitting device also includes a mapping circuit for mapping the symbol vector in a time-frequency grid associated with multiple time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources of the time-frequency resource grid to generate a vector of time-frequency modulation symbols; and at least one antenna for transmitting each of the time-frequency modulation symbols to a receiving device via a radio frequency signal.

[0008] When used in a communication system in which there is no complete synchronization (or no block fading channel) between a transmitting device (or multiple transmitting devices) and a receiving device, the disclosed transmitting device exhibits a reduced decoding error probability and improved communication reliability. In addition, the transmitting device can be used in a communication system that adopts tensor-based modulation and OFDM, thereby improving spectral efficiency. The transmitting device includes a time-frequency mapping between tensor elements and the physical resources used, which enables the receiving device to more accurately estimate and compensate for timing offsets and carrier frequency offsets, thereby improving the communication reliability of the communication system including the transmitting device and the receiving device. In addition, the use of time-frequency mapping retains the rank 1 property of the symbol vector under timing offset. In addition, the transmitting device implements an improved waveform design for large-scale random access communication, which has a reduced decoding error probability and improved spectral efficiency.

[0009] In one implementation, the Kronecker product circuit is used to apply a rotation to each of the d vectors by multiplying each of the d vectors with a rotation matrix before calculating the Kronecker product.

[0010] The use of rotation matrices provides additional degrees of freedom for the design of sub-constellations. In addition, appropriate selection of the rotation matrix enables the receiving device to accurately estimate and compensate for timing offset and carrier frequency offset, which further improves communication reliability.

[0011] In another implementation, the encoding circuit is used to determine each of the d vectors using a corresponding sub-constellation based on bits in a corresponding bit block, wherein each of the corresponding sub-constellations has a structure selected from at least the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the multiple vectors into a pilot part and a data part.

[0012] Each of the sub-constellations in the corresponding sub-constellation has a defined structure, and each structure has its own characteristics, for example, the structured Grassmann constellation provides a dense constellation structure. The dense constellation structure based on the structured Grassmann constellation (e.g., a dense constellation structure of a symbol vector) produces input data in a compact form and reduces the complexity of the decoding process at the receiving device.

[0013] In another implementation, the encoding circuit is used to encode the input message into a bit sequence according to a binary code.

[0014] By encoding the input message into a bit sequence according to a binary code, redundancy is added to the input message, which makes the input message robust to noise and different kinds of interference.

[0015] On the other hand, the present disclosure provides a receiving device for random access communication, comprising at least one antenna for simultaneously receiving multiple radio frequency signals from multiple transmitting devices. The receiving device also includes a separation circuit for arranging each of the radio frequency signals into a time-frequency grid associated with multiple time-frequency resources according to a predefined permutation matrix to generate multiple estimated symbol vectors from the received multiple radio frequency signals, and using a d-order rank 1 tensor structure associated with each transmitting device to separate the multiple estimated symbol vectors, where d>1. The receiving device also includes a plurality of compensation circuits, each of which is used to estimate a corresponding time offset and a corresponding frequency offset in a corresponding estimated symbol vector in the multiple estimated symbol vectors, and generate a corresponding compensated symbol vector by applying a time offset compensation based on the corresponding time offset and a frequency offset compensation based on the corresponding frequency offset to the corresponding estimated symbol vector. The receiving device also includes a plurality of decoders, each of which is used to decode a compensated symbol vector generated by one of the compensation circuits to generate a plurality of decoded messages, each of which includes a bit sequence corresponding to data associated with a corresponding transmitting device in the multiple transmitting devices.

[0016] When used in a communication system where there is no complete synchronization (or no block fading channel) between a transmitting device (or multiple transmitting devices) and a receiving device, the disclosed receiving device exhibits a reduced decoding error probability and improved communication reliability. By using time-frequency mapping at the transmitting device and by rotating the tensor elements using a rotation matrix and the multiple compensation circuits, accurate estimation and compensation of timing offset and carrier frequency offset can be achieved, which further reduces the decoding error probability and improves communication reliability. In addition, the receiving device can be used in a communication system that uses tensor-based modulation and OFDM, thereby improving spectral efficiency.

[0017] In one implementation, each compensation circuit of the plurality of compensation circuits is configured to use a corresponding constellation including a symbol vector and determine the time offset compensation and the frequency offset compensation to minimize a distance between the corresponding estimated symbol vector and a symbol vector of the constellation.

[0018] Using corresponding constellations including symbol vectors in determining time offset compensation and frequency offset compensation results in more accurate estimation and compensation of timing offset and carrier frequency offset.

[0019] On the other hand, the present disclosure provides a communication device, including the sending device and the receiving device.

[0020] The communication device realizes all the advantages and technical effects of the sending device and the receiving device described in the present disclosure.

[0021] On the other hand, the present disclosure provides a method for random access communication. The method includes: an encoder of a transmitting device encodes an input message into a bit sequence. The method also includes: the encoder divides the bit sequence into d bit blocks, where d>1; the encoder determines d vectors from the d bit blocks. The method also includes: the Kronecker product circuit of the transmitting device generates a d-order rank 1 tensor structure by calculating the Kronecker product of the d vectors to construct a symbol vector. The method also includes: the mapping circuit of the transmitting device maps the symbol vector in a time-frequency grid associated with multiple time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources of the time-frequency resource grid to generate a vector of time-frequency modulation symbols; and at least one antenna of the transmitting device sends each of the time-frequency modulation symbols to the receiving device via a radio frequency signal.

[0022] The method achieves all the advantages and technical effects of the sending device described in the present disclosure.

[0023] On the other hand, the present disclosure provides a method for random access communication. The method includes: at least one antenna of a receiving device simultaneously receives multiple radio frequency signals from multiple transmitting devices. The method also includes: the separation circuit of the receiving device arranges each of the radio frequency signals into a time-frequency grid associated with multiple time-frequency resources according to a predefined matrix to generate multiple estimated symbol vectors from the received multiple radio frequency signals, and uses a d-order rank 1 tensor structure associated with each transmitting device to separate the multiple estimated symbol vectors, where d>1. The method also includes: multiple compensation circuits of the receiving device estimate the time offset and frequency offset in each of the multiple estimated symbol vectors; and the compensation circuit generates multiple compensated symbol vectors by applying time offset compensation based on the time offset and frequency offset compensation based on the frequency offset to the multiple estimated symbol vectors. The method also includes: multiple decoders in the receiving device decode the multiple compensated symbol vectors to generate multiple decoded messages, each decoded message including a bit sequence corresponding to data associated with a corresponding transmitting device among the multiple transmitting devices.

[0024] The method achieves all the advantages and technical effects of the receiving device described in the present disclosure.

[0025] In yet another aspect, the present disclosure provides a computer program product, comprising program instructions, which, when executed by one or more processors in a computer system, are used to perform the method for random access communication.

[0026] On the other hand, the present disclosure provides a computer system, including one or more processors and one or more memories, wherein the one or more memories store program instructions, and when the program instructions are executed by the one or more processors, the one or more processors execute the method for random access communication.

[0027] After executing the method for random access communication, the one or more processors of the computer system achieve all the advantages and technical effects of the method.

[0028] It should be understood that all the above implementations can be combined together.

[0029] It should be noted that all devices, elements, circuits, units and devices described in this application can be implemented in software or hardware elements or any type of combination thereof. All steps performed by various entities described in this application and the described functions to be performed by various entities are intended to indicate that each entity is suitable for or used to perform respective steps and functions. Although in the description of the following specific embodiments, the specific functions or steps performed by external entities are not reflected in the description of the specific detailed elements of the entities performing the specific steps or functions, it should be clear to the technician that these methods and functions can be implemented by corresponding software or hardware elements or any combination thereof. It is understandable that the features of the present disclosure are easy to be combined in various combinations without departing from the scope of the present disclosure defined by the appended claims.

[0030] Other aspects, advantages, features and objects of the present disclosure will become apparent from the accompanying drawings and detailed description of illustrative implementations interpreted in conjunction with the following appended claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] The above summary of the invention and the detailed description of the following illustrative embodiments can be better understood by reading in conjunction with the accompanying drawings. In order to illustrate the present invention, exemplary structures of the present invention are shown in the accompanying drawings. However, the present invention is not limited to the specific methods and tools disclosed herein. In addition, it will be appreciated by those skilled in the art that the accompanying drawings are not drawn to scale. Where possible, identical elements are represented by identical numerals.

[0032] Embodiments of the present invention are described below by way of example only with reference to the following drawings, in which:

[0033] Figure 1 is a schematic diagram of a network environment of a system having multiple sending devices and receiving devices according to an embodiment of the present invention;

[0034] Figure 2 is a block diagram illustrating various exemplary components of a transmitting device according to an embodiment of the present invention;

[0035] Figure 3 is a diagram of a time-frequency mapping of a symbol vector in a time-frequency grid according to an embodiment of the present invention;

[0036] Figure 4 is a flow chart of a method for random access communication according to an embodiment of the present invention;

[0037] Figure 5 is a block diagram illustrating various exemplary components of a receiving device according to an embodiment of the present invention;

[0038] Figure 6 is a diagram of a timing offset of a symbol vector according to an embodiment of the present invention;

[0039] Figure 7 is a diagram of a receiving device according to another embodiment of the present invention;

[0040] Figure 8 is a flow chart of a method for random access communication according to another embodiment of the present invention;

[0041] Fig. 9 is a block diagram illustrating various exemplary components of a communication device according to an embodiment of the present invention;

[0042] Fig.10 is a graphical representation showing a change in block error rate (BLER) relative to signal-to-noise ratio (SNR) according to an embodiment of the present invention;

[0043] Fig.11 is a graphical representation showing the variation of BLER with respect to SNR for a cube partitioned constellation according to an embodiment of the present invention; and

[0044] Fig.12 is a graphical representation showing the variation of BLER with respect to SNR for a quadrature amplitude modulation (QAM) constellation according to an embodiment of the present invention.

[0045] In the drawings, underlined numbers are used to indicate the item in which the underlined number is located or an item adjacent to the underlined number, and non-underlined numbers are items identified by a line connecting the non-underlined number to the item. When a number is not underlined and has an associated arrow, the non-underlined number is used to identify the general item to which the arrow points. DETAILED DESCRIPTION

[0046] The following detailed description describes embodiments of the invention and ways in which these embodiments may be implemented. Although some modes of implementing the invention have been disclosed, those skilled in the art will recognize that there may be other embodiments for implementing or practicing the invention.

[0047] Figure 1 is a schematic diagram of a network environment of a system having multiple sending devices and receiving devices according to an embodiment of the present invention. Figure 1 , shows a network environment of a system 100 including a plurality of transmitting devices 102 and a receiving device 104. Also shown is a communication network 106. The plurality of transmitting devices 102 include K transmitting devices, for example, a first transmitting device 102A, a second transmitting device 102B, and up to a Kth transmitting device 102K.

[0048] Each of the plurality of transmitting devices 102 may include suitable logic, circuitry, interfaces, and / or code for communicating with the receiving device 104 via the communication network 106 (e.g., a propagation channel). Examples of each of the plurality of transmitting devices 102 may include, but are not limited to, an Internet of Things (IoT) device, a smartphone, a machine type communication (MTC) device, a computing device, an evolved universal mobile telecommunications system (UMTS) terrestrial radio access (E-UTRAN) NR dual connectivity (EN-DC) device, a server, an IoT controller, a drone, custom hardware for wireless communication, a transmitter, or any other portable or non-portable electronic device. In the system 100, each of the plurality of transmitting devices 102 has a single antenna for communicating with the receiving device 104. However, in another implementation of the system 100, each of the plurality of transmitting devices 102 may have more than one antenna for communicating with the receiving device 104.

[0049] The receiving device 104 may include suitable logic, circuitry, interfaces and / or code for simultaneously receiving one or more radio frequency signals from multiple transmitting devices 102 via the communication network 106. Examples of the receiving device 104 may include, but are not limited to, an Internet of Things (IoT) controller, a base station, a server, a smartphone, custom hardware for wireless communication, a receiver, or any other portable or non-portable electronic device. In the system 100, the receiving device 104 has more than one antenna for communicating with the multiple transmitting devices 102.

[0050] The communication network 106 includes a medium (e.g., a communication channel) through which multiple transmitting devices 102 potentially communicate with the receiving device 104. Examples of the communication network 106 may include, but are not limited to, a cellular network (e.g., 2G, 3G, long-term evolution (LTE) 4G, 5G or 5G New Radio (NR) network, e.g., sub-6GHz, cmWave or mmWave communication network), a wireless sensor network (WSN), a cloud network, a local area network (LAN), a vehicle-to-network (V2N) network, a metropolitan area network (MAN), and / or the Internet. Each of the multiple transmitting devices 102 in the network environment is used to connect to the receiving device 104 according to various wireless communication protocols. Examples of such wireless communication protocols, communication standards and techniques may include, but are not limited to, IEEE 802.11, 802.11p, 802.15, 802.16, 1609, Worldwide Interoperability for Microwave Access (Wi-MAX), Transmission Control Protocol and Internet Protocol (TCP / IP), User Datagram Protocol (UDP), Hypertext Transfer Protocol (HTTP), Long-term Evolution (LTE), File Transfer Protocol (FTP), Enhanced Data GSM Environment (EDGE), Voice over Internet Protocol (VoIP), email, instant messaging and / or Short Message Service (SMS) protocols, and / or other cellular or IoT communication protocols.

[0051] Furthermore, a random number of the plurality of transmitting devices 102 may be simultaneously activated and may be used to simultaneously transmit a plurality of radio frequency signals to the receiving device 104 via the communication network 106. Therefore, the system 100 may also be referred to as an exemplary implementation of massive random access communication, in which the plurality of transmitting devices 102 simultaneously transmit a plurality of radio frequency signals to the receiving device 104. Furthermore, each of the plurality of transmitting devices 102 simultaneously transmits a plurality of radio frequency signals to the receiving device 104 without any prior resource request (or grant).

[0052] In addition, in one implementation of the system 100, the communication network 106 may be used as a block fading channel between the multiple transmitting devices 102 and the receiving device 104. Alternatively, it is assumed that the multiple transmitting devices 102 and the receiving device 104 are completely synchronized with each other, and therefore, there is no timing offset and carrier frequency offset in the system 100. In another implementation of the system 100, there is no block fading channel between the multiple transmitting devices 102 and the receiving device 104, and therefore, there is a timing offset and a carrier frequency offset at the multiple transmitting devices 102, and it is necessary to compensate for the timing offset and the carrier frequency offset at the receiving device 104, so as to reduce the probability of decoding errors and obtain sufficient communication reliability in the system 100. In this embodiment (i.e., the system 100), it is assumed that there is no block fading channel between the multiple transmitting devices 102 and the receiving device 104.

[0053] Figure 2 is a block diagram showing various exemplary components of a transmitting device according to an embodiment of the present invention. Figure 1 The element pairs in Figure 2 Described. Figure 2 , a block diagram 200 of a transmitting device 202 is shown, which includes a coding circuit 204, a Kronecker product circuit 206, a mapping circuit 208, an antenna 210, a processor 212, and a memory 214. In one implementation, each of the coding circuit 204, the Kronecker product circuit 206, and the mapping circuit 208 can be part of the processor 212. In another implementation, the coding circuit 204, the Kronecker product circuit 206, and the mapping circuit 208 are separate circuits or modules (and may not be part of the processor 212). The coding circuit 204, the Kronecker product circuit 206, and the mapping circuit 208 are communicatively coupled to the antenna 210, the processor 212, and the memory 214. In the present embodiment, the transmitting device 202 includes a single antenna, for example, the antenna 210. However, in other embodiments, the transmitting device 202 may include multiple antennas.

[0054] The sending device 202 corresponds to ( Figure 1The transmitting device 202 may be used to communicate with one of the plurality of transmitting devices 102, for example, the Kth transmitting device 102K. Figure 1 ) receiving device 104 communicates.

[0055] The encoding circuit 204 may include suitable logic, circuitry, and / or interfaces for encoding an input message into a bit sequence. In one implementation, the encoding circuit 204 may be a binary encoder.

[0056] The Kronecker product circuit 206 may include appropriate logic, circuitry, and / or interfaces for generating a rank-1 tensor structure of order d by computing the Kronecker product of d vectors to construct a symbolic vector.

[0057] The mapping circuit 208 may include suitable logic, circuitry, and / or interfaces for mapping a symbol vector onto a vector of time-frequency modulation symbols. The mapping circuit 208 may also be referred to as a time-frequency resource mapping circuit.

[0058] Antenna 210 may include a Figure 1 The antenna 210 may include, but is not limited to, a radio frequency transceiver, a network interface, a telematics unit, or any antenna suitable for use in an IoT device, an IoT controller, a user device, a repeater, a base station, or other portable or non-portable communication device. The antenna 210 may be used for wireless communication using various wireless communication protocols.

[0059] The processor 212 may include appropriate logic, circuitry, and / or interfaces for executing instructions stored in the memory 214. Examples of the processor 212 may include, but are not limited to, an integrated circuit, a coprocessor, a microprocessor, a microcontroller, a complex instruction set computing (CISC) processor, an application-specific integrated circuit (ASIC) processor, a reduced instruction set (RISC) processor, a very long instruction word (VLIW) processor, a central processing unit (CPU), a state machine, a data processing unit, and other processors or circuits. In addition, the processor 212 may refer to one or more separate processors, processing devices, and processing units as part of a machine.

[0060] The memory 214 may include suitable logic, circuitry, and / or interfaces for storing machine code and / or instructions executable by the processor 212. The memory 214 may temporarily store one or more time-frequency modulation symbols, which are then sent to the receiving device 104 by the antenna 210 in the form of one or more radio frequency signals. Examples of implementations of the memory 214 may include, but are not limited to, an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Random Access Memory (RAM), a Read Only Memory (ROM), a Hard Disk Drive (HDD), a flash memory, a Secure Digital (SD) card, a Solid-State Drive (SSD), a computer-readable storage medium, and / or a CPU cache memory. The memory 214 may store an operating system and / or a computer program product to operate the sending device 202. Computer-readable storage media used to provide non-transitory memory may include, but are not limited to, electronic storage devices, magnetic storage devices, optical storage devices, electromagnetic storage devices, semiconductor storage devices, or any suitable combination of the above.

[0061] In operation, the sending device 202 is used to communicate with ( Figure 1 The transmitting device 202 includes a coding circuit 204, which is used to encode an input message into a bit sequence. In one implementation, the coding circuit 204 is used to encode a B-bit input message (e.g., a binary message) mk into a bit sequence, and the number of bits of the bit sequence (i.e., B′) is greater than the number of bits of the input message (i.e., B).

[0062] According to an embodiment, the encoding circuit 204 is used to encode the input message into a bit sequence according to a binary code. In one implementation, the encoding circuit 204 can be used to encode the input message (i.e., a binary message m of B bits) into a bit sequence using a binary code. k ) is encoded into a bit sequence (i.e., B′). Examples of binary codes may include, but are not limited to, source codes, channel codes, etc. Channel codes may include low-density parity check (LDPC) codes, Turbo codes, Viterbi codes, etc.

[0063] The encoding circuit 204 is further used to divide the bit sequence into d bit blocks, where d>1, and determine d vectors from the d bit blocks. Thereafter, the encoding circuit 204 is used to divide the bit sequence (i.e., B′) into d blocks, where d is an arbitrary number and greater than 1. Each of the d blocks has B i bits, so that The i-th block (where 1≤i≤d) is mapped from the sub-constellation Ti generated in 维 vector The dimensions T1,…,Td satisfy The mapping from the d bit blocks to the d vectors is performed by using the encoding circuit 204 (more specifically, the vector symbol mapper). Thus, the d vectors can also be represented as x 1,k ,…,x d,k .

[0064] According to an embodiment, the encoding circuit 204 is used to determine each of the d vectors using a corresponding sub-constellation based on bits in the corresponding bit block, wherein each of the corresponding sub-constellations has a structure selected from at least the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the plurality of vectors into a pilot part and a data part. The encoding circuit 204 is also used to determine each of the d vectors using a corresponding sub-constellation (i.e., ) determines each of the d vectors (i.e. x 1,k ,…,x d,k ). Each sub-constellation in the corresponding sub-constellation belongs to a constellation and has two or more dimensions. The constellation has a definite and fixed multi-dimensional data structure, which reduces the computational complexity of waveform design for data transmission. In addition, in one implementation, the structure of each sub-constellation in the corresponding sub-constellation is selected from a Grassmann constellation (e.g., a cube partitioned constellation). In another implementation, the structure of each sub-constellation in the corresponding sub-constellation is selected from a constellation that divides each of a plurality of vectors into a pilot part of one or more scalar reference symbols and a data part with remaining scalar elements. The data part can be generated by quadrature amplitude modulation (QAM) or phase shift keying (PSK) modulation.

[0065] The transmitting device 202 further includes a Kronecker product circuit 206, which is used to generate a d-order rank 1 tensor structure by calculating the Kronecker product of d vectors to construct a symbol vector. The Kronecker product circuit 206 is used to generate a rank 1 tensor structure by calculating the Kronecker product of d vectors (ie, x 1,k ,…,x d,k ) to generate a rank 1 tensor structure of order d (i.e. ) to construct a symbolic vector (also denoted as u k ). The Kronecker product is a form of matrix multiplication, expressed in mathematical notation The Kronecker product is also called the tensor product (or direct product). Using the Kronecker product is beneficial because the dimensions of the matrices that are multiplied together based on the Kronecker product do not need to have any relationship to each other. 1,k ,…,x d,k ) is expressed as The constructed symbol vector has a multi-dimensional data structure. In addition, the information carried by the constructed symbol vector is consistent with the input message (ie, the binary message m) obtained by the sending device 202 and encoded by the encoding circuit 204. k ) carries the same information. The constructed symbolic vector can also be called a d-order rank 1 tensor structure, which means that the constructed symbolic vector can be understood as a d-dimensional array of real and complex numbers. The dimensions of the d-dimensional arrays of real and complex numbers are T1…T d (It can be expressed as an order of "d" and a size of "T1×…T d "). The tensor structure contains The numbers can also be stored in a sequence (predefined order) in a Any potential representation is The tensor structure (where "x 1,k ,…,x d,k " refers to the dimensions T1…T d A vector of a symbol vector) is generally referred to as a rank 1 tensor structure. In the case where the tensor structure can be expressed as the sum of at least n vectors, the tensor structure can be considered a rank n tensor. Using the Kronecker product is advantageous because the Kronecker product can form a definite and fixed tensor structure (i.e., a definite multidimensional data structure) of the symbol vector, which simplifies the waveform design for random access communication.

[0066] According to one embodiment, the Kronecker product circuit 206 is used to apply a rotation to each of the d vectors by multiplying each of the d vectors by a rotation matrix before calculating the Kronecker product. In one implementation, the Kronecker product circuit 206 is used to apply a rotation to each of the d vectors (i.e., x ) by multiplying each of the d vectors by a rotation matrix before calculating the Kronecker product. 1,k ,…,x d,k ) and the rotation matrix (also represented as U i ) and apply a rotation to each of the d vectors. For any sub-constellation (i.e., C i ), by converting the sub-constellation (i.e. C i ) and the rotation matrix (i.e. U i ) and multiply them to get the rotated sub-constellation (also expressed as C i′). Or, if the sub-constellation (i.e. C i ) is represented by (c i,j ), Then the rotated sub-constellation (i.e. C i ′) is represented by c′ i,j , Among them, c′ i,j =U i c i,j The rotation matrix (i.e. U i ) provides additional degrees of freedom for the design of sub-constellations. Specifically, the use of structured sub-constellations combined with the rotation matrix (i.e., U i ) can reduce the complexity at the receiving device 104 and improve the performance in estimating and compensating for timing offset and carrier frequency offset. i The choice of ) has an impact on the performance of estimating time offset and carrier frequency offset. i Examples of choices of ) are Fourier matrices, combinations of given rotations, normalized Hadamard matrices, etc. Timing offset and carrier frequency offset can also be determined by considering the rotation matrix (i.e., U i ) is optimized, and the rotation matrix can maximize the minimum distance between all codeword pairs affected by all possible offsets. Alternatively, a matrix that can solve the optimization problem of equation (1) can be selected as the rotation matrix (i.e., U i ).

[0067]

[0068] The transmitting device 202 also includes a mapping circuit 208, which is used to map a symbol vector in a time-frequency grid associated with multiple time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources in the time-frequency resource grid to generate a vector of time-frequency modulation symbols. In the case where the transmitting device (e.g., the transmitting device 202) is not synchronized with the receiving device 104, a time offset and a carrier frequency offset are generated at the transmitting device 202, and the time offset and the carrier frequency offset need to be compensated at the receiving device 104. In addition, it is necessary to perform time-frequency mapping at the transmitting device 202, and it is also necessary to perform corresponding time-frequency demapping at the receiving device 104, and to estimate and compensate for the time offset and the carrier frequency offset. The mapping circuit 208 is used to convert the symbol vector (i.e., u k ) is mapped in a time-frequency grid of OFDM modulation with F frequency subcarriers and S time symbols, for example, Figure 3 It is constructed as a symbolic vector of rank 1 tensor structure of order d>1 (i.e. u k ) is represented by a predefined permutation matrix (which can also be expressed as ) is further parameterized to generate a vector of time-frequency modulation symbols according to equation (2) (also denoted as v k ):

[0069]

[0070] Among them, each x k,i is (i=1,…,d) and T1…T d Time dimension T i vector such that The predefined permutation matrix (i.e., A) can be viewed as a permutation matrix that transforms the symbol vector (i.e., u k ) onto a time-frequency grid associated with multiple time-frequency resources. The predefined permutation matrix (i.e., A) defines the symbol vector (i.e., u k ) and the time-frequency grid. For each mode, i = 1, ..., d, the vector The information belongs to the known vector codebook, represented by C i The obtained time-frequency modulation symbol (ie, v k ) is expressed as At each transmitting device (e.g., transmitting device 202), the frequency domain signal representation of each of the time-frequency modulation symbols having N subcarriers undergoes an inverse discrete Fourier transform (IDFT) to form N time domain samples. In addition, in order to avoid any inter-symbol interference, a cyclic prefix module is used to add a length of N to the cyclic prefix. CP A cyclic prefix (CP) of samples of is added to each OFDM symbol (i.e., N time domain samples) at the transmitting device 202. The resulting signal is then converted to the analog domain using a digital-to-analog converter and further up-converted to radio frequency and amplified by using up-conversion and power amplification modules, which are not shown here for simplicity.

[0071] The transmitting device 202 further includes at least one antenna (e.g., antenna 210), which is used to transmit each of the time-frequency modulation symbols to the receiving device 104 via a radio frequency signal. The radio frequency signal is used to transmit each of the time-frequency modulation symbols (i.e., v k ) electromagnetic wave. Each time-frequency modulation symbol vector in the time-frequency modulation symbol vector (ie, v k ) is linearly mapped to a corresponding signal frequency (eg, a carrier), which is sent to ( Figure 1 ) receiving device 104.

[0072] Therefore, when used in a communication system where there is no complete synchronization (or no block fading channel) between the transmitting device 202 (or multiple transmitting devices 102) and the receiving device 104, the transmitting device 202 exhibits a reduced decoding error probability and improved communication reliability. In addition, the transmitting device 202 can be used in a communication system that adopts tensor-based modulation and OFDM, thereby improving spectrum efficiency. The transmitting device 202 includes a time-frequency mapping between tensor elements and the physical resources used, and a rotation parameter (i.e., a rotation matrix U i ) The sub-constellation used within each mode of the tensor. This enables accurate estimation and compensation of timing offset and carrier frequency offset at the receiving device 104, thereby achieving improved communication reliability in the communication system including the transmitting device 202 and the receiving device 104.

[0073] Figure 3 FIG. 1 is a diagram of a time-frequency mapping of a symbol vector in a time-frequency grid according to an embodiment of the present invention. Figure 1 and Figure 2 The element pairs in Figure 3 Describe. Figure 3 , a time-frequency grid 300 representing multiple time-frequency resources is shown. The time-frequency grid 300 includes an X-axis 302 and a Y-axis 304. The X-axis 302 represents the time domain representation, and the Y-axis 304 represents the frequency domain representation.

[0074] The mapping circuit 208 of the transmitting device 202 is used to transform the symbol vector (i.e., u k ) is mapped in a time-frequency grid 300 of OFDM modulation with F frequency subcarriers and S time symbols. A plurality of time-frequency resources of the time-frequency grid 300 are defined according to a predefined permutation matrix (ie, A), wherein the symbol vector (ie, u k ) is mapped to one of the time-frequency resources in the time-frequency grid 300 to generate a vector of time-frequency modulation symbols (ie, v k ). For example, a complex value (i.e., v k (s,f)) corresponds to the time-frequency modulation symbol vector sent in the sth time resource and the fth frequency resource (i.e., v k ). Therefore, the vector of time-frequency modulation symbols (i.e., v k ) can also be called SF-dimensional vector. In order to be consistent with the vectorization operation related to the tensor structure, the SF-dimensional vector can be expressed as the column-first vectorization of the time-frequency matrix, as shown in equation (3):

[0075]

[0076] Figure 4 1 is a flow chart of a method for random access communication according to an embodiment of the present invention. Figure 1 , Figure 2and Figure 3 The element pairs in Figure 4 Described. Figure 4 , showing a method 400 including steps 404 to 414. The method 400 is composed of ( Figure 1 Each of the plurality of sending devices 102 is executed by, or by ( Figure 2 ) sending device 202 executes.

[0077] The method 400 is used for random access communication, wherein a random number of multiple transmitting devices 102 (or transmitting devices 202) may be activated at the same time and may be used to simultaneously transmit multiple radio frequency signals to a receiving device 104 without any prior resource request (or grant). In addition, each transmitting device (or transmitting device 202) in the multiple transmitting devices 102 is not completely synchronized with the receiving device 104, and therefore, a timing offset and a carrier frequency offset are generated during the transmission process from each transmitting device (or transmitting device 202) in the multiple transmitting devices 102 to the receiving device 104, and the timing offset and the carrier frequency offset need to be compensated at the receiving device 104.

[0078] At step 404, the method 400 includes: an encoder of the transmitting device (e.g., the encoding circuit 204 of the transmitting device 202) encodes the input message obtained by the transmitting device into a bit sequence. In one implementation, the input message corresponds to a binary message including a certain number of bits. The input message is further encoded into an encoded message including the bit sequence by using a binary encoder or a polar encoder, etc. The number of bits of the encoded message is greater than the number of bits of the input message to achieve bit redundancy.

[0079] According to an embodiment, the encoder encodes the input message into a bit sequence using a binary code. The input message is encoded into an encoded message using a binary code, such as a remainder 3 code, a Gray code, a reflection code, a sequential code, and the like.

[0080] At step 406 , the method 400 further includes: the encoder dividing the bit sequence into d bit blocks, where d>1. The encoded message having the bit sequence is divided into d bit blocks, where d is an arbitrary number and greater than 1.

[0081] At step 408, the method 400 further includes: the encoder determines d vectors from the d bit blocks, and further encodes the d bit blocks into d vectors based on the number of bits in each of the d blocks.

[0082] According to one embodiment, each of the d vectors is determined by using a corresponding sub-constellation based on the bits in the corresponding bit block, wherein each of the corresponding sub-constellations has a structure selected from at least the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the multiple vectors into a pilot part and a data part. In one implementation, each of the d vectors is obtained from the d bit blocks by using the corresponding sub-constellation. The use of the corresponding sub-constellation is based on the number of bits in each block of the d blocks. Each of the corresponding sub-constellations has a determined and fixed multidimensional data structure. In addition, each of the corresponding sub-constellations has at least one structure selected from the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the multiple vectors into a pilot part and a data part, for example, as mentioned above. Figure 2 Described in .

[0083] At step 410, the method 400 further includes: the Kronecker product circuit 206 of the transmitting device 202 generates a d-order rank 1 tensor structure by calculating the Kronecker product of d vectors to construct a symbol vector. The Kronecker product circuit 206 is used to generate a d-order rank 1 tensor structure by calculating the Kronecker product of d vectors obtained from the d bit blocks to construct the symbol vector. The constructed symbol vector can also be called a d-order rank 1 tensor structure, which means that the constructed symbol vector can be understood as a d-dimensional array of real numbers and complex numbers.

[0084] According to an embodiment, before calculating the Kronecker product, a rotation is applied to each of the d vectors by multiplying each of the d vectors with a rotation matrix. In one implementation, the Kronecker product circuit 206 is used to apply a rotation to each of the d vectors by multiplying each of the d vectors with a rotation matrix before calculating the Kronecker product.

[0085] At step 412, the method 400 further includes: the mapping circuit 208 of the transmitting device 202 maps the symbol vector in a time-frequency grid associated with the plurality of time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources of the time-frequency resource grid to generate a vector of time-frequency modulation symbols. The mapping circuit 208 is used to map the symbol vector in a time-frequency grid of OFDM modulation having F frequency subcarriers and S time symbols, for example, as described above in Figure 3 The symbol vector constructed as a rank-1 tensor structure of order d>1 is further parameterized by a predefined permutation matrix to generate a vector of time-frequency modulation symbols.

[0086] At step 414, the method 400 further includes: at least one antenna 210 of the transmitting device 202 transmits each of the time-frequency modulation symbols to the receiving device 104 via a radio frequency signal. Each of the time-frequency modulation symbol vectors is linearly mapped to a corresponding signal frequency (e.g., a carrier), which is transmitted to the receiving device 104 via the antenna 210 of the transmitting device 202.

[0087] Steps 402 to 414 are merely illustrative, and other alternatives may be provided in which one or more steps are added, one or more steps are deleted, or one or more steps are provided in a different order without departing from the scope of the claims herein.

[0088] In one aspect, a computer program product is provided, which, when executed by one or more processors in a computer system (e.g., processor 212 of sending device 202), performs method 400. In another aspect, a computer system is provided, including one or more processors (e.g., processor 212) and one or more memories (e.g., memory 214), wherein the one or more memories (i.e., memory 214) store program instructions, which, when executed by the one or more processors (i.e., processor 212), cause the one or more processors (i.e., processor 212) to perform method 400. In yet another aspect, the present disclosure provides a non-transitory computer-readable medium having computer-implemented instructions stored thereon, which, when executed by a computer, causes the computer to perform the operations of method 400.

[0089] Figure 5 is a block diagram showing various exemplary components of a receiving device according to an embodiment of the present invention. Figure 1 and Figure 2 The element pairs in Figure 5 Describe. Figure 5 , showing that ( Figure 1 5. Block diagram 500 of a receiving device 104 of the present invention, which includes at least one antenna 502, a separation circuit 504, a plurality of compensation circuits 506, a plurality of decoders 508, a memory 510, and a processor 512. In one implementation, each of the separation circuit 504, the plurality of compensation circuits 506, and the plurality of decoders 508 may be part of the processor 512. In another implementation, each of the separation circuit 504, the plurality of compensation circuits 506, and the plurality of decoders 508 is a separate circuit or module (and may not be part of the processor 512). The separation circuit 504, the plurality of compensation circuits 506, and the plurality of decoders 508 are communicatively coupled to the memory 510 and the antenna 502. The receiving device 104 includes at least one antenna, for example, the antenna 502 (or 1, 2, 3, ..., M antennas).

[0090] At least one antenna 502 may include a Figure 1 The plurality of transmitting devices 102 may include appropriate logic, circuitry, and / or interfaces for receiving the plurality of RF signals. Advantageously, the number of receiving antennas at the receiving device 104 may be less than the number of transmitting signals. An example of an implementation of the antenna 502 is similar to the antenna 210 ( Figure 2 ) is an example of an implementation method.

[0091] The separation circuit 504 may include suitable logic, circuitry, and / or interfaces for arranging each of the radio frequency signals into a time-frequency grid associated with the plurality of time-frequency resources.

[0092] The plurality of compensation circuits 506 may comprise suitable logic, circuitry, and / or interfaces for estimating a respective time offset and a respective frequency offset in a respective one of the plurality of estimated symbol vectors.

[0093] The plurality of decoders 508 may comprise suitable logic, circuitry, and / or interfaces that may be operable to decode a compensation symbol vector generated by one of the compensation circuits to generate a plurality of decoded messages. Each decoder in the plurality of decoders 508 may be a single user decoder.

[0094] The memory 510 may include suitable logic, circuitry, and / or interfaces for storing machine code and / or instructions executable by the processor 512. The memory 510 may temporarily store one or more decoded messages. An example implementation of the memory 510 is similar to ( Figure 2 Memory 510 may store an operating system and / or a computer program product to operate receiving device 104. Computer-readable storage media for providing non-transitory memory may include, but are not limited to, electronic storage devices, magnetic storage devices, optical storage devices, electromagnetic storage devices, semiconductor storage devices, or any suitable combination of the above.

[0095] The processor 512 may include suitable logic, circuitry, and / or interfaces for executing instructions stored in the memory 510. An example of an implementation of the processor 512 is similar to ( Figure 2 An example of an implementation of the processor 212.

[0096] In operation, the receiving device 104 includes at least one antenna 502, which is used to simultaneously receive multiple radio frequency signals from multiple transmitting devices. In a large-scale random access scenario, at least one antenna 502 of the receiving device 104 is used to simultaneously receive multiple radio frequency signals from multiple transmitting devices such as ( Figure 1 Multiple transmitting devices of the multiple transmitting devices 102 receive multiple radio frequency signals.

[0097] The receiving device 104 also includes a separation circuit 504, which is used to arrange each RF signal in the RF signal into a time-frequency grid associated with multiple time-frequency resources according to a predefined permutation matrix to generate multiple estimated symbol vectors from the received multiple RF signals, and use a d-order rank 1 tensor structure associated with each transmitting device to separate the multiple estimated symbol vectors, where d>1. The separation circuit 504 is used to arrange each RF signal in the received RF signal into a time-frequency grid associated with multiple time-frequency resources using an inverse permutation. The inverse permutation corresponds to applying a predefined permutation matrix (also expressed as) to each RF signal in the RF signal received at the receiving device 104. To restore in ( Figure 2 The effect of the predefined permutation matrix (i.e., A) used at the transmitting device 202 is shown in FIG. 2. When the predefined permutation matrix (i.e., A) is applied to each of the received RF signals, Afterwards, a plurality of estimated symbol vectors are generated at the receiving device 104. The plurality of estimated symbol vectors are subjected to tensor decomposition using a canonical multivariate decomposition corresponding to each of the plurality of transmitting devices 102. The canonical multivariate decomposition is used to separate the plurality of estimated symbol vectors into single-user components, thereby outputting Vector symbols The estimated value of Integer Represents the estimated number of messages sent.

[0098] The receiving device 104 further includes a plurality of compensation circuits 506, each of which is used to estimate a corresponding time offset and a corresponding frequency offset in a corresponding estimated symbol vector in the plurality of estimated symbol vectors, and to generate a corresponding compensated symbol vector by applying a time offset compensation based on the corresponding time offset and a frequency offset compensation based on the corresponding frequency offset to the corresponding estimated symbol vector. In the absence of a block fading channel between each of the plurality of transmitting devices 102 and the receiving device 104, a timing offset and a carrier frequency offset may occur at each of the plurality of transmitting devices 102, and the timing offset and the carrier frequency offset need to be compensated at the receiving device 104. Therefore, the plurality of compensation circuits 506 are used to estimate and compensate for the timing offset and the carrier frequency offset at the receiving device 104, for example, Figure 6 and Figure 7 Described in detail in .

[0099] According to an embodiment, each compensation circuit in the plurality of compensation circuits 506 is configured to use a corresponding constellation including a symbol vector and determine a time offset compensation and a frequency offset compensation to minimize a distance between a corresponding estimated symbol vector and a symbol vector of the constellation. Each compensation circuit in the plurality of compensation circuits 506 is configured to use a corresponding constellation including a symbol vector and determine a time offset compensation and a carrier frequency offset compensation to minimize a distance between a corresponding symbol vector and a symbol vector of the constellation, for example, Figure 7 Described in detail in .

[0100] The receiving device 104 also includes a plurality of decoders 508, each decoder is used to decode a compensation symbol vector generated by one of the compensation circuits 506 to generate a plurality of decoded messages, each decoded message including a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices 102. Each decoder in the plurality of decoders 508 is used to decode the compensation symbol vector into a plurality of decoded messages. Each decoded message in the plurality of decoded messages has a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices 102.

[0101] Therefore, when used in a communication system where there is no perfect synchronization (or no block fading channel) between the transmitting device 202 (or multiple transmitting devices 102) and the receiving device 104, the receiving device 104 exhibits a reduced decoding error probability and improved communication reliability. With the time-frequency mapping used at the transmitting device 202 and by using the rotation matrix (i.e., U i ) rotated tensor elements and multiple compensation circuits 506 can achieve accurate estimation and compensation of timing offset and carrier frequency offset, which further reduces the decoding error probability and improves communication reliability. In addition, the receiving device 104 can be used in a communication system that adopts tensor-based modulation and OFDM, thereby improving spectrum efficiency.

[0102] Figure 6 FIG. 1 is a diagram of a timing offset of a symbol vector according to an embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4 and Figure 5 The element pairs in Figure 6 Describe. Figure 6 , a graphical representation 600 is shown, which shows the timing offset of a symbol vector (e.g., OFDM symbol) with three transmitting devices, represented as UE 1, UE 2 and UE 3. The graphical representation 600 includes an X-axis 602 representing the timing parameter. A first line 604 is also shown, which represents the position where the sampling of the symbol vector (i.e., OFDM symbol) starts and the position where the sampling ends.

[0103] In one case, when there is no block fading channel between the transmitting device 202 and the receiving device 104, timing offset and carrier frequency offset occur during the data transmission from the transmitting device 202 to the receiving device 104. It is also assumed that the sampling rate of the analog-to-digital converter at the receiving device 104 is 1 / Δ s , and the channel (ie Figure 1 The communication network 106 in includes a single path. Therefore, according to equation (4), the baseband frequency domain is represented as:

[0104]

[0105] Delay τ k represents the propagation delay between the Kth transmitting device 102K and the receiving device 104, and g k is an M×1 vector, called a steering vector, corresponding to the response of the antenna array (e.g., antenna 502) to the angle of arrival of the path under consideration. k represents the time-correlated effects due to carrier frequency offset and timing offset (or Doppler shift). At the receiving device 104, the receiving device 104 samples the signal for a duration equal to the symbol vector (e.g., OFDM symbol) with its cyclic prefix, removes the cyclic prefix and applies a discrete Fourier transform (DFT) operation to the received samples. Parameters Defined as The M-dimensional vector y(s,f) of one or more RF signals received by all antennas (eg, antenna 502) on subcarrier f of the sth OFDM symbol can be expressed as equation (5):

[0106]

[0107] Where w(s,f) is an M×1 vector representing a random noise term. This shows that conventional tensor-based modulation (TBM) is not applicable to OFDM systems because conventional TBM assumes that the channel is essentially block fading. In fact, in the context of OFDM systems, the block fading assumption holds when multiple transmitting devices 102 and receiving devices 104 are fully synchronized with each other, so in, represents the timing offset, ω kDenotes the carrier frequency offset. In the case of a block fading channel, the channel is flat in time and frequency because the received signal includes channel components that are independent of the frequency subcarrier f and the index of the OFDM symbol s, as shown in equation (6):

[0108]

[0109] Therefore, the conventional TBM is only applicable to the OFDM system when the channel is block fading. Alternatively, it is assumed that each of the multiple transmitting devices 102 and the receiving device 104 are completely synchronized with each other. In another case, when there is no block fading channel between each of the multiple transmitting devices 102 and the receiving device 104, the conventional TBM does not seem to be suitable for use in the OFDM system due to the presence of the timing offset and the carrier frequency offset. However, the receiving device 104 estimates and compensates for the timing offset and the carrier frequency offset, thereby providing a reduced decoding error probability and improved communication reliability.

[0110] If the transmissions are properly synchronized so that for all k, This yields equation (7):

[0111]

[0112] If we assume And ω k ≠0, where k=1, ..., K. The timing offset and carrier frequency offset affect the received signal y by adding a phase slope in both the time domain and the frequency domain for each of the multiple transmitting devices 102 (or users). In other words, equation (7) becomes equation (8):

[0113]

[0114] in, The diagonal matrix can be defined according to equation (9):

[0115]

[0116] In general, vector is not a vectorization of a rank tensor. On the other hand, if we predefine the permutation matrix (i.e., A) and the d vectors (i.e., T1,…,T d ) satisfies the following properties, then is a rank tensor, so that the separation circuit 504 of the receiving device 104 can blindly separate each transmitting device in the plurality of transmitting devices 102 using tensor decomposition. The predefined permutation matrix (ie, A) and the diagonal matrix Satisfies property P. For any and ω k , and for the diagonal matrix There exists a diagonal matrix as expressed in equation (10)

[0117]

[0118] For example, property P is satisfied when:

[0119] -A is the identity matrix, and βi is divided by F, or F is divided by βi, where i = 1, ..., d,

[0120] -A is d permutation matrices The Kronecker product of i Divide by F, or F divided by β i , where i=1,…,d,

[0121] If property P is satisfied, the received RF signal (or multiple RF signals) can then be written as the sum of rank tensors according to equation (11):

[0122]

[0123] Figure 7 is a diagram of a receiving device according to another embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4 , Figure 5 and Figure 6 The element pairs in Figure 7 Describe. Figure 7 , shows a receiving device 104 including a separation circuit 504, a plurality of compensation circuits 506, and a plurality of decoders 508. Also shown is the processing of the radio frequency signal (or multiple radio frequency signals) to obtain multiple decoded messages.

[0124] The antenna 502 of the receiving device 104 is used to simultaneously receive a radio frequency signal (or multiple radio frequency signals) from each of the multiple transmitting devices 102. Thereafter, the separation circuit 504 is used to process the received radio frequency signal (i.e., y) by inverse permutation to further perform multi-user separation. Inverse permutation corresponds to applying a predefined permutation matrix (i.e., To restore in ( Figure 2 The effect of the predefined permutation matrix (i.e., A) used at the transmitting device 202 is shown in FIG. 2. When the predefined permutation matrix (i.e., A) is applied to each of the received RF signals, Afterwards, each signal acts like a d-order rank tensor structure, and then the d-order rank tensor structure is tensor decomposed. The tensor decomposition can be performed by using a canonical multivariate decomposition to separate the multiple estimated symbol vectors, for example, for a first transmitting device (e.g., the first transmitting device 102A) in the multiple transmitting devices 102. For the Kth sending device 102K among the multiple sending devices 102, separate Thus, the separation circuit 504 outputs the Vector symbols The estimate of Integer represents the estimated number of messages sent. Although this number does not prevent the separation of each sending device in the plurality of sending devices 102 (or user separation), assuming property P (e.g., Figure 6 When the timing offset and carrier frequency offset are still satisfied, the multiplication term (i.e. ) affects the information carrying vector. On the other hand, in the presence of timing offset and carrier frequency offset, each of the multiple estimated symbol vectors is used to illustrate the The dependence matrix of ) in the form of different channels, and the estimated symbol vector is compensated by using multiple compensation circuits 506. Then, the timing offset and carrier frequency offset are estimated and compensated for each transmitting device (or user) separately. The compensated symbol vector can be expressed as for the first transmitting device 102A in the multiple transmitting devices 102: Until the Kth sending device 102K among the multiple sending devices 102 is represented as Finally, the compensation symbol vector is decoded into a plurality of decoded messages by using a plurality of decoders 508 (or a single-user decoder). Each decoded message includes a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices 102. For each transmitting device in the plurality of transmitting devices 102, the decoded message may be represented as, for example, a decoded message corresponding to the first transmitting device 102A in the plurality of transmitting devices 102: and a decoded message corresponding to the Kth transmitting device 102K among the plurality of transmitting devices 102 In using a single compensation circuit, abandoning the dependence on the user index k and As the output of the separation circuit 504 to any transmitting device, the timing offset and carrier frequency offset parameters can be estimated by the optimization problem of equation (12):

[0125]

[0126] Selecting Deskew Parameters ω, so that the distance between the corresponding estimated symbol vector and the symbol vector of the constellation (i.e., C) is minimized. Corresponding to symbols for compensating for timing offset and carrier frequency offset, the vector value is used as input to a plurality of decoders 508 .

[0127] Furthermore, in the case where each of the plurality of transmitting devices 102 has N antennas and N>1, operations performed on each of the plurality of transmitting devices 102 and the receiving device 104 may be adjusted in the following manner.

[0128] Option 1: Option 1 consists in modifying the constellation C by C″, where the members of C″ are T×N matrices, consisting of c j a T Definition, all c j ∈C, where a is a fixed vector of size N. Then, the non-coherent multi-user equalizer and the multiple decoders 508 (or single-user decoders) remain unchanged.

[0129] Option 2: Option 2 considers another modification of the constellation mapper (i.e., mapping circuit 208), wherein the symbol vector sent by the Kth transmitting device 102K can be further described according to equation (13):

[0130]

[0131] Among them, each X k,i The size is T i ×N i (i=1…d) matrix, T1,…,T d and N1,…,N d Make and Then, the sub-constellations form the constellation Each C j,i is the dimension T i ×N i The receiving device 104 may then be adjusted accordingly.

[0132] Figure 8 FIG. 1 is a flow chart of a method for random access communication according to another embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4 , Figure 5 , Figure 6 and Figure 7 The element pairs in Figure 8 Described. Figure 8 , showing a method 800 including steps 802 to 808. The method 800 comprises ( Figure 1 ) receiving device 104 executes.

[0133] The method 800 is used for random access communication, wherein a random number of multiple transmitting devices 102 (or transmitting devices 202) may be activated at the same time and may be used to simultaneously transmit multiple radio frequency signals to a receiving device 104 without any prior resource request (or grant). In addition, each transmitting device (or transmitting device 202) in the multiple transmitting devices 102 is not completely synchronized with the receiving device 104. Therefore, a timing offset and a carrier frequency offset are generated during the transmission process from each transmitting device (or transmitting device 202) in the multiple transmitting devices 102 to the receiving device 104, and the timing offset and the carrier frequency offset are compensated at the receiving device 104 in the following manner.

[0134] At step 802, method 800 includes: receiving at least one antenna 502 of device 104 simultaneously from ( Figure 1 In a large-scale random access scenario, at least one antenna 502 of the receiving device 104 is used to simultaneously receive multiple RF signals from ( Figure 1 ) multiple transmitting devices 102 receive multiple radio frequency signals.

[0135] At step 804, the method 800 further includes: the separation circuit 504 of the receiving device 104 arranges each RF signal in the RF signal into a time-frequency grid associated with the multiple time-frequency resources according to the predefined matrix to generate multiple estimated symbol vectors from the received multiple RF signals, and uses the d-order rank 1 tensor structure associated with each transmitting device to separate the multiple estimated symbol vectors, where d>1. The separation circuit 504 is used to arrange each RF signal in the received RF signal into a time-frequency grid associated with the multiple time-frequency resources using the predefined matrix, for example, as described above in Figure 5 After applying the predefined matrix to each of the received radio frequency signals, a plurality of estimated symbol vectors are generated at the receiving device 104. The plurality of estimated symbol vectors are tensor-decomposed using a canonical multivariate decomposition corresponding to each of the plurality of transmitting devices 102. The canonical multivariate decomposition is used to separate the plurality of estimated symbol vectors into single-user components.

[0136] At step 806, the method 800 further includes: the plurality of compensation circuits 506 of the receiving device 104 estimate the time offset and the frequency offset in each of the plurality of estimated symbol vectors, and the compensation circuit generates a plurality of compensated symbol vectors by applying a time offset compensation based on the time offset and a frequency offset compensation based on the frequency offset to the plurality of estimated symbol vectors. At the receiving device 104, the plurality of compensation circuits 506 are used to estimate and compensate for the timing offset and the carrier frequency offset in each of the plurality of estimated symbol vectors, and generate a plurality of compensated symbol vectors by applying a corresponding time offset compensation and a carrier frequency offset compensation to each of the plurality of estimated symbol vectors.

[0137] According to an embodiment, each compensation circuit in the compensation circuits uses a corresponding constellation including a symbol vector and determines a corresponding time offset compensation and a frequency offset compensation to minimize a distance between the estimated symbol vector and a symbol vector of the constellation. Each compensation circuit in the plurality of compensation circuits 506 is configured to use a corresponding constellation including a symbol vector and determine a time offset compensation and a frequency offset compensation to minimize a distance between the corresponding symbol vector and a symbol vector of the constellation, for example, as described above in Figure 7 Described in .

[0138] At step 808, the method 800 further includes: the plurality of decoders 508 in the receiving device 104 decode the plurality of compensation symbol vectors to generate a plurality of decoded messages, each decoded message including a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices 102. Each decoder in the plurality of decoders 508 is used to decode the compensation symbol vector into a plurality of decoded messages. Each decoded message in the plurality of decoded messages has a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices 102.

[0139] Steps 802 to 808 are merely illustrative, and other alternatives may be provided in which one or more steps are added, one or more steps are deleted, or one or more steps are provided in a different order without departing from the scope of the claims herein.

[0140] In one aspect, a computer program product is provided, which, when executed by one or more processors in a computer system (e.g., processor 512 of receiving device 104), performs method 800. In another aspect, a computer system is provided, including one or more processors (e.g., processor 512) and one or more memories (e.g., memory 510), wherein the one or more memories (i.e., memory 510) store program instructions, which, when executed by the one or more processors (i.e., processor 512), cause the one or more processors (i.e., processor 512) to perform method 800. In yet another aspect, the present disclosure provides a non-transitory computer-readable medium storing computer-implemented instructions, which, when executed by a computer, causes the computer to perform the operations of method 800.

[0141] Fig. 9 is a block diagram showing various exemplary components of a communication device according to an embodiment of the present invention. Figure 1 , Figure 2 and Figure 5 The element pairs in Fig. 9 Described. Fig. 9 , a block diagram 900 of a communication device 902 is shown, the communication device 902 comprising ( Figure 2 ) sending device 202 and ( Figure 1 In another embodiment, the communication apparatus 902 may include a plurality of sending devices 102 and receiving devices 104.

[0142] The communication device 902 including the transmitting device 202 and the receiving device 104 exhibits a reduced decoding error probability and improved communication reliability. In addition, the communication device 902 can be used in large-scale random access scenarios with improved communication reliability and spectrum efficiency. Examples of the communication device 902 may include, but are not limited to, a transceiver, a base station, a user equipment, etc. The communication device 902 including the transmitting device 202 (or multiple transmitting devices 102) and the receiving device 104 can be used for the Internet of Things (IoT), large-scale random access scenarios, uplink multi-input multi-output (MIMO) random access with multiple transmitting devices 102, etc.

[0143] Fig.10 is a graphical representation showing the variation of block error rate (BLER) with respect to signal-to-noise ratio (SNR) according to an embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4, Figure 5 , Figure 6 , Figure 7 , Figure 8 and Fig. 9 The element pairs in Fig.10 Describe. Fig.10 , shows a graphical representation 1000 showing the variation of block error rate (BLER) with respect to signal-to-noise ratio (SNR). The graphical representation 1000 includes an X-axis 1002 representing SNR in decibels (dB) and a Y-axis 1004 representing BLER.

[0144] The graphical representation 1000 is obtained by using an approximate cube partitioning decoder and by Grid search consisting of To illustrate the mixed discrete-continuous low-complexity optimization, the complexity of the optimization criterion is In the graphical representation 1000, a first line 1006 is shown, which represents the change of BLER relative to SNR in the case of no time offset and no phase correction between the cube segmentation constellation and two active user equipments (UE) or transmitting devices. In addition, a second line 1008 represents the change of BLER relative to SNR in the case of a rotated cube segmentation constellation with a time offset of 0.5 cyclic prefix (cyclic prefix, CP) and two active user equipments (UE) or transmitting devices with offset compensation. In addition, a third line 1010 represents the change of BLER relative to SNR in the case of the original cube segmentation modulation (i.e., no rotation) with a time offset of 0.5 CP and two active user equipments (UE) or transmitting devices with offset compensation. In addition, there is a 2 dB SNR difference between the first line 1006 and the third line 1010. However, compared with the third line 1010, the second line 1008 is closer to the first line 1006 and has a 0.5 dB SNR difference with the first line 1006. This means that the change in BLER relative to SNR obtained using the rotated cubic split constellation and timing offset compensation and phase offset compensation is equal to the case where no time offset and phase correction are used. In one implementation, the graphical representation 1000 can be obtained by considering the following: a packet size of 10 bytes, two active user equipment or transmitting devices, 240 potential user equipment (UE), a carrier frequency of 700 MHz, a bandwidth of 6 resource blocks (RB), polar codes for channel coding, 8 base station antennas, 1 UE antenna, a channel model of TDL-A30ns and 3Km / h, no timing offset in the first line 1006, uniformly distributed timing offsets between 0 and 0.5CP in the second line 1008 and the third line 1010, and a numerology with SCS 15kHz and 14 operating systems (OS).

[0145] Fig.11 is a graphical representation showing the variation of BLER with respect to SNR for a cube partitioned constellation according to an embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4 , Figure 5 , Figure 6 , Figure 7 , Figure 8 , Fig. 9 and Fig.10 The element pairs in Fig.11Describe. Fig.11 , shows a graphical representation 1100 having an X-axis 1102 representing SNR in decibels (dB) and a Y-axis 1104 representing BLER.

[0146] The graphical representation 1100 is obtained in the following implementation scenario, wherein each transmitting device (e.g., each transmitting device in the plurality of transmitting devices 102) is configured to transmit an 80-bit payload in OFDM with F=72 frequency subcarriers and S=14 time slots. In addition, the graphical representation 1100 shows the variation of BLER with respect to SNR in the following cases: the ideal case where timing offset and carrier frequency offset are not considered, and thus the plurality of compensation circuits 506 are not present in the receiving device 104; and the timing offset is between 0 and 0.5N. CP Δ s The graphical representation 1100 is obtained by using the same parameters as used to obtain the graphical representation 1000.

[0147] The graphical representation 1100 compares three different cases, for example, the rotation matrix (i.e., U i ) is the first case when the identity matrix, the rotation matrix (i.e., U i ) is a random Fourier rotation matrix, and the rotation matrix (i.e., U i ) is the third case of a random cubic rotation matrix. In addition, three different cases of the rotation matrix are used for comparison of two systems, a first system (e.g., an ideal case) that does not consider timing offset and carrier frequency offset, and a second system with timing offset that is estimated and compensated by using multiple compensation circuits 506 in the receiving device 104. In the graphical representation 1100, the first line 1106 represents no rotation (i.e., U as the identity matrix). i ), the second line 1108 represents the BLER of the Fourier rotation (i.e., U as a random Fourier rotation matrix i ), the third line 1110 represents the third rotation in the first system without timing offset and carrier frequency offset (i.e., U as a random third rotation matrix i ). The following other lines are also shown: The fourth line 1112 represents the BLER without rotation (i.e., U as the identity matrix i ), the fifth line 1114 represents the Fourier rotation (i.e., U as a random Fourier rotation matrix i ), the sixth line 1116 represents the third rotation in the second system with timing offset (i.e., U as a random third rotation matrix i), the timing offset is estimated and compensated by using the plurality of compensation circuits 506 in the receiving device 104. In addition, the graphical representation 1100 shows that the BLERs shown by the fifth line 1114 and the sixth line 1116 are close to the BLERs shown by the first line 1106, the second line 1108, and the third line 1110. Alternatively, the performance of the second system with timing offset estimation and compensation is close to the performance of the first system (or the ideal case) without timing offset and carrier frequency offset. In addition, the rotation matrix (i.e., U i ) improves the performance of the second system in the presence of timing offsets.

[0148] Fig.12 is a graphical representation showing the variation of BLER with respect to SNR for a quadrature amplitude modulation (QAM) constellation according to an embodiment of the present invention. Figure 1 , Figure 2 , Figure 3 , Figure 4 , Figure 5 , Figure 6 , Figure 7 , Figure 8 , Fig. 9 , Fig.10 and Fig.11 The element pairs in Fig.12 Described. Fig.12 , shows a graphical representation 1200 having an X-axis 1202 representing SNR in decibels (dB) and a Y-axis 1204 representing BLER.

[0149] The graphical representation 1200 is obtained in the following implementation scenario, wherein each transmitting device (e.g., each transmitting device in the plurality of transmitting devices 102) is configured to transmit an 80-bit payload in OFDM with F=72 frequency subcarriers and S=14 time slots. In addition, the graphical representation 1200 shows the variation of BLER with respect to SNR in the following cases: an ideal case where there is no timing offset and carrier frequency offset, and thus no plurality of compensation circuits 506 in the receiving device 104; and in comparison, a timing offset between 0 and 0.5N. CP Δ s The case where the compensation circuits 506 are randomly distributed between and there are multiple compensation circuits 506 in the receiving device 104. The graphical representation 1200 is obtained by using the same method as that used to obtain ( Fig.10 ) graphical representation of 1000 and ( Fig.11 ) The graphical representation 1100 is obtained with the same parameters.

[0150] The graphical representation 1200 compares three different situations, for example, the rotation matrix (ie, Ui ) is the first case when the identity matrix, the rotation matrix (i.e., U i ) is a random Fourier rotation matrix, and the rotation matrix (i.e., U i ) is the third case of a random cubic rotation matrix. In addition, three different cases of the rotation matrix are used for comparison of two systems, a first system (e.g., an ideal case) that does not consider timing offset and carrier frequency offset, and a second system with timing offset that is estimated and compensated by using a plurality of compensation circuits 506 in the receiving device 104. In the graphical representation 1200, the first line 1206 represents no rotation (i.e., U as the identity matrix). i ), the second line 1208 represents the BLER of the Fourier rotation (i.e., U as a random Fourier rotation matrix i ), the third line 1210 represents the third rotation in the first system without timing offset and carrier frequency offset (i.e., U as a random third rotation matrix i ). The following other lines are also shown: The fourth line 1212 represents the BLER without rotation (i.e., U as the identity matrix i ), the fifth line 1214 represents the Fourier rotation (i.e., U as a random Fourier rotation matrix i ), the sixth line 1216 represents the third rotation in the second system with timing offset (i.e., U as a random third rotation matrix i ), the timing offset is estimated and compensated by using the plurality of compensation circuits 506 in the receiving device 104. In addition, the graphical representation 1200 shows that the BLERs shown by the fifth line 1214 and the sixth line 1216 are close to the BLERs shown by the first line 1206, the second line 1208, and the third line 1210. Alternatively, the performance of the second system with timing offset estimation and compensation is close to the performance of the first system (or the ideal case) without timing offset and carrier frequency offset. In addition, the rotation matrix (i.e., U i ) improves the performance of the second system in the presence of timing offset. Fig.11 It can be analyzed from the graphical representations 1100 and 1200 that the cube-partitioned constellation can obtain more benefits from offset compensation compared with the QAM constellation using (T1, T2, T3, T4) = (4, 3, 6, 14).

[0151] Without departing from the scope of the present disclosure as defined by the appended claims, the embodiments of the present disclosure described above may be modified. Expressions such as "including / comprising", "incorporating", "have", "is / is" used to describe and claim the present disclosure are intended to be interpreted in a non-exclusive manner, that is, items, components or elements not explicitly described may also exist. References to the singular should also be interpreted as involving the plural. The word "exemplary" used herein means "as an example, instance or illustration". Any embodiment described as "exemplary" is not necessarily interpreted as being more preferred or more advantageous than other embodiments, and / or excluding the incorporation of features from other embodiments. The word "optionally" used herein means "provided in some embodiments and not provided in other embodiments". It should be understood that certain features of the present disclosure described in the context of a separate embodiment for the sake of clarity may also be provided in a single embodiment by combination. Conversely, various features of the present disclosure described in the context of a single embodiment for the sake of clarity may also be provided individually or in any suitable combination or appropriately in any other described embodiment of the present disclosure.

Claims

1. A transmitting device (202) for random access communication, comprising: An encoding circuit (204) is used to encode an input message into a bit sequence, divide the bit sequence into d bit blocks, where d>1, and determine d vectors from the d bit blocks; A Kronecker product circuit (206) for generating a rank-1 tensor structure of order d by calculating the Kronecker product of the d vectors to construct a symbol vector; A mapping circuit (208) for mapping the symbol vector in a time-frequency grid associated with a plurality of time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources of the time-frequency resource grid to generate a vector of time-frequency modulation symbols; and At least one antenna (210) is used to send each of the time-frequency modulation symbols to a receiving device via a radio frequency signal.

2. The sending device (202) according to claim 1, characterized in that The Kronecker product circuit (206) is used to apply a rotation to each of the d vectors by multiplying each of the d vectors with a rotation matrix before calculating the Kronecker product.

3. The sending device (202) according to claim 1 or 2, characterized in that: The encoding circuit (204) is used to determine each of the d vectors by using a corresponding sub-constellation based on bits in a corresponding bit block, wherein each of the corresponding sub-constellations has a structure selected from at least the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the multiple vectors into a pilot part and a data part.

4. The sending device (202) according to any one of claims 1 to 3, characterized in that: The encoding circuit (204) is used to encode the input message into a bit sequence according to a binary code.

5. A receiving device (104) for random access communication, comprising: at least one antenna (502) for simultaneously receiving a plurality of radio frequency signals from a plurality of transmitting devices (102); A separation circuit (504) is used to arrange each of the radio frequency signals into a time-frequency grid associated with a plurality of time-frequency resources according to a predefined permutation matrix to generate a plurality of estimated symbol vectors from the received plurality of radio frequency signals, and to separate the plurality of estimated symbol vectors using a d-order rank 1 tensor structure associated with each transmitting device, wherein d>1; a plurality of compensation circuits (506), each of the compensation circuits being configured to estimate a corresponding time offset and a corresponding frequency offset in a corresponding estimated symbol vector of the plurality of estimated symbol vectors, and to generate a corresponding compensated symbol vector by applying a time offset compensation based on the corresponding time offset and a frequency offset compensation based on the corresponding frequency offset to the corresponding estimated symbol vector; and A plurality of decoders (508), each of the decoders being configured to decode a compensation symbol vector generated by one of the compensation circuits to generate a plurality of decoded messages, each decoded message comprising a bit sequence corresponding to data associated with a corresponding one of the plurality of transmitting devices (102).

6. The receiving device (104) according to claim 5, characterized in that Each compensation circuit of the plurality of compensation circuits (506) is configured to use a corresponding constellation including a symbol vector and determine the time offset compensation and the frequency offset compensation to minimize a distance between the corresponding estimated symbol vector and a symbol vector of the constellation.

7. A communication device (902), comprising the transmitting device (202) according to any one of claims 1 to 4 and the receiving device (104) according to claim 5 or 6.

8. A method (400) for random access communication, comprising: The encoder of the sending device (202) encodes the input message into a bit sequence; The encoder divides the bit sequence into d bit blocks, where d>1; The encoder determines d vectors from the d bit blocks; The Kronecker product circuit (206) of the transmitting device (202) generates a d-order rank 1 tensor structure by calculating the Kronecker product of the d vectors to construct a symbol vector; A mapping circuit (208) of the transmitting device (202) maps the symbol vector in a time-frequency grid associated with a plurality of time-frequency resources according to a predefined permutation matrix, wherein each element of the symbol vector is mapped to one of the time-frequency resources of the time-frequency resource grid to generate a vector of time-frequency modulation symbols; and At least one antenna (210) of the transmitting device (202) transmits each of the time-frequency modulation symbols to the receiving device (104) via a radio frequency signal.

9. The method (400) according to claim 8, characterized in that: Prior to computing the Kronecker product, a rotation is applied to each of the d vectors by multiplying each of the d vectors with a rotation matrix.

10. The method (400) according to claim 8 or 9, characterized in that: Each of the d vectors is determined by using a corresponding sub-constellation based on bits in a corresponding bit block, wherein each of the corresponding sub-constellations has a structure selected from at least the following: a Grassmann constellation, a cube partitioning constellation, or a constellation that divides each of the multiple vectors into a pilot part and a data part.

11. The method (400) according to any one of claims 8 to 10, characterized in that: The encoder encodes the input message into a bit sequence using a binary code.

12. A method (800) for random access communication, comprising: At least one antenna (502) of the receiving device (104) simultaneously receives a plurality of radio frequency signals from a plurality of transmitting devices (102); The separation circuit (504) of the receiving device (104) arranges each of the radio frequency signals into a time-frequency grid associated with a plurality of time-frequency resources according to a predefined matrix to generate a plurality of estimated symbol vectors from the received plurality of radio frequency signals, and separates the plurality of estimated symbol vectors using a d-order rank 1 tensor structure associated with each transmitting device, wherein d>1; A plurality of compensation circuits (506) of the receiving device (104) estimate a time offset and a frequency offset in each of the plurality of estimated symbol vectors; the compensation circuits generate a plurality of compensated symbol vectors by applying a time offset compensation based on the time offset and a frequency offset compensation based on the frequency offset to the plurality of estimated symbol vectors; as well as A plurality of decoders (508) in the receiving device (104) decode the plurality of compensated symbol vectors to generate a plurality of decoded messages, each decoded message comprising a bit sequence corresponding to data associated with a corresponding transmitting device in the plurality of transmitting devices (102).

13. The method (800) according to claim 12, characterized in that: Each of the compensation circuits uses a respective constellation including a symbol vector and determines the respective time offset compensation and the respective frequency offset compensation to minimize a distance between the estimated symbol vector and a symbol vector of the constellation.

14. A computer program product comprising program instructions for executing the method (400) according to any one of claims 8 to 11 and / or the method (800) according to claim 12 or 13 when executed by one or more processors in a computer system.

15. A computer system comprising one or more processors and one or more memories, wherein the one or more memories store program instructions, and when the program instructions are executed by the one or more processors, the one or more processors execute the method (400) according to any one of claims 8 to 11 and / or the method (800) according to claim 12 or 13.