Presentation is loading. Please wait.

Presentation is loading. Please wait.

Title: Channel Coding schemes for the data portion of the BW REQ channel Document Number: IEEE C802.16m-09/1378 Date Submitted: 2009 – 07 - 06 Source:

Similar presentations


Presentation on theme: "Title: Channel Coding schemes for the data portion of the BW REQ channel Document Number: IEEE C802.16m-09/1378 Date Submitted: 2009 – 07 - 06 Source:"— Presentation transcript:

1 Title: Channel Coding schemes for the data portion of the BW REQ channel Document Number: IEEE C802.16m-09/1378 Date Submitted: 2009 – 07 - 06 Source: Kaushik Josiam, Hwasun Yoo, Zhouyue Pi, Heewon Kang, Hokyu Choi Voice:+972 761-7437 kjosiam@sta.samsung.com kjosiam@sta.samsung.com Samsung Telecommunications America 1301 E. Lookout Dr Richardson TX 75082 Venue: Session 62, July 13-16, 2009 Re: Call for Comments on 802.16m amendment working document IEEE 802.16m-09/0010r2, Section 15.3.9 Uplink Control Channel Purpose: To discuss and adopt the proposed text in the revision of the 802.16m AWD Notice This document does not represent the agreed views of the IEEE 802.16 Working Group or any of its subgroups. It represents only the views of the participants listed in the “Source(s)” field above. It is offered as a basis for discussion. It is not binding on the contributor(s), who 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.16. Patent Policy: The contributor is familiar with the IEEE-SA Patent Policy and Procedures: and.http://standards.ieee.org/guides/bylaws/sect6- 7.html#6http://standards.ieee.org/guides/opman/sect6.html#6.3 Further information is located at and.http://standards.ieee.org/board/pat/pat-material.htmlhttp://standards.ieee.org/board/pat 1

2 Channel Coding schemes for the data portion of the BW REQ channel Kaushik Josiam, Hwasun Yoo, Zhouyue Pi, Heewon Kang, Hokyu Choi Samsung Electronics

3 3 – step BW REQ procedure Need to find efficient encoding schemes to transmit the 15 bit quick access message

4 BWREQ Channel: PHY design 4 Access Portion of BWREQ tile 3 – length 24 sequences mapped to 3 tiles 3 bits of the 15 bit QA message used to indicate the Preamble Index Hadamard sequences Data Portion of BW REQ tile 12 bits of the 15 bit QA message 6x6 tile

5 Data Portion of the BW REQ tile 5 12 bits of the 15 bit Quick Access Message are to be transmitted in the Data portion of the BW REQ tile Candidate Channel Encoders 1/6 TBCC (24, 12, 8) Golay Code with repetition (72,12, 30) linear block code (NEW!!) (72, 12, 24) linear block code with Golay construction (NEW!!) Coherent Detection Use detected sequence as pilot to perform channel estimation for QA message ML receiver for linear block code Viterbi Algorithm for TBCC

6 1/6 TBCC 6 Proposed in Contribution C802.16m/09-0876.ppt Optimum Distance Spectrum Code K=7 G =[0133 0171 0165 0117 0127 0171] – Achieved by 1/5 with repetition the second polynomial – The 1/5 code was accepted as the coding scheme for Secondary fast feedback channel

7 (72,12,30) Linear Block Code Kohnert and Zwanzger construction Weight Enumerator – x 0 + 161x 30 + 616x 31 + 773x 32 + 320x 33 + 320x 38 + 880x 39 + 752x 40 + 192x 41 + 30x 46 + 40x 47 + 10x 48 + x 62 Minimum distance = 30 – Lower bound on minimum distance = Upper bound on minimum distance = 30 Best Linear Block Code !! 7

8 (72, 12, 24) code with Golay construction 14 different automorphisms for the (24,12,8) code Construct (72,12) code by using 3 different generator matrices (automorphisms) of the (24,12,8) Golay Code G = [G x G y G z ] For any x, y, z in the set of automorphisms – Construct generator matrix G for each combination of x, y, z – Compute weight polynomial for each G The weight polynomial is of the form – Ax 24 + Bx 28 + …… – Choose the generator matrices with indices x, y, z that lead to the smallest coefficient “A” PRO: – Performance similar to (72,12,30) code. – Can use efficient decoding algorithms designed for Golay Code 8

9 Performance Results with 1 user 9 1 dB Gain

10 Conclusions Linear Block codes offer a gain of 1dB in the link performance of the quick access message – Improved coverage Golay codes performance is similar to the best (72,12) linear block code – Reduced complexity implementations available for Golay codes

11 Recommendation Adopt text in C80216m-09/1377.doc


Download ppt "Title: Channel Coding schemes for the data portion of the BW REQ channel Document Number: IEEE C802.16m-09/1378 Date Submitted: 2009 – 07 - 06 Source:"

Similar presentations


Ads by Google