Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A faster than Nyquist communication system adapted for conveying a set of symbols from a transmitter to a receiver, wherein the transmitter and the receiver are coupled by means of a transmission channel, comprising the following circuits: a precoder configured to generate a set of precoded symbols from a set of input symbols by performing a matrix operation with a precoding matrix; a pulse filter configured to generate a transmission signal to be transmitted over the transmission channel as a function of the precoded symbols, the transmission signal comprising a sequence of pulses having a pulse form g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor having a value between 0 and 1; a receiving filter configured to generate a set of sampled symbols as a function of the transmission signal and noise added by the transmission channel; a decoder configured to generate a set of decoded symbols as a function of the set of sampled symbols; wherein the elements of the precoding matrix are dependent on a property of the pulse form g T .
A faster-than-Nyquist communication system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
2. The communication system of claim 1 , wherein the decoder is configured to generate the set of decoded symbols by performing a matrix operation with a decoding matrix, wherein the elements of the decoding matrix are dependent on the receiving filter.
In the faster-than-Nyquist communication system described above, the decoder generates decoded symbols by performing a matrix operation using a decoding matrix. The elements of this decoding matrix depend on the receiving filter characteristics. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
3. The communication system of claim 1 , wherein the matrix elements of the precoding matrix are further dependent on an acceleration factor ρ, the acceleration factor being adapted to be used by the pulse filter to decrease the symbol delay time below the Nyquist delay time, wherein the acceleration factor ρ is a value between 0 and 1.
In the faster-than-Nyquist communication system, the precoding matrix elements depend on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
4. The communication system of claim 1 , wherein the pulse filter is configured to perform the following operation onto a number of N input symbols a n : s ( t ) = ∑ n a n · ρ g T ( t - n ρ T ) .
In the faster-than-Nyquist communication system, the pulse filter operates on 'N' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
5. The communication system of claim 4 , wherein the matrix of the precoder is derived form a matrix G, the matrix elements of the matrix G being calculated as: G m , n = ∫ - ∞ ∞ ρ g T ( t - n ρ T ) · ρ g T ( t - m ρ T ) dt with 1<n≦N and 1<m≦N and N being an integer value >1.
In the faster-than-Nyquist communication system, the precoder's matrix is derived from a matrix 'G'. The elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'N' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
6. The communication system of claim 5 , wherein the matrix of the precoder is an inverse square root matrix G −1/2 of the matrix G.
In the faster-than-Nyquist communication system, the precoder's matrix is the inverse square root (G−1/2) of the matrix 'G', where the elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'N' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
7. The communication system of claim 6 , wherein the receiving filter is matched to the pulse filter, and wherein both the precoding matrix and the decoding matrix are inverse square root matrices G−1/2 of the matrix G.
In the faster-than-Nyquist communication system, the receiving filter is matched to the pulse filter. Both the precoding matrix and the decoding matrix are inverse square root matrices (G−1/2) of the matrix 'G', where the precoder's matrix is the inverse square root (G−1/2) of the matrix 'G', where the elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'N' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
8. The communication system of claim 7 , wherein the precoder matrix and the decoder matrix are derived from a decomposition of the matrix G with G=L L T , wherein L is a lower triangular matrix with all matrix elements above the main diagonal being zero and L T is a transpose conjugate matrix to the matrix L, wherein the precoder is adapted to apply an inverse matrix L −T of the transpose conjugate matrix L T , and the decoder is adapted to apply an inverse matrix L −1 of the lower triangular matrix L.
In the faster-than-Nyquist communication system, the precoder and decoder matrices are derived from a decomposition of matrix 'G' such that G = LLT, where 'L' is a lower triangular matrix (elements above the diagonal are zero) and 'LT' is its conjugate transpose. The precoder applies the inverse matrix L-T, and the decoder applies the inverse matrix L-1, where the receiving filter is matched to the pulse filter. Both the precoding matrix and the decoding matrix are inverse square root matrices (G−1/2) of the matrix 'G', where the precoder's matrix is the inverse square root (G−1/2) of the matrix 'G', where the elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'N' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
10. The communication system of claim 1 , wherein the decoder is adapted to perform a matrix operation for transforming a set of n sampled symbols to a set of n decoded symbols.
In the faster-than-Nyquist communication system, the decoder transforms 'n' sampled symbols into 'n' decoded symbols using a matrix operation. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'.
11. The communication system of claim 1 , wherein a maximum-likelihood estimation is performed with respect to the set of decoded symbols.
In the faster-than-Nyquist communication system, a maximum-likelihood estimation is performed on the decoded symbols. Specifically, the system transmits symbols from a transmitter to a receiver through a channel. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal. The signal consists of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor reducing symbol delay below the Nyquist limit. The receiver has a receiving filter that generates sampled symbols from the received signal, and a decoder that generates decoded symbols from the sampled symbols. The precoding matrix elements depend on the pulse form 'gT'. The decoder transforms 'n' sampled symbols into 'n' decoded symbols using a matrix operation.
12. A transmitter configured to conveying a set of symbols to a receiver faster than Nyquist, the transmitter comprising the following circuits: a precoder configured to generate a set of precoded symbols from a set of input symbols by performing a matrix operation with a precoding matrix; a pulse filter configured to generate a transmission signal to be transmitted over the transmission channel as a function of the precoded symbols, the transmission signal comprising a sequence of pulses having a pulse form g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor having a value between 0 and 1; wherein the matrix elements of the precoding matrix are dependent on a property of the pulse form g T .
A transmitter for faster-than-Nyquist communication includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal consisting of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on a property of the pulse form 'gT'.
13. The transmitter of claim 12 , wherein the matrix elements are further dependent on an acceleration factor ρ, the acceleration factor being adapted to be used by the pulse filter to decrease the symbol delay time below the Nyquist delay time, wherein the acceleration factor ρ is a value between 0 and 1.
In the faster-than-Nyquist transmitter, the precoding matrix elements further depend on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal consisting of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on a property of the pulse form 'gT'.
14. The transmitter of claim 13 , wherein the pulse filter is configured to perform the following operation onto a number of n input symbols a n : s ( t ) = ∑ n a n · ρ g T ( t - n ρ T ) .
In the faster-than-Nyquist transmitter, the pulse filter operates on 'n' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. The precoding matrix elements further depend on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal consisting of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on a property of the pulse form 'gT'.
15. The transmitter of claim 14 , wherein the matrix of the precoder is derived from a matrix G, the matrix elements of the matrix G being calculated as: G m , n = ∫ - ∞ ∞ ρ g T ( t - n ρ T ) · ρ g T ( t - m ρ T ) dt with 1<n≦N and 1<m≦N and N being an integer value >1.
In the faster-than-Nyquist transmitter, the precoder's matrix is derived from a matrix 'G'. The elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'n' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. The precoding matrix elements further depend on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal consisting of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on a property of the pulse form 'gT'.
16. The transmitter of claim 15 , wherein the matrix P of the precoder is an inverse square root matrix G −1/2 of the matrix G.
In the faster-than-Nyquist transmitter, the precoder's matrix is the inverse square root (G−1/2) of the matrix 'G', where the elements of matrix 'G' are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The pulse filter operates on 'n' input symbols ('an') according to the formula: s(t) = Σ an * ρ * gT(t - n * ρ * T). This creates the transmission signal by summing weighted and time-shifted pulse forms. The precoding matrix elements further depend on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal consisting of pulses with a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on a property of the pulse form 'gT'.
18. A receiver adapted for detecting a set of symbols from a transmission signal transmitted by a transmitter, the receiver comprising the following circuits: a receiver filter configured to receive a transmission signal comprising a sequence of pulses having a pulse form g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor having a value between 0 and 1; a decoder configured to generate a set of decoded symbols as a function of set of the sampled symbols by means of operation with a decoding matrix, wherein the matrix elements of the decoding matrix are selected in dependency of a property of the pulse form.
A receiver for faster-than-Nyquist communication detects symbols from a transmission signal. It includes a receiver filter that receives a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. A decoder generates decoded symbols from sampled symbols using a decoding matrix. The matrix elements of the decoding matrix are selected based on the properties of the pulse form.
19. The receiver of claim 18 , wherein the receiving filter is matched to a pulse filter of a transmitter; wherein the transmitter is adapted to perform a precoding with a precoding matrix; wherein both the precoding matrix and the decoding matrix are inverse square root matrices G −1/2 of a matrix G; and wherein the elements of the matrix G are dependent on the pulse form g T , the intermediate time T, and the acceleration factor ρ.
In the faster-than-Nyquist receiver, the receiving filter is matched to a pulse filter in the transmitter. The transmitter precodes with a precoding matrix. Both the precoding and decoding matrices are inverse square root matrices (G−1/2) of a matrix 'G'. The elements of 'G' depend on the pulse form 'gT', the intermediate time 'T', and the acceleration factor 'ρ'. Specifically, the receiver detects symbols from a transmission signal. It includes a receiver filter that receives a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. A decoder generates decoded symbols from sampled symbols using a decoding matrix. The matrix elements of the decoding matrix are selected based on the properties of the pulse form.
20. The receiver of claim 19 , wherein the precoder matrix and the decoder matrix are derived from a decomposition of the matrix G with G=L L T , wherein L is a lower triangular matrix with all matrix elements above the main diagonal being zero and L T is a transpose conjugate to the matrix L, wherein the decoder is adapted to apply an inverse matrix L −1 of the lower triangular matrix L.
In the faster-than-Nyquist receiver, the precoder and decoder matrices are derived from a decomposition of matrix 'G' such that G = LLT, where 'L' is a lower triangular matrix (elements above the diagonal are zero) and 'LT' is its conjugate transpose. The decoder applies the inverse matrix L-1. Also, the receiving filter is matched to a pulse filter in the transmitter. The transmitter precodes with a precoding matrix. Both the precoding and decoding matrices are inverse square root matrices (G−1/2) of a matrix 'G'. The elements of 'G' depend on the pulse form 'gT', the intermediate time 'T', and the acceleration factor 'ρ'. Specifically, the receiver detects symbols from a transmission signal. It includes a receiver filter that receives a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. A decoder generates decoded symbols from sampled symbols using a decoding matrix. The matrix elements of the decoding matrix are selected based on the properties of the pulse form.
21. A user equipment adapted for communication with a base station of cellular radio network, the user equipment comprising at least one of: a transmitter comprising the following circuits: a precoder configured to generate a set of precoded symbols from a set of input symbols by performing a matrix operation with a precoding matrix; a pulse filter configured to generate a transmission signal to be transmitted over the transmission channel as a function of the precoded symbols, the transmission signal comprising a sequence of pulses having a pulse form g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor having a value between 0 and 1; wherein the matrix elements of the precoding matrix are dependent on a property of the pulse form g T ; a receiver comprising the following circuits: a receiver filter configured to receive the transmission signal comprising the sequence of pulse forms g T , wherein the pulses are separated by the time distance ρT, wherein T is the intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is the acceleration factor having the value between 0 and 1; a decoder configured to generate a set of decoded symbols as a function of set of the sampled symbols by means of operation with a decoding matrix, wherein the matrix elements of the decoding matrix are selected in dependency of a property of the pulse form.
A user equipment (UE) for a cellular radio network includes either a transmitter OR a receiver OR BOTH. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on the pulse form 'gT'. The receiver includes a receiver filter that receives the transmission signal with the pulse forms 'gT' separated by 'ρT'. A decoder generates decoded symbols from sampled symbols using a decoding matrix. The decoding matrix elements depend on the pulse form.
22. A base station of a radio access network configured to communication with user equipment, the base station comprising at least one of: a transmitter comprising the following circuits: a precoder configured to generate a set of precoded symbols from a set of input symbols by performing a matrix operation with a precoding matrix; a pulse filter configured to generate a transmission signal to be transmitted over the transmission channel as a function of the precoded symbols, the transmission signal comprising a sequence of pulses having a pulse form g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor having a value between 0 and 1; wherein the matrix elements of the precoding matrix are dependent on a property of the pulse form g T filter; a receiver comprising the following circuits: a receiver filter configured to receive a transmission signal comprising the sequence of pulse forms g T , wherein the pulses are separated by the time distance ρT, wherein T is the intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is the acceleration factor having the value between 0 and 1; a decoder configured to generate a set of decoded symbols as a function of set of the sampled symbols by means of operation with a decoding matrix, wherein the matrix elements of the decoding matrix are selected in dependency of a property of the pulse form.
A base station for a radio access network includes either a transmitter OR a receiver OR BOTH. The transmitter includes a precoder that generates precoded symbols from input symbols using a precoding matrix. A pulse filter shapes these precoded symbols into a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The precoding matrix elements depend on the pulse form 'gT'. The receiver includes a receiver filter that receives the transmission signal with the pulse forms 'gT' separated by 'ρT'. A decoder generates decoded symbols from sampled symbols using a decoding matrix. The decoding matrix elements depend on the pulse form.
23. A method, performed in a transmitter adapted for conveying a set of symbols to a receiver over a transmission channel, the method comprising: generating a set of precoded symbols as a function of the input symbols by performing a matrix operation with a precoding matrix; generating a transmission signal comprising a sequence of pulse forms g T of the set of precoded symbols, wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is a value between 0 and 1; wherein the matrix elements of the precoding matrix are selected in dependency of a property of the pulse form g r .
A method for faster-than-Nyquist transmission in a transmitter includes: generating precoded symbols from input symbols using a precoding matrix; and generating a transmission signal with pulses of form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The matrix elements of the precoding matrix are selected based on a property of the pulse form 'gT'.
24. The method of claim 23 , wherein the matrix elements of the precoding matrix are further selected dependent on an acceleration factor ρ, the acceleration factor being adapted to be used by the pulse filter to decrease the symbol delay time below the Nyquist delay time, wherein the acceleration factor ρ is a value between 0 and 1.
The faster-than-Nyquist transmission method also selects precoding matrix elements based on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The method includes: generating precoded symbols from input symbols using a precoding matrix; and generating a transmission signal with pulses of form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The matrix elements of the precoding matrix are selected based on a property of the pulse form 'gT'.
25. The method of claim 24 , wherein the transmission signal is generated as following from a number of n input symbols: s ( t ) = ∑ n a n · ρ g T ( t - n ρ T ) .
The faster-than-Nyquist transmission method generates the transmission signal from 'n' input symbols as: s(t) = Σ an * ρ * gT(t - n * ρ * T). This method also selects precoding matrix elements based on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The method includes: generating precoded symbols from input symbols using a precoding matrix; and generating a transmission signal with pulses of form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The matrix elements of the precoding matrix are selected based on a property of the pulse form 'gT'.
26. The method of claim 25 , wherein the matrix elements of the precoding matrix are generated in dependency of a matrix G, the matrix elements of the matrix G being calculated as: G m , n = ∫ - ∞ ∞ ρ g T ( t - n ρ T ) · ρ g T ( t - m ρ T ) dt with 1<n≦N and 1<m≦N and N being an integer value >1.
The faster-than-Nyquist transmission method generates precoding matrix elements based on a matrix 'G', with elements calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The transmission signal is generated from 'n' input symbols as: s(t) = Σ an * ρ * gT(t - n * ρ * T). This method also selects precoding matrix elements based on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The method includes: generating precoded symbols from input symbols using a precoding matrix; and generating a transmission signal with pulses of form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The matrix elements of the precoding matrix are selected based on a property of the pulse form 'gT'.
27. The method of claim 26 , wherein the precoding matrix of is an inverse square root matrix G −1/2 of the matrix G.
In the faster-than-Nyquist transmission method, the precoding matrix is the inverse square root (G−1/2) of the matrix 'G', where elements are calculated as: Gm,n = ∫ ρ * gT(t - n * ρ * T) * ρ * gT(t - m * ρ * T) dt, where 1 < n ≤ N, 1 < m ≤ N, and N is an integer greater than 1. The integration is performed from -∞ to ∞. The transmission signal is generated from 'n' input symbols as: s(t) = Σ an * ρ * gT(t - n * ρ * T). This method also selects precoding matrix elements based on an acceleration factor 'ρ' (between 0 and 1). This factor is used by the pulse filter to decrease the symbol delay time below the Nyquist limit. The method includes: generating precoded symbols from input symbols using a precoding matrix; and generating a transmission signal with pulses of form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor. The matrix elements of the precoding matrix are selected based on a property of the pulse form 'gT'.
29. A method, performed in receiver adapted for detecting a set of symbols from a transmission signal transmitted by a transmitter, the method comprising: receiving a transmission signal comprising a sequence of pulse forms g T , wherein the pulses are separated by a time distance ρT, wherein T is an intermediate time for orthogonal pulse transmission with respect to the pulse form g T , and ρ is an acceleration factor with a value between 0 and 1; generating a set of sampled symbols from transmission signal by means of a receiver filter; and generating a set of decoded symbols as a function of set of the sampled symbols by means of operation with a decoding matrix, wherein the matrix elements of the decoding matrix are selected in dependency of a property of the pulse form.
A method for faster-than-Nyquist reception includes: receiving a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor; generating sampled symbols from the transmission signal using a receiver filter; and generating decoded symbols from the sampled symbols using a decoding matrix. The decoding matrix elements are selected based on a property of the pulse form.
30. The method of claim 29 , wherein a receiving filter of the receiver is matched to a pulse filter of the transmitter; wherein the transmitter performs a precoding with a precoding matrix; wherein both the precoding matrix and the decoding matrix are inverse square root matrices G −1/2 of a matrix G; and wherein the elements of the matrix G are dependent on the pulse form g T , the intermediate time T, and the acceleration factor ρ.
The faster-than-Nyquist reception method uses a receiving filter matched to the transmitter's pulse filter. The transmitter precodes with a precoding matrix. Both the precoding and decoding matrices are inverse square root matrices (G−1/2) of a matrix 'G'. The elements of 'G' depend on the pulse form 'gT', intermediate time 'T', and acceleration factor 'ρ'. The method includes: receiving a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor; generating sampled symbols from the transmission signal using a receiver filter; and generating decoded symbols from the sampled symbols using a decoding matrix. The decoding matrix elements are selected based on a property of the pulse form.
31. The method of claim 30 , wherein the precoder matrix and the decoder matrix are derived from a decomposition of the matrix G, with G=L L T , wherein L is a lower triangular matrix with all matrix elements above the main diagonal being zero and L T is a transpose conjugate to the matrix L, wherein the decoder applies an inverse matrix L −1 of the lower triangular matrix L.
The faster-than-Nyquist reception method derives the precoder and decoder matrices from a decomposition of matrix 'G' such that G = LLT, where 'L' is a lower triangular matrix (elements above the diagonal are zero) and 'LT' is its conjugate transpose. The decoder applies the inverse matrix L-1. The receiving filter is matched to the transmitter's pulse filter. The transmitter precodes with a precoding matrix. Both the precoding and decoding matrices are inverse square root matrices (G−1/2) of a matrix 'G'. The elements of 'G' depend on the pulse form 'gT', intermediate time 'T', and acceleration factor 'ρ'. The method includes: receiving a transmission signal with pulses having a form 'gT' separated by 'ρT', where 'T' is the orthogonal pulse transmission time and 'ρ' (between 0 and 1) is an acceleration factor; generating sampled symbols from the transmission signal using a receiver filter; and generating decoded symbols from the sampled symbols using a decoding matrix. The decoding matrix elements are selected based on a property of the pulse form.
Unknown
December 5, 2017
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.