Low PAPR Binary Preamble Design

Slides:



Advertisements
Similar presentations
Doc.: IEEE /0050r0 Submission January 2007 Monisha Ghosh, PhilipsSlide 1 Low PAPR Binary Preamble Design IEEE P Wireless RANs Date:
Advertisements

LB84 General AdHoc Group Sept. Closing TGn Motions
[ Interim Meetings 2006] Date: Authors: July 2005
IEEE P Wireless RANs Date:
IEEE WG Status Report – July 2005
Binary Preamble Sequence Set
IEEE White Space Radio Contribution Title
London TGu Motions Authors: January 2007 Date: Month Year
LB73 Noise and Location Categories
LB73 Noise and Location Categories
WRAN Protocol Reference Model(PRM)
Waveform Generator Source Code
March 2014 Election Results
TGp Closing Report Date: Authors: July 2007 Month Year
Attendance and Documentation for the March 2007 Plenary
Attendance and Documentation for the March 2007 Plenary
[ Policies and Procedure Summary]
[ Policies and Procedure Summary]
Effect of FCH repetition on the detection of FCH and MAP
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
TGp Closing Report Date: Authors: March 2006 Month Year
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
ATSC DTV Receiver Performance Multipath Equalization
IEEE WG Opening Report – March 2007
On Coexistence Mechanisms
TGp Closing Report Date: Authors: March 2006 Month Year
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
IEEE WG Opening Report – July 2008
“Comment Status” Definitions
Binary Preamble Sequence Set
[PAPR Evaluation on SCH in IEEE ]
IEEE P Wireless RANs Date:
IEEE P Wireless RANs Date:
Spectrum Sensing Tiger Team
TGu-changes-from-d0-01-to-d0-02
September Opening Report
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:
TGr Proposed Draft Revision Notice
TGu-changes-from-d0-02-to-d0-03
[ Policies and Procedure Summary]
OFDM Parameters And Preambles
Draft P802.11s D1.03 WordConversion
Questions to the Contention-based Protocol (CBP) Study Group
January Opening Report
EC Motions – July 2005 Plenary
TGu-changes-from-d0-04-to-d0-05
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
TGp Motions Date: Authors: January 2006 Month Year
Presentation transcript:

Low PAPR Binary Preamble Design September 2006 doc.: IEEE 802.22-yy/xxxxr0 January 2007 Low PAPR Binary Preamble Design IEEE P802.22 Wireless RANs Date: 2007-01-17 Authors: Notice: This document has been prepared to assist IEEE 802.22. 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 802.22. Patent Policy and Procedures: The contributor is familiar with the IEEE 802 Patent Policy and Procedures http://standards.ieee.org/guides/bylaws/sb-bylaws.pdf 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 Chair Carl 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 802.22 Working Group. If you have questions, contact the IEEE Patent Committee Administrator at patcom@iee.org. > Monisha Ghosh, Philips Carlos Cordeiro, Philips

Advantage Of Binary Preambles January 2007 Advantage Of Binary Preambles Binary preambles enable very simple channel estimation, with no multiplications required. Significant complexity advantage for large FFT sizes, e.g 2K-FFT systems. Storage requirements are minimal: 1 bit per preamble symbol. Generating the preambles with shift-registers eliminates the need for any storage of multiple sequences. Monisha Ghosh, Philips

Method For Generating Binary Preambles. January 2007 Method For Generating Binary Preambles. General preamble structure in the frequency domain: [0 p1 … pL 0 … 0 pL+1 … p2L] Problem: Determine the sequences [p1..pL] and [pL+1 … p2L] to minimize PAPR of 4-times oversampled signal in the time domain. Let N = smallest power of 2 > L. For example, if L = 840, choose N = 1024. Pick a maximal length sequence of length N. For example, for N = 1024, choose x10 +x8 +x7 + x5 +1, and initialize the shift-register with all ones, to generate a sequence a(n). Cyclically shift sequence a(n) by shift S1 and let [p1..pL] = first L values of shifted sequence. Cyclically shift sequence a(n) by shift S2 and let [pL+1..p2L] = first L values of shifted sequence. Form the preamble sequence [0 p1 … pL 0 … 0 pL+1 … p2L]. Take IFFT of oversampled preamble and evaluate PAPR. Repeat for all combination of S1 and S2. Pick the combination (S1, S2) that minimizes PAPR. Monisha Ghosh, Philips

Example Assume L = 840 (1680 data+pilot carriers). January 2007 Example Assume L = 840 (1680 data+pilot carriers). Superframe/frame short: training symbol on every 4th frequency. Length 255 M-sequence: x8 + x7 +x3 + x2 + 1. S1 = 226, S2 = 109; PAPR = 4.4292 dB Frame long: training symbol on every 2nd frequency. Length 511 M-sequence: x9 + x8 + x7 + x6 +x4 +x2 + 1 S1 = 256 S2 = 492; PAPR = 4.7396 dB Superframe long: training symbol on every frequency. Length 1023 M-sequence: x10 +x8 +x7 +x5 +1 S1 = 296, S2 = 808; PAPR = 4.9868 dB If multiple preambles are required choose another generator, or another combination of (S1,S2). Monisha Ghosh, Philips

PAPR Of Random QPSK Data January 2007 PAPR Of Random QPSK Data PAPR < 5 dB for the preamble sequences will be adequate. Monisha Ghosh, Philips

January 2007 Conclusions Binary preambles for various decimation factors can be easily generated with low PAPR. Method presented leads to a very simple specification (generator + shifts) of sequences. Monisha Ghosh, Philips