Patent Description:
Multiple access is one of core technologies at a physical layer of wireless communication, enables a wireless network device to distinguish between and serve a plurality of end users, and reduces multi-access interference.

A simple orthogonal multiple access mode is used in most existing wireless communications systems. However, as application scenarios, terminal types, and application types become increasingly rich, a quantity of terminals increases explosively during evolution of a future cellular network. The existing orthogonal multiple access mode cannot meet an increasing requirement of people for an increased cellular network capacity, for example, cannot meet massive accesses and continuous improvement of uplink/downlink data transmission and spectrum efficiency.

With constant deepening of the study and application of a non-orthogonal multiple access technology, people expect that a problem of an increase in a capacity requirement, especially a problem of an increase in an uplink/downlink data transmission throughput requirement, can be resolved effectively for future wireless cellular networks such as fifth generation (<NUM> generation, <NUM>) mobile communications systems by using the non-orthogonal multiple access technology. <CIT> relates to a method for transmitting data over a wireless network to a plurality of receivers connected to the wireless network, wherein a superposition coded multicast or broadcast is applied so as to create a multi-resolution multicast or broadcast signal to transmit data to the plurality of receivers as a scalable multicast.

<CIT> relates to a method for multilevel coding of a stream of information bits in a communication system. The method comprises the steps of: separating the stream of information bits into a plurality of different portions; associating each of the portions of the information bits with one of a plurality of levels; applying at least one code to the portion of the information bits of each level in a designated subset of the plurality of levels, such that the portions of the information bits for one or more levels in the designated subset are coded while the portions of the information bits for one or more levels not in the designated subset are uncoded; and utilizing both the coded portions of the information bits and the uncoded portions of the information bits to select modulation symbols for transmission in the system.

In document <NPL>, the properties of the <NUM>-level SCM capacity is studied using numerical evaluation. Based on the properties, an efficient code rate assignment and power allocation method is proposed to realize a <NUM>-level SCMMU system with minimum transmission power.

<CIT> relates to a control device comprising circuitry configured to communicate with a radio communication device of a radio communication system equipped to use a plurality of alternative access schemes, the plurality of alternative access schemes including at least one of a multiple access scheme that uses orthogonal resources and a multiple access scheme that uses non-orthogonal resources; and allocate resources according to a selected access scheme of the plurality of alternative access schemes.

Embodiments of the invention are defined by the appended claims. This application provides a non-orthogonal data transmission device, so as to increase an uplink/downlink data transmission.

throughput, a corresponding method and a corresponding computer storage medium.

According to a first aspect, an embodiment of this application provides a non-orthogonal data transmission device, including: a splitting unit, a coding unit, and a transmission unit. The splitting unit is configured to split a to-be-transmitted transport block into N code blocks with incompletely equal sizes, wherein N is an integer greater than or equal to <NUM>.

The coding unit is configured to perform error correction coding on the N code blocks to obtain N encoded bit blocks.

The transmission unit is configured to non-orthogonally transmit the N encoded bit blocks by using resources that are the same in at least one dimension of a time domain, a frequency domain, a space domain, and a code domain, wherein the transmission unit is specifically configured to:.

Optionally, in an implementation of the first aspect, the transmission unit is specifically configured to modulate a first bit stream in the M bit streams through quadrature amplitude modulation and/or phase shift modulation, to obtain the M to-be-transmitted symbol streams.

Optionally, in an implementation of the first aspect, modulation schemes of the N code blocks are not completely the same.

Optionally, in an implementation of the first aspect, the coding unit is specifically configured to perform error correction coding on the N code blocks by using incompletely same code rates, to obtain the N encoded bit blocks.

During non-orthogonal data transmission, the to-be-transmitted block is split into the N code blocks with incompletely equal sizes, and error correction coding with different error correction capabilities is performed on the N code blocks, so that performance of all the code blocks is different, and a receive end can gradually demodulate data more easily in an interference cancellation manner, thereby increasing an uplink/downlink data transmission throughput.

According to a second aspect, an embodiment of this application provides a system comprising the non-orthogonal data transmission device according to any implementation of the first aspect, and a second non-orthogonal data transmission device. The second non-orthogonal data transmission device comprises:.

Optionally, in an implementation of the second aspect, the processing unit of the second non-orthogonal data transmission device is specifically configured to demodulate the M symbol streams through quadrature amplitude demodulation and/or phase shift demodulation, to obtain the M bit streams.

Optionally, in an implementation of the second aspect, demodulation schemes of the M symbol streams are not completely the same.

<FIG>, <FIG> and <FIG> correspond to examples not covered by the scope of the claims, but useful for understanding the invention.

The following describes technical solutions in the embodiments of this application with reference to accompanying drawings.

<FIG> is a schematic diagram of a communications system for non-orthogonal data transmission to which this application is applied. As shown in <FIG>, the communications system <NUM> includes a network device <NUM>, and the network device <NUM> may include a plurality of antennas such as antennas <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, and <NUM>. In addition, the network device <NUM> may additionally include a transmitter chain and a receiver chain. A person of ordinary skill in the art may understand that both the transmitter chain and the receiver chain may include a plurality of components that are related to signal transmission and reception (such as a processor, a modulator, a multiplexer, a demodulator, a demultiplexer, or an antenna).

The network device <NUM> may communicate with a plurality of terminal devices (such as a terminal device <NUM> and a terminal device <NUM>). However, it can be understood that the network device <NUM> may communicate with any quantity of terminal devices similar to the terminal device <NUM> or <NUM>. The terminal devices <NUM> and <NUM> may be cellular phones, smartphones, portable computers, handheld communications devices, handheld computing devices, satellite radio apparatuses, global positioning systems, PDAs, and/or any other appropriate devices that are configured to perform communication in the wireless communications system <NUM>.

As shown in <FIG>, the terminal device <NUM> communicates with the antennas <NUM> and <NUM>. The antennas <NUM> and <NUM> send information to the terminal device <NUM> through a forward link <NUM>, and receive information from the terminal device <NUM> through a reverse link <NUM>. In addition, the terminal device <NUM> communicates with the antennas <NUM> and <NUM>. The antennas <NUM> and <NUM> send information to the terminal device <NUM> through a forward link <NUM>, and receive information from the terminal device <NUM> through a reverse link <NUM>.

For example, in a frequency division duplex (Frequency Division Duplex, FDD) system, different frequency bands may be used on the forward link <NUM> and the reverse link <NUM>, and different frequency bands may be used on the forward link <NUM> and the reverse link <NUM>.

For another example, in a time division duplex (Time Division Duplex, TDD) system or a full duplex (Full Duplex) system, a same frequency band may be used on the forward link <NUM> and the reverse link <NUM>, and a same frequency band may be used on the forward link <NUM> and the reverse link <NUM>.

Each antenna (or each antenna group including a plurality of antennas) and/or each region designed for communication are/is referred to as a sector of the network device <NUM>. For example, an antenna group may be designed to communicate with a terminal device that is in a sector of a coverage area of the network device <NUM>. In a process in which the network device <NUM> communicates with the terminal devices <NUM> and <NUM> through the forward links <NUM> and <NUM> respectively, transmit antennas of the network device <NUM> may increase signal-to-noise ratios of the forward links <NUM> and <NUM> through beamforming. In addition, compared with a manner in which a network device uses a single antenna to send signals to all terminal devices served by the network device, when the network device <NUM> sends signals to the terminal devices <NUM> and <NUM> that are randomly scattered in the related coverage area through beamforming, a mobile device in a neighboring cell receives less interference.

Within a given time, the network device <NUM>, the terminal device <NUM>, or the terminal device <NUM> may be a wireless communications sending apparatus and/or a wireless communications receiving apparatus. When sending data, the wireless communication sending apparatus may encode the data for transmission. Specifically, the wireless communication sending apparatus may obtain (for example, generate, receive from another communications apparatus, or store in a memory) a specific quantity of data bits to be sent to the wireless communication receiving apparatus through a channel. Such data bits may be included in a data transport block (or a plurality of transport blocks), and the transport block may be segmented to generate a plurality of code blocks.

In addition, the communications system <NUM> may be a public land mobile network (Public Land Mobile Network, PLMN), a device-to-device (Device-to-Device, D2D) network, a machine-to-machine (Machine-to-Machine, M2M) network, or another network. <FIG> is merely a simplified schematic diagram used as an example. The network may further include another network device that is not graphed in <FIG>.

A transmit end (a receive end) in the embodiments of this application may be a network device. The network device may be a device that communicates with a terminal device. For example, the network device may be a network device controller. Each network device may provide communication coverage to a particular geographical area, and may communicate with a terminal device located in this coverage area (a cell). The network device may be a network device (such as a base transceiver station (Base Transceiver Station, BTS)) in a Global System for Mobile Communications (Global System for Mobile Communications, GSM) or a Code Division Multiple Access (Code Division Multiple Access, CDMA) system, may be a network device (NodeB, NB) in a Wideband Code Division Multiple Access (Wideband Code Division Multiple Access, WCDMA) system, or may be an evolved network device (Evolved NodeB, eNB or eNodeB) in an LTE system, or may be a wireless controller in a cloud radio access network (Cloud Radio Access Network, CRAN). Alternatively, the network device may be a network device in a future <NUM> network, a network device in a future evolved public land mobile network (Public Land Mobile Network, PLMN), or the like.

A receive end (a transmit end) in the embodiments of this application may be a terminal device. The terminal device may be an access terminal, user equipment (User Equipment, UE), a subscriber unit, a subscriber station, a mobile station, a remote station, a remote terminal, a mobile terminal, a user terminal, a terminal, a wireless communications device, a user agent, or a user apparatus. The access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a wireless local loop (Wireless Local Loop, WLL) station, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device having a wireless communication function, a computing device, another processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in the Internet of Things, a virtual reality device, a terminal device in a future <NUM> network, a terminal device in a future evolved public land mobile network (Public Land Mobile Network, PLMN), or the like.

A non-orthogonal data transmission method and device according to the embodiments of this application may be applied to a terminal device or a network device. The terminal device or the network device includes a hardware layer, an operating system layer running above the hardware layer, and an application layer running above the operating system layer. The hardware layer includes hardware such as a central processing unit (Central Processing Unit, CPU), a memory management unit (Memory Management Unit, MMU), and a memory (which is also referred to as a main memory). The operating system may be any one or more types of computer operating systems implementing service processing by using a process (Process), such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a Windows operating system. The application layer includes applications such as a browser, a contact list, word processing software, and instant messaging software. In addition, in the embodiments of this application, a specific structure of an execution body of a data transmission method is not particularly limited in this application, provided that communication can be performed based on the data transmission method in the embodiments of this application by running a program that records code for the data transmission method in the embodiments of this application. For example, an execution body of the data transmission method in the embodiments of this application may be a terminal device or a network device, or may be a function module that is in the terminal device or the network device and that can invoke and execute the program. In addition, aspects or features of this application may be implemented as a method, an apparatus or a product that uses standard programming and/or engineering technologies. The term "product" used in this application covers a computer program that can be accessed from any computer readable component, carrier or medium. For example, the computer readable medium may include but is not limited to: a magnetic storage component (such as a hard disk, a floppy disk, or a magnetic tape), an optical disc (such as a compact disc (Compact Disc, CD), a digital versatile disc (Digital Versatile Disc, DVD), a smart card, and a flash memory device (such as erasable programmable read-only memory (Erasable Programmable Read-Only Memory, EPROM), a card, a stick, or a key drive). In addition, various storage media described in this specification may indicate one or more devices and/or other machine-readable media that are configured to store information. The term "machine-readable media" may include but is not limited to a radio channel, and various other media that can store, contain, and/or carry an instruction and/or data.

It should be noted that in the communications system <NUM> to which the non-orthogonal data transmission method and device in the embodiments of this application are applied, a plurality of terminal devices can perform data transmission with a network device by using a same time-frequency resource. In addition, for example, in time-frequency resource division performed by using a resource element (Resource Element, RE) as a unit, the time-frequency resource may be a time-frequency resource block (which may also be referred to as a time-frequency resource group) including a plurality of REs. In addition, locations of the plurality of REs may be the same in time domain (that is, corresponding to a same symbol) and may differ in frequency domain (that is, corresponding to different subcarriers); or locations of the plurality of REs may differ in time domain (that is, corresponding to different symbols) and may be the same in frequency domain (that is, corresponding to a same subcarrier). This is not particularly limited in this application.

<FIG> is a schematic flowchart of a non-orthogonal data transmission method <NUM> according to an embodiment of this application. As shown in <FIG>, the method <NUM> includes the following content.

In step <NUM>, a to-be-transmitted transport block is split into N code blocks with incompletely equal sizes, where N is an integer greater than or equal to <NUM>.

Optionally, the N code blocks may be code blocks of different sizes.

For example, as shown in <FIG>, for a transport block (Transport Block, TB) whose size is <NUM> bits, that is, a transport block size (Transport Block Size, TBS) of <NUM> bits, the TB is split into two code blocks (Code Block, CB): a CB1 and a CB2, respectively. During the splitting of the TB, a parity bit is configured for data bits generated after the TB is split, that is, a cyclic redundancy check (Cyclic Redundancy Check, CRC) code is configured. Sizes of the CB1 and the CB2 include a value of the CRC code. A size of the CB1 is <NUM> bits, and the CB1 includes <NUM>-bit class-B CRC code. A size of the CB2 is <NUM> bits, and the CB2 includes <NUM>-bit class-A CRC code and the <NUM>-bit class-B CRC code.

Optionally, there may be some code blocks of a same size in the N code blocks.

For example, as shown in <FIG>, a to-be-transmitted block is split into eight code blocks. A CB2 and a CB6 are the same in size, a CB5 and a CB7 are the same in size, and a CB1, the CB2, a CB3, a CB4, the CB5, and a CB8 are different in size.

In step <NUM>, error correction coding is performed on the N code blocks to obtain N encoded bit blocks.

Optionally, error correction coding may be performed on each of the N code blocks in an encoding manner, for example, by using Turbo coding, polar coding, or low-density parity-check coding, to obtain the N encoded bit blocks.

Optionally, error correction coding may be performed on the N code blocks in a plurality of encoding manners.

Optionally, error correction coding is performed on the N code blocks by using incompletely same code rates, to obtain the N encoded bit blocks.

Optionally, sizes of the N code blocks are not completely the same, and the code rates used when error correction coding is performed on the N code blocks is also not completely the same. This embodies that error correction coding with different error correction capabilities is performed on the N code blocks.

Optionally, during non-orthogonal transmission, if a plurality of superposed data streams can have different error correction capabilities, a receive end may gradually demodulate data more easily in an interference cancellation manner.

Optionally, during error correction coding performed on a code block by using a Turbo code, error correction coding is first performed on the code block, and rate matching is performed on bits obtained after error correction coding is performed, to obtain the N encoded bit blocks.

Optionally, when error correction coding is performed on a code block by using polar coding, a size of an encoded bit block is a power of <NUM>.

In step <NUM>, the N encoded bit blocks are non-orthogonally transmitted by using resources that are the same in at least one dimension of a time domain, a frequency domain, a space domain, and a code domain.

Optionally, the same resources may be any type of resource of time domain resources, frequency domain resources, space domain resources, and code domain resources.

Optionally, the same resources may be a plurality of types of resources of time domain resources, frequency domain resources, space domain resources, and code domain resources.

Optionally, the N encoded bit blocks are combined and non-orthogonally transmitted on the resources that are the same in the at least one dimension.

Optionally, the N encoded bit blocks are mapped onto M bit streams, where M is an integer greater than or equal to <NUM>; the M bit streams are modulated to obtain M to-be-transmitted symbol streams, where quantities of modulation symbols in the M to-be-transmitted symbol streams are equal; the M to-be-transmitted symbol streams are superposed to obtain a superposed symbol stream; and the superposed symbol stream is non-orthogonally transmitted.

Optionally, the superposed symbol stream is non-orthogonally transmitted by using the resources that are the same in the at least one dimension of the time domain, the frequency domain, the space domain, and the code domain.

Optionally, a first bit stream in the M bit streams is modulated through quadrature amplitude modulation and/or phase shift modulation, to obtain the M to-be-transmitted symbol streams.

Optionally, the first bit stream may be some of the M bit streams, or may be all of the M bit streams.

It should be understood that modulating the first bit stream in the M bit streams is modulating bits in the first bit stream.

Optionally, when the first bit stream in the M bit streams is modulated through quadrature amplitude modulation and/or phase shift modulation, a size of an ith encoded bit block (Encoded Bit Block, EB) EBi in the N encoded bit blocks may be obtained according to the following formula <NUM>: <MAT> where X represents an order of modulation performed on the first bit stream. Optionally, the total quantity of time-frequency resources has been obtained when data transmission is performed.

Optionally, the order of modulation performed on the first bit stream has been obtained when a modulation scheme is determined.

Optionally, the order of modulation performed on the first bit stream may be <NUM>, <NUM>, <NUM>, and <NUM>.

For example, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is split into two CBs: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. Optionally, multidimensional modulation is performed on a second bit stream in the M bit streams by using a codebook, where the codebook includes two or more than two code words, the code word is a multidimensional complex vector and is used to represent mapping relationships between data and at least two modulation symbols, and the at least two modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol.

Optionally, the second bit stream may be some of the M bit streams, or may be all of the M bit streams.

It should be understood that modulating the second bit stream in the M bit streams is modulating bits in the second bit stream.

Optionally, the codebook may be a sparse code multiple access (Sparse Code Multiple Access, SCMA) codebook.

SCMA is a non-orthogonal multiple access technology. In the technology, a plurality of different data streams are transmitted on a same resource element (that is, the same resource element is used for the plurality of different data streams) by using codebooks, where different codebooks are used for the different data streams. Therefore, resource utilization is improved. The data streams may come from same user equipment, or may come from different user equipments.

The codebook used in SCMA is a set of two or more than two code words.

The code word may be represented as a multidimensional complex vector of two or more than two dimensions, and is used to represent mapping relationships between data and two or more than two modulation symbols. The modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol, and the data may be binary bit data or multivariate data.

The codebook includes two or more than two code words, and the code words may be different from each other. The codebook may represent a mapping relationship between a possible data combination of data of a specific length and a code word in the codebook.

A code word used in SCMA may have sparsity to some extent. For example, a quantity of zero elements in the code word may be not less than a quantity of non-zero elements, so that a receive end can use a multi-user detection technology to perform decoding with relatively low complexity. Herein, the relationship between the quantity of zero elements and the quantity of non-zero elements that is enumerated above is merely an example description of sparsity. The present invention is not limited thereto. A proportion of the quantity of zero elements to the quantity of non-zero elements may be set at random.

In the SCMA technology, data in a data stream is directly mapped onto a code word, that is, a multidimensional complex vector, in a codebook according to a specific mapping relationship, to implement extended sending of the data over a plurality of resource elements. The data herein may be binary bit data or multivariate data. The plurality of resource elements may be resource elements in a time domain, a frequency domain, a space domain, a time-frequency domain, a time-space domain, or a time-frequency-space domain. It should be understood that SCMA is only a name, and another name may alternatively be used in the industry to represent the technology.

Optionally, when multidimensional modulation is performed on the second bit stream in the M bit streams by using the codebook, a size of an ith encoded bit block EBi in the N encoded bit blocks may be obtained according to the following formula <NUM>: <MAT> where F represents a spreading factor, k represents a quantity of bit streams occupied by each encoded bit block, and X represents an order of modulation performed on the second bit stream.

Optionally, the total quantity of time-frequency resources has been obtained when data transmission is performed.

Optionally, the order of modulation performed on the second bit stream has been obtained when a modulation scheme is determined.

Optionally, the spreading factor F is an optimization parameter used in the SCMA technology.

Optionally, the quantity k of bit streams occupied by each encoded bit block EB may be determined based on a mapping relationship of the EB. The EB may be mapped sequentially or pseudorandomly.

Optionally, the order X of modulation performed on the second bit stream may be an SCMA modulation order, and the order may be <NUM>, <NUM>, <NUM>, and <NUM>.

For example, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is split into two CBs: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an encoded bit block (Encoded Bit, EB) is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits.

In a non-claimed example, the N encoded bit blocks are pseudorandomly mapped onto the M bit streams.

According to the invention, the N encoded bit blocks are pseudorandomly mapped onto at least two of the M bit streams after each of the N encoded bit blocks is split, or the N encoded bit blocks are pseudorandomly mapped onto at least two of the M bit streams after at least two of the N encoded bit blocks are combined.

For example, for the case when the encoded bit blocks are split, when the first bit stream in the M bit streams is modulated through quadrature amplitude modulation and/or phase shift modulation, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is split into two CB: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. The EB1 is evenly split into two sub-bit blocks that are respectively labeled as a sub-bit block <NUM> and a sub-bit block <NUM> according to a splitting sequence, and the sub-bit block <NUM> and the sub-bit block <NUM> are randomly mapped onto a bit stream <NUM> and a bit stream <NUM>. The EB2 is evenly split into two sub-bit blocks that are respectively labeled as a sub-bit block <NUM> and a sub-bit block <NUM> according to a splitting sequence, and the sub-bit block <NUM> and the sub-bit block <NUM> are randomly mapped onto the bit stream <NUM> and the bit stream <NUM>. A bit size of the bit stream <NUM> is <NUM> bits, and a bit size of the bit stream <NUM> is <NUM> bits.

For example, when multidimensional modulation is performed on the second bit stream in the M bit streams, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is unevenly split into two CBs: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. The EB1 is evenly split into three sub-bit blocks that are respectively labeled as a sub-bit block <NUM>, a sub-bit block <NUM>, and a sub-bit block <NUM> according to a splitting sequence; and the sub-bit block <NUM>, the sub-bit block <NUM>, and the sub-bit block <NUM> are randomly mapped onto a bit stream <NUM>, a bit stream <NUM>, and a bit stream <NUM>. The EB2 is evenly split into three sub-bit blocks that are respectively labeled as a sub-bit block <NUM>, a sub-bit block <NUM>, and a sub-bit block <NUM> according to a splitting sequence; and the sub-bit block <NUM>, the sub-bit block <NUM>, and the sub-bit block <NUM> are respectively mapped onto the bit stream <NUM>, the bit stream <NUM>, and the bit stream <NUM>. A bit size of the bit stream <NUM> is <NUM> bits, a bit size of the bit stream <NUM> is <NUM> bits, and a bit size of the bit stream <NUM> is <NUM> bits.

For example, for the case when the encoded bit blocks are combined, when multidimensional modulation is performed on the second bit stream in the M bit streams by using the codebook, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is unevenly split into four CBs: a CB1, a CB2, a CB3, and a CB4, respectively. A size of the CB1 is <NUM> bits, a size of the CB2 is <NUM> bits, a size of the CB3 is <NUM> bits, and a size of the CB4 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. An EB3 is obtained after the CB3 is encoded; in this case, an order X of modulation performed on the EB3 is <NUM>, and a size of the EB3 is <NUM> bits. An EB4 is obtained after the CB4 is encoded; in this case, an order X of modulation performed on the EB4 is <NUM>, and a size of the EB4 is <NUM> bits. The EB1 and the EB4 are combined to obtain an EB5, and a size of the EB5 is <NUM> bits. The EB2 and the EB3 are combined to obtain an EB6, and a size of the EB6 is <NUM> bits. The EB5 is evenly split into three sub-bit blocks that are respectively labeled as a sub-bit block <NUM>, a sub-bit block <NUM>, and a sub-bit block <NUM> according to a splitting sequence; and the sub-bit block <NUM>, the sub-bit block <NUM>, and the sub-bit block <NUM> are respectively mapped onto a bit stream <NUM>, a bit stream <NUM>, and a bit stream <NUM>. The EB6 is evenly split into three sub-bit blocks that are respectively labeled as a sub-bit block <NUM>, a sub-bit block <NUM>, and a sub-bit block <NUM> according to a splitting sequence; and the sub-bit block <NUM>, the sub-bit block <NUM>, and the sub-bit block <NUM> are respectively mapped onto the bit stream <NUM>, the bit stream <NUM>, and the bit stream <NUM>. A bit size of the bit stream <NUM> is <NUM> bits, a bit size of the bit stream <NUM> is <NUM> bits, and a bit size of the bit stream <NUM> is <NUM> bits.

In a non-claimed example, the N code blocks are sequentially mapped onto the M bit streams according to an arrangement sequence of bits in each of the N encoded bit blocks.

For example, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is split into two CBs: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. The EB1 is evenly split into two sub-bit blocks that are respectively labeled as a sub-bit block <NUM> and a sub-bit block <NUM> according to a splitting sequence, and the sub-bit block <NUM> and the sub-bit block <NUM> are respectively mapped onto a bit stream <NUM> and a bit stream <NUM>. The EB2 is evenly split into two sub-bit blocks that are respectively labeled as a sub-bit block <NUM> and a sub-bit block <NUM> according to a splitting sequence, and the sub-bit block <NUM> and the sub-bit block <NUM> are respectively mapped onto a bit stream <NUM> and a bit stream <NUM>. A bit size of the bit stream <NUM> is <NUM> bits, a bit size of the bit stream <NUM> is <NUM> bits, a bit size of the bit stream <NUM> is <NUM> bits, and a bit size of the bit stream <NUM> is <NUM> bits.

In a non-claimed example, the N code blocks are sequentially mapped onto the M bit streams according to an arrangement sequence of the N encoded bit blocks.

For example, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is split into two CBs: a CB1 and a CB2, respectively. A size of the CB1 is <NUM> bits, and a size of the CB2 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. The EB1 is mapped onto a bit stream <NUM> and the EB2 is mapped onto a bit stream <NUM> according to an arrangement sequence of the N encoded bit blocks. A bit block size of the bit stream <NUM> is <NUM> bits, and a bit block size of the bit stream is <NUM> bits.

In a non-claimed example, the N encoded bit blocks are randomly mapped onto the M bit streams. In this case, M=N.

For example, as shown in <FIG>, for a TB whose size is <NUM> bits (that is, a TBS is <NUM> bits), the TB is unevenly split into four CBs: a CB1, a CB2, a CB3, and a CB4, respectively. A size of the CB1 is <NUM> bits, a size of the CB2 is <NUM> bits, a size of the CB3 is <NUM> bits, and a size of the CB4 is <NUM> bits. According to the formula <NUM>, an EB is obtained after a CB is encoded. During this period, the total quantity of time-frequency resources is <NUM>, the spreading factor F is <NUM>, and the quantity k of bit streams occupied by each encoded bit block is <NUM>. An EB1 is obtained after the CB1 is encoded; in this case, an order X of modulation performed on the EB1 is <NUM>, and a size of the EB1 is <NUM> bits. An EB2 is obtained after the CB2 is encoded; in this case, an order X of modulation performed on the EB2 is <NUM>, and a size of the EB2 is <NUM> bits. An EB3 is obtained after the CB3 is encoded; in this case, an order X of modulation performed on the EB3 is <NUM>, and a size of the EB3 is <NUM> bits. An EB4 is obtained after the CB4 is encoded; in this case, an order X of modulation performed on the EB4 is <NUM>, and a size of the EB4 is <NUM> bits. The EB1 is mapped onto a bit stream <NUM>, the EB2 is mapped onto a bit stream <NUM>, the EB3 is mapped onto a bit stream <NUM>, and the EB4 is mapped onto a bit stream <NUM>.

According to the invention, the M bit streams are modulated to obtain the M to-be-transmitted symbol streams. The quantities of modulation symbols in the M to-be-transmitted symbol streams are equal.

According to the invention, the M to-be-transmitted symbol streams are superposed to obtain the superposed symbol stream.

For example, as shown in <FIG>, each of the M to-be-transmitted symbol streams includes <NUM> symbols. Symbols in a first to-be-transmitted symbol stream are labeled as 1a, 2a,. , and 10a; symbols in a second to-be-transmitted symbol stream are labeled as 1b, 2b,. , and 10b; symbols in an Mth to-be-transmitted symbol stream are labeled as <NUM>, <NUM>,. , and <NUM>; and symbols in the superposed symbol stream are labeled as <NUM>, <NUM>,. , and <NUM>. , and <NUM> are superposed to obtain a superposed symbol <NUM>; 2a, 2b,. , and <NUM> are superposed to obtain a superposed symbol <NUM>; and 10a, 10b,. , and <NUM> are superposed to obtain a superposed symbol <NUM>. Optionally, the superposed symbol stream is a new symbol stream and may be non-orthogonally transmitted by using same time domain resources, frequency domain resources, space domain resources, and code domain resources.

Therefore, in this embodiment of this application, during non-orthogonal data transmission, the to-be-transmitted block is split into the N code blocks with incompletely equal sizes, and error correction coding with different error correction capabilities is performed on the N code blocks, so that performance of all the code blocks is different, and a receive end can gradually demodulate data more easily in an interference cancellation manner, thereby increasing an uplink/downlink data transmission throughput.

In <NUM>, a received signal is obtained by using the resources that are the same in the at least one dimension of the time domain, the frequency domain, the space domain, and the code domain.

In <NUM>, N encoded bit blocks are obtained by demodulating the received signal, where N is an integer greater than or equal to <NUM>.

Optionally, the obtaining N encoded bit blocks by demodulating the received signal includes: obtaining the received signal, where the received signal includes a superposed symbol stream; evenly splitting the superposed symbol stream to obtain M symbol streams, where quantities of symbols included in all of the M symbol streams are equal, and M is an integer greater than or equal to <NUM>; demodulating the M symbol streams to obtain M bit streams; and demapping the M bit streams to obtain the N encoded bit blocks, where N is an integer greater than or equal to <NUM>.

Optionally, bits in the M bit streams are pseudorandomly demapped to obtain the N encoded bit blocks.

Optionally, bits in the M bit streams are sequentially demapped to obtain the N encoded bit blocks.

Optionally, encoded bit blocks in the M bit streams are sequentially mapped onto the N encoded bit blocks according to an arrangement sequence of the encoded bit blocks in the M bit streams.

Optionally, bits in the M bit streams are sequentially mapped onto the N encoded bit blocks according to an arrangement sequence of the bits in the M bit streams.

Optionally, the M symbol streams are demodulated through quadrature amplitude demodulation and/or phase shift demodulation, to obtain the M bit streams.

Optionally, the M symbol streams are demodulated by using a codebook, to obtain the M bit streams, where the codebook includes two or more than two code words, the code word is a multidimensional complex vector and is used to represent mapping relationships between data and at least two modulation symbols, and the at least two modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol.

Optionally, demodulation schemes of the M symbol streams are not completely the same.

In <NUM>, error correction decoding is performed on the N encoded bit blocks to obtain N code blocks with incompletely equal sizes.

Optionally, error correction decoding is performed on the N encoded bit blocks by using incompletely same code rates, to obtain the N code blocks with incompletely same sizes.

Optionally, error correction decoding is performed in any one of the following decoding manners: a Turbo code, a polar code, and a low-density parity-check code.

In <NUM>, the N code blocks are combined to obtain a transport block.

Optionally, the N code blocks may be code blocks of incompletely equal sizes.

Therefore, in this embodiment of this application, during non-orthogonal data transmission, the N code blocks with incompletely same sizes are obtained through decoding, so that data is demodulated more easily in an interference cancellation manner, thereby increasing an uplink/downlink data transmission throughput.

<FIG> and <FIG> are a schematic flowchart of a non-orthogonal data transmission method <NUM> according to another non-claimed example.

As shown in <FIG> and <FIG>, the method <NUM> includes the following content.

In step <NUM>, a to-be-transmitted transport block is split into N code blocks, where N is an integer greater than or equal to <NUM>.

Optionally, the N code blocks may be code blocks of equal sizes, or may be code blocks of incompletely equal sizes.

Optionally, when the N code blocks are code blocks of incompletely equal sizes, error correction coding may be performed on the N code blocks by using incompletely same code rates, to obtain the N encoded bit blocks.

Optionally, error correction coding is performed on each of the N code blocks to obtain the N encoded bit blocks, where error correction coding is performed in any one of the following encoding manners: a Turbo code, a polar code, and a low-density parity-check code.

Optionally, when error correction coding is performed on each of the N code blocks through polar coding, a size of each of the N encoded bit blocks is a power of <NUM>.

In step <NUM>, the N encoded bit blocks are pseudorandomly mapped onto M bit streams, where M is an integer greater than or equal to <NUM>.

Optionally, the N encoded bit blocks are pseudorandomly mapped onto at least two of the M bit streams after each of the N encoded bit blocks is split.

Optionally, the N encoded bit blocks are pseudorandomly mapped onto at least two of the M bit streams after at least two of the N encoded bit blocks are combined.

In step <NUM>, the M bit streams are modulated to obtain M to-be-transmitted symbol streams, where quantities of modulation symbols included in all of the M to-be-transmitted symbol streams are equal.

Optionally, when the first bit stream in the M bit streams is modulated through quadrature amplitude modulation and/or phase shift modulation, a size of an ith encoded bit block EBi in the N encoded bit blocks may be obtained according to the following formula <NUM>: <MAT> where X represents an order of modulation performed on the first bit stream. Optionally, multidimensional modulation is performed on a second bit stream in the M bit streams by using a codebook, where the codebook includes two or more than two code words, the code word is a multidimensional complex vector and is used to represent mapping relationships between data and at least two modulation symbols, and the at least two modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol.

Optionally, modulation schemes of the N code blocks are not completely the same.

In step <NUM>, the M to-be-transmitted symbol streams are superposed to obtain a superposed symbol stream.

In step <NUM>, the superposed symbol stream is non-orthogonally transmitted by using same time domain resources, frequency domain resources, space domain resources, and code domain resources.

Therefore, in this embodiment of this application, during non-orthogonal data transmission, the to-be-transmitted block is split into the N code blocks, and the N encoded bit blocks are pseudorandomly mapped onto the M bit streams, so that performance of all the bit streams is different, thereby increasing an uplink/downlink data transmission throughput.

In step <NUM>, the superposed symbol stream is received.

In step <NUM>, the superposed symbol stream is evenly split to obtain M symbol streams, where quantities of symbols included in all of the M symbol streams are equal, and M is an integer greater than or equal to <NUM>.

In step <NUM>, the M symbol streams are demodulated to obtain M bit streams.

In step <NUM>, the M bit streams are demapped to obtain N encoded bit blocks, where N is an integer greater than or equal to <NUM>.

In step <NUM>, error correction decoding is performed on the N encoded bit blocks to obtain N code blocks.

Optionally, error correction decoding is performed on the N encoded bit blocks to obtain the N code blocks, where error correction decoding is performed in any one of the following decoding manners: a Turbo code, a polar code, and a low-density parity-check code.

In step <NUM>, the N code blocks are combined to obtain a transport block.

It should be understood that for each step in a non-orthogonal data transmission method <NUM> according to another embodiment of this application, reference may be made to a corresponding step in the method <NUM> in <FIG>. For brevity, details are not described herein again.

Therefore, in this embodiment of this application, during non-orthogonal data transmission, bit streams with different performance are obtained, so that data is demodulated more easily in an interference cancellation manner, thereby increasing an uplink/downlink data transmission throughput.

<FIG> is a schematic block diagram of a non-orthogonal data transmission device <NUM> according to an embodiment of this application. As shown in <FIG>, the device <NUM> includes:.

According to the invention,
the transmission unit <NUM> is specifically configured to:.

In a non-claimed example, the transmission unit <NUM> is specifically configured to:
pseudorandomly map the N encoded bit blocks onto the M bit streams.

In a non-claimed example,
the transmission unit <NUM> is specifically configured to:
sequentially map the N encoded bit blocks onto the M bit streams according to an arrangement sequence of the N encoded bit blocks and/or an arrangement sequence of bits in each of the N encoded bit blocks.

Optionally, the transmission unit <NUM> is specifically configured to:.

Optionally, the coding unit <NUM> is specifically configured to:
perform error correction coding on the N code blocks by using incompletely same code rates, to obtain the N encoded bit blocks.

Optionally, the coding unit <NUM> performs error correction coding in any one of the following encoding manners: a Turbo code, a polar code, and a low-density parity-check code.

It should be understood that the foregoing and other operations and/or functions of the units in the non-orthogonal data transmission device <NUM> according to this embodiment of this application are intended to implement corresponding procedures of a transmit end in the method <NUM> in <FIG>. For brevity, details are not described herein again.

<FIG> is a schematic block diagram of a non-orthogonal data transmission device <NUM> according to another non-claimed example.

As shown in <FIG>, the device <NUM> includes:.

Optionally, the mapping unit <NUM> is specifically configured to:
split each of the N encoded bit blocks and pseudorandomly map the N encoded bit blocks onto at least two of the M bit streams; or pseudorandomly map the N encoded bit blocks onto at least two of the M bit streams after at least two of the N encoded bit blocks are combined.

Optionally, the modulation unit <NUM> is specifically configured to:.

Optionally, the coding unit <NUM> is specifically configured to:
perform error correction coding on each of the N code blocks to obtain the N encoded bit blocks, where error correction coding is performed in any one of the following encoding manners: a Turbo code, a polar code, and a low-density parity-check code.

It should be understood that the foregoing and other operations and/or functions of the units in a non-orthogonal data transmission device <NUM> according to this embodiment of this application are intended to implement corresponding procedures of a transmit end in the method <NUM> in <FIG> and <FIG>. For brevity, details are not described herein again.

<FIG> is a schematic block diagram of a data transmission device <NUM> according to an embodiment of this application. As shown in <FIG>, the device <NUM> includes:.

Optionally, the processing unit <NUM> is configured to:
obtain the received signal, where the received signal includes a superposed symbol stream; evenly split the superposed symbol stream to obtain M symbol streams, where quantities of symbols included in all of the M symbol streams are equal, and M is an integer greater than or equal to <NUM>; demodulate the M symbol streams to obtain M bit streams; and demap the M bit streams to obtain the N encoded bit blocks, where N is an integer greater than or equal to <NUM>. Optionally, the processing unit <NUM> is configured to pseudorandomly demap bits in the M bit streams to obtain the N encoded bit blocks.

Optionally, the processing unit <NUM> is configured to sequentially demap bits in the M bit streams to obtain the N encoded bit blocks.

Optionally, the processing unit <NUM> is configured to demodulate the M symbol streams through quadrature amplitude demodulation and/or phase shift demodulation, to obtain the M bit streams. Optionally, the processing unit <NUM> is configured to demodulate the M symbol streams by using a codebook, to obtain the M bit streams, where the codebook includes two or more than two code words, the code word is a multidimensional complex vector and is used to represent mapping relationships between data and at least two modulation symbols, and the at least two modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol.

Optionally, the decoding unit <NUM> is configured to:
perform error correction decoding on the N code blocks by using incompletely same code rates, to obtain the N code blocks with incompletely same sizes.

Optionally, the decoding unit <NUM> performs error correction decoding in any one of the following decoding manners: a Turbo code, a polar code, and a low-density parity-check code.

It should be understood that the foregoing and other operations and/or functions of the units in a non-orthogonal data transmission device <NUM> according to this embodiment of this application are intended to implement corresponding procedures of the receive end in the method <NUM> in <FIG>. For brevity, details are not described herein again.

Optionally, the demapping unit <NUM> is configured to:
pseudorandomly demap bits in the M bit streams to obtain the N encoded bit blocks.

Optionally, the demapping unit <NUM> is configured to:
sequentially demap bits in the M bit streams to obtain the N encoded bit blocks.

Optionally, the demodulation unit <NUM> is configured to:
demodulate the M symbol streams through quadrature amplitude demodulation and/or phase shift demodulation, to obtain the M bit streams.

Optionally, the demodulation unit <NUM> is configured to:
demodulate the M symbol streams by using a codebook, to obtain the M bit streams, where the codebook includes two or more than two code words, the code word is a multidimensional complex vector and is used to represent mapping relationships between data and at least two modulation symbols, and the at least two modulation symbols include at least one zero modulation symbol and at least one non-zero modulation symbol.

Optionally, the decoding unit <NUM> is configured to:
perform error correction decoding on the N encoded bit blocks to obtain the N code blocks, where error correction decoding is performed in any one of the following decoding manners: a Turbo code, a polar code, and a low-density parity-check code.

It should be understood that the foregoing and other operations and/or functions of the units in a non-orthogonal data transmission device <NUM> according to this embodiment of this application are intended to implement corresponding procedures of the receive end in the method <NUM> in <FIG> and <FIG>. For brevity, details are not described herein again.

<FIG> is a schematic block diagram of a communications apparatus <NUM> according to an embodiment of this application. The apparatus <NUM> includes:.

Optionally, when the code is executed, the processor <NUM> can implement operations performed by a transmit end device in the method <NUM>. For brevity, details are not described herein again. In this case, the communications apparatus <NUM> may be a terminal device or a network device. The transceiver <NUM> is configured to perform specific signal transceiving under the driving of the processor <NUM>.

Optionally, when the code is executed, the processor <NUM> can implement operations performed by a transmit end device in the method <NUM>. For brevity, details are not described herein again. In this case, the communications apparatus <NUM> may be a terminal device or a network device.

Optionally, when the code is executed, the processor <NUM> can implement operations performed by a receive end device in the method <NUM>. For brevity, details are not described herein again. In this case, the communications apparatus <NUM> may be a terminal device or a network device. The transceiver <NUM> is configured to perform specific signal transceiving under the driving of the processor <NUM>.

Optionally, when the code is executed, the processor <NUM> can implement operations performed by a receive end device in the method <NUM>. For brevity, details are not described herein again. In this case, the communications apparatus <NUM> may be a terminal device or a network device.

It should be understood that in this embodiment of this application, the processor <NUM> may be a central processing unit (Central Processing Unit, CPU), or the processor <NUM> may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or another programmable logic device, discrete gate or transistor logic device, a discrete hardware component, or the like. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.

The memory <NUM> may include a read-only memory and a random access memory, and provide an instruction and data to the processor <NUM>. A part of the memory <NUM> may further include a non-volatile random access memory. For example, the memory <NUM> may further store information of a device type.

The transceiver <NUM> may be configured to implement signal transmission and reception functions, such as frequency modulation and demodulation functions or up-conversion and down-conversion functions.

In an implementation process, at least one step of the foregoing methods may be implemented by using an integrated logic circuit of hardware in the processor <NUM>, or the at least one step may be implemented by using the integrated logic circuit under the driving of a software instruction. Therefore, the communications apparatus <NUM> may be a chip or a chip set. The steps of the methods disclosed with reference to the embodiments of this application may be directly performed by a hardware processor, or may be performed by using a combination of hardware in the processor and a software module. The software module may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, or a register. The storage medium is located in the memory, and the processor <NUM> reads information in the memory and completes the steps in the foregoing methods in combination with hardware of the processor. To avoid repetition, details are not described herein again.

It may be clearly understood by a person skilled in the art that, for convenient and brief description, for a detailed working process of the foregoing system, apparatus, and unit, refer to a corresponding process in the foregoing method embodiments, and details are not described herein again.

The indirect couplings or communication connections between the apparatuses or units may be implemented in electrical, mechanical, or other forms.

The foregoing descriptions are merely specific implementations of this application, but are not intended to limit the protection scope of this application.

Claim 1:
A non-orthogonal data transmission device (<NUM>), comprising:
a splitting unit (<NUM>), configured to split a to-be-transmitted transport block into N code blocks with sizes which are not completely equal,
wherein N is an integer greater than or equal to <NUM>;
a coding unit (<NUM>), configured to perform error correction coding on the N code blocks to obtain N encoded bit blocks; and
a transmission unit (<NUM>), configured to non-orthogonally transmit the N encoded bit blocks by using resources that are the same in at least one dimension of a time domain, a frequency domain, a space domain, and a code domain, wherein the transmission unit (<NUM>) is specifically configured to:
split each of the N encoded bit blocks and pseudorandomly map the split N encoded bit blocks onto at least two of M bit streams; or
pseudorandomly map the N encoded bit blocks onto at least two of M bit streams after at least two of the N encoded bit blocks are combined, wherein M is an integer greater than <NUM>;
modulate the M bit streams to obtain M to-be-transmitted symbol streams, wherein quantities of modulation symbols comprised in all of the M to-be-transmitted symbol streams are equal;
superpose the M to-be-transmitted symbol streams to obtain a superposed symbol stream; and
non-orthogonally transmit the superposed symbol stream.