Devices and methods for single carrier modulation schemes

Abstract

The present invention relates to single carrier modulation schemes, and presents a transmitter device, a receiver device and a transceiver device for a single carrier modulation scheme. The transmitter device is configured to generate a plurality of signature roots for a single carrier transmission, construct a Lagrange matrix and a Vandermonde matrix based on the plurality of signature roots, and generate a single carrier modulated signal based on the Lagrange and the Vandermonde matrix. The receiver device is configured to determine a plurality of signature roots, construct at least two Vandermonde matrices from the plurality of signature roots, and perform a demodulation of a single carrier modulated signal based on the at least two Vandermonde matrices. The transceiver device comprising a transmitter device configured to generate a single carrier modulated signal, and a receiver device configured to perform a demodulation of the single carrier modulated signal.

Claims

1. A transmitter device for a single carrier modulation scheme, the transmitter device comprising: at least one processor; and one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to: generate a plurality of signature roots (ρ.sub.k) for a single carrier transmission, wherein each signature root (ρ.sub.k) is a nonzero complex point; construct a Lagrange matrix and a Vandermonde matrix based on the plurality of signature roots (ρ.sub.k); and generate a single carrier modulated signal based on the Lagrange matrix and the Vandermonde matrix.

2. The transmitter device according to claim 1, the programming instructions instructing the at least one processor to: perform a zero-padding procedure or a cyclic-prefix procedure on the single carrier modulated signal.

3. A receiver device for a single carrier modulation scheme, the receiver device comprising: at least one processor; and one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to: determine a plurality of signature roots (ρ.sub.k), wherein each signature root is a nonzero complex point; construct at least two Vandermonde matrices from the plurality of signature roots (ρ.sub.k); and perform a demodulation of a single carrier modulated signal based on the at least two Vandermonde matrices.

4. The receiver device according to claim 3, wherein performing the demodulation comprises: performing a pre-equalization procedure based on one of the Vandermonde matrices; applying a one-tap equalizer on the output of the pre-equalization procedure; and performing a post equalization procedure on the output of the one-tap equalizer based on the other Vandermonde matrix.

5. The receiver device according to claim 3, the programming instructions instructing the at least one processor to: determine a radius (a) of a circle based on channel state information of a communication channel, wherein the determined plurality of signature roots (ρ.sub.k) are uniformly distributed on the circumference of the circle.

6. The receiver device according to claim 5, the programming instructions instructing the at least one processor to: compute a metric for evaluating the radius (a) of the circle or the plurality of signature roots (ρ.sub.k), based on channel state information of a communication channel.

7. The receiver device according to claim 3, the programming instructions instructing the at least one processor to: modify individually each signature root from the plurality of signature roots (ρ.sub.k) based on a machine learning algorithm, in particular a gradient descent algorithm.

8. The receiver device according to claim 7, the programming instructions instructing the at least one processor to perform the demodulation of the single carrier modulated signal, considering the individual modification of each signature root.

9. A transceiver device comprising a transmitter device, the transmitter device comprising: at least one processor; and one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to: generate a plurality of signature roots (ρ.sub.k) for a single carrier transmission, wherein each signature root (ρ.sub.k) is a nonzero complex point; construct a Lagrange matrix and a Vandermonde matrix based on the plurality of signature roots (ρ.sub.k); and generate a single carrier modulated signal based on the Lagrange matrix and the Vandermonde matrix.

10. The transceiver device according to claim 9, the programming instructions instructing the at least one processor to perform a zero-padding procedure or a cyclic-prefix procedure on the single carrier modulated signal.

11. A transceiver device for a single carrier modulation scheme, the transceiver device comprising: a transmitter device configured to generate a single carrier modulated signal based on constructing a Lagrange matrix and a Vandermonde matrix; and a receiver device configured to perform a demodulation of the single carrier modulated signal based on constructing at least two Vandermonde matrices.

12. The transceiver device according to claim 11, wherein the transmitter device is configured to perform a zero-padding procedure or a cyclic-prefix procedure on the single carrier modulated signal.

13. A method comprising: generating, at a transmitter device, a plurality of signature roots (ρ.sub.k) for a single carrier transmission, wherein each signature root (ρ.sub.k) is a nonzero complex point; constructing, at the transmitter device, a Lagrange matrix and a Vandermonde matrix based on the plurality of signature roots (ρ.sub.k); and generating, at the transmitter device, a single carrier modulated signal based on the Lagrange matrix and the Vandermonde matrix.

14. A method, the method comprising: determining, at a receiver device, a plurality of signature roots (ρ.sub.k), wherein each signature root is a nonzero complex point; constructing, at the receiver device, at least two Vandermonde matrices from the plurality of signature roots (ρ.sub.k); and performing, at the receiver device, a demodulation of a single carrier modulated signal based on the at least two Vandermonde matrices.

15. The method according to claim 14, wherein performing the demodulation comprises: performing a pre-equalization procedure based on one of the Vandermonde matrices; applying a one-tap equalizer on the output of the pre-equalization procedure; and performing a post equalization procedure on the output of the one-tap equalizer based on the other Vandermonde matrix.

16. The method according to claim 14, further comprising: determining a radius (a) of a circle based on channel state information of a communication channel, wherein the determined plurality of signature roots (ρ.sub.k) are uniformly distributed on the circumference of the circle.

17. The method according to claim 16, further comprising: computing a metric for evaluating the radius (a) of the circle or the plurality of signature roots (ρ.sub.k), based on channel state information of a communication channel.

18. The method according to claim 14, further comprising: modifying individually each signature root from the plurality of signature roots (ρ.sub.k) based on a machine learning algorithm, in particular a gradient descent algorithm.

19. The method according to claim 18, further comprising: performing the demodulation of the single carrier modulated signal considering the individual modification of each signature root.

20. A method comprising: generating, at a transmitter device of a transceiver device, a single carrier modulated signal based on constructing a Lagrange matrix and a Vandermonde matrix; and performing, at a receiver device of the transceiver device, a demodulation of the single carrier modulated signal based on constructing at least two Vandermonde matrices.

Description

BRIEF DESCRIPTION OF DRAWINGS

(1) The above described aspects and implementation forms of the present invention will be explained in the following description of specific embodiments in relation to the enclosed drawings, in which

(2) FIG. 1 is a schematic view of a transmitter device for a single carrier modulation scheme, according to an embodiment of the present invention.

(3) FIG. 2 is a schematic view of a receiver device for a single carrier modulation scheme, according to an embodiment of the present invention.

(4) FIG. 3 is a schematic view of a transceiver device for a single carrier modulation scheme, according to an embodiment of the present invention.

(5) FIG. 4 is an exemplarily scheme of a transceiver device comprising a transmitter device using a Lagrange matrix for modulation and a receiver device using a Vandermonde matrix for demodulation, according to an embodiment of the invention.

(6) FIG. 5 is another exemplarily scheme of the transmitter device for the single carrier modulation scheme, according to an embodiment of the invention.

(7) FIG. 6 an exemplarily scheme of the transceiver device for a single carrier modulation scheme comprising the transmitter device using a Lagrange matrix for modulation and the receiver device using two Vandermonde matrices for demodulation, according to an embodiment of the invention.

(8) FIG. 7 is an exemplarily scheme of the transceiver device comprising the receiver device using a radius of a circle for building its modules.

(9) FIG. 8 is an exemplarily scheme of the transceiver device comprising the receiver device modifying the plurality of signature roots.

(10) FIG. 9a and FIG. 9b illustrate two exemplarily channel realization.

(11) FIG. 10a and FIG. 10b illustrate an example of determining a radius of a circle (FIG. 10a) and further determining the signature roots using the radius of the circle (FIG. 10b).

(12) FIG. 11a and FIG. 11b illustrate modifying the plurality of signature roots, when the plurality of signature roots migrating toward new positions (FIG. 11a) and when the MSE decreases with the GDA iterations (FIG. 11b).

(13) FIG. 12a and FIG. 12b illustrate another example of determining a radius of a circle (FIG. 12a) and further determining the signature roots using the radius of the circle (FIG. 12b).

(14) FIG. 13a and FIG. 13b illustrate another example of modifying the plurality of signature roots, when the plurality of signature roots migrating toward new positions (FIG. 13a) and when the MSE decreases with the GDA iterations (FIG. 13b).

(15) FIG. 14 shows the overall performance of the SCLV modulator of the invention compared to the conventional SC-FDM scheme.

(16) FIG. 15 is a flowchart of a method for being implemented at a transmitter device, according to an embodiment of the invention.

(17) FIG. 16 is a flowchart of a method for being implemented at a receiver device, according to an embodiment of the invention.

(18) FIG. 17 is a flowchart of a method for being implemented at a transceiver device, according to an embodiment of the invention.

(19) FIG. 18 schematically illustrates a single carrier frequency division multiplexing access block diagram.

(20) FIG. 19 schematically illustrates a conventional Mutually-Orthogonal Usercode-Receiver (AMOUR) block diagram.

DETAILED DESCRIPTION OF EMBODIMENTS

(21) FIG. 1 is a schematic view of a transmitter device 100 for a single carrier modulation scheme, according to an embodiment of the present invention.

(22) The transmitter device 100 for the single carrier modulation scheme is configured generate a plurality of signature roots ρ.sub.k for a single carrier transmission, wherein each signature root ρ.sub.k is a nonzero complex point.

(23) The transmitter device 100 is further configured to construct a Lagrange matrix 101-L and a Vandermonde matrix 101-V based on the plurality of signature roots ρ.sub.k.

(24) The transmitter device 100 is further configured to generate a single carrier modulated signal 102 based on the Lagrange matrix 101-L and the Vandermonde matrix 101-V.

(25) The transmitter device 100 may comprise processing circuitry (not shown) configured to perform, conduct or initiate the various operations of the transmitter device 100 described herein. The processing circuitry may comprise hardware and software. The hardware may comprise analog circuitry or digital circuitry, or both analog and digital circuitry. The digital circuitry may comprise components such as application-specific integrated circuits (ASICs), field-programmable arrays (FPGAs), digital signal processors (DSPs), or multi-purpose processors. In one embodiment, the processing circuitry comprises one or more processors and a non-transitory memory connected to the one or more processors. The non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the transmitter device 100 to perform, conduct or initiate the operations or methods described herein.

(26) Moreover, in some embodiments, the transmitter device 100 may further be incorporated in a transceiver device.

(27) FIG. 2 is a schematic view of a receiver device 200 for a single carrier modulation scheme, according to an embodiment of the present invention.

(28) The receiver device 200 for the single carrier modulation scheme is configured to determine a plurality of signature roots ρ.sub.k, wherein each signature root is a nonzero complex point.

(29) The receiver device 200 is further configured to construct at least two Vandermonde matrices 201-V, 202-V from the plurality of signature roots ρ.sub.k.

(30) The receiver device 200 is further configured to perform a demodulation 203 of a single carrier modulated signal 102 based on the at least two Vandermonde matrices 201-V, 202-V.

(31) The receiver device 200 may comprise processing circuitry (not shown) configured to perform, conduct or initiate the various operations of the receiver device 200 described herein. The processing circuitry may comprise hardware and software. The hardware may comprise analog circuitry or digital circuitry, or both analog and digital circuitry. The digital circuitry may comprise components such as application-specific integrated circuits (ASICs), field-programmable arrays (FPGAs), digital signal processors (DSPs), or multi-purpose processors. In one embodiment, the processing circuitry comprises one or more processors and a non-transitory memory connected to the one or more processors. The non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the receiver device 200 to perform, conduct or initiate the operations or methods described herein.

(32) Moreover, in some embodiments, the receiver device 200 may further be incorporated in a transceiver device.

(33) FIG. 3 is a schematic view of a transceiver device 300 for a single carrier modulation scheme, according to an embodiment of the present invention.

(34) The transceiver device 300 comprises a transmitter device 100 configured to configured to generate a single carrier modulated signal 102 based on constructing a Lagrange matrix 101-L and a Vandermonde matrix 101-V.

(35) The transceiver device 300 further comprises a receiver device 200 configured to perform a demodulation 203 of the single carrier modulated signal 102 based on constructing at least two Vandermonde matrices 201-V, 202-V.

(36) For example, the transceiver device 300 may be based on a LV single carrier modulation scheme. For instance, the transmitter device 100 of the transceiver device 300 may generate the single carrier modulated signal 102 based on constructing a Lagrange matrix 101-L and a Vandermonde matrix 101-V. Moreover, the receiver device 200 may obtain the single carrier modulated signal 102 and may further construct the two Vandermonde matrix 201-V, 202-V from the plurality of signature roots ρ.sub.k. Furthermore, the receiver device 200 may perform the demodulation 203 of the single carrier modulated signal 102 based on the two Vandermonde matrix 201-V, 202-V.

(37) The transceiver device 300 may comprise processing circuitry (not shown) configured to perform, conduct or initiate the various operations of the transceiver device 300 described herein. The processing circuitry may comprise hardware and software. The hardware may comprise analog circuitry or digital circuitry, or both analog and digital circuitry. The digital circuitry may comprise components such as application-specific integrated circuits (ASICs), field-programmable arrays (FPGAs), digital signal processors (DSPs), or multi-purpose processors. In one embodiment, the processing circuitry comprises one or more processors and a non-transitory memory connected to the one or more processors. The non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the transceiver device 300 to perform, conduct or initiate the operations or methods described herein.

(38) Reference is made to FIG. 4 which is an exemplarily scheme of a transceiver device 300 comprising the transmitter device 100 using a Lagrange matrix for modulation and a receiver device 200 using a Vandermonde matrix for demodulation, according to an embodiment of the invention.

(39) Moreover, it may be determined, whether it is possible to: 1. design a transmitter device being compatible with the multicarrier LV transmitter with perfect inter-symbol interference (ISI) cancellation using a low complexity receiver device implementation (i.e., linear receiver with single tap equalization) while; 2. satisfying the perfect recovery condition.

(40) In the following, some mathematical basics and notation are briefly discussed, that may be used by the transmitter device 100 and/or the receiver device 200 and/or the transceiver device 300, without limiting the present invention.

(41) For example, from a set of K distinct nonzero complex points {ρ.sub.k}.sub.k=1.sup.K, that are referred to as signature roots, a Vandermonde matrix may be constructed. The Vandermonde matrix, is a K×P matrix, given by Eq. 8:

(42) $\begin{array}{cc}{V}_{K\times P}=\left[\begin{array}{cccc}1& {\rho }_0^{-1}& .Math.& {\rho }_0^{1-P}\\ 1& {\rho }_1^{-1}& .Math.& {\rho }_1^{1-P}\\ .Math.& .Math.& & .Math.\\ 1& {\rho }_{K-1}^{-1}& .Math.& {\rho }_{K-1}^{1-P}\\ & & & \end{array}\right],v_{k,p}=\left({\rho }_{k-1}^{1-p}\right)& \mathrm{Eq}.8\end{array}$
Moreover, note that, if

(43) 0${\rho }_k=\frac{1}{\sqrt{K}}\exp \left(j\frac{2\pi k}{K}\right)=\frac{1}{\sqrt{K}}{w}^{-k},$
therefore, V.sub.K×K=F.sub.K×K which is the Discrete Fourier Transform (DFT) matrix given above.

(44) Furthermore, taking Tx filters as linear combinations of the Lagrange polynomials, Eq. 9 may be obtained as follow:

(45) $\begin{array}{cc}{F}_k\left(z\right)=\underset{n=0}{\overset{K-1}{.Math.}}{\beta }_n\underset{\underset{q\ne n}{q=0}}{\overset{K-1}{.Math.}}\frac{{\rho }_q{z}^{-1}-1}{{\rho }_q{\rho }_n^{-1}-1}& \mathrm{Eq}.9\end{array}$
If β.sub.n are set to β.sub.n=ρ.sub.n.sup.−k, it turns out that,

(46) $\begin{array}{cc}{F}_k\left(z\right)=\underset{n=0}{\overset{K-1}{.Math.}}{\rho }_n^{-k}\underset{\underset{q\ne n}{q=0}}{\overset{K-1}{.Math.}}\frac{{\rho }_q{z}^{-1}-1}{{\rho }_q{\rho }_n^{-1}-1}=z^{-k}& \mathrm{Eq}.10\end{array}$

(47) Therefore, the synthesis filter bank reduces to a parallel-to-serial convertor and a single carrier transmission may be obtained.

(48) Reference is made to FIG. 5 which is another exemplarily scheme of the transmitter device 100 for the single carrier modulation scheme, according to an embodiment of the invention.

(49) In the single carrier transmitter device block diagram of the FIG. 5, the transmitter device 100 includes a precoder 401, a modulator 402 and a Zero Padding block 403.

(50) Moreover, the single carrier transmitter device may be compatible with the multicarrier LV transmitter.

(51) The transmitter device 100 (for example, it may be the transmitter device of the multicarrier LV scheme of FIG. 4) may include the precoder 401 and the modulator 402 which may be given by R and Ω, respectively, as follow:

(52) $\begin{array}{cc}R=\left[\begin{array}{cccc}1& {\rho }_0^{-1}& .Math.& {\rho }_0^{1-K}\\ 1& {\rho }_1^{-1}& .Math.& {\rho }_1^{1-K}\\ .Math.& .Math.& & .Math.\\ 1& {\rho }_{K-1}^{-1}& .Math.& {\rho }_{K-1}^{1-K}\\ & & & \end{array}\right]& \mathrm{Eq}.11\end{array}$$\mathrm{and},$$\begin{array}{cc}\Omega ={\frac{1}{K}\left[\begin{array}{cccc}1& {\rho }_0& .Math.& {\rho }_0^{K-1}\\ 1& {\rho }_1& .Math.& {\rho }_1^{K-1}\\ .Math.& .Math.& & .Math.\\ 1& {\rho }_{K-1}& .Math.& {\rho }_{K-1}^{K-1}\end{array}\right]}^T& \mathrm{Eq}.12\end{array}$
Moreover, it may be verified that RΩ=I∀ρ.sub.k.

(53) Note that, the transmission process turns out to add L zeros (in case of LV Tx) or a cyclic prefix of L (in case of VL Tx) to the K symbols, and may further transmit using a single carrier.

(54) Furthermore, a single carrier transmitter device may be obtained which may be compatible with the multicarrier VL by using other Vandermonde matrices, and adding a cyclic prefix (CP) instead of a zero padding (ZP).

(55) Reference is made to FIG. 6 which is an exemplarily scheme of the transceiver device 300 for a single carrier modulation scheme comprising the transmitter device 100 using a Lagrange matrix for modulation and the receiver device 200 using two Vandermonde matrices for demodulation, according to an embodiment of the invention.

(56) In the block diagram of the SCLV modulator of FIG. 6, the single carrier transceiver device 300 comprises the transmitter device 100 which is compatible with the multicarrier LV modulator, while the receiver device 200 uses two Vandermonde matrices for pre and post equalization.

(57) The transmitter device 100 which includes a precoder 401, a modulator 402 and a ZP block 403. Moreover, by assuming, that the transmitter device 100 (i.e., has been detailed above) transmits K symbols per frame, the communication channel and the receiver device 200 can be described.

(58) The communication channel of the transceiver device 300 comprises the transmitter filter (Tx filter, not shown in FIG. 6) and the receiver filter (Rx filter) 406 (for example, they may be raised cosine filters). In addition, the parameter C 405 which is a propagation channel of order L may be obtained according to Eq. 13:

(59) $\begin{array}{cc}C\left(z\right)={.Math.}_{l=0}^L{h}_l{z}^{-l}& \mathrm{Eq}.13\end{array}$

(60) Furthermore, the convolution of the Tx filter, the C 405 and the Rx filter 406 may be given by a channel matrix H.

(61) The transceiver device 300 further comprises the receiver device (Rx) 200 which includes the Pre-equalizer 601, the one-tap Equalizer unit 408, the Post-equalizer 602 and the decision block 409.

(62) The Pre-equalizer 601 uses a matrix E which is a Vandermonde matrix having a size of K×P. Moreover, the one-tap equalizer 408 uses a K×K diagonal matrix. Moreover, the Post-equalizer 602 uses M, which is a K×K matrix (for example, it may be a Vandermonde matrix).

(63) The pre-equalized received signal (applying E to the received signal) is given by Eq. 14:

(64) $\begin{array}{cc}y=\left[\begin{array}{ccc}C\left({\rho }_0\right)& & \\ & \ddots & \\ & & C\left({\rho }_{K-1}\right)\\ & & \end{array}\right]E\left(:,1:K\right)s+E\eta & \mathrm{Eq}.14\end{array}$

(65) Moreover, applying the one-tap equalization 408, then the post-equalization 602 to the “y”, Eq. 15 may be obtained as:

(66) $\begin{array}{cc}\tilde{y}=s+\underset{u}{\underbrace{\stackrel{M}{\overbrace{{E\left(:,1:K\right)}^{-1}}}\stackrel{D}{\overbrace{\left[\begin{array}{ccc}{C\left({\rho }_0\right)}^{-1}& & \\ & \ddots & \\ & & {C\left({\rho }_{K-1}\right)}^{-1}\\ & & \end{array}\right]}}E\eta }}& \mathrm{Eq}.15\end{array}$
where the matrix M should be the inverse of a Vandermonde matrix. For instance, the E(:,1:K) is the K first columns of the Vandermonde matrix E, the pre-euglization matrix which is used by the demodulator of the multicarrier LV scheme (e.g., as shown in FIG. 4), given by Eq. 16 as:

(67) $\begin{array}{cc}E\left(:,1:K\right)=\left[\begin{array}{cccc}1& {\rho }_0^{-1}& .Math.& {\rho }_0^{1-K}\\ 1& {\rho }_1^{-1}& .Math.& {\rho }_1^{1-K}\\ .Math.& .Math.& & .Math.\\ 1& {\rho }_{K-1}^{-1}& .Math.& {\rho }_{K-1}^{1-K}\\ & & & \end{array}\right]& \mathrm{Eq}.16\end{array}$
which is a Vandermonde matrix.

(68) Note that, the following operations or conditions may be performed or satisfied. This result is true ∀ρ.sub.k.Math. For example, the plurality of signature roots ρ.sub.k may further be determined (e.g., an operation to obtain or determine or choose the plurality of signature roots ρ.sub.k). It may further be determined, choosing the ρ.sub.k such that avoiding a Vandermonde matrix inversion in the post-equalization process.

(69) If C(ρ.sub.k)≠0, ∀k.Math.a perfect recovery condition may be satisfied with f expression. It may be determined, e.g., how to choose (optimize) the signature roots in order to boost the system performance (such as minimize the bit error rate (BER)).

(70) As discussed, the transceiver design of the invention comprises the transmitter device which may be compatible with both single carrier and multicarrier transmissions. In the following, the transmitter device and the receiver device (e.g., their circuitries) are presented and the implemented methods thereof, for providing the SCLV transceiver that satisfies the PR condition while keeping a low receiver implementation. Moreover, the aforementioned goal may be achieved, without any signaling exchange between the transmitter device and the receiver device.

(71) As discussed above, in some embodiments, the transmitter device 100 does not need any feedback from the receiver device 200 since it is a single carrier transmission, the transmitter device 100 adds L zeros to the frame of K symbols and then transmits a frame of P=K+L over the channel (see FIG. 5).

(72) However, the receiver device 200 needs to define K signature roots to build the pre- and post-equalizers as well as the one-tap equalization. As stated above, the post-equalization should carry out a Vandermonde matrix inversion (high complexity operation) if the signature roots have not been well selected. Furthermore, the complexity of an optimization over .sup.K to select the best K signature roots increases with K.

(73) This problem may be solved based on operations performed in the following two steps including step 1 and step 2:

(74) Step I: Choosing the Plurality of Signature Roots.

(75) For example, the plurality of signature roots (ρ.sub.k) may be uniformly distributed on the circumference of a circle, e.g., uniformly spread over a circle of radius a, such that

(76) ${\rho }_k={\mathrm{ae}}^{\frac{j2\pi k}{K}}.$

(77) The post-equalization matrix reduces to a Vandermonde matrix, given by:

(78) $\begin{array}{cc}M=\frac{1}{K}\left[\begin{array}{cccc}1& 1& .Math.& 1\\ {\rho }_0& {\rho }_1& .Math.& {\rho }_{K-1}\\ .Math.& .Math.& & .Math.\\ {\rho }_0^{K-1}& {\rho }_1^{K-1}& .Math.& {\rho }_{K-1}^{K-1}\end{array}\right]& \mathrm{Eq}.17\end{array}$

(79) It may provide a low-complex transceiver implementation comprising two Vandermonde matrices and a simple one-tap equalization, and no matrix inversion (as it is required in the AMOUR system 1900 in FIG. 19).

(80) Moreover, if a.sub.opt=1, therefore E.sub.K×P={tilde over (F)}=[F F(:,1: L)] and M=F.sup.H.

(81) Therefore, the SCLV scheme may reduce to the SC-FDM(A).

(82) Moreover, a procedure for modifying the radius of the circle may be provided. For example, the transceiver device 300 (e.g., its receiver device 100) may modify (e.g., optimize) the radius of the circle. A method, among others, for optimizing the radius “a” is to minimize the mean squared error (MSE) given by:

(83) 0$\begin{array}{cc}\mathrm{MSE}=\frac{{\sigma }_{\eta }^2}{K}\mathrm{trace}\left(\underset{z}{E^H\underbrace{D^H{M}^{-H}MD}E}\right)& \mathrm{Eq}.18\end{array}$
where Z is a K×K matrix, given by Eq. 19 as follow:

(84) $\begin{array}{cc}Z\left(k,n\right)=\frac{1-a^{2K}}{K^2{C\left({\rho }_k\right)}^{*}C\left({\rho }_n\right)\left(1-a^2{e}^{\frac{j2\pi \left(n-k\right)}{K}}\right)}& \mathrm{Eq}.19\end{array}$

(85) Moreover, the MSE is given by:

(86) $\begin{array}{cc}\mathrm{MSE}={\sigma }_{\eta }^2\frac{1-a^2}{K^3}\underset{k=0}{\overset{K-1}{.Math.}}\underset{n=0}{\overset{K-1}{.Math.}}\frac{1-a^{-2\left(K+L\right)}{e}^{\frac{j2\pi L\left(k-n\right)}{K}}}{{C\left({\rho }_k\right)}^{*}C\left({\rho }_n\right)\left(2-a^2{e}^{\frac{j2\pi \left(n-K\right)}{K}}-a^{-2}{e}^{\frac{j2\pi \left(k-n\right)}{K}}\right)}& \mathrm{Eq}.20\end{array}$

(87) The modified (e.g., optimal) radius a.sub.opt may be determined as a.sub.opt=argmin MSE.

(88) Step 2: Modifying the Plurality of the Signature Roots.

(89) For example, the signature roots that uniformly spread over a circle of radius a.sub.opt may be used, and an algorithm may further be applied that may optimize the signature roots individually following a specific optimization metric. In particular, a machine learning techniques may be used in this step.

(90) In the following the step 2 is exemplarily referred to as the “signature roots refinement”. A detailed description of this step is provided, for example, in FIG. 8 and FIG. 11a, FIG. 11b, FIG. 13a, and FIG. 13b.

(91) Reference is made to FIG. 7 which is an exemplarily scheme of the transceiver device 300 comprising the receiver device 200 uses a radius of a circle for building its modules.

(92) In the block diagram FIG. 7, the single carrier transceiver 300 may be compatible with the LV (and VL) modulators that satisfy the perfect recovery condition while keeping a low complex transceiver implementation.

(93) Step I: Choosing the Plurality of Signature Roots.

(94) For example, the plurality of signature roots (ρ.sub.k) may be uniformly distributed on the circumference of the circle, e.g., uniformly spread over a circle of radius a, such that

(95) ${\rho }_k={\mathrm{ae}}^{\frac{j2\pi k}{K}}.$ 1. For example, an optimization block 702 is provided that needs the channel state information (can be obtained from the channel estimation unit 701) in order to compute the optimization metric (e.g., the MSE detailed above), and it may further compute the a.sub.opt. 2. The receiver device 200 uses the a.sub.opt to compute the pre-equalizer (in 601), the one-tap equalizer (in 408), and the post-equalizer (in 602) modules.

(96) In some embodiments of the invention, the above mentioned step 1 (i.e., Step I: choosing the plurality of signature roots) may only be performed (i.e., the above step may be enough).

(97) Moreover, in some embodiments, (e.g., depending on the use case), the above mentioned step 2 (i.e., Step 2: modifying the plurality of the signature roots) may further be performed, which is exemplarily discussed, e.g., this step is provided, for example, in FIG. 8 and FIG. 11a, FIG. 11b, FIG. 13a, and FIG. 13b.

(98) Reference is made to FIG. 8 which is an exemplarily scheme of the transceiver device 300 comprising the receiver device 200 modifying the plurality of signature roots. The step 2 may be performed as follow:

(99) Step 2: Modifying the Plurality of the Signature Roots

(100) For example, the signature roots that uniformly spread over a circle of radius a.sub.opt may be used, and an algorithm may further be applied that may optimize the signature roots individually following a specific optimization metric. In particular, a machine learning techniques may be used, and the following operations may be performed. 1. The optimization block 702 that needs the channel state information (which may be obtained using the channel estimation unit 701) in order to compute the optimization metric (for instance, the MSE detailed above) and it may further compute the a.sub.opt. 2. Moreover, a refinement block 703 (for example, it may use a refinement algorithm) that needs to refine the signature roots individually following a specific optimization method and using a specific metric. 3. Furthermore, the receiver device 100 may use the modified plurality of signature roots ρ to compute the pre-equalizer (in 601), the one-tap equalizer (in 408), and the post-equalizer (in 602) modules.

(101) References are made from FIG. 9a and FIG. 9b which illustrate two exemplarily channel realization.

(102) At the step 1, the signature roots may be determined such that they are uniformly spread over a circle of radius a, for example, according to

(103) ${\rho }_k={\mathrm{ae}}^{\frac{j2\pi k}{K}}.$

(104) The significance of a.sub.opt and its impact on the overall system performance is exemplarily described.

(105) For example, for a system of K=16, and the channel spread L=4, two channel realization including channel realization 1 and channel realization 2 may be determined as follow, where the C(z) is the channel response:

(106) $\mathrm{Channel}\mathrm{realization}1:C\left(z\right)=1+z^{-4}$$\mathrm{Channel}\mathrm{realization}2:C\left(z\right)=1-z+z^{-4}$

(107) Furthermore, considering the optimization metric, the MSE, it may be determined that, in the example of channel realization 1 which is illustrated in FIG. 9a, the optimum radius is between 1.4 and 2. Note that, if we use ZP-OFDM (a=1) the signal cannot be efficiently recovered, since

(108) ${\mathrm{SNR}}_{\mathrm{eq}}=\frac{1}{\mathrm{MSE}}$
is almost 0 (see FIG. 9a).

(109) However, in the example of channel realization 2, which is illustrated in FIG. 9b, the best choice is when the radius is equal to 1, then the SCLV scheme reduces to the SC-FDM.

(110) In the following, the application of Step 1 and the relevance of Step 2 is discussed.

(111) References are made from FIG. 10a and FIG. 10b which illustrate determining a radius of the circle (FIG. 10a) and further determining the signature roots using the radius of the circle (FIG. 10b).

(112) For example, the Gradient descent algorithm may be used in order to perform the individual signature roots optimization (i.e., modifying the signature root). For instance, at first, the radius of the circle a.sub.opt may be used (i.e., which has been provided by Step 1) and considering the K=16 and the L=4 (e.g., the results given by Step 1). The determined radius of the circle in FIG. 10a may be used and the plurality of the signature roots may further be determined, as it is illustrated in FIG. 10b.

(113) The results from Step 1 provide that the optimal radius should be equal to 2. However, the signature roots represented in FIG. 10b may further be modified (refined) using the Gradient Descent algorithm (GDA), where results are depicted in FIG. 11a and FIG. 11b, for the same channel realization.

(114) FIG. 11a and FIG. 11b illustrates the signature roots refinement using Step 2. FIG. 11a shows the plurality of signature roots migrating toward new positions, and FIG. 11b shows the MSE decreasing with the GDA iterations.

(115) As it can be derived from FIG. 11b, that the MSE degrades while the GDA algorithm is optimizing the signature roots positions from an iteration to another.

(116) References are made from FIG. 12a and FIG. 12b which illustrate another example of determining a radius of the circle (FIG. 12a) and further determining the signature roots using the radius of the circle (FIG. 12b).

(117) Another channel realization for K=16 and L=4, provides the results given by Step 1 in FIG. 12a and FIG. 12b.

(118) For example, the Gradient descent algorithm may be used in order to perform the individual signature roots optimization (i.e., modifying the signature root). For instance, at first, the radius of the circle a.sub.opt may be used (i.e., which has been provided by Step 1) and considering the K=16 and the L=4 (e.g., the results given by Step 1). The determined radius of the circle in FIG. 12a may be used and the plurality of the signature roots may further be determined, as it is illustrated in FIG. 12b.

(119) The results from Step 1 provide that the optimal radius should be equal to 1. Therefore, the provided scheme reduces to the SC-FDM(A) scheme. However, the signature roots represented in FIG. 12b may be modified (refined) using Gradient Descent algorithm (GDA), where results are depicted in FIG. 13a and FIG. 13b, for the same channel realization.

(120) FIG. 13a and FIG. 13b illustrates the signature roots refinement using Step 2. FIG. 13a shows the plurality of signature roots migrating toward new positions, and FIG. 13b shows the MSE decreasing with the GDA iterations.

(121) As it can be derived from FIG. 13b, that the MSE degrades while the GDA algorithm is optimizing the signature roots positions (leaving the unit circle) from an iteration to another.

(122) FIG. 14 shows the overall performance of the SCLV modulator of the invention compared to the conventional SC-FDM scheme.

(123) The comparison of the performance is performed based on considering K=16, L=4, and using frequency selective channel following a uniform pdp (the results can be derived for a more general channel). Moreover, the comparison of performance results is performed using Step 1 only, and step 1 along with the Step 2 (which uses Step 1 as an intermediate results).

(124) Note that, the Step 2 brings a significant improvement compared to the SCLV and SC-FDM using Step 1 only. For example, A performance gain of 4 dB at 10.sup.−5 may be obtained (when SCLV uses Step 2 compared to Step 1 only). The SCLV modulation scheme of the present invention outperforms the SC-FDM(A).

(125) FIG. 15 shows a method 1500 according to an embodiment of the invention for being implemented at a transmitter device 100. The method 1500 may be carried out by the transmitter device 100, as it described above.

(126) The method 1500 comprises a step 1501 of generating a plurality of signature roots ρ.sub.k for a single carrier transmission, wherein each signature root ρ.sub.k is a nonzero complex point.

(127) The method 1500 further comprises a step 1502 of constructing a Lagrange matrix 101-L and a Vandermonde matrix 101-V based on the plurality of signature roots ρ.sub.k.

(128) The method 1500 further comprises a step 1503 of generating a single carrier modulated signal 102 based on the Lagrange matrix 101-L and the Vandermonde matrix 101-V.

(129) FIG. 16 shows a method 1600 according to an embodiment of the invention for being implemented at a receiver device 200. The method 1600 may be carried out by the receiver device 200, as it described above.

(130) The method 1600 comprises a step 1601 of determining a plurality of signature roots ρ.sub.k, wherein each signature root is a nonzero complex point.

(131) The method 1600 further comprises a step 1602 of constructing at least two Vandermonde matrices 201-V, 202-V from the plurality of signature roots ρ.sub.k.

(132) The method 1600 further comprises a step 1603 of performing a demodulation 203 of a single carrier modulated signal 102 based on the at least two Vandermonde matrices 201-V, 202-V.

(133) FIG. 17 shows a method 1700 according to an embodiment of the invention for being implemented at a transceiver device 300. The method 1700 may be carried out by the transceiver device 300, as it described above.

(134) The method 1700 comprises a step 1701 of generating, at a transmitter device 100, a single carrier modulated signal 102 based on a Lagrange matrix 101-L and a Vandermonde matrix 101-V.

(135) The method 1700 further comprises a step 1702 of performing, at a receiver device 200, a demodulation 203 of the single carrier modulated signal 102 based on at least two Vandermonde matrices 201-V, 202-V.

(136) The present invention has been described in conjunction with various embodiments as examples as well as implementations. However, other variations can be understood and effected by those persons skilled in the art and practicing the claimed invention, from the studies of the drawings, this disclosure and the independent claims. In the claims as well as in the description the word “comprising” does not exclude other elements or steps and the indefinite article “a” or “an” does not exclude a plurality. A single element or other unit may fulfill the functions of several entities or items recited in the claims. The mere fact that certain measures are recited in the mutual different dependent claims does not indicate that a combination of these measures cannot be used in an advantageous implementation.