Dual Carrier Index Modulation (DC-IM)

Abstract

Methods and techniques are described for increasing data rate at a high error performance in wireless transmission. A plurality of groups of p bits, wherein p is an integer greater than 1, is obtained. A transmission signal is generated, which includes, for a group of p bits dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero. Based on the p.sub.1 bits, a sequence of modulation schemes is selected from a plurality of predetermined sequences of modulation schemes. The predetermined sequences are mutually different, and each of the predetermined sequences has length R, wherein R is an integer greater than 1. The p.sub.2 bits onto R subcarriers are mapped respectively by means of the R modulation schemes of the selected sequence. Finally, the generated transmission signal is transmitted.

Claims

1. A method for wireless transmission, comprising: obtaining a plurality of groups of p bits, wherein p is an integer greater than 1; generating a transmission signal comprising, for a group of p bits: dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero; selecting, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R, and R is an integer greater than 1; and mapping the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence; and transmitting the generated transmission signal.

2. The method according to claim 1, wherein each of the predetermined sequences has length R=2.

3. The method according to claim 1, wherein the first subgroup is of p.sub.1=log.sub.2A bits, wherein A is the number of the predetermined sequences; and each modulation scheme appearing in the predetermined sequences has a same number, M, of symbols, and the second subgroup is of p.sub.2=log.sub.2M bits.

4. The method according to claim 3, wherein a Hamming distance between any two sequences of the predetermined sequences is R; and/or the number A of the predetermined sequences is smaller than or equal to a number, Q, of mutually different modulation schemes appearing in the predetermined sequences.

5. The method according to claim 4, wherein each of the predetermined sequences I.sub.k, 1≤k≤A≤Q, is given as:
I.sub.k={X.sub.π.sub.1(k),X.sub.π.sub.2(k), . . . , X.sub.π.sub.R(k)}, wherein the X.sub.i, 1≤i≤Q, are the Q mutually different modulation schemes, and the π.sub.j, 1≤j≤R, are R permutations of {1, 2, . . . , Q}.

6. The method according to claim 4, wherein the modulation schemes appearing in the predetermined sequences: can be obtained by partitioning of a Phase Shift Keying or a Quadrature Amplitude Modulation scheme into groups of with M symbols; and/or are mutually related by a rotation in the complex plane.

7. The method according to claim 6, wherein the modulation schemes comprise Binary Phase Shift Keying, BPSK, and Quadrature Binary Phase Shift Keying, QBPSK.

8. The method according to claim 1, wherein a number of the plurality of groups of p bits is $N_p=\frac{N}{R},$ wherein N is a number of subcarrier used for transmitting the N.sub.p groups of p bits; and/or the generating of the transmission signal comprise for each of the N.sub.p groups of p bits, the dividing, the selecting, and the mapping.

9. The method according to claim 8, wherein for each n-th group of the N.sub.p groups, the R subcarriers are subcarriers with the indices n, n+N/R, n+2N/R, . . . , n+(R−1)N/R.

10. A method for wireless reception, the method comprising: receiving a transmission signal; and obtaining, from the received signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero, comprising determining, by performing maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein: the p.sub.2 bits are mapped onto R subcarriers respectively by means of R modulation schemes of a sequence of modulation schemes, wherein R is an integer greater than 1; and the sequence is a sequence of a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, and each of the predetermined sequences has length R and indicates the p.sub.1 bits.

11. The method according to claim 10, wherein each of the plurality of predetermined sequences has length R=2.

12. The method according to claim 10, wherein the first subgroup is of p.sub.1=log.sub.2A bits, wherein A is the number of the predetermined sequences; and each modulation scheme appearing in the predetermined sequences has a same number, M, of symbols, and the second subgroup is of p.sub.2=log.sub.2M bits.

13. The method according to claim 10, wherein a Hamming distance between any two sequences of the predetermined sequences is R; and/or the number A of the predetermined sequences is smaller than or equal to a number, Q, of mutually different modulation schemes appearing in the predetermined sequences.

14. A transmitting device, comprising: circuitry configured to: obtain a plurality of groups of p bits, wherein p is an integer greater than 1; generate a transmission signal comprising, for a group of p bits: divide the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero; select, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R, and R is an integer greater than 1; and map the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence; and a transmitter configured to transmit the generated transmission signal.

15. A receiving device, comprising: a receiver configured to receive a transmission signal; and circuitry configured to: obtain, from the received signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero, comprising determining, by performing maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein: the p.sub.2 bits are mapped onto R subcarriers respectively by means of R modulation schemes of a sequence of modulation schemes, wherein R is an integer greater than 1; and the sequence is a sequence of a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R and indicates the p.sub.1 bits.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0014] An understanding of the nature and advantages of various embodiments may be realized by reference to the following figures.

[0015] FIG. 1 is a block diagram illustrating a communication system;

[0016] FIG. 2 is a schematic drawing illustrating the mapping on Resource Units according to DCM;

[0017] FIG. 3a is a block diagram illustrating a transmitting device;

[0018] FIG. 3b is a block diagram illustrating a receiving device;

[0019] FIG. 4a is a flow diagram illustrating exemplary steps performed by a transmitting device;

[0020] FIG. 4b is a flow diagram illustrating exemplary steps performed by a receiving device;

[0021] FIG. 5 is a schematic drawing illustrating the mapping on Resource Units according to an exemplary embodiment;

[0022] FIG. 6 is a schematic drawing illustrating BPSK and a rotated BPSK constellations;

[0023] FIG. 7 is a graph showing simulation results illustrating bit error rate for an exemplary implementation; and

[0024] FIG. 8 is a graph showing simulation results illustrating packet error rate for an exemplary implementation.

[0025] Like reference numbers and symbols in the various figures indicate like elements, in accordance with certain example implementations.

Description

[0026] For purposes of the description hereinafter, the terms “end,” “upper,” “lower,” “right,” “left,” “vertical,” “horizontal,” “top,” “bottom,” “lateral,” “longitudinal,” and derivatives thereof shall relate to the disclosed subject matter as it is oriented in the drawing figures. However, it is to be understood that the disclosed subject matter may assume various alternative variations and step sequences, except where expressly specified to the contrary. It is also to be understood that the specific devices and processes illustrated in the attached drawings, and described in the following specification, are simply exemplary embodiments or aspects of the disclosed subject matter. Hence, specific dimensions and other physical characteristics related to the embodiments or aspects disclosed herein are not to be considered as limiting unless otherwise indicated.

[0027] No aspect, component, element, structure, act, step, function, instruction, and/or the like used herein should be construed as critical or essential unless explicitly described as such. Also, as used herein, the articles “a” and “an” are intended to include one or more items and may be used interchangeably with “one or more” and “at least one.” Furthermore, as used herein, the term “set” is intended to include one or more items (e.g., related items, unrelated items, a combination of related and unrelated items, and/or the like) and may be used interchangeably with “one or more” or “at least one.” Where only one item is intended, the term “one” or similar language is used. Also, as used herein, the terms “has,” “have,” “having,” or the like are intended to be open-ended terms. Further, the phrase “based on” is intended to mean “based at least partially on” unless explicitly stated otherwise.

[0028] FIG. 1 illustrates an exemplary communication system CS in which Tx represents a transmitter and Rx represents a receiver. The transmitter Tx is capable of transmitting a signal to the receiver Rx over an interface If. The interface may be, for instance, a wireless interface. The interface may be specified by means of resources, which can be used for the transmission and reception by the transmitter Tx and the receiver Rx. Such resources may be defined in one or more (or all) of the time domain, frequency domain, code domain, and space domain. It is noted that in general, the “transmitter” and “receiver” may be also both integrated in the same device. In other words, the devices Tx and Rx in FIG. 1 may respectively also comprise the functionality of the Rx and Tx.

[0029] The present disclosure is not limited to any particular transmitter Tx, receiver Rx and/or interface If implementation. However, it may be applied readily to some existing communication systems as well as to the extensions of such systems, or to new communication systems. Exemplary existing communication systems may be, for instance the 5G New Radio (NR) in its current or future releases, and/or the IEEE 802.11 based systems such as the recently studied IEEE 802.11 be or the like.

[0030] As mentioned in the background section, OFDM is a currently rather popular wideband multi-carrier transmission technology and has been used in many standards such as IEEE 802.11 (Wi-Fi), LTE (Long Term Evolution, which is a mobile communication system of 4th generation, 4G), New Radio (NR, which belongs to 5.sup.th generation, 5G). In OFDM, frequency band is divided into subbands and these bands are called subcarriers. The data symbols, which are obtained by mapping incoming bits with a constellation, are transmitted simultaneously over these subcarriers. A certain number of subcarriers forms a resource unit (RU). For example, an RU may comprise 26, 52, 106, 242, 484 or 996 subcarriers. In Wi-Fi standards such as IEEE 802.11ax (Wi-Fi 6), there are several MCSs which allow to adjust the data rate and communication range. For example, MCS0 corresponds to BPSK with ½ coding rate and it provides the most reliable communication and the lowest data rate among all MCSs. To further extend the communication range and to improve the error performance in Wi-Fi, DCM has been introduced in the expense of reducing the data rate by half. It is noted that the present disclosure can readily be applied to OFDM systems, but is not limited thereto. It is conceivable that the present disclosure may be applied in general to other schemes such as frequency division multiplexing (FDM). The OFDM or the FDM is not limited to using FFT, but may use discrete Fourier transformation (DFT) or other transformations. At the receiver side, the time domain signal is received. Samples belonging to an OFDM symbol are transformed by a (forward) transformation such as fast Fourier transformation or the like. Thereby, modulation symbols mapped onto the subcarriers are obtained and de-mapped.

[0031] DCM is a modulation scheme which may be applied to OFDM based transmission methods. DCM has been involved in IEEE 802.11 ax standard and applied with MCSs 0, 1, 3, and 4. In DCM, an RU with size N (e.g., N subcarriers) is divided into two parts.

[0032] FIG. 2 illustrates an exemplary mapping scheme of DCM-MCS0, i.e. DCM based on BPSK.

[0033] As illustrated in FIG. 2, data symbols (x_n and x_m) of the first and second half of the RU are determined by the same incoming bits to provide frequency diversity, where n∈{1, . . . , N/2} and m=N/2+n are the subcarrier indices for the first and second half of the RU, respectively. Note that the same or different modulation schemes can be used for mapping the incoming bits onto the data symbols of the first and the second half of the RU. The term modulation here refers to mapping of one or more bits onto a signal point out of a plurality of signal points given by the modulation scheme. Arrangement of the signal points in the modulation scheme is sometimes also referred to as constellation. In case of BPSK, one bit of data is mapped onto one data symbol (modulation symbol). In the BPSK, the two possible signal points are typically antipodal, and represent two respective phases differing from each other by pi (180°).

[0034] More specifically, according to DCM-MCS0, N/2 groups of bits are mapped respectively onto the first N/2 subcarriers (e.g., the first N/2 subcarriers, when the subcarriers are ordered according to their index). Furthermore, the same N/2 groups of bits are mapped respectively onto the second N/2 subcarriers (e.g., the last N/2 subcarriers, when the subcarriers are ordered according to their index). In this case, as BPSK mapping is applied, the group size is one, meaning that each of the N/2 groups comprises one bit. In other words, N input bits are split into two branches. In the first branch, the N/2 bits are mapped by means of a first BPSK mapping to the data symbols x_n, whereas in the second branch, the remaining N/2 bits are mapped by means of a second BPSK mapping to the data symbols x_m.

[0035] Since DCM transmits the same information over two different subcarriers of OFDM, it provides reliable communication and extends the communication range. However, for the same reason, the conventional DCM method halves the data rate of any MCS, which is very important metric in wireless communication networks.

[0036] Data rate is one of important metrics for efficiency in the existing wireless communication networks. However, as the data rate increases in a system, the error performance typically gets worse. As previously mentioned, in Wi-Fi technology such as IEEE 802.11ax, there are several MCSs to adjust the data rate and the reliability. For example, MCS0 is the most reliable scheme; nevertheless, its data rate is low compared to schemes with higher layer modulations. The DCM technique may improve the reliability of MCSs and so it may also increase the communication range. However, it may decrease the data rate. In future wireless communication technologies, which aim to provide very high data rates, such as IEEE 802.11 be, it would be desirable to avoid or reduce the decrease in data rate. In the disclosed subject matter, this drawback of DCM is overcome, while still providing close error performance to DCM.

[0037] FIG. 3a illustrates a transmitting device 350 according to some exemplary embodiments. The transmitting device 350 may be a part of any wireless communication device such as STA or AP, or, in general base station or terminal. The transmitting device 350 comprises memory 310, processing circuitry 320, and a wireless transceiver 330 (or a wireless transmitter 330), which may be capable of communicating with each other via a bus 301. The transmitting device 350 may further comprise a user interface 340. However, for some applications, the user interface 340 is not necessary (for instance some devices for machine-to-machine communications or the like).

[0038] The memory 310 may store a plurality of firmware or software modules, which implement some embodiments of the present disclosure. The memory may 310 be read from by the processing circuitry 320. Thereby, the processing circuitry may be configured to carry out the firmware/software implementing the embodiments. The processing circuitry 320 may comprise one or more processors, which, in operation, obtain a plurality of groups of p bits and generate a transmission signal. The generation of the transmission signal comprises, for a group of p bits (or for each group of p bits of the plurality of groups of p bits): i) dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits; ii) selecting, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, wherein the predetermined sequences are mutually different, each of the predetermined sequences has length R, and R is an integer greater than 1; and iii) mapping the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence. The wireless transceiver 330, in operation, transmits the generated transmission signal.

[0039] In correspondence with the above described transmitting device, a communication method for wireless transmission(s) to be performed by a transmitting device is provided. As illustrated in FIG. 4a, the method comprises the step S420 of obtaining a plurality of groups of p bits. The method further comprises a step S430 of generating a transmission signal comprising, for a group of p bits (or for each group of p bits of the plurality of groups of p bits), i) dividing S440 the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, ii) selecting S450, based on the p.sub.1 bits, a sequence of modulation schemes (MS) from a plurality of predetermined sequences of modulation schemes, and iii) mapping S460 the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence. Moreover, the method comprises a step S470 of transmitting the generated S430 transmission signal. Furthermore, the method may comprise a step S410 of obtaining m bits. The group(s) of p bits may then be obtained in step S420 from the m bits as described below.

[0040] The generating S430 of the transmission signal may further comprise performing the OFDM and/or further digital processing (such as MIMO) and analog processing (such as one or more of pulse shaping, power amplification, pre-distortion, modulation onto the designated frequency carrier of the system or the like).

[0041] It is noted that, in the present disclosure, m and p are in general an integer (or natural numbers) greater than 1; and p.sub.1 and p.sub.2 are integers greater than 0. It is further noted that the terms “group of xxx bits” and “xxx bits” are used interchangeably and refer to a sequence of 0 and 1 with length “xxx”. In other words, a group of “xxx bits” may consist of the “xxx bits”.

[0042] In general, the p bits may be obtained from a number m of bits. The m bits may, for instance, be obtained from a higher layer or from a preceding processing which may comprise one or more of forward error correction coding, rate matching, interleaving or the like. These m bits may be divided (or split) into groups of p bits according to some predetermined pattern. E.g., the first p bits of the m bits may be put into the first group of p bits, and so forth (more specifically, the n-th group of p bits would comprise bit the “(n times p)+1”-th bit, the “(n times p)2”-th bit, . . . , up to the “(n+1) times p”-th bit of the m bits). In the present disclosure, the number (count, amount) of groups of p bits is denoted as N.sub.p. In general, the number (count, amount) of the groups of p bits (in the plurality of groups of p bits) may be

[00001]$N_p=\frac{N}{R}.$

In general, there may be one or more groups of p bits. That is, the number N.sub.p is in general an integer greater than zero. That is, there may be one or more groups of p bits (i.e., N.sub.p≥1).

[0043] It is noted that the generating of the transmission signal may comprise for each of the N.sub.p groups of p bits: the dividing, the selecting, and the mapping. More specifically, the generation of the transmission signal may comprise for each of the N.sub.p groups of p bits: i) dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, ii) selecting, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, and iii) mapping the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence.

[0044] In particular, in the splitting, each of the N.sub.p groups of p bits may be split into a same number of p.sub.1 and p.sub.2 bits. That is, the first subgroups obtained by splitting the N.sub.p groups of p bits may have the same size (number of bits), and the second subgroups obtained by splitting the N.sub.p groups of p bits may have the same size (number of bits). However, the presently disclosed subject matter is not limited thereto as, in general, the N.sub.p groups of p bits may be split into subgroups of different sizes.

[0045] Furthermore, in the selecting, for each of the N.sub.p groups of p bits, the modulation scheme may be selected, from the same plurality of predetermined sequences of modulation schemes. However, the presently disclosed subject matter is not limited thereto. In general, each of the N.sub.p groups may have its own/corresponding plurality of predetermined sequences from which a modulation scheme is selected. In general, the N.sub.p groups have the same number, A, of mutually different predetermined sequences from with a sequence is selected. Furthermore, the predetermined sequences of the N.sub.p groups may have the same length R. It is further noted that, for each of the N.sub.p groups of p bits, the selection is based on the first subgroup of p.sub.1 bits obtained by splitting the respective group of p bits.

[0046] Moreover, in the mapping, the p.sub.2 bits of each of the N.sub.p groups are in general mapped onto mutually different R subcarriers. That is, each of the second subgroups obtained by splitting the N.sub.p groups, may be mapped onto a same number, R, of subcarriers. However, these “N.sub.p times R” subcarriers onto which the second subgroups are mapped are, in general, mutually different. It is further noted that, for each of the groups N.sub.p groups, the mapping is performed using sequence of modulation schemes selected for said group (based on the first subgroup of said group).

[0047] It is further noted that, in the present disclosure, the number of subcarriers (amount, count) used per (e.g., for each) group of p bits is denoted as R, and the number (amount, count) of subcarriers used for transmitting the N.sub.p groups of p bits is denoted as N. In general, R and N are integers greater than 1.

[0048] In general, the m bits may be split into

[00002]$N_p=\frac{N}{R}.$

groups of p bits. It is noted that if m is larger than “N/R times p”, only the first “N/2 times p” bits of the m bits may be grouped into the N/R groups of the p bits, and the remaining bits may be transmitted later. For instance, if DCM is used (corresponding to R=2), the m bits may be split into N/2 groups each comprising p bits.

[0049] A group of p bits may be separated or divided into two groups, which, in the present disclosure, are respectively referred to as the first subgroup of p.sub.1 bits and the second subgroup of p.sub.2. For instance, each of the p bits may be put, according to a predetermined or predefined pattern (known to both receiver and transmitter) into either the first or the second subgroup. Accordingly, the sum of p.sub.1 and p.sub.2 may be p=p.sub.1+p.sub.2. For example, the first p.sub.1 of the p bits may be put into the first subgroup, and the last p.sub.2 of the p bits may be put into the second subgroup.

[0050] It is noted that, in the present disclosure, the number (amount, count) of the predetermined sequences is referred to as A, and the number (amount, count) of mutually different modulation schemes appearing in the predetermined sequences (e.g., in all the predetermined combined) is referred to as Q. Furthermore, it is noted that the terms “predetermined sequence” and the term “Mode Activation Pattern” are used interchangeably.

[0051] In general, the predetermined sequences may have the same length R, where R is an integer greater than 1. In other words, each predetermined sequence may have the same number of elements (i.e., modulation schemes). It is noted that, in general, the length of the predetermined sequences and the number of subcarrier onto which the groups are mapped may be the same.

[0052] In general, the predetermined sequences may be mutually different. For instance, in some embodiments, a Hamming distance between any two sequences of the predetermined sequences may be R. This may be written as

d(I.sub.k,I.sub.l)=R, for k≠l,

where k∈{1, 2, . . . , Q}, l∈{1, 2, . . . , Q}, d(v,z) denotes the Hamming distance between v and z, and I.sub.k and I.sub.l are two predetermined sequences.

[0053] In other words, in some embodiments, for each pair of different predetermined sequences, the Hamming distance is equal to the length of the sequences. That is, any two sequences differ at each position.

[0054] Here, the Hamming distance between two sequences of modulation schemes is the number of positions (first, second, . . . , last position in the sequence) at which the corresponding modulation schemes are different. In other words, the Hamming distance between a first and a second sequence is the number of positions at which the modulation scheme of the first sequence and the modulation scheme of the second sequence are different. More specifically, the first, the second, . . . , and the last modulation scheme of the first sequence is respectively compared with the first, the second, . . . , and the last modulation scheme of the second sequence.

[0055] However, from singleton bound (A≤Q.sup.R−d+1), it may only be possible to generate, from Q different modes, at most A=Q different MAPs, which have a Hamming distance of R. Correspondingly in some embodiments, the number A of the predetermined sequences is smaller than or equal to a number, Q, of mutually different modulation schemes appearing in the predetermined sequences.

[0056] In some embodiments (in particular, when DCM is used), each of the predetermined sequences has length R=2. In other words, if DCM is applied over two subcarriers, the length of an/each MAP may be 2 (in other words, the diversity order of 2). Furthermore, in some of the embodiments having R=2, the Hamming distance between any two sequences is 2. In other words, in some embodiments, the condition d(I.sub.k,I.sub.l)=2, is satisfied for all k≠l.

[0057] In some embodiments, each of the predetermined sequences I.sub.k, 1≤k≤A≤Q, is given as: I.sub.k={X.sub.π.sub.1(k), X.sub.π.sub.2(k), . . . , X.sub.π.sub.R(k)}, wherein the X.sub.i, 1≤i≤Q, are the Q mutually different modulation schemes, and the π.sub.j, 1≤j≤R, are R permutations (e.g., re-orderings) of {1, 2, . . . , Q}.

[0058] For example, Q MAPs with a Hamming distance of R may be given as (1≤k≤Q):

I.sub.k={X.sub.k,X.sub.k, . . . , X.sub.k}

By introducing I.sup.n={i.sub.1.sup.n, i.sub.2.sup.n, . . . , i.sub.R.sup.n}, where the i.sub.j.sup.i, with 1≤i.sub.j.sup.i≤Q, represent the mode indices of the corresponding predetermined sequence I.sub.n={X.sub.i.sub.1.sub.n, X.sub.i.sub.2.sub.n, . . . , X.sub.i.sub.R.sub.n}, this may also be written as I.sup.k={k, k, . . . , k}. Another example for Q MAPs with a Hamming distance of R is given as

I.sup.k=(k,k+1, . . . ,Q,1,2 . . . ,Q,1,2 . . . ,R)

Furthermore, in some embodiments with R=2 (DCM), the possible MAPs are obtained as I.sup.a=(a, b), where a∈{1, . . . , Q}, and

b=−(a mod(−(Q+1))=−a mod(Q+1)=Q+1−a

[0059] Modulation Schemes (Also Referred to as Modes or Constellations)

[0060] In general, each modulation scheme X.sub.k appearing in the predetermined sequences has a same number (amount, count), M, of symbols. In other word, each modulation scheme X.sub.k is a set of symbols of size M. Furthermore, the Q mutually different modulation schemes may be such that they do not have an overlap in terms of symbols. In other words, there is no symbol appearing in more than one of the Q mutually different modulation schemes. This may be written as X.sub.k∩X.sub.l=Ø, k∈{1, . . . , Q}, l∈{1, . . . , Q}, for all k≠l. Using non-overlapping modes may enable easier detection of the modes, by the receiver (e.g., by its circuitry) of the modulation schemes selected by the transmitter (e.g., by its circuitry).

[0061] In some embodiments, the modulation schemes appearing in the predetermined sequences can be obtained by partitioning of a Phase Shift Keying (PSK) or Quadrature Amplitude Modulation (QAM) scheme into groups of with M symbols, and/or are mutually related by a rotation in the complex plane.

[0062] For instance, the modulation schemes (or modes) comprise Binary Phase Shift Keying (BPSK) and a Quadrature Binary Phase Shift Keying (QBPSK). This is illustrated in FIG. 6: two modes for BPSK constellations can be obtained by the original BPSK symbols and its rotated version as X.sub.1={1,−1} and X.sub.2={j,−j}, respectively (here, j denotes the imaginary unit, i.e., j.sup.2=−1). In other words, the symbols of a first modulation scheme may be the symbols {1,−1} of the BPSK, and the symbols of a second modulation may be obtained by rotating the BPSK symbols by π/2 in the complex plane. The symbols of the first and the second modulation scheme may be obtained by dividing the symbols of a QPSK (or, more generally, of a modulation scheme having 4 symbols) into two groups, each of the two corresponding to one of the first and the second modulation scheme. For example, the first BPSK mapping maps 0 and 1 onto phases 0 and π, whereas the second BPSK mapping maps 0 and 1 onto phases π/2 and 3 π/2, which correspond to the above mentioned two BPSK constellations. It is noted that the QPSK, and the corresponding two BPSK mappings may be rotated by the same constant angle, e.g. π/4. Then, the first BPSK mapping maps 0 and 1 onto phases π/2 and 5π/2, whereas the second BPSK mapping maps 0 and 1 onto phases 3π/2 and 7π/2. These have been examples for how two obtain two modulation schemes (Q=2), each having two symbols (M=2).

[0063] For example, for MCS0, two modes may be defined as in FIG. 6 and the MAPs may be I.sup.1=(1,2) and I.sup.2=(2,1) to preserve the frequency diversity with d(I.sup.1,I.sup.2)=d(I.sub.1,I.sub.2)=2. Hence, in the present example, a total number of p.sub.1=1 bits can be transmitted for each pair of subcarriers with the selection of the MAP, which may allow to compensate the reduction in the data rate due to transmitting each group of p.sub.2=1 bits over each of two subcarriers.

[0064] In general (i.e., for Q≥2 and M≥2), Q modulation schemes may be obtained by partitioning constellations with at least “Q times M” symbols. For instance, the symbols of 16-QAM may be divided into four groups each having 4 symbols, 8 groups each having 2 symbols, or 2 groups each having 8 symbols. This is not limited to 16-QAM. For instance, the symbols of any QAM (4-QAM, 8-QAM, 16-QAM, 32-QAM, 64-QAM, 256-QAM, etc) or PSK modulation (4-PSK, 8-PSK, 16-PSK, . . . ) may be partitioned.

[0065] Alternatively, new modulation schemes may be obtained from a given modulation scheme by rotating the constellation (e.g., by rotating each symbol) in the complex plane. The given modulation and the rotated modulation schemes will have the same number of symbols.

[0066] In general, any constellation, in particular any QAM and any PSK modulation, may be rotated to obtain (additional) modulation schemes. However, when obtaining modulation schemes X.sub.k, k∈{1, . . . , Q}, by rotating a given constellation, one should rotate said given constellation by angles that the condition X.sub.k∩X.sub.l=Ø, k∈{1, . . . , Q}, l∈{1, . . . , Q}, is satisfied for all k≠l.

[0067] The selecting of the MAP(s) is performed, for each group of p bits, based on the respective p.sub.1 bits, which are the p.sub.1 bits obtained by dividing the respective group of p bits into a first and a second subgroup. In particular, the selection may be performed based on the values of said p.sub.1 bits. In some embodiments, the values of the p.sub.1 bits determine which MAP is selected.

[0068] In general, each of the MAPs may correspond to or be associated with a (single) combination of possible values of p.sub.1 bits. That is, each MAP may indicate, for each of p.sub.1 bits, a corresponding value (e.g., indicates 0 or 1). In particular, in the selecting, a MAP that corresponds to the p.sub.1 bits may be selected. The associations between MAPs and values of the p.sub.1 bits may be predetermined or predefined, and may be known to both the transmitter and the receiver side. Thus, the selection of the MAP, i.e., choice of which MAP is selected, indicates the values of the p.sub.1 bits. Accordingly, at the receiver, the values of the p.sub.1 bits may be determined from the employed MAP.

[0069] In particular, in some embodiments, the first subgroup is of p.sub.1=log.sub.2A bits. That is, the second group comprises or consists of p.sub.1=log.sub.2A bits. In these embodiments, there is a one-to-one correspondence between the MAPs of the plurality of MAPs from which a MAP is selected and the possible values of p.sub.1 bits.

[0070] Indicating the second subgroup of bits by means of the choice of the MAP increases the data rate and still allows god error correction. For instance, having at least M different MAPs (e.g., having Q equal to or greater than M) may allow to overcome/compensate the drawback of a halved data rate due to using DCM. In particular, in comparison to DCM, the mapping schemes (or constellations) that are used for the pair of subcarriers (for R=2) are selected according to one or more additional incoming bit. Therefore, by applying index modulation (IM) to constellation modes, the data rate of DCM may be increased while still providing reliable communication by means of an outstanding error performance. For instance, for R=Q=A=2, it may be possible to transmit one additional bit compared to DCM-MCS0 per pair of subcarriers. Furthermore, in particular for R=2, this allows using the established DCM architecture, already used in IEEE 802.11ax wireless standard.

[0071] In general, for each of the N.sub.p groups of p bits, the p.sub.2 bits are mapped onto R data symbols. This mapping may be performed in accordance with that MAP that has been selected based on the p.sub.1 bits of this group of p bits. At this, each of the R data symbols may be obtained by using, for the mapping of the p.sub.2 bits, one (e.g., a single one) of the R modulation schemes of the selected MAP. Thus, the R data symbols may respectively correspond to the p.sub.2 bits according to the R modulation schemes of the selected MAP. In other words, for each modulation scheme appearing in the selected MAP, the p.sub.2 bits are mapped onto that symbol that corresponds, according said modulation scheme, to the p.sub.2 bits. This may give a sequence of R symbols, wherein each of those R symbols indicates the p.sub.2 bits. Since, each of the modulation schemes has M symbols, the second subgroup may comprise or consist of p.sub.2=log.sub.2M bits.

[0072] Furthermore, for each of the N.sub.p groups of p bits, the R data symbols, obtained by mapping the p.sub.1 bits of this group onto symbols, may be mapped onto R subcarriers, respectively. In particular, in some embodiments (in particular in those in which the predetermined sequences have length R=2), the p.sub.1 bits of each group of p bits are mapped onto two subcarriers. In general, for each of the N.sub.p groups, the R subcarriers onto which the R data symbols are to be mapped, may be predefined or predetermined (e.g., configured by higher-layer signalling) and, in particular, known to the receiver. For instance, in some embodiments, for each n-th group of the N.sub.p groups, the R subcarriers are subcarriers with the indices n, n+N/R, n+2N/R, . . . , n+(R−1)N/R. That is, the R subcarriers onto which the R symbols of the n-th group are mapped may be the subcarriers with the indices n, n+N/R, n+2N/R, . . . , n+(R−1)N/R.

[0073] More specifically, after selecting, based on the values of the p.sub.1 bits, a predetermined sequence I.sub.n={X.sub.i.sub.1.sub.n, X.sub.i.sub.2.sub.n, . . . , X.sub.i.sub.R.sub.n}, the p.sub.2 bits of the n-th group of p bits are mapped onto R data symbols x.sub.1.sup.s.sup.1.sup.n, x.sub.2.sup.s.sup.2.sup.n, . . . , X.sub.R.sup.s.sup.R.sup.n using respectively the R modulation schemes X.sub.i.sub.1.sub.n, X.sub.i.sub.2.sub.n, . . . , X.sub.i.sub.R.sub.n of the selected predetermined sequence I.sub.n. In particular, the same p.sub.2 bits of the n-th group may be mapped onto each of said R data symbols. Here, s.sub.i.sup.n is the indices of the i-th subcarrier used for transmitting the symbols of the n-th group any may be used distinguish the R data symbols of different groups of the p bits.

[0074] The mapping may be performed in accordance with the selected MAP. That is, the order of the R modulation schemes in the MAP may determine which of the R obtained data symbols is mapped onto which of the R subcarriers. For instance, the symbol obtained by using the first modulation scheme (MS) of the MAP may be mapped onto the subcarrier with the lowest index among the indices of the R subcarriers, the symbol obtained by using the second MS may be mapped onto the subcarrier with a second-lowest index among the R subcarriers, and so forth.

[0075] In general, after determining the MAP(s), the same processes may be performed as in DCM. This is illustrated in FIG. 5, which shows an exemplary mapping. As illustrated in FIG. 5, there are N/2 groups of p bits (only the first and N/2-th group are illustrated explicitly, the other groups are indicated by the dots). Each group of the p bits (more specifically, the p.sub.2 bits of each group), is mapped onto two (R=2) subcarriers. That is, the RU may be formed by mapping the p.sub.2 bits of each of the N/2 groups of p bits onto two (R=2) subcarriers.

[0076] More specifically, the p.sub.2 bits of the n-th group of the p bits are mapped onto data symbols x.sup.n=[x.sub.1.sup.n, x.sub.2.sup.m].sup.T, where (.Math.){circumflex over ( )}T denotes transposition. For this, the modulation schemes of the MAP that has been selected, based on the p.sub.1 bits of the n-th group, are used (in FIG. 5, this selected MAP is denoted as I.sup.n). In particular, the first data symbol x.sub.1.sup.n may be obtained by using the first modulation scheme of said MAP, and the second data symbol x.sub.2.sup.m may be obtained by using the second modulation scheme of said MAP. In other words, the data symbols x.sub.1.sup.n and x.sub.2.sup.m are obtained by mapping the same p.sub.2 bits using the first and the second modulation scheme of the selected MAP, respectively.

[0077] For instance, the p.sub.1 bits of the n-th group of p bits may determine the MAP I.sup.n=(i.sub.1.sup.n,i.sub.2.sup.m), where n=1, . . . , N/2, and i.sub.1.sup.n and i.sub.1.sup.m represent the mode indices that are employed over the n-th and m-th subcarriers, respectively. Accordingly, after determining/selecting the MAP I.sup.n, the p.sub.2 bits of the n-th group are mapped using the modes (constellations) X.sub.i.sub.1.sub.n and X.sub.i.sub.1.sub.m onto the data symbols x.sub.i.sub.1.sub.n and x.sub.i.sub.2.sub.m.

[0078] In the example illustrated in FIG. 5, the data symbols x.sub.i.sub.1.sub.n, x.sub.i.sub.2.sub.m obtained by mapping the p.sub.2 bits the n-th group are placed into the Resource Unit (RU) with the indices n and m=n+N/2, respectively. In other words, the data symbols x.sub.i.sub.1.sub.n, x.sub.i.sub.2.sub.m are mapped in the subcarriers with indices n and m=n+N/2, respectively. The RU may be constructed by performing this processes for all n=N/2 groups of p bits.

[0079] FIG. 3b illustrates a receiving device 355 according to some exemplary embodiments. The receiving device 355 comprises memory 315, processing circuitry 325, and a wireless transceiver 335 (or a wireless receiver 330), which may be capable of communicating with each other via a bus 306. The receiving device 355 may further comprise a user interface 345. However, for some applications, the user interface 345 is not necessary (for instance some devices for machine-to-machine communications or the like).

[0080] The transceiver/receiver 335, in operation, receives a transmission signal. The processing circuitry 325 may comprise one or more processors, which, in operation, obtains, from the received transmission signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero. The obtaining comprises determining, by performing maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits. The p.sub.2 bits are mapped (e.g., have been mapped by the transmitting device that transmitted the received signal) onto R subcarriers respectively by means of the R modulation schemes of a sequence of modulation schemes. Furthermore, R is an integer greater than 1, and the sequence is a sequence of a plurality of predetermined sequences of modulation schemes. Moreover, the predetermined sequences are mutually different, and each of the predetermined sequences has length R and indicates the p.sub.1 bits.

[0081] In correspondence with the above described receiving device, a communication method for wireless reception to be performed by a receiving device is provided. As illustrated in FIG. 4b, the method comprises a step S415 of receiving a transmission signal. The method further comprises a step of obtaining S425, from the received transmission signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero. It is noted that, as also indicated in FIG. 4b, the step S425 of obtaining p bits may be performed for each of the N.sub.p groups of p bits. This step of obtaining S425 comprises a step of determining S435, by performing S445 maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits. More specifically, by performing S445 ML detection/estimation, a MAP Î.sup.n and symbols {circumflex over (x)}.sup.n may be determined or estimated. Here, the superscript “n” is an index of the group of p bits, for which step S425 is currently performed. In general, the ML detection/estimation is performed based on the received signal. For instance, the ML detection may be based on the symbols Y.sup.n received in the R subcarriers associated with the respective group of p bits. It is noted that the symbols {circumflex over (x)}.sup.n may comprise a symbol for each of said R subcarriers. Accordingly, by means of the ML detection, for each of the R subcarriers associated with the respective group of p bits, a symbol may be estimated/determined.

[0082] It is further noted that the MAP determined in the ML detection is one of A predetermined MAPs I.sub.k. As already mentioned above, these predetermined MAPs may be known to the transmitter and the receiver (for instance, they may be defined in a standard or configured by a higher-layer signalling).

[0083] Furthermore, the step of obtaining S435 may comprise a step of determining S455, from the MAP (e.g., from the choice of the MAP In among the A predetermined MAPs I.sub.k, 2≤k≤A), the p.sub.1 bits. Moreover, the step of obtaining S435 may comprise a step of determining S465, from the determined symbols, the p.sub.2 bits. This is further explained below.

[0084] As described above, the p.sub.2 bits are mapped (e.g., have been mapped by the transmitting device that transmitted the received signal) onto R subcarriers respectively by means of the R modulation schemes of a sequence of modulation schemes. The sequence is a sequence of a plurality of predetermined sequences of modulation schemes. Moreover the predetermined sequences are mutually different, and each of the predetermined sequences has length R and indicates the p.sub.1 bits. More specifically, each predetermined sequence indicates one combination of values of the p.sub.1 bits. That is, each predetermined sequence indicates, for each of p.sub.1 bits, a corresponding value (e.g., indicates 0 or 1).

[0085] At the receiver, after performing Fast Fourier Transform (FFT), the received signal at the subcarriers n and m=n+N/2, can be given as (for R=2 subcarriers), respectively:

y.sup.n=h.sup.nx.sub.1.sup.n+w.sup.n

y.sup.m=h.sup.mx.sub.2.sup.m+w.sup.m

where h.sup.n and h.sup.m are the channel fading coefficients of subcarriers n and m, respectively; and w.sup.n and w.sup.m represent the noise samples in the frequency domain. The Maximum Likelihood (ML) detection rule may be exploited S445 to obtain i) the MAP Î.sup.n that has been selected, based on the p.sub.1 bits of the n-th group of the N.sub.p groups of p bits, and ii) the data symbols {circumflex over (x)}.sup.4 onto which the p.sub.2 bits of said n-th group are mapped when using said MAP in according to:

[00003]$\left({\hat{I}}^n,{\hat{x}}^n\right)=\underset{I^n,x^n}{\arg \min }{.Math.Y^n-H^n{x}^n.Math.}^2$

where, assuming for R=2 and that the n-th group uses the subcarriers with indices n and m=n+N/2, Y.sup.n=[y.sup.n, y.sup.m].sup.T, H.sup.n=diag([h.sup.n, h.sup.m].sup.T), diag(.Math.) represents diagonalization operation, and x.sup.n=[x.sub.1.sup.n, x.sub.2.sup.m].sup.T comprises the data symbols x.sub.1.sup.n and x.sub.2.sup.m as explained above.

[0086] In general (R≥2 and any mapping pattern of the N.sub.p groups onto subcarriers),

[00004]$Y^n={\left[y^{s_1^n},y^{s_2^n},.Math.,y^{s_R^n}\right]}^T,$$x^n={\left[x_1^{s_1^n},x_2^{s_2^n},.Math.,x_R^{s_R^n}\right]}^T,$${\hat{x}}^n={\left[{\hat{x}}_1^{s_1^n},{\hat{x}}_2^{s_1^n},.Math.,{\hat{x}}_R^{s_1^n}\right]}^T,$$\mathrm{and}{H}^n=\mathrm{diag}\left({\left[h^{s_1^n},h^{s_2^n},.Math.,h^{s_R^n}\right]}^T\right),$

where s.sub.i.sup.n is the indices of the i-th subcarrier used for transmitting the symbols of the n-th group, and y.sup.s.sup.i.sup.n=h.sup.s.sup.i.sup.n=h.sup.s.sup.i.sup.n x.sub.i.sup.s.sup.i.sup.n+w.sup.s.sup.i.sup.n is the signal received at the subcarrier with index s.sub.i.sup.n.

[0087] For instance, a joint determination of the MAP In and the symbols {circumflex over (x)}.sup.4 may be performed based on a ML detection according to

[00005]${\hat{x}}^n=\underset{x^n\in X^k}{\arg \min }{.Math.Y^n-H^n{x}^n.Math.}^2,$

where each X.sup.k comprises all sequences of symbols corresponding to (or consistent with) the MAP I.sub.k=X.sub.i.sub.1.sub.k, X.sub.i.sub.2.sub.k, . . . , X.sub.i.sub.R.sub.k.

[0088] Mathematically, this may be expressed as X.sup.k=X.sub.i.sub.1.sub.k×X.sub.i.sub.2.sub.k× . . . ×X.sub.i.sub.R.sub.k, where “x” denotes the Cartesian product. Since the MAPs I.sub.k are mutually different and the different modulation schemes X.sub.i, 1≤i≤Q, have no symbols in common, each x.sup.n is only comprised in one of the X.sup.k. In other words, there are one-to-one correspondence between the MAPs I.sub.k and the sets of symbol sequences X.sup.k. Accordingly, the MAP In used of mapping the p.sub.2 bits of the n-th group may be determined as the MAP I.sup.k that corresponds to the sets of symbol sequences X.sup.k that comprises the {circumflex over (x)}.sup.n by means of the ML detection.

[0089] In other words, diag(v) is a diagonal matrix (i.e., a matrix having zeros except on its diagonal elements) with diagonal elements corresponding to the elements of the vector v. It is noted that, the receiver may in general perform a joint ML detection of the MAP(s) Î.sup.n and the symbols {circumflex over (x)}.sup.n. However, the presently disclosed subject matter is not limited thereto. For instance, the receiver (e.g., its processing circuitry) may first perform a ML detection to determine MAP(s) employed by the transmitter and, after the MAP(s) have been determined, perform a ML detection of the symbols using the determined MAP(s) Î.sup.n.

[0090] In step S455, the p.sub.1 bits may be determined from the determined MAP Î.sup.n, determined S435 by means of a ML detection. More specifically, the p.sub.1 bits may be determined based on the choice of the MAP Î.sup.n among the A predetermined MAPs I.sub.k, 2≤k≤A. In other words, the p.sub.1 bits may be determined based on which of the A predetermined MAPs has been determined/detected by means of the ML detection.

[0091] In particular, each of the A predetermined MAPs may be associated with or correspond to a particular combination (e.g., a single combination) of values of the p.sub.1 bits. These association between predetermined MAPs and combinations of values may be known to the transmitter and the receiver (for instance, they may be defined in a standard or configured by a higher-layer signalling). Accordingly, in step S455, it may be determined that the p.sub.1 bits have those values that correspond to the detected MAP Î.sup.n.

[0092] In other words, at the receiver, the p.sub.1 bits of a group of p bits may be determined as follows. A ML detection may be performed to determine the MAP that has been used for mapping the p.sub.2 bits onto R symbols. In particular, for each group of p bits, the corresponding R subcarriers, onto each of which the p.sub.2 bits are mapped, may be known to the receiver. For instance, said corresponding R subcarriers may be predefined (e.g., in a standard) or be signaled/indicated by the transmitter (e.g., by higher layer signalling). Thus, the receiver may determine which of the predetermined MAPs (i.e., which I.sup.n) minimizes the above “argmin”-expression for the symbols Y.sup.n received in the R subcarriers. For instance, it may be determined to which of the predetermined MAPs the symbols {circumflex over (x)}.sup.n that minimize the “argmin”-expression correspond.

[0093] Furthermore, in a step S465, the p.sub.2 bits may be determined based on or in accordance with the symbols {circumflex over (x)}.sup.n, determined by means of the ML detection. That is, each of the R determined symbols {circumflex over (x)}.sub.1.sup.s.sup.1.sup.n, {circumflex over (x)}.sub.2.sup.s.sup.1.sup.n, . . . , {circumflex over (x)}.sub.R.sup.s.sup.1.sup.n, in general, corresponds to a particular combination (e.g., a single combination) of values of the p.sub.2 bits. That is, each of the R determined symbols may indicate, for each of p.sub.2 bits, a corresponding value (e.g., indicates 0 or 1).

[0094] Accordingly, in step S465, it may be determined that the p.sub.2 bits have those values that correspond to the detected symbols {circumflex over (x)}.sup.n. Since the transmitter maps the p.sub.2 bits onto each of the R subcarriers, the values of p.sub.2 bits may in general correspond to each of the detected symbols. In case that the R determined symbols {circumflex over (x)}.sub.1.sup.s.sup.1.sup.n, {circumflex over (x)}.sub.2.sup.s.sup.1.sup.n, . . . , {circumflex over (x)}.sub.R.sup.s.sup.1.sup.n do not correspond to the same values of the p.sub.2 bits (e.g., due to an imperfect channel), it may for instance be determined that the p.sub.2 bits have that combination of values that corresponds to more of the determined symbols {circumflex over (x)}.sup.n than any other combination of p.sub.2 bits.

[0095] The method described above with reference to FIG. 5 (denoted as DCIM-MCS0, E standing for enhanced) provides only a slightly worse error performance than the DCM-MCS0 described with reference to FIG. 2, while doubling the data rate, as can be seen in FIG. 7. FIG. 7 shows simulation results in terms of the bit error rate (BER) in Rayleigh channel without additional coding. While the spectral efficiency of DCM-MCS0 is ½ log.sub.22=0.5 bps/Hz, the spectral efficiency of the proposed method is log.sub.22=1 bps/Hz. As can be seen from the figure, alongside the doubling of the spectral efficiency, the DCIM-MCS0 may still provide an outstanding error performance. Here, SNR refers to the Signal to Noise Ratio per bit, defined as E.sub.B/N.sub.0, where E.sub.B is the signal energy per bit and N.sub.0 is the noise spectral density.

[0096] FIG. 8 shows results of a simulation of packet error rate (PER) performance of MCS0, DCM-MCS0, and the exemplary implementation described with reference to FIG. 5. The channel model used in the simulation was channel model B with coding, in particular with a convolutional coding (CC) with coding rate 1/2. Furthermore, in the simulation, a packet comprised 960 byte information. As can be seen from the simulation results, the DCIM-MCS0 provides the same data rate as MCS0 while providing much better error performance. Furthermore, the simulation results show that the error performances of DCM-MCS0 and DCIM-MCS0 is rather close, and that DCIM provides a much higher spectral efficiency than DCM-MCS0. As in FIG. 7, SNR is per bit and defined as E.sub.B/N.sub.0.

[0097] As can be seen from the description above, some embodiments of the present disclosure may provide a relatively simple structure mapping modulation symbols on respective frequencies.

[0098] Moreover, the present disclosure is not limited to selection of two modulation schemes. In some embodiments, more than two modulation schemes can be exploited, thus increasing flexibility in terms of mode selection.

[0099] In some embodiments, the processing circuitry performing the functions described herein may be integrated within an integrated circuit on a single chip. The output of the processing circuitry is the combined signal in time domain. It may be a discrete signal, which the processing circuitry may provide to a transceiver 330 for transmission. The processing circuitry may also implement a control function to control the transceiver 330 to transmit the signal. The transceiver 330 is configured (e.g. by the processing circuitry) to transmit a signal by means of symbols carrying the generated signal. For example, the processing circuitry 320 may configure (control) the transceiver 330, over the bus 301, to transmit the signal. The transceiver may be, for example a wireless transceiver.

[0100] As mentioned above, the program code may cause the processing circuitry (e.g. comprising one or more processors) to operate as a special purpose computer programmed to perform the techniques disclosed herein. The memory 310 is shown in FIG. 3A to be separated from the processing circuitry. However, this is only an example. In general, the memory 310 may be implemented within the processing circuitry, and e.g., within the one or more processors. The term “memory” refers to any type of long term, short term, volatile, nonvolatile, or other memory and is not to be limited to any particular type of memory or number of memories, or type of media upon which memory is stored.

[0101] The methodologies described herein (at the transmitter side and the received side) may be implemented by various means depending upon the application. For example, these methodologies may be implemented in hardware, operation system, firmware, software, or any combination of two or all of them. For a hardware implementation, any processing circuitry may be used, which may comprise one or more processors. For example, the hardware may comprise one or more of application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, any electronic devices, or other electronic circuitry units or elements designed to perform the functions described above.

[0102] If implemented as program code, the functions performed by the transmitting apparatus (device) may be stored as one or more instructions or code on a non-transitory computer readable storage medium such as the memory 310 or any other type of storage. The computer-readable media comprises physical computer storage media, which may be any available medium that can be accessed by the computer, or, in general by the processing circuitry 320. Such computer-readable media may comprise RAM, ROM, EEPROM, optical disk storage, magnetic disk storage, semiconductor storage, or other storage devices. Some particular and non-limiting examples comprise compact disc (CD), CD-ROM, laser disc, optical disc, digital versatile disc (DVD), Blu-ray (BD) disc or the like. Combinations of different storage media are also possible—in other words, distributed and heterogeneous storage may be employed.

[0103] The embodiments and exemplary implementations mentioned above show some non-limiting examples. It is understood that various modifications may be made without departing from the disclosed subject matter. For example, modifications may be made to adapt the examples to new systems and scenarios without departing from the central concept described herein. In particular, the above embodiments and exemplary implementations are multiple-input multiple-output (MIMO) compatible and can be applied to all MCSs.

[0104] Summarizing, methods and techniques are described for increasing data rate at a high error performance in wireless transmission. A plurality of groups of p bits, wherein p is an integer greater than 1, is obtained. Furthermore, a transmission signal is generated. The generation of the transmission signal comprises, for a group of p bits dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero. Furthermore, based on the p.sub.1 bits, a sequence of modulation schemes is selected from a plurality of predetermined sequences of modulation schemes. The predetermined sequences are mutually different, and each of the predetermined sequences has length R, wherein R is an integer greater than 1. Moreover, the p.sub.2 bits onto R subcarriers are mapped respectively by means of the R modulation schemes of the selected sequence. Finally, the generated transmission signal is transmitted.

[0105] A method for wireless transmission is provided, the method comprising the steps of: i) obtaining a plurality of groups of p bits, wherein p is an integer greater than 1; ii) generating a transmission signal comprising, for a group of p bits: dividing the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero; selecting, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R, and R is an integer greater than 1; and mapping the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence; and iii) transmitting the generated transmission signal.

[0106] In some embodiments, each of the predetermined sequences has length R=2.

[0107] In some embodiments, the first subgroup is of p.sub.1=log.sub.2A bits, wherein A is the number of the predetermined sequences; and each modulation scheme appearing in the predetermined sequences has a same number, M, of symbols, and the second subgroup is of p.sub.2=log.sub.2M bits.

[0108] In some embodiments, the Hamming distance between any two sequences of the predetermined sequences is R; and/or the number A of the predetermined sequences is smaller than or equal to a number, Q, of mutually different modulation schemes appearing in the predetermined sequences.

[0109] For example, each of the predetermined sequences I.sub.k, 1≤k≤A≤Q, is given as: I.sub.k={X.sub.π.sub.1(k), X.sub.π.sub.2(k), . . . , X.sub.π.sub.R(k)}, wherein the X.sub.i, 1≤i≤Q, are the Q mutually different modulation schemes, and the π.sub.j, 1≤j≤R, are R permutations of {1, 2, . . . , Q}.

[0110] In some embodiments, the modulation schemes appearing in the predetermined sequences: can be obtained by partitioning of a Phase Shift Keying or a Quadrature Amplitude Modulation scheme into groups of with M symbols; and/or are mutually related by a rotation in the complex plane.

[0111] For example, the modulation schemes comprise Binary Phase Shift Keying, BPSK, and Quadrature Binary Phase Shift Keying, QBPSK.

[0112] In some embodiments, the number of the plurality of groups of p bits is

[00006]$N_p=\frac{N}{R},$

wherein N is a number of subcarrier used for transmitting the N.sub.p groups of p bits; and/or the generating of the transmission signal comprises for each of the N.sub.p groups of p bits, the dividing, the selecting, and the mapping.

[0113] In some embodiments, for each n-th group of the N.sub.p groups, the R subcarriers are subcarriers with the indices n, n+N/R, n+2N/R, . . . , n+(R−1)N/R.

[0114] A method is provided for wireless reception, the method comprising the steps of: i) receiving a transmission signal; and ii) obtaining, from the received signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero, comprising determining, by performing maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein: the p.sub.2 bits are mapped onto R subcarriers respectively by means of R modulation schemes of a sequence of modulation schemes, wherein R is an integer greater than 1; and the sequence is a sequence of a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R and indicates the p.sub.1 bits.

[0115] In some embodiments, each of the plurality of predetermined sequences has length R=2.

[0116] In some embodiments, the first subgroup is of p.sub.1=log.sub.2A bits, wherein A is the number of the predetermined sequences; and each modulation scheme appearing in the predetermined sequences has a same number, M, of symbols, and the second subgroup is of p.sub.2=log.sub.2M bits.

[0117] In some embodiments, the Hamming distance between any two sequences of the predetermined sequences is R; and/or the number A of the predetermined sequences is smaller than or equal to a number, Q, of mutually different modulation schemes appearing in the predetermined sequences.

[0118] A transmitting device is provided, the transmitting device comprising circuitry configured to: i) obtain a plurality of groups of p bits, wherein p is an integer greater than 1; ii) generate a transmission signal comprising, for a group of p bits: divide the group of p bits into a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero; select, based on the p.sub.1 bits, a sequence of modulation schemes from a plurality of predetermined sequences of modulation schemes, wherein: the predetermined sequences are mutually different, each of the predetermined sequences has length R, and R is an integer greater than 1; and iii) map the p.sub.2 bits onto R subcarriers respectively by means of the R modulation schemes of the selected sequence. Furthermore, the transmitting device comprises a transmitter configured to transmit the generated transmission signal.

[0119] A receiving device, is provided, the receiving device comprising a receiver configured to receive a transmission signal. Furthermore, the receiving device comprises circuitry configured to obtain, from the received signal, p=p.sub.1+p.sub.2 bits, wherein p.sub.1 and p.sub.2 are integers greater than zero, comprising determining, by performing maximum likelihood estimation on the received transmission signal a first subgroup of p.sub.1 bits and a second subgroup of p.sub.2 bits, wherein: the p.sub.2 bits are mapped onto R subcarriers respectively by means of R modulation schemes of a sequence of modulation schemes, wherein R is an integer greater than 1; and the sequence is a sequence of a plurality of predetermined sequences of modulation schemes, wherein the predetermined sequences are mutually different, each of the predetermined sequences has length R and indicates the p.sub.1 bits.

[0120] Still further, a computer program is provided, stored on a non-transitory medium, and comprising code instructions which when executed by a computer or by a processing circuitry, performs steps of any of the above-mentioned methods.

[0121] According to some embodiments, the processing circuitry and/or the transceiver is embedded in an integrated circuit, IC.

[0122] Although the disclosed subject matter has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred embodiments, it is to be understood that such detail is solely for that purpose and that the disclosed subject matter is not limited to the disclosed embodiments, but, on the contrary, is intended to cover modifications and equivalent arrangements that are within the spirit and scope of the disclosed subject matter. For example, it is to be understood that the presently disclosed subject matter contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.