Document made available under
`Patent Cooperation Treaty (PCT)
`
`the
`
`International application number: PCT/CA05/00 14 74
`
`International filing date:
`
`29 September 2005 (29.09.2005)
`
`Document type:
`
`Certified copy of priority document
`
`Document details:
`
`Country/Office: US
`Number:
`60/6 14,62 1
`Filing date:
`30 September 2004 (30.09.2004)
`
`Date of receipt at the International Bureau: 0 1 November 2005 (0 1.11.2005)
`
`Remark:
`
`Priority document submitted or transmitted to the International Bureau in
`compliance with Rule 17 . l (a) or (b)
`
`World Intellectual Property Organization (WIPO) - Geneva, Switzerland
`Organisation Mondiale de la Propriete Intellectuelle (OMPI) - Geneve, Suisse
`
`

`

`~05' (!ff~
`
`~.
`
`UNITED STATES DEPARTMENT OF COMMERCE
`
`United States Patent and Trademark Office
`
`June 28, 2005
`
`THIS IS TO CERTIFY THAT ANNEXED HERETO IS A TRUE COPY FROM
`THE RECORDS OF THE UNITED STATES PATENT AND TRADEMARK
`OFFICE OF THOSE PAPERS OF THE BELOW IDENTIFIED PATENT
`APPLICATION THAT MET THE REQUIREMENTS TO BE GRANTED A
`FILING DATE UNDER35 USC 111.
`
`APPLICATION NUMBER: 60/614,621
`FILING DATE: September 30, 2004
`
`By Authority of the
`Under Secretary of Commerce for Intellectual Property
`and Director of the United States Patent and Trademark Office
`
`PV(__
`
`/If ~
`M. TARVER
`Certifying Officer
`
`

`

`- --
`
`- - -- - - - - - - - - -
`
`PTOJSB/16 (09-04)
`Approved for use lhRlllgh 0713112006. 0MB 0851-11032
`U.S. Palentand Trademark Office; U.S. DEPARlMENT OF COMMERCE
`Under Ille PapeiwadtRedtlctlan Act d 1995, no per11011s me reqund to ,espond to a colectlon of lnfonnatlan ..,less I displays a wld 0MB conlnll number.
`PROVISIONAL APPLICATION FOR PATENT COVER SHEET
`.
`This is a reauest for filna a PROVISIONAL APf'llCATION FOR PATENT under 37 CFR 1.53lc).
`]
`
`I Express Mall Label No. EV517424492US
`
`~n
`"'
`-;=. Given Name (first and middle (If any))
`
`INVENTOR(Sl
`Famly Name or Surname
`
`Residence
`fCilv and eilher State or F,,..,.,,n Countn,\
`
`MING
`
`JIA
`
`OTTAWA,ONTARIO, CANADA
`
`Qt:IE
`$epa1lllle/y numbered sheets attached hereto
`Additions/ Inventors are being named on the
`TITLE OF THE INVENTION f&OO charactars max\:
`METHODS AND APPARATUS OF CLOSED LOOP MIMO PRE-CODING AND FEEDBACK
`FOR IEEE802.16e
`
`uj
`-
`
`~ ... ,... ·--0
`
`~ ...
`(0
`~
`
`Dht:1 all co,,espondence to:
`
`CORRESPONDENCE ADDRESS
`
`0 The address corresponding to customer Number: I
`
`00826
`
`I
`
`OR
`□ Finn or
`
`lndhAdual Name
`Address
`
`Cly
`
`Country
`
`I Sta1e
`I Zip
`I Telephone
`I Fax
`ENCLOSED APPLICATION PARTS {chedc all that appM
`D CD(s), Number of CDs
`0 Specification Number of Pages 15
`0 Drawlng(s) NUtrberofSheets 69
`□ other (spedfy)
`□ Application Data Sheet. See37CFR 1.76
`
`METHOD OF PAYMENT OF FLING FEES FOR TllS PROVISIONAL APPLICATION FOR PATENT
`
`A duollcalive cor,,, of this fonn is enclosed for fee nrocessino.
`
`Government. No.
`
`FILING FEE
`AlllDI lat lll
`160.00
`
`I
`
`Dale September 30, 2004
`
`D Applicant claims small entity sta~s. See 37 CFR 1.27.
`D A check or money order is enclosed to mver lhe fling fees.
`I
`D Payment by aeclt card. Form PTC>-2038 is attached.
`-
`0 The Director is hereby authorized to charge fling fees or creclt any overpayment to Deposit Account Nurmer: 14-1315
`□ The invention was made by an agency of tie Unled Stales Gowmment or under a contract with an agency of the I.Jnled Stales
`□ Yes, the name of the U.S. Government agency and the Government contract number are:
`.
`-
`-
`~ / /~~ ~ -
`< -
`....
`
`SIGNA.,t,;;C
`
`r
`TYPED or PRINTED NAME PAUL C. HASHIM
`
`REGISTRATION NO. ~3,_.1..,6..,.1-=8'------(cid:173)
`(,f approptfste)
`Docket Number. 17381 ROUS01 P
`USE ONLY FOR FR.ING A PROVISIONAL APPLICATION FOR RIITENT
`This cdlloctian of irlcnnalbn Is l"'!IAred by 37 CFR 1.51. The lnfonnallan Is required to obtain or retain a benefit by the publcwllich Is to file (and by the US PTO
`ID proees.s) an aJllllicatlon. ConlidentiallY. Is gowmed by 3S U.S.C. 122 and 37 CFR 1.11 and 1.14. This collection is estimated ID take a houn to co~ete.
`Including gathering. prepamg. and submilllng the co~ted applJcatian tom, to Ille USPTO. Time will v.iry depending upon Ille lndMdual case. Any commenls
`on the amount d time you n,qulte to co~eta this ro.m and/or suggestions for 18duclng this bulden. should be sent to the Q1ief lnfOffllBtian Officer, U.S. Paten1
`and Trademark OfflCe. US. DePal1ment Of Commen:e, P.O. Box 1450, Alexandria. VA 22313-1450. DO MOT SEND FEES OR COMPlETED FORMS TO THIS
`ADDRESS. SEND 10: Commlsslo,-rfar Patents, P.O. Box 1450, Al8118ndtla, VA 22313-1450.
`/fyou need a s~ in canpletfng the fo,m. cal/1-BlJtU>T0-9199 andse/ector,tion 2.
`
`TELEPHONE_ 972-684-7886
`
`Copy provided by USPlO from the IFW Image Database on 0&'27/2005
`
`

`

`I
`
`First Named lmientor
`
`Jw.iGJIA
`
`PTO/SB/16 (09-04)
`Appn,ved fer use llraigh 07131/2006. 0MB 0651-0032
`U.S. Pallont and Tradamarlc OlllcC U.S. DEPARTMENT OF COMMERCS
`Under the PaDllfWOrlc Reduction Ad. of 1995, no panona a,e reauhld to 111SDOnd to a cdlectlon of lnfonnation unless H displays a valid 0MB conbol number.
`
`PROVISIONAL APPLJCAOON COVER SHEET
`Additional Page
`
`I Docket Number 17381ROUS01P
`
`r.i11en Name ffirst and middle rlf """"
`
`Famllv or Surname
`
`Residence
`ICilv and either State or Foreian Countrvl
`
`INVENTOR15l/APPLICANT(S)
`
`WEN
`
`PEIVING
`
`TONG
`
`2HU
`
`OTTAWA. ONTARIO, CANADA
`
`KANATA. ONTARIO, CANADA
`
`...
`
`NIRber
`
`ONE
`
`of ONE
`
`WARNING: Information on this form may bemme pubic. Oedit card information sh cud not be
`Included on this form Provi:le a-edit card Information and authorization on PT0-2038.
`
`Copy provided by USPTO from the FW Image Database on 06127/2005
`
`

`

`..
`
`17381ROUS0IP
`
`1
`
`PROVISIONAL PATENT APPLICATION
`
`SUBMITTED ON SEPTEMBER 30, 2004
`
`TITLE:
`
`SYSTEM AND METHOD FOR CLOSED LOOP MJMO PRE-CODING AND
`FEEDBACK
`
`INVENTORS:,
`
`MING JIA, OTT A WA, ONTARIO CANADA
`
`WEN TONG, OTTA WA, ONTARIO CANADA
`
`PEIYING ZHU, KANA TA, ONTARIO CANADA
`
`Copy provided by USPTO from the 1FW Image Database on 06/27/2006
`
`

`

`17381ROUS01P
`
`2
`
`SYSTEM AND MEfflOD FOR CLOSED LOOP MIMO 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 pwposes of the IEEE 802.16(e) and IEEE 802. l l(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:
`
`[1] MIMO channel feedback bandwidth reduction
`[2] Antenna group selection
`[3J 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. l 6( e) and IEEE802. ll (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 06127/2005
`
`

`

`1738IROUS01P
`
`3
`
`SUMMARYOFfflEINVENTION
`
`It is an object of the invention to provide a closed loop MIMO pre-coding and feedback
`system and method for the IEEE802.16(e) and IEEE 802.1 l(n) standards.
`
`It is another object of the invention to provide a closed loop MIMO 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 MIMO 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.
`
`Copyprovi
`
`m the IFW Image Database on 06/27/2005
`
`

`

`17381ROUS0IP
`
`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
`• DFf
`• 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
`CQichannel
`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 closedloopMIMO pre-coding and feedback in a communications network
`operating in accordance with the IEEE 802.16(e) and IEEE 802.1 l(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.
`
`USP O from the FW Image Database on 06127/2005
`
`

`

`..
`
`17381ROUS01 P
`
`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.1 l(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 sulrEmbodiments 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.1 -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. l - Multi-User Pre-coding with assigned set of users)
`
`Copy prov!
`
`by USPTO from the FW Image Database on 0612712005
`
`

`

`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/
`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 transfonned 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)
`
`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 transfonn SQ algorithm in accordance with an
`embodiment of the invention (Embodiment 2.2.1.2 - Givens Rotation for 3-Transmit
`Antenna)
`
`Copy provi
`
`by USPTO from the IFW Image Database on 08/27/2005
`
`

`

`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 trans.form 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 n 3
`)
`
`Copy provided by USPTO trom 1,e IFW Image Database on 0Bf27/2005
`
`

`

`17381ROUS01P
`
`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
`
`Alloc IE O f
`
`ents
`
`+
`
`{
`CID
`Duration d
`
`Frame o set
`
`If d !=obOOO
`
`Num COICH Allocation
`
`=ObOOO, the COICH is deallocated:
`d = Obl 11. t
`oor feedback
`e until
`
`back
`the same
`ffset. If the
`
`to the MSS
`ID
`
`Copy provided by USPTO from the IFW Image Database on 06/2:1/2005
`
`

`

`l 7381ROUS0IP
`
`9
`
`feedback
`
`Format Index
`
`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
`
`Table 2. MIMO feedback.
`Size
`~
`for ( i=O; i < Num MIMO feedback; i++)
`
`Notes
`rf the Num MIMO feedback>
`I the feedback either }aver
`lba.c;ed or AMC band based,
`~hall be in the order so that the
`haver or AMC band who has the
`maximnm COi
`~ first.
`
`i bits AveraQ'e interference
`
`l.
`Feedback content formatted as indicated bv format ~ See Table xx Feedback format.
`index
`l
`If (Format index =- 4)
`A veraQ'e interference
`If (Fonn:1t index= 4)
`STTD/BLAST Selection
`
`Um
`
`Db0: SITO is selected
`rlbl: RT AST is selected
`
`l
`
`Table 3 MIMO feedback formats
`
`Copy provided by USPTO from the IFW Image Database on 06127/2005
`
`

`

`17381ROUS01P
`
`LAST selection I
`e number of bits = I
`dex indicated in the
`
`0
`indicated in
`
`Joe IE e. . 4/5/6 bits
`
`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
`
`Syntax
`MIMO Feedback Reauest messae:e
`i:-ormat n f
`Num MIMO feedback
`
`Leno-th of band index
`
`Size
`
`Notes
`
`~ Nu mer of feedbacks formatted based on the
`i:;'ormat index defined below
`rndication of the Jent:!th of AMC band index
`
`l bits
`
`Copy provided by USPTO from the IFW Image Database on 06/27/2005
`
`

`

`17381ROUS01P
`
`Lenl!th of COi value index
`Format Index
`1
`
`11
`
`1-hits.
`rndication of the Jene.th of COi value index
`3 bits See Table Z
`
`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
`
`fu'.!!tax
`IMIMO Feedback Reouest messal!e format O f
`Nnm MJMO feedh,.,-1,-
`
`Size
`
`Notes.
`
`~ ~umPr of feedb<>rl,-s formattp,I
`:>ased on the Format index
`t,-finPrl hP}ow
`
`Format index
`for ( i=0· i <Num MIMO feedback; i++)
`
`~ bits
`
`rf the Num MIMO feedback>
`. the feedback. either laver
`ciased or AMC band based.
`~hall be in the order so that the
`haver or AMC band who has the
`,n<>vim11m COi
`,, fird
`
`f - --
`
`k content formatted as indicated bv format ~ See Table xx. Feedback format.
`
`lndex
`_}_
`If <Format index == 4)
`AuPr<>nP i
`lf<Format index== 3)
`STTO/BI A,ST Selection
`
`~
`
`f bits
`
`I\. ver:i ~e interferr.nl'P.
`
`1 bit
`
`'lhQ: SITD selected
`'lh 1 · RT AST sel,-rted
`
`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 06'27/2005
`
`

`

`17381ROUS01P
`
`12
`
`E4 '.::= 11 1)
`I 1)
`rypeC6)=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 3~ 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 -
`TDD MIMO channel sounding)
`
`Figure 39 presents a CQICH Based MIMO Channel Sounding Algorithm ( 1 transmit
`antenna) in accoxdance with an embodiment of the invention (Embodiment: 4.1.2 -
`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 -
`Sounding CQICH channel for PUSC)
`
`Figure 41 presents a CQICH Based MIMO Channel Sounding Algorithm (2 transmit
`antennas) in accordance with an embodiment oftheinvention (Embodiment: 4.1.4 -
`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 -
`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)
`
`Copy provided by USPTO from the IFW Image Database on 0lli27/2005
`
`

`

`1738 lROUSOIP
`
`13
`
`Figure 44 presents a CQICH Based MIMO Channel Smmding Algorithm (2 transmit
`antennas) in accordance with an embodiment of the invention (Embodiment: 4.1.7 -
`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.-- SITO 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.43 -MIMO pilot of pre-coding large
`antenna array)
`
`Copy provided by UsPTO from the IFW Image Database an 06/27/2005
`
`

`

`17381ROUS0IP
`
`14
`
`The IEEE 80'2. 16(a, d and e) and 80'2. l 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 optimiz.ation) 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
`quantiz.e 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 quantiz.ed
`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 tie IFW Image Database on 06/27/2005
`
`

`

`1738 lROUS0IP
`
`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 06127/2005
`
`

`

`Embodiment 2.2.1 Embodiment 2.2.2 Embodinent 2.2.3
`
`Embodiment 2.1.2
`
`· Transform
`
`Givens
`Based
`Receiver
`
`Transform
`
`va
`Givens
`
`SVD Based
`
`.
`
`.
`
`Erlcoding
`Differential
`
`.
`
`"®Aanmel· _.,, MIMO Channel
`1!1' eifflrvli MO".":
`Transformed
`.
`
`. ·•11·
`
`1
`
`Embodiment 2.1.1
`Enet~rm:m
`~ Oiffe~em.
`\l>' "':
`•
`
`•,p•<';f1,
`. ~-;_'f~!~!
`
`,
`
`.
`
`•
`
`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
`
`Embodinent 4.2
`
`Embodiment 4.1
`
`Embodilnent 2.0
`
`Pre-Coding of
`
`Pilot
`
`Feedback Ageing
`Ml Mb Channel
`
`Space Time Coding~.
`
`of CQI Channel
`
`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
`
`AMC sub-channel
`
`Primitives
`
`USER#1
`
`USER#2
`
`USER#N
`
`Embodiment 3.0
`
`· ·eedback .. _j
`
`MAC Op~r.;:1tJ'
`
`. ;l~
`and c01 ·
`
`... r~n-
`
`Figure 1
`
`:::! i
`0 ~I ~
`I
`!
`!1 ~1 a
`
`~.
`
`I
`0
`ij
`~
`i:, i g_
`E
`
`C,
`~
`
`

`

`• Typically degradation due to antenna selection
`
`is smaller wfien the group size is larger
`
`weak layers.
`
`• The terminal generally needs to feedback very
`
`little information to the Base station
`
`• Antenna grouping criterion may be based on
`
`eigenvalue rather than on determinant.
`
`• This may avoid selection being dominated by
`
`• Antenna grouping is based on the selection of
`
`the terminal based on simple criterion
`sub-set antenna from available antennas by
`
`level Shannon capacity
`matching transmission and achieving the link
`
`• SVD is optimal in terms of the best channel
`
`CSI feedback in the FFD case.
`amount of computing and a large amount of
`
`• However, SVD typically requires a large
`
`V
`
`former
`Beam(cid:173)
`with
`SVD
`
`Figure 2
`
`antennas
`Turn off a group
`
`with power
`group antenna
`Select best
`
`}
`
`J boosting
`
`Domain
`OFDMA
`
`• • • •
`
`~ g
`~
`
`0
`
`l\;Y
`Discard weak eigen f ~
`---
`
`modes
`
`---
`
`modes
`on strong eigen
`Use power to transmit
`
`ii a s.
`
`.:
`