Simplification of DFT and IDFT in PRACH
Abstract The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function by using the property of Zadoff‐Chu...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-08-01
|
| Series: | Electronics Letters |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ell2.12894 |
| _version_ | 1827867544153751552 |
|---|---|
| author | Yufeng Jiang Shouxin Kang |
| author_facet | Yufeng Jiang Shouxin Kang |
| author_sort | Yufeng Jiang |
| collection | DOAJ |
| description | Abstract The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function by using the property of Zadoff‐Chu (ZC) sequence, and the latter is an approximation based on cubic spline interpolation, which not only reduces the IDFT points, but also is easy to construct. |
| first_indexed | 2024-03-12T15:19:00Z |
| format | Article |
| id | doaj.art-83206f1efc9c4264aa2c926eae16697b |
| institution | Directory Open Access Journal |
| issn | 0013-5194 1350-911X |
| language | English |
| last_indexed | 2024-03-12T15:19:00Z |
| publishDate | 2023-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | Electronics Letters |
| spelling | doaj.art-83206f1efc9c4264aa2c926eae16697b2023-08-11T07:18:29ZengWileyElectronics Letters0013-51941350-911X2023-08-015915n/an/a10.1049/ell2.12894Simplification of DFT and IDFT in PRACHYufeng Jiang0Shouxin Kang1CCTEG China Coal Research Institute No.5 Qingniangou RoadBeijing100013ChinaCCTEG China Coal Research Institute No.5 Qingniangou RoadBeijing100013ChinaAbstract The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function by using the property of Zadoff‐Chu (ZC) sequence, and the latter is an approximation based on cubic spline interpolation, which not only reduces the IDFT points, but also is easy to construct.https://doi.org/10.1049/ell2.128945G mobile communicationcomputational complexitysignal generators |
| spellingShingle | Yufeng Jiang Shouxin Kang Simplification of DFT and IDFT in PRACH Electronics Letters 5G mobile communication computational complexity signal generators |
| title | Simplification of DFT and IDFT in PRACH |
| title_full | Simplification of DFT and IDFT in PRACH |
| title_fullStr | Simplification of DFT and IDFT in PRACH |
| title_full_unstemmed | Simplification of DFT and IDFT in PRACH |
| title_short | Simplification of DFT and IDFT in PRACH |
| title_sort | simplification of dft and idft in prach |
| topic | 5G mobile communication computational complexity signal generators |
| url | https://doi.org/10.1049/ell2.12894 |
| work_keys_str_mv | AT yufengjiang simplificationofdftandidftinprach AT shouxinkang simplificationofdftandidftinprach |