Method and a system for transmitting DFT-s-OFDM symbols
Uloženo v:
| Název: | Method and a system for transmitting DFT-s-OFDM symbols |
|---|---|
| Patent Number: | 11349,622 |
| Datum vydání: | May 31, 2022 |
| Appl. No: | 16/990365 |
| Application Filed: | August 11, 2020 |
| Abstrakt: | The present disclosure discloses a method and a system for transmitting DFT-s-OFDM symbols. A data sequence for transmitting as an OFDM symbol is received as input from a data source. A reference sequence for transmitting along with the data sequence as the OFDM symbol is generated and time-multiplexed with the data sequence, to generate a multiplied sequence. Thereafter, a Discrete Fourier Transform (DFT) operation is performed on the multiplexed sequence to generate a DFT-spread-Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) symbol that is further processed for transmitting over a channel. The transmission of the reference sequence and the data sequence in a single OFDM symbol provides better bandwidth utilization and flexibility in modulation of the reference sequence and the data sequence. |
| Inventors: | WISIG NETWORKS PRIVATE LIMITED (Telangana, IN) |
| Claim: | 1. A method for transmitting Orthogonal Frequency Division Multiplexing (OFDM) symbols, comprising: generating, by a transmitter, at least one data sequence and at least one reference sequence (RS) for transmitting; precoding, by the transmitter, the at least one data sequence to generate a precoded data sequence; time-multiplexing, by the transmitter, the at least one RS with the precoded data sequence, to generate a multiplexed sequence; performing, by the transmitter, a Discrete Fourier Transform (DFT) on the multiplexed sequence to generate a DFT-spread-Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) symbol; and processing, by the transmitter, the DFT-s-OFDM symbol for transmitting over a channel. |
| Claim: | 2. The method as claimed in claim 1 , wherein the at least one data sequence is one of a BPSK sequence, a Pi/2 binary phase shift keying (BPSK) sequence, a Quadrature Phase Shift Keying (QPSK) sequence, a 16 QAM sequence, and a 64 QAM sequence. |
| Claim: | 3. The method as claimed in claim 1 , wherein the at least one data sequence is precoded using a filter. |
| Claim: | 4. The method as claimed in claim 1 , wherein the at least one data sequence is precoded using a two-tap filter, the two-tap filter comprises equal magnitudes for the two taps with a unit delay between the two taps. |
| Claim: | 5. The method as claimed in claim 1 , wherein the at least one data sequence is precoded using a three-tap filter having three consecutive taps, and wherein a first tap and a third tap of the three-tap filter have an equal magnitude. |
| Claim: | 6. The method as claimed in claim 1 , wherein the at least one RS is a Zadoff-Chu (ZC) sequence. |
| Claim: | 7. The method as claimed in claim 1 , wherein the at least one RS is a pi/2 BPSK reference sequence (pi/2 BPSK-RS). |
| Claim: | 8. The method as claimed in claim 7 , wherein the pi/2 BPSK-RS is filtered using a filter. |
| Claim: | 9. The method as claimed in claim 7 , wherein the pi/2 BPSK-RS is filtered using a two-tap filter, and wherein the two-tap filter comprises equal magnitudes for the two taps with a unit delay between the two taps. |
| Claim: | 10. The method as claimed in claim 7 , wherein the pi/2 BPSK-RS is filtered using a three-tap filter having three consecutive taps, and wherein a first tap and a third tap of the three-tap filter have an equal magnitude. |
| Claim: | 11. The method as claimed in claim 1 , wherein the at least one RS comprises at least one of a prefix and a postfix. |
| Claim: | 12. The method as claimed in claim 1 , wherein the at least one RS is located in at least one of a head, a tail, both a head and a tail, a center position and any other location of the DFT-s-OFDM symbol. |
| Claim: | 13. The method as claimed in claim 1 , wherein processing the DFT-s-OFDM symbol comprising: mapping the DFT-s-OFDM symbol to one or more sub-carriers to generate a mapped signal; and performing an Inverse Fast Fourier Transform (IFFT) on the mapped signal to produce a time domain DFT-s-OFDM signal. |
| Patent References Cited: | 2008/0279170 November 2008 Maladi 2010/0074244 March 2010 Luo 2010/0111209 May 2010 Frenger 2014/0003544 January 2014 Oketani 2014/0254530 September 2014 Kim 2016/0112994 April 2016 Wang 2017/0134203 May 2017 Zhu 2018/0062894 March 2018 Ma 2019/0097859 March 2019 Bala 2020/0076558 March 2020 Kuchi |
| Other References: | Int'l Search Report and Written Opinion Appln No. PCT/IN2017/050565 dated Jul. 3, 2018. cited by applicant K. Kuchi, “Partial Response DFT-precoded-OFDM Modulation,” IEEE Trans. on Emerging Tele. Tech., May 2012. cited by applicant F. Khan, “LTE for 4G Mobile Broadband Air Interface Technologies and Performance.” New York, NY: Cambridge University Press, 2009. cited by applicant Iith et. al., “Comparison of pi/2 BPSK with and without frequency domain pulse shaping: Results with PA model,” 3GPP TSG-RAN WG1 Ad-Hoc NR Meeting, R1-1701180, Spokane, WA, USA, Jan. 16-20, 2017. cited by applicant |
| Primary Examiner: | Soe, Kyaw Z |
| Attorney, Agent or Firm: | McAndrews, Held & Malloy, Ltd. |
| Přístupové číslo: | edspgr.11349622 |
| Databáze: | USPTO Patent Grants |
| Abstrakt: | The present disclosure discloses a method and a system for transmitting DFT-s-OFDM symbols. A data sequence for transmitting as an OFDM symbol is received as input from a data source. A reference sequence for transmitting along with the data sequence as the OFDM symbol is generated and time-multiplexed with the data sequence, to generate a multiplied sequence. Thereafter, a Discrete Fourier Transform (DFT) operation is performed on the multiplexed sequence to generate a DFT-spread-Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) symbol that is further processed for transmitting over a channel. The transmission of the reference sequence and the data sequence in a single OFDM symbol provides better bandwidth utilization and flexibility in modulation of the reference sequence and the data sequence. |
|---|