`
`
`
`
`
`
`
`
`
`
`This file wrapper was thoroughly reviewed by
`our technical staff. The File History Jacket
`Cover and Table of Contents page is missing
`from the original USPTO file history.
`
`This has been brought to your attention so that
`you will know it has not been overlooked.
`
`
`ZTE, Exhibit 1011-0001
`
`

`

`PTO/SB/16 (09-04)
`Approved for use through 07/31/2006. 0MB 0651-0032
`U.S. Patent and Trademark Office; U.S. DEPARTMENT OF COMMERCE
`Under the Paperwork Reduction Act of 1995, no persons are required to respond to a collection of infonnation unless it displays a valid 0MB control number.
`PROVISIONAL APPLICATION FOR PATENT COVER SHEET
`.
`This is a re uest for filin a PROVISIONAL APPLICATION FOR PATENT under 37 CFR 1.53 c .
`Express Mail Label No. EV517424492us
`
`0
`
`,.
`
`~
`
`\
`
`.
`!-n
`'--r-
`Given Name (first and middle [if any])
`
`INVENTOR($)
`Family Name or Surname
`
`Residence
`(Citv and either State or Foreian Countrv)
`
`JIA
`
`OTTAWA, ONTARIO, CANADA
`MING
`separately numbered sheets attached hereto
`Additional inventors are being named on the
`ONE
`TITLE OF THE INVENTION 1500 characters max):
`METHODS AND APPARATUS OF CLOSED LOOP MIMO PRE-CODING AND FEEDBACK
`FOR IEEE802.16e
`
`Direct all correspondence to:
`CORRESPONDENCE ADDRESS
`0 The address corresponding to Customer Number:
`OR
`□ Firm or
`
`I
`
`Individual Name
`Address
`
`00626
`
`I
`
`City
`
`Countiy
`
`State
`
`Telephone
`
`Zip
`
`Fax
`
`1-,(cid:173)a. . =-"
`mco
`:..
`co -0 co
`~ ,-
`
`~
`g
`
`ENCLOSED APPLICATION PARTS (check all that apply)
`D CD{s), Number of CDs
`0 Specification Number of Pages 15
`D Other (specify)
`0 Drawing(s) Number of Sheets 69
`0 Application Data Sheet. See 37 CFR 1.76
`METHOD OF PAYMENT OF FILING FEES FOR THIS PROVISIONAL APPLICATION FOR PATENT
`D Applicant claims small entity status. See 37 CFR 1.27.
`D A check or money order is enclosed to cover the filing fees.
`I 160.00
`□ Payment by credit card. Form PT0-2038 is attached.
`-
`0 The Director is hereby authorized to charge filing fees or credit any overpayment to Deposit Account Number: 14-1315
`A duplicative copy of this form is enclosed for fee processinr:i.
`□ The invention was made by an agency of the United States Government or under a contract with an agency of the United States
`□ Yes, the name of the U.S. Government agency and the Government contract number are:
`-
`- /T
`-
`"
`-
`/__ ~~~
`..d,_
`~ - -
`V
`•
`TYPED or PRINTED NAME PAUL C. HASHIM
`
`Government. No.
`
`f f
`
`SIGNA~E
`
`Date September 30, 2004
`
`TELEPHONE 972-684-7886
`
`REGISTRATION NO . ....;3c.c1.:.;;,6..;..18;;..... ____ _
`(if appropriate)
`Docket Number: 17381 ROUS01 P
`USE ONLY FOR FIUNG A PROVISIONAL APPL/CATION FOR PATENT
`This collection of information is required by 37 CFR 1.51. The information is required to obtain or retain a benefit by the public which is to file (and by the USPTO
`to process) an application. Confidentiality is governed by 35 U.S.C. 122 and 37 CFR 1. 11 and 1.14. This collection is estimated to take 8 hours to complete,
`including gathering, preparing. and submitting the completed application form to the USPTO. Time will vary depending upon the individual case. Any comments
`on the amount of time you require to complete this form and/or suggestions for reducing this burden, should be sent to the Chief Information Officer, U.S. Patent
`and Trademark Office, U.S. Department of Commerce, P.O. Box 1450, Alexandria, VA 22313-1450. DO NOT SEND FEES OR COMPLETED FORMS TO THIS
`ADDRESS. SEND TO: Commissioner for Patents, P.O. Box 1450, Alexandria, VA 22313-1450.
`If you need assistance in ccmpteting the fonn, catl 1-800-PT0-9199 and select option 2.
`
`FILING FEE
`amc11at£Sil
`
`I
`
`Copy provided by USPTO from the IFW lmaQe Databa~~ nn fl1'/-1?1?Mt:
`
`ZTE, Exhibit 1011-0002
`
`

`

`PTO/SB/16 (09-04)
`Approved for use through 07/3112006. 0MB 0651-0032
`U.S. Patent and Trademark Office; U.S. DEPARTMENT OF COMMERCE
`Under the Paperwork Reduction Act of 1995, no per.;ons are required to respond to a collection of information unless it displays a valid 0MB control number.
`
`I First Named Inventor
`
`IMINGJIA
`
`PROVISIONAL APPLICATION COVER SHEET
`Additional Page
`
`I Docket Number 17381ROUS01P
`
`Given Name <first and middle lif anvil
`
`Familv or Surname
`
`Residence
`(City and either State or Forelan Countrv)
`
`INVENTOR(S)/APPLICANT(S)
`
`WEN
`
`PEIVING
`
`TONG
`
`ZHU
`
`OTTAWA, ONTARIO, CANADA
`
`KANATA, ONTARIO, CANADA
`
`Number _...;O!o<!.:!N.,,,E~- of ONE
`
`WARNING: Information on this form may become public. Credit card information should not be
`included on this form. Provide credit card information and authorization on PT0-2038.
`
`Copy provided by USPTO from the IFW Image Database on fl!-./i?/?Mc
`
`ZTE, Exhibit 1011-0003
`
`

`

`u
`
`17381ROUS01P
`
`1
`
`PROVISIONAL PATENT APPLICATION
`
`SUBMITTED ON SEPTEMBER 30, 2004
`
`TITLE:
`
`SYSTEM AND METHOD FOR CLOSED LOOP MIMO PRE-CODING AND
`FEEDBACK
`
`INVENTORS:
`
`MING JIA, OTTAWA, ONTARIO CANADA
`
`WEN TONG, OTTA WA, ONTARIO CANADA
`
`PEIYING ZHU, KANATA, ONTARIO CANADA
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0004
`
`

`

`,.
`
`I)
`
`17381ROUS01P
`
`2
`
`SYSTEM AND METHOD FOR CLOSED LOOP l\11MO PRE-CODING AND
`FEEDBACK
`
`The present invention generally relates to closed loop MIMO (Multiple Input Multiple
`Output) pre-coding and feedback, and more specifically to closed loop MIMO pre-coding
`and feedback for purposes of the IEEE 802.16( e) and IEEE 802.11 (n) standards.
`
`BACKGROUND OF THE INVENTION
`
`As will be apparent to one of skill in the art there are numerous problems with the current
`IEEE 802.16(e) standard that need to be resolved including:
`
`[l] MIMO channel feedback bandwidth reduction
`[2] Antenna group selection
`[3] MIMO channel feedback ageing
`[4] Vector quantization for the MIMO channel
`[5] MIMO feedback flow control associated MAC design
`[ 6] Feedback channel design
`[7] Feedback STC coding and channel sounding
`
`While several solutions have been proposed in IEEE802.16(e) and IEEE802.l l(n) for the
`closed loop MIMO pre-coding transmission, they are not practical for the following
`reasons:
`
`[ 1] The Hausholder transform based SVD beam former feedback: The problem
`with this approach is that it is too complex for mobile channel realization
`
`[2] Single user based fixed sub-channel allocation: The problem with this
`approach is that it has 2-3 times capacity loss compared to multi-user diversity
`
`[3] Receiver based vector channel quantization: The problem with this approach
`is that it exponentially increases terminal complexity
`
`A need exists therefore for an improved system and method for enabling closed loop
`MIMO pre-coding and feedback.
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0005
`
`

`

`•
`
`,,
`
`17381ROUS01P
`
`3
`
`SUMMARY OF THE INVENTION
`
`It is an object of the invention to provide a closed loop MIMO pre-coding and feedback
`system and method for the IEEE802. l 6( e) and IEEE 802.11 (n) standards.
`
`It is another object of the invention to provide a closed loop MJMO pre-coding and
`feedback system and method for the WiMAX forum.
`
`It is another object of the invention to provide a multi-user allocation for an OFDMA
`banded sub-channel
`
`It is another object of the invention to provide feedback ageing processing
`
`It is another object of the invention to provide differential feedback of a MIMO channel
`
`It is another object of the invention to provide Givens-rotation based decomposition of a
`beam-former
`
`It is another object of the invention to provide a multi-user scheduled downlink (DL)
`MIMO transmission
`
`It is another object of the invention to provide MAC control of MJMO feedback
`
`It is another object of the invention to provide a space time coded MIMO feedback
`channel
`
`It is another object of the invention to provide combined sounding of a MIMO channel
`and CQI (channel quality indicator) feedback
`
`It is another object of the invention to provide first multi-user feedback of a MIMO
`channel to a basestation (BTS) by MIMO channel compression or uplink (UL) MIMO
`channel sounding
`
`It is another object of the invention to provide a Multi-user selection and allocation
`strategy
`
`It is another object of the invention to provide multi-user pre-coding transmission to
`increase the range or to separate the inter-user interference.
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0006
`
`

`

`.,
`
`"
`
`17381ROUS01P
`
`4
`
`DETAILED DESCRIPTION OF THE INVENTION
`
`The following provides a glossary of the terms used in this application:
`
`• AMC
`• BS orBTS
`• CL_MIMO
`• CQI
`• CQICH
`• DFr
`• FB
`• FDD
`• FFf
`• MIMO
`• MLD
`• MSE
`• MSS
`• PUSC
`• QoS
`• SISO
`• SVD
`• STTD
`• SM
`• SQ
`• TDD
`• VQ
`
`Adaptive Coding and Modulation
`Base Station
`Closed Loop MIMO
`Channel Quality Indicator
`CQlchannel
`Discrete Fourier Transform
`Feedback
`Frequency Duplex
`Fast Fourier Transform
`Multiple Input Multiple Output
`Maximum Likelihood Detector
`Minimum square error
`Mobile Subscriber Station
`Partially Utilized Sub-Channel
`Quality of service
`Single Input Single Output
`Singular Value Decomposition
`Space Time Transmit Diversity
`Spatial Multiplexing
`Scalar Quantize
`Time Duplex
`Vector Quantize
`
`The embodiments set forth below represent the necessary information to enable those
`skilled in the art to practice the invention and illustrate the best mode of practicing the
`invention. Upon reading the following description in light of the accompanying drawing
`figures, those skilled in the art will understand the concepts of the invention and will
`recognize applications of these concepts not particularly addressed herein. It should be
`understood that these concepts and applications fall within the scope of the disclosure and
`the accompanying claims.
`
`In accordance with a broad embodiment of the invention there is provided a way of
`facilitating closed loop MIMO pre-coding and feedback in a communications network
`operating in accordance with the IEEE 802.16(e) and IEEE 802.ll(n) standards.
`
`,.
`
`Prior to describing the details, however, a brief overview of an IEEE 802.16( e) / IEEE
`802.1 l(n) environment in accordance with a broad embodiment of the invention is
`presented in Figure 1. As will be apparent to one of skill in the art the various boxes
`depicted therein are representative of algorithms which may be embedded in software,
`firmware or an ASIC (application specific integrated circuit). The broader inventions are
`not intended to be limited in this regard.
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0007
`
`

`

`,.
`
`17381ROUS01P
`
`5
`
`As shown in Figure 1 particular embodiments of the invention can be largely grouped
`into four categories of algorithms for purposes of illustration:
`
`• Multi-User Selection (Embodiment 1.0): includes algorithms for organizing users,
`organizing antennas and selecting sub-bands;
`
`• Quantized MIMO Channel Feedback (Embodiment Group 2.0): includes
`algorithms for facilitating feedback from a terminal to a BTS;
`
`• MAC Layer (Embodiment 3.0): includes algorithms for the overall operation of
`the IEEE 802.16( e) or 802.11 (n) environment
`
`• Feedback channel for MIMO channel information MIMO (Embodiment 4.0):
`includes the feedback channel structure with the channel sounding capability and
`space time coding on the feedback channel.
`
`In accordance with an embodiment of the invention Embodiments 1.0 and 3.0 occurs
`predominately within an associated BTS, Embodiment 2.0 predominately within an
`associated terminal, and Embodiment 4.0 occurring in both.
`
`Regarding the sub-Embodiments of Embodiment 2.0 (2.1 and 2.2) one of skill in the art
`will appreciate that these algorithms are generally alternative to each other and need not
`co-exist. Similarly their respective sub-Embodiments are alternatives and need not co(cid:173)
`exist.
`
`In accordance with an embodiment of the invention the sub-Embodiments of
`Embodiment 4.0 co-exist.
`
`Figures 2 and 3 present a comparison of SVD to Antenna Grouping for purposes of
`providing context for Embodiment 1.0.
`
`Figure 4 presents an antenna! grouping algorithm in accordance with an embodiment of
`the invention (Embodiment 1.0. l - Modes Selection)
`
`Figure 5 presents an antenna grouping algorithm in accordance with an embodiment of
`the invention (Embodiment 1.0.2 - Antenna Grouping Criterion)
`
`Figure 6 presents an antenna grouping algorithm in accordance with an embodiment of
`the invention (Embodiment 1.0.3 - Antenna Group Selection)
`
`Figure 6A presents a multi-user pre-coding algorithm in accordance with an embodiment
`of the invention (Embodiment 1.1.0 - Dirty Paper coding)
`
`Figure 6B presents a multi-user pre-coding algorithm in accordance with an embodiment
`of the invention (Embodiment 1.1.1 - Multi-User Pre-coding with assigned set of users)
`
`Copy provided by USPTO from the IFW lmaqe DatabPM "" nc,11?i?nn,.-
`
`ZTE, Exhibit 1011-0008
`
`

`

`17381ROUS01P
`
`"
`
`6
`
`Figure 6C presents a multi-user pre-coding algorithm in accordance with an embodiment
`of the invention (Embodiment 1.1.2 - Multi-User Pre-coding with multi-user diversity)
`
`Note, the designations 6A through 6C were chosen in the interests of time and does not
`necessarily suggest a relationship with Figure 6 or each other.
`
`Figure 7 presents a direct differential encoding algorithm in accordance with an
`embodiment of the invention (Embodiment 2.1.1.0-Architecture (1))
`
`Figure 8 presents a direct differential encoding algorithm in accordance with another
`embodiment of the invention (Embodiment 2.1.1.0-Architecture (2))
`Figure 9 presents a direct differential encoding algorithm (FB) in accordance with an
`embodiment of the invention (Embodiment 2.1.1.1 -Differential Encoder: 1 bit DPCM)
`
`Figure 10 presents a direct differential encoding algorithm (FB) in accordance with an
`embodiment of the invention (Embodiment 2.1.1.2 - Differential Encoder: 1 bit Delta /
`Sigma)
`
`Figure 11 presents a direct differential encoding algorithm (FB) in accordance with an
`embodiment of the invention (Embodiment 2.1.1.2 - Differential Encoder: 1 bit Delta I
`Sigma)
`
`Figure 12 presents a direct differential encoding algorithm (FB) in accordance with an
`embodiment of the invention (Embodiment 2.1.1.3 - Differential Encoder Operation)
`
`Figure 13 presents a direct differential encoding algorithm (FB) in accordance with an
`embodiment of the invention (Embodiment 2.1.1.4 - Feedback Channel)
`
`Figure 14 presents a differential encoding of transformed MIMO channel algorithm in
`accordance with an embodiment of the invention (Embodiment 2.1.2.1 - Differential
`encoding of unitary matrix)
`
`Figure 15 presents a differential encoding of transformed MIMO channel algorithm in
`accordance with an embodiment of the invention (Embodiment 2.1.2 .2 - Differential
`encoding of vector weights)
`
`Figure 16 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.0 - Givens Rotation Architecture)
`
`r-
`
`Figure 17 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.1 -Givens Rotation for 2-Transmit
`Antenna)
`
`Figure 18 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.2-Givens Rotation for 3-Transmit
`Antenna)
`
`Copy provided by USPTO from the IFW lmaqe Database on 05/1?/?nni:::
`
`ZTE, Exhibit 1011-0009
`
`

`

`17381ROUS01P
`
`7
`
`Figure 19 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.3 - Givens Rotation Architecture for 4-
`Transmit Antenna)
`
`Figure 20 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.4 - Givens Rotation Architecture for n(cid:173)
`Transmit Antenna)
`
`Figure 21 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.5 - Truncation of Givens Expansion)
`Figure 22 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.6 - Truncation of Givens Expansion)
`
`Figure 23 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.7-Bit Allocation (1))
`
`Figure 24 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1. 7 - Bit Allocation (2))
`
`Figure 25 presents an SVD based Givens transform SQ algorithm in accordance with an
`embodiment of the invention (Feedback requirement Example)
`
`Figure 26 presents an SVD based Givens transform VQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.2.1 - Grassmann Subspace Packing)
`
`Figure 27 presents an SVD based Givens transform VQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.2.2 - Spherical Code Based Quantizer (1))
`
`Figure 28 presents an SVD based Givens transform VQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.2.3 - Spherical Code Based Quantizer (2))
`
`Figure 29 presents a receiver based Givens transform in accordance with an embodiment
`of the invention (Embodiment 2.2.3.0 - Architecture)
`
`Figure 30 presents a receiver based Givens transform in accordance with an embodiment
`of the invention (Embodiment 2.2.3.1 - Search Criteria)
`
`Figure 31 presents a receiver based Givens transform in accordance with an embodiment
`of the invention (Embodiment 2.2.3.2 - Feedback method)
`
`Figure 32 presents an SVD based pre-coding algorithm in accordance with an
`embodiment of the invention (SVD Decomposition >>> cost n3
`)
`
`Figure 33 presents an SVD based pre-coding algorithm in accordance with an
`embodiment of the invention (SVD Decomposition >>> cost n3
`)
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0010
`
`

`

`17381ROUS0IP
`
`8
`
`Figure 34 presents a MAC Support for CL-MIMO algorithm in accordance with an
`embodiment of the invention (Embodiment 3.0 -- FDD MIMO channel feedback (1))
`
`Figure 35 presents a MAC Support for CL-MIMO algorithm in accordance with an
`embodiment of the invention (Embodiment 3.0 -- FDD MIMO channel feedback (2))
`
`Figure 36 presents a MAC Support for CL-MIMO algorithm in accordance with an
`embodiment of the invention (Embodiment 3.1 -- TDD MIMO channel feedback)
`
`Figure 37 presents a MAC Support for CL-MIMO algorithm in accordance with an
`embodiment of the invention (Embodiment 3.0 -- FDD MIMO channel feedback (1))
`
`According to the embodiment of the invention shown in Figure 37, MIMO feedback
`channel allocation information element (MIMO_CQICH_Alloc_IE) is provided
`
`This IE is used by BS to assign one or more fast feedback channel (CQICH) to a MSS for
`the MSS to provide MIMO feedback.
`
`Table 1 --MIMO_CQICH Alloc IE
`
`Svntax
`MIMO COICH Alloc IE () f
`
`~ Notes
`
`Extended UIUC
`Len!!th
`Num Assi1T11ments
`For ( i = 0: i
`kNum Assimments: i++)
`f
`CID
`Duration( d)
`
`Frame offset
`
`r
`
`4 bits Ox??
`4 bits
`.en!!th in bvtes of followinl! fields
`~ Number of asshmments in this IE
`
`16 bits MSS basic CID
`~ The COICH is assiimed to a MSS for 10x2e1
`trames:
`ff d =0b000 the COICH is deallocated:
`If d = Ob 111. the MSS shall reoor feedback
`information usinl! the asshmed resource until
`he BS commands for the MSS to stoo
`~ The MSS starts to nrovide MIMO feedback
`at the frame which the number has the same
`BLSB as the snecified frame offset. If the
`current frame is snecified. the MSS shall
`start transmit feedback in 8 frames
`
`If< d !=ob000)
`l
`Num COICH Allocation ~ Number of COICHs allocated to the MSS
`identified bv the MSS basic CID
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0011
`
`

`

`17381ROUS01P
`
`9
`
`Num MIMO feedback ~ Numer of feedbacks formatted based on the
`Format index defined below
`llfil.
`Indication of the len2:th of AMC band index
`Len2:th of band index
`Length of COi value index ~ indication of the len!!th of COi value index
`)b00: 4 bits
`)b01: 5 bits
`)blO: 6bits
`Ob 11: reserved
`3 bits See Table Z
`
`Format Index
`J
`l
`1
`
`After a MSS receives such a IE, the MSS may continuously transmit the following
`information defined in Table 1 during the assignment duration or until the CQICH(s) is
`deallocated. The information bits may be mapped to the assigned CQICH(s) in the
`following way:
`
`For the first frame where CQICH(s) is allocated, the payload of first CQICH is first filled
`and the payload of second CQICH is filled up and so on until the all assigned CQICH(s)
`in the frame is filled up; for the following frames, the above is repeated
`
`Smtax
`for ( i=0: i < Num MIMO feedback: i++)
`
`Table 2. MIMO feedback.
`Size
`
`Notes
`ff the Num MIMO feedback >
`1. the feedback. either laver
`oased or AMC band based.
`:shall be in the order so that the
`aver or AMC band who has the
`maximum COi annears first.
`
`(
`Feedback content formatted as indicated bv format 3 bits See Table xx. Feedback format.
`·ndex
`~
`If (Format index == 4)
`A vera!!e interference
`If (Format index== 4)
`STTD/BLAST Selection
`
`1 bit
`
`Ob0: STTD is selected
`Ob l :BLAST is selected
`
`~ bits A vera2:e interference
`
`1
`
`Table 3 MIMO feedback formats
`
`Copy provided by USPTO from the IFW lma~e Datal:l.::a."1A n" rv::.1-1?,,,,.,..,
`
`ZTE, Exhibit 1011-0012
`
`

`

`17381ROUS01P
`
`10
`
`Also provided in accordance with an embodiment of the invention is a MIMO_Feedback
`Request message
`
`This message may be used by BS to request-MIMD feedback information from a MSS
`who support MIMO operation.
`
`Table 4 - MIMO Feedback request message format
`
`S:Y:ntax
`MIMO Feedback Reauest messa!!e
`~ormat () {
`Num MIMO feedback
`
`Lenirth of band index
`
`Size
`
`-
`
`fo
`
`Notes
`
`~ Numer of feedbacks formatted based on the
`Format index defined below
`~ Tndication of the lenm-h of AMC band index
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0013
`
`

`

`17381ROUS01P
`
`Format Index
`
`11
`
`I value index
`
`Also provided in accordance with an embodiment of the invention is a MIMO_Feedback
`Response message
`
`This message may used by MSS to request MIMO feedback information to BS as a reply
`after receiving MIMO feedback request or as an unsolicited MIMO feedback.
`
`Table 5 - MIMO Feedback response message format
`
`S~ntax
`MIMO Feedback Reouest messa11:e format () l
`Num MIMO feedback
`
`Format index
`for ( i=0: i < Num MIMO feedback: i++)
`
`Size
`
`..
`lli!§.
`
`l_bits
`
`Notes
`
`Numer of feedbacks formatted
`t:>ased on the Format index
`defined below
`
`ff the Num MIMO feedback >
`1. the feedback either laver
`oased or AMC band based.
`shall be in the order so that the
`aver or AMC band who has the
`maximum COI annears first.
`
`4 bits A veraQ:e interference
`
`1
`Feedback content formatted as indicated bv format ~ See Table xx. Feedback format.
`"ndex
`_}_
`If (Format index== 4)
`A veraQ:e interference
`If <Format index == 3)
`STTD/BLAST Selection
`
`1 bit
`
`Ob0: STTD selected
`Dbl: BLAST selected
`
`l
`
`Also provided in accordance with an embodiment of the invention is a MIMO feedback
`MAC header
`
`This UP generic MAC header may be used by MSS to provide MIMO feedback
`information.
`One or more MIMO feedback header(s) may be sent by a MSS at once if one header is
`not enough.
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0014
`
`

`

`17381ROUS01P
`
`12
`
`HT=l
`
`Et "'=11 1)
`1)
`rype( 6)=000001
`
`MIMO feedback (8)
`
`MIMO feedback (8)
`
`MIMO feedback (8)
`
`MIMO feedback (8)
`
`HCS (8)
`
`The Type (6) may be set to 000001 to indicate a MIMO feedback MAC header. In each
`MIMO feedback header, there are 32 bits payload may be used for the MIMO feedback
`purpose.
`The mapping of feedback information bits (table Y) on to MIMO feedback header(s) may
`be provided as follows: the payload field in the first MIMO feedback header is filled and
`then the second, until preferably all the information bits are mapped.
`
`Figure 38 presents a CQICH Based MIMO Channel Sounding Algorithm (1 transmit
`antenna) in accordance with an embodiment of the invention (Embodiment: 4.1.1 -(cid:173)
`TDD MIMO channel sounding)
`
`Figure 39 presents a CQICH Based MIMO Channel Sounding Algorithm (1 transmit
`antenna) in accordance with an embodiment of the invention (Embodiment: 4.1.2 -(cid:173)
`Sounding CQICH channel for PUSC)
`
`Figure 40 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1.3 -(cid:173)
`Sounding CQICH channel for PUSC)
`
`Figure 41 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1.4 -(cid:173)
`Sounding CQICH channel for PUSC)
`
`Figure 42 presents a CQICH Based MIMO Channel Sounding Algorithm (1 transmit
`antenna) in accordance with an embodiment of the invention (Embodiment: 4.1.5 -(cid:173)
`Sounding CQICH channel for Optional PUSC)
`
`Figure 43 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1.6-(cid:173)
`Sounding CQICH channel for Optional PUSC)
`
`Copv provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0015
`
`

`

`17381ROUS01P
`
`13
`
`Figure 44 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1. 7 -(cid:173)
`Sounding CQICH channel for Optional PUSC)
`
`Figure 45 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1.8 -(cid:173)
`Sounding CQICH channel for Optional PUSC)
`
`Figure 46 presents a CQICH Based MIMO Channel Sounding Algorithm in accordance
`with an embodiment of the invention (Embodiment: 4.1.9. -- sounding MIMO Feedback
`channel)
`
`Figure 47 presents a CQICH Support of Differential Encoding Algorithm in accordance
`with an embodiment of the invention (Embodiment: 4.1.10. - mini tile support for
`differential CQI)
`
`Figure 48 presents a space time coding for CQICH algorithm in accordance with an
`embodiment of the invention (SISO construct)
`
`Figure 49 presents a space time coding for CQICH algorithm in accordance with an
`embodiment of the invention (Embodiment 4.2.1.-- STTD support)
`
`Figure 50 presents a space time coding for CQICH algorithm in accordance with an
`embodiment of the invention (Embodiment 4.2.2. -- SM support)
`
`Figure 51 presents a MIMO feedback channel ageing algorithm in accordance with an
`embodiment of the invention (Embodiment 4.3.1. - Receive ageing beam-former
`correction)
`
`Figure 52 presents a MIMO feedback channel ageing algorithm in accordance with an
`embodiment of the invention (Embodiment 4.3.2. - Mitigation of ageing)
`
`Figure 53 presents a pre-coding of MIMO pilot algorithm in accordance with an
`embodiment of the invention (Embodiment 4.4.1 - Pre-coding of MIMO pilot)
`
`Figure 54 presents a pre-coding of MIMO pilot algorithm in accordance with an
`embodiment of the invention (Embodiment 4.4.2 - Pre-coding of MIMO pilot)
`
`Figure 55 presents a pre-coding of MIMO pilot algorithm in accordance with an
`embodiment of the invention (Embodiment 4.4.3 - MIMO pilot of pre-coding large
`antenna array)
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0016
`
`

`

`17381ROUS01P
`
`14
`
`The IEEE 802.16(a, d and e) and 802.1 l(n) standards are hereby incorporated by
`reference.
`
`Figure 56 provides an overview of Vector Pre-coding (code-book construction) for
`purposes of context and comparison
`
`Figure 57 provides an overview of Vector Pre-coding (code-book optimization) for
`purposes of context and comparison
`
`Figure 58 provides an overview of Vector Pre-coding (vector quantize channel) for
`purposes of context and comparison
`
`Figure 59 provides an overview of Matrix Pre-coding ( column by column vector
`quantize channel-I) for purposes of context and comparison
`
`Figure 60 provides an overview of Matrix Pre-coding (column by column vector
`quantize channel-2) for purposes of context and comparison
`
`Figure 61 provides an overview of Matrix Pre-coding (decompression of quantized
`channel-I) for purposes of context and comparison
`
`Figure 62 provides an overview of Matrix Pre-coding (decompression of quantized
`channel-2) for purposes of context and comparison
`
`Figure 63 provides an overview of Matrix Pre-coding (code book design) for purposes of
`context and comparison
`
`Figure 64 provides an overview of Matrix Pre-coding ( code book design) for purposes of
`context and comparison
`
`Figure 65 provides an overview of Matrix Pre-coding (vector quantize channel) for
`purposes of context and comparison
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0017
`
`

`

`17381ROUS01P
`
`WE CLAIM:
`
`15
`
`A method comprising:
`at a basestation:
`broadcasting pilot information to one or more receivers; and
`receiving channel information from at least one of said one or more
`receivers in response to said pilot information,
`wherein said channel information is compressed using differential encoding
`
`A method comprising:
`at a receiver, receiving pilot information broadcast from a basestation; and
`in response to said pilot information, transmitting channel information to said
`basestation,
`wherein said channel information is compressed using differential encoding
`
`A method comprising:
`at a basestation:
`broadcasting pilot information to one or more receivers; and
`receiving channel information from at least one of said one or more
`receivers in response to said pilot information,
`wherein said channel information is compressed using a givens rotation
`transformation.
`
`A method comprising:
`at a receiver, receiving pilot information broadcast from a basestation; and
`in response to said pilot information, transmitting channel information to said
`basestation,
`wherein said channel information is compressed using a givens rotation
`transformation
`
`A method comprising:
`at a basestation having a plurality of antennas:
`broadcasting pilot information to one or more receivers;
`receiving channel information from at least one of said one or more
`receivers in response to said pilot information, and
`assigning one or more antennas to said at least one of said or more users
`based on said received compressed channel information.
`
`A system comprising:
`either transmit or receive circuitry as is appropriate; and
`circuitry adapted to carry out the methods set out above.
`
`Copy provided by USPTO from the IFW Image Database on 05/12/2005
`
`ZTE, Exhibit 1011-0018
`
`

`

`Embodiment 2.2.2 Embodiment 2.2.3
`
`Embodiment 2.2.1
`
`Embodiment 2.1.2
`
`Embodiment 2.1.1
`
`· Transform
`
`Givens
`Based
`Receiver
`
`VQ
`
`Transform
`
`Givens
`
`SVD Based
`
`ttannet, .~:~i MIMO Channel ·.
`Transformed
`
`~. Differ;e!:l~-
`,,,
`lftlMJMo.·,
`
`Encoding
`Differential
`
`Ene~:til'iifl.<!I
`
`VQ
`
`Code Book
`
`Based
`Receiver
`
`VQ
`
`Transform
`Householder
`SVD Based
`
`Embodiment 2.2
`
`Embodiment 2.1
`
`Compressed feedback
`
`Code Book Based
`
`Non-Compressed
`
`feedback
`
`Embodiment 4.4
`
`Embodiment 4.3
`
`Embodiment 4.2
`
`Embodiment 4.1
`
`Embodiment 2.0
`
`Pre-Coding of
`
`Pilot
`
`Feedback Ageing
`MIMO . .Channel
`
`of CQI Channel
`
`Space .lime Coding. __ .
`
`Sounding + CQI
`MIMO Channel
`
`Channel feedback
`Quantized MIMO
`
`Embodiment 1.1
`
`Embodiment 1.0
`
`Dirty paper coding
`
`Multi-User Pre(cid:173)
`
`coding
`
`Pre-Code Beam former
`MIMO Channel, CQI and
`
`Primitives
`
`AMC sub-channel
`
`USER#1
`
`USER#2
`
`USER#N
`
`Embodiment 3.0
`
`,_.L
`
`;,tt~
`
`MAC Op~r,at
`,,., ·· '•'Feedback
`
`and cr.1
`
`;,,&'JlMO
`
`Figure 1
`
`CJ)
`C:
`~
`C.
`(1)
`C:
`
`a <
`~ ,,
`~
`
`"ti cl
`
`~ 0
`~
`0
`0 ::s
`ti: (1)
`i Ill
`&:
`3
`~
`s:- (1)
`3
`0
`::;-
`
`(II
`0
`
`CJ"
`
`(1)
`
`ZTE, Exhibit 1011-0019
`
`

`

`is smaller when the group size is larger
`Typically degradation due to antenna selection
`weak layers.
`This may avoid selection being dominated by
`eigenvalue rather than on determinant.
`Antenna grouping criterion may be based on
`little information to the Base station
`The terminal generally needs to feedback very
`the terminal based on simple criterion
`sub-set antenna from available antennas by
`Antenna grouping is based on the selection of
`
`CSI feedback in the FFD case.
`amount of computing and a large amount of
`However, SVD typically requires a large
`level Shannon capacity
`matching transmission and ach