A Comparison of DCT-Based OFDM and DFT-Based OFDM in Frequency Offset and Fading Channels
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
A precise method for calculating the bit-error probability (BEP) of a discrete cosine transform (DCT)-based orthogonal frequency-division multiplexing (OFDM) system on additive white Gaussian noise (AWGN) channels in the presence of frequency offset is derived. These accurate results are used to examine and compare the BEP performance of a DCT-OFDM system and the conventional discrete Fourier transform (DFT)-based OFDM system in an AWGN environment. Several signaling formats, such as binary phase-shift keying, quaternary phase-shift keying, and 16-ary quadrature amplitude modulation are considered. The performance of a DCT-OFDM with a zero-padding guard-interval scheme is then compared with a zero-padded DFT-OFDM with the employment of minimum mean-square error (MMSE) detection and MMSE decision-feedback detection with ordering scheme over frequency-selective fast Rayleigh fading channels. Analysis and simulation results show that the DCT-OFDM system outperforms the DFT-OFDM system in the presence of frequency offset, and in frequency-selective fast-fading environments
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Discrete-Time Signal Processing
Oppenheim, A. V., & Schafer, R. W. (1989) · Cited by 12,648
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Discrete-time Signal Processing
Williamson, D. (1999) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0541-1 · Cited by 4,858
Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela, R. A. (2002) · 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167) · doi:10.1109/issse.1998.738086 · Cited by 3,527 · cited 2×
“One may well ask: how would the relative performance of ZP-DCT-OFDM and ZP-DFT-OFDM change with a more advanced receiver? Therefore, in this paper, we examine two suboptimum detection algorithms, MMSE and MMSE DFD with ordering (also known as MMSE successive detection in [36], and MMSE V-BLAST in [37]–[39]).”
BackgroundMethodMulticarrier modulation for data transmission: an idea whose time has come
Bingham, J. A. C. (1990) · IEEE Communications Magazine · doi:10.1109/35.54342 · Cited by 3,438
Christopoulos, C., & Wright, A. (1999) · Electrical Power System Protection · doi:10.1007/978-1-4757-5065-2_13 · Cited by 2,748
Principles of Mobile Communication
(2002) · Kluwer Academic Publishers eBooks · doi:10.1007/b117369 · Cited by 2,674
Data Transmission by Frequency-Division Multiplexing Using the Discrete Fourier Transform
Weinstein, S. B., & Ebert, P. M. (1971) · IEEE Transactions on Communication Technology · doi:10.1109/tcom.1971.1090705 · Cited by 2,624 · cited 1×
“Particularly, in orthogonal frequency-division multiplexing (OFDM) systems, digital modulations and demodulations can be realized with the inverse DFT (IDFT) and DFT, respectively [5].”
BackgroundAnalysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing
Cimini, L. J. (1985) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1985.1096357 · Cited by 2,549
A technique for orthogonal frequency division multiplexing frequency offset correction
Moose, P. H. (1994) · IEEE Transactions on Communications · doi:10.1109/26.328961 · Cited by 2,329 · cited 2×
“In DFT-OFDM, ICI is introduced after the DFT operation at the receiver [13], [19], [26], [27].”
MethodThe Fourier integral and its applications
Papoulis, A. (1962) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,650
A Fast Computational Algorithm for the Discrete Cosine Transform
Chen, W.-H., Smith, C., & Fralick, S. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093941 · Cited by 1,148 · cited 2×
“DCT algorithms proposed in [8] and [9] can provide fewer”
BackgroundMethodPrinciples of mobile communication (2nd ed.)
Stüber, G. L. (2001) · Kluwer Academic Publishers eBooks · Cited by 812
Rao, K. R., & Yip, P. C. Y. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-092534-9.50007-2 · Cited by 659
Fast algorithms for the discrete W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597 · cited 1×
“DCT algorithms proposed in [8] and [9] can provide fewer”
BackgroundA discrete multitone transceiver system for HDSL applications
Chow, J. S., Tu, J., & Cioffi, J. M. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.93100 · Cited by 512 · cited 1×
“16a, and HIPERLAN/2, but in wire-line digital communications systems, such as asymmetric digital subscriber loop (ADSL) [1]–[4].”
BackgroundSymmetric convolution and the discrete sine and cosine transforms
Martucci, S. A. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.295213 · Cited by 371 · cited 1×
“By using the circular convolution property of the DCT [15], [16] reported that by feeding a symmetrically extended data sequence into a DCT-OFDM system, in the case of static and exponentially decaying channel profiles, the throughput lower bound of the DCT-based OFDM system is greater than that of the DFT-based OFDM…”
MethodThe generation of correlated Rayleigh random variates by inverse discrete Fourier transform
Young, D. J., & Beaulieu, N. C. (2000) · IEEE Transactions on Communications · doi:10.1109/26.855519 · Cited by 272
Self-citationADSL, VDSL, and Multicarrier Modulation
Bingham, J. A. C. (2001) · Wiley eBooks · doi:10.1002/0471200727 · Cited by 220 · cited 2×
“I. INTRODUCTION MULTICARRIER modulation (MCM) is used not only inthe physical layers of many wireless network standards, such as IEEE 802.11a, IEEE 802.16a, and HIPERLAN/2, but in wire-line digital communications systems, such as asymmetric digital subscriber loop (ADSL) [1]–[4].”
BackgroundImproved importance sampling technique for efficient simulation of digital communication systems
Lu, D., & Yao, K. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.192731 · Cited by 172 · cited 1×
“Importance sampling [31] is used to reduce the variance of the simulation estimates.”
MethodM -ary amplitude shift keying OFDM system
Xiong, F. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818103 · Cited by 92 · cited 2×
“In addition, carrier-frequency offset (CFO), which was not considered in [10] and [11], will introduce intercarrier interference (ICI) in both the DFT-OFDM system [12] and the DCT-OFDM system.”
BackgroundMethodTapped delay line model of linear randomlytime-variant WSSUS channel
Sýkora, J. (2000) · Electronics Letters · doi:10.1049/el:20001168 · Cited by 22 · cited 1×
“The TDL tap coefficients , and , which are, in general, correlated, can be obtained from [33] , where , is the duration of a DCT-OFDM symbol without zero-padding, and , where denotes the floor operation.”
Background
Metadata
- Authors
- Tan, P., & Beaulieu, N. C.
- Venue
- IEEE Transactions on Communications
- Published
- 2006-11
- Volume
- 54
- Issue
- 11
- Pages
- 2113-2125
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2154104609
- Cited by
- 162
- References
- 23
- FWCI
- 4.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.