Close category search window
 

V-OFDM: On Performance Limits over Multi-Path Rayleigh Fading Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Peng Cheng ; Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Meixia Tao ; Yue Xiao ; Wenjun Zhang

As a bridge of connecting orthogonal frequency division multiplexing (OFDM) with single-carrier frequency domain equalization (SC-FDE) techniques, Vector OFDM (V-OFDM) provides significant flexibility in system design. This paper presents an analytical study of V-OFDM over multi-path fading channels. Our goal is to investigate the diversity gain and coding gain of each vector block (VB) in V-OFDM so as to ultimately reveal its performance limits over fading channel. By using algebraic number theory tools, we rigorously prove for the first time that a majority of VBs in V-OFDM can surely realize the diversity gain of min {M,G} , where M is the length of each VB, and G is the total number of channel taps. Furthermore, some specific VBs, whose length equals the total number of channel taps, can not only harvest the maximum diversity gain but also achieve the maximum coding gain. It is further demonstrated that, even though VBs fail to benefit from additional diversity gain when M exceeds G, they can enjoy significantly increased coding gains. Our analysis concludes that it is preferable to choose the length of VBs to be equal to the number of channel taps in consideration of both overall system performance and computational complexity.

Published in:
Communications, IEEE Transactions on  (Volume:59 ,  Issue: 7 )

Date of Publication: July 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.