Pre-DFT combining space diversity assisted COFDM

Okada, Minoru; Komaki, Shozo

doi:10.1109/25.923060

Cited by 66 publications

(32 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Related to the post-FFT configuration, a direction of arrival (DoA)-based technique is proposed for co-channel interference suppression in [6], and a minimum mean square error (MMSE)-based technique is proposed for space diversity in [7]. On the other hand, a pre-FFT type OFDM adaptive array antenna, which requires only one FFT processor, can drastically reduce the computational complexity by tolerating some performance degradation [8], [9]. This paper proposes a novel pre-FFT type OFDM adaptive array antenna called "Eigenvector Combining [10]."…”

Section: Introductionmentioning

confidence: 99%

A Pre-FFT OFDM Adaptive Array Antenna with Eigenvector Combining

Hara¹

2006

IEICE Transactions on Communications

View full text Add to dashboard Cite

SUMMARYThis paper proposes a novel pre-FFT type OFDM adaptive array antenna called "Eigenvector Combining." The eigenvector combining array antenna is a realization of a post-FFT type OFDM adaptive array antenna through a pre-FFT signal processing, so it can achieve excellent performance with less computational complexity and shorter training symbols. Numerical results demonstrate that the proposed eigenvector combining array antenna shows excellent bit error rate performance close to the lower bound just with 2 OFDM symbol-long training symbols.

show abstract

Section: Introductionmentioning

confidence: 99%

A Pre-FFT OFDM Adaptive Array Antenna with Eigenvector Combining

Hara¹

2006

IEICE Transactions on Communications

View full text Add to dashboard Cite

show abstract

“…A method to derive optimum diversity weight factors for multiple antenna Pre-DFT processing OFDM receiver is presented in [4]. We adopt a similar weight estimation scheme for our Pre-DFT MARC with CDD receiver diversity scheme.…”

Section: B Optimum Diversity Weightsmentioning

confidence: 99%

“…It is found that the optimum diversity weight vector gopt is the eigenvector, which corresponds to maximum eigenvalue from diagonal matrix Λ [4]. In the method described above, the covariance matrix C is derived from the CIRs of all diversity branches.…”

Section: B Optimum Diversity Weightsmentioning

confidence: 99%

“…In the method described above, the covariance matrix C is derived from the CIRs of all diversity branches. The CIR estimators (or equivalently CTF estimators) that are found in literature impose a high computational complexity, thus [4] employed the correlation among the signals of the diversity branches directly in time domain instead of explicitly estimating the CIRs or the CTFs of all the diversity branches.…”

Section: B Optimum Diversity Weightsmentioning

confidence: 99%

“…For an MRC-OFDM system as shown in Figure 1, the combining operations are performed at subcarrier level after the DFT operation, thus we denote the process as Post-DFT MRC or subcarrier combining receiver [4]. The received OFDM signals at different antenna branches are first transformed via M separate DFTs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimum pre-DFT combining with cyclic delay diversity for OFDM based WLAN systems

Rahman

Witrisal

Das

et al.

2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514)

View full text Add to dashboard Cite

Abstract-The cyclic delay diversity is applied in OFDM receiver to increase the frequency-selectivity of the channel seen at the receiver for flat (or less frequency-selective) channels. The diversity combining is performed prior to the Discrete Fourier Transform (DFT) operation. A new method has been studied to optimize the Pre-DFT diversity combining by selecting the cyclic shifts and weight factors based on known channel state information. The optimum signal to noise ratio for maximum cyclic delay and optimum weight factors for multiple antenna receiver diversity is analyzed. Performance results in terms of bit error probability is presented. Finally, it was found that the scheme advocated in this paper drastically reduces the computational complexity comparing to traditional receiver diversity schemes.

show abstract