Doc.: IEEE 802.22-06/0147-00-0000 SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 1 Preamble design and frequency offsets estimation for OFDMA.

Slides:



Advertisements
Similar presentations
Doc.: IEEE /0365r0 Submission July 2007 Monisha Ghosh, PhilipsSlide 1 Rate ¼ Convolution Code IEEE P Wireless RANs Date: Authors:
Advertisements

Doc.: IEEE /0049r0 Submission Zander LEI, I2R Singapore January 2007 Slide 1 Proposed Beacon Design vs. Baseline Date: Authors: Notice:
Doc.: IEEE /0050r0 Submission January 2007 Monisha Ghosh, PhilipsSlide 1 Low PAPR Binary Preamble Design IEEE P Wireless RANs Date:
Doc.: IEEE /0116r0 Submission March 2007 Carlos de Segovia, France TelecomSlide 1 Service allocation for IEEE P Wireless RANs Date:
Doc.: IEEE /0032r0 Submission January 2007 Slide 1 Soo-Young Chang, Huawei Technologies Interference Detection Using Preambles for Sensing IEEE.
Doc.: IEEE /0179r0 Submission April 2007 Wu Yu-Chun, Huawei HisiSlide 1 CRC_Length_and_FEC_gain_of_PSDU for the IEEE P Wireless.
Doc: IEEE /0102r0 Submission March 2008 Slide 1 HuaweiLiu Jinnan Huawei Hisi Optimization of Channel Distribution Authors: Notice: This document.
Doc.: IEEE /0125r0 Submission July 2006 Slide 1 Huawei Interference Detection for Sensing IEEE P Wireless RANs Date: Authors:
Doc.: IEEE /0018r0 Submission January 2006 Patrick Pirat, France TelecomSlide 1 OQAM performances and complexity IEEE P Wireless RANs Date:
Doc.: IEEE /0038r0 Submission May 2005 Paul Thompson, Paul Thompson Associates, LLCSlide 1 WRAN Base Station Class Proposal IEEE P Wireless.
Uplink Symbol Structure
LB84 General AdHoc Group Sept. Closing TGn Motions
[ Interim Meetings 2006] Date: Authors: July 2005
IEEE WG Status Report – July 2005
Binary Preamble Sequence Set
IEEE White Space Radio Contribution Title
Low PAPR Binary Preamble Design
LB73 Noise and Location Categories
LB73 Noise and Location Categories
WRAN Protocol Reference Model(PRM)
Waveform Generator Source Code
[ Considering of Intra-cell multiple CBP response]
March 2014 Election Results
TGp Closing Report Date: Authors: July 2007 Month Year
Attendance and Documentation for the March 2007 Plenary
[ Policies and Procedure Summary]
Motion to accept Draft p 2.0
[place presentation subject title text here]
(Presentation name) For (Name of group) (Presenter’s name,title)
Fractional Bandwidth Usage
Block Spreading for OFDMA
On Coexistence Mechanisms
WRAN Protocol Reference Model(PRM)
[Comparison between CDMA Code and Contention-based Access]
TGu-changes-from-d0-02-to-d0-03
TGp Closing Report Date: Authors: May 2007 Month Year
IEEE WG Opening Report – March 2007
On Coexistence Mechanisms
Reflector Tutorial Date: Authors: July 2006 Month Year
TGv Redline D0.07 Insert and Deletion
TGv Redline D0.06 Insert and Deletion
Experimental DTV Sensor
Binary Preamble Sequence Set
Upstream interleaving performance (Comments #74)
IEEE WG Opening Report – July 2008
Binary Preamble Sequence Set
IEEE P Wireless RANs Date:
Spectrum Sensing Tiger Team
TGu-changes-from-d0-01-to-d0-02
LB73 Noise and Location Categories
IEEE P Wireless RANs Date:
TGy draft 2.0 with changebars from draft 1.0
TGv Redline D0.10 Insert and Deletion
IEEE WG Opening Report – July 2007
WAPI Position Paper Sept 2005 Sept 2005 IEEE WG
Redline of draft P802.11w D2.2 Date: Authors:
IEEE P Wireless RANs Date:
Beamforming Weight Adaptation for Dynamic Channel Switching
TGu-changes-from-d0-02-to-d0-03
[ Policies and Procedure Summary]
Comparison of CBP PHY Modes
Draft P802.11s D1.03 WordConversion
Questions to the Contention-based Protocol (CBP) Study Group
EC Motions – July 2005 Plenary
TGu-changes-from-d0-04-to-d0-05
STC with CSI feedback IEEE P Wireless LANs Date:
TGu-changes-from-d0-03-to-d0-04
TGu Motions Date: Authors: May 2006 May 2006
Frequency Repetition with CTC
WAPI Position Paper Sept 2005 Sept 2005 IEEE WG
Presentation transcript:

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 1 Preamble design and frequency offsets estimation for OFDMA uplink IEEE P Wireless RANs Date: Authors: Notice: This document has been prepared to assist IEEE It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE Patent Policy and Procedures: The contributor is familiar with the IEEE 802 Patent Policy and Procedures including the statement "IEEE standards may include the known use of patent(s), including patent applications, provided the IEEE receives assurance from the patent holder or applicant with respect to patents essential for compliance with both mandatory and optional portions of the standard." Early disclosure to the Working Group of patent information that might be relevant to the standard is essential to reduce the possibility for delays in the development process and increase the likelihood that the draft publication will be approved for publication. Please notify the Chairhttp://standards.ieee.org/guides/bylaws/sb-bylaws.pdf Carl R. StevensonCarl R. Stevenson as early as possible, in written or electronic form, if patented technology (or technology under patent application) might be incorporated into a draft standard being developed within the IEEE Working Group. If you have questions, contact the IEEE Patent Committee Administrator at >

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 2 Abstract Dedicated preambles are designed to estimate the carrier frequency offset (CFO) in orthogonal frequency division multiple access (OFDMA) uplink. Based on the preambles, algorithms are proposed for the CFO estimations. It is theoretically proved that the CFOs are identifiable by using the algorithms. Simulations results are given.

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 3 Introduction Due to oscillator instabilities and/or Doppler shifts, there exists carrier frequency offsets (CFOs) between the transmitters and the receivers. When there are CFOs, the orthogonality among the subcarriers of OFDMA is destroyed and the received signals are contaminated by the inter carrier interference (ICI) and multi-access interference (MAI). For OFDMA uplink, each user may have a different CFO, which further worsens the problem. To combat the ICI and MAI, first of all the CFOs must be estimated. CFO estimation for the OFDMA uplink is a crucial and challenging task. Known CFO estimation methods for single-user OFDM cannot be directly used here because there are multiple CFOs in OFDMA.

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 4 Preamble design Use one OFDM symbol as the preamble for frequencfy estimation in OFDMA uplink. Preamble design: The N subcarriers are divided into KQ consecutive subbands, where each subband has P=N/(KQ) subcarriers. Each user is allocated with Q subands, which are interleaved in the KQ subbands. In each subband, there is only one active subcarrier at the end of the subband. The minimum distance between any two active subcarriers is Δ1. For example, for N=16, K=2, Δ1=4, Q=2, the preamble structure in shown in Figure 1, where K is the number of users.

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 5 Figure 1. Preamble structure (N=16, K=2, Δ1=4, Q=2) Blue: user 1; Red: user 2

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 6 Frequency offsets estimation algorithms Figure 2. Simplified ML estimation Algorithm 1. Simplified ML estimation

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 7 Frequency offsets estimation algorithms Figure 3. Fast algorithm Algorithm 2. Fast algorithm where

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 8 Simulations and conclusions System settings The length of OFDM block N=2048 The length of the CP is 64 Random channels with no more than 65 taps Random CFOs in (-0.5, 0.5) Preamble design The N subcarriers are divided into KQ consecutive subbands, where each subband has P=N/(KQ) subcarriers. Each user is allocated with Q subands, which are interleaved in the KQ subbands. In each subband, there is only one active subcarrier at the end of the subband. The minimum distance between any two active subcarriers is Δ1. Simualtion results are given in Figure 4 to 6 when only one receiver antenna is used at the base-station. Figure 7 and 8 give the simualtion results when multiple receiver antennas are used at the base-station, where J is the number of antenna.

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 9 Simplified MLFast algorithm Figure 4. MSE ( number of users is K=32)

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 10 Figure 5. SER (number of users is K=32) Simplified ML Fast algorithm

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 11 Figure 6. SER (number of users is K=8) Simplified ML Fast algorithm

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 12 Figure 7. MSE for the fast algorithm (number of users is K=16, multiple antennas)

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 13 Figure 8. SER for the fast algorithm (number of users is K=16, multiple antennas)

doc.: IEEE / SubmissionYonghong Zeng, Insitute for Infocomm ResearchSlide 14 Conclusions Dedicated preambles are designed to estimate the carrier frequency offset (CFO) in orthogonal frequency division multiple access (OFDMA) uplink. Based on the preambles, algorithms are proposed for the CFO estimations. It is theoretically proved that the CFOs are identifiable by using the algorithms. Simulations results have been given to show the performance of the preamble design and the estimation algorithms.