c2) United States Patent wo as), Cy ay @ 6) 60) May 15, 2003 ot) o (58) Kim et al. MOBILE COMMUNICATION SYSTEM AND. SIGNAL PROCESSING METHOD THEREOF Inventor: Bong Hoe Youn Ansansi (KR): Dong Seoul (KR); Dong Hi Sim Seoul (KR); Hyoun Hee Koo, Gwangju (KR) Assignee: LG Eleetronies Inc, Seoul (KR) Notice: Subject to any disclaimer, the tom of this patent is extendad or adjusted under 35 USC. 1544b) by 528 days Appl. Now 107845,086 Filed: May 14, 2004 Prior Publication Data US 2004/0268206.81 Dec. 30, 2004 Foreign Application Priority Data (KR) 10-200840031026 Int.Cl Ho3M 1301 US.Cl (2006.01) TAL; 7141749: 375/267 $7S/847; 70334; 455/101 7147148-751, T4781, 16 ‘See application file for complet search history. Field of Clas earch US007392460B2 US 7,392,460 B2 Jun, 24, 2008 (10) Patent No.: (45) Date of Patent: 66) References Cited US, PATENT DOCUMENTS, 20030031158 AL* 22003 Kasuriet 032 200s 0123409 AL Kwaketal aoosuotase7 ale Hepler etal 495.258 FOREIGN PATENT DOCUMENTS toss29 AL 4.2003 Wo WooDopI6s7 112002 OTHER PUBLICATIONS ‘hea cl, “Multiple ARQ Processes for MIMO Systems” 13 TEEE International Symposium on Pesonal, Indoor and Mobile Radio Communications, PIMC 2002, New York, IEEE Sep. 15, 2002, vol 31023-1026, PCT Intermaional Search Repor dated Sep. 30,2008 * cited by examiner Primary Examiner—Guy 3, Lamarre (14) torney Agent, or Frm—Ked & Associates, LLP on ABSTRACT A method of mobile communication including # transmitter having multiple rasmiters and a receiver having multiple receivers. The method includes adding a cyclic redundancy cheek (CRC) code fo a data block to be transmited and spatially segmenting the data block according to a modula tion scheme and a coding rate of each respective transmit. antenna ofthe multiple antemas. 18 Claims, 7 Drawing Sheets cmon fe 30! [eee 30k —r ah oad eeeUS 7,392,460 B2 Sheet 1 of 7 Jun. 24, 2008 US. Patent Jossaooid [euais weans eep wouruonaua repuusmen Suraye9s qou Japooua 10}92A,US. Patent Jun. 24,2008 Sheet 2 of 7 US 7,392,460 B2 FIG. 2A st Sa 53 I s4 so CRC teonsgort glockUS 7,392,460 B2 Sheet 3 of 7 Jun. 24, 2008 US. Patent [ euua}ue 0} Z euUa}UE o W buu9}T8 0} W eausyue Joy rears ejep 7 emayae Joy weans eiep { euuaque Jo} wreays Bep dé ‘OldUS. Patent Jun. 24,2008 Sheet 4 of 7 US 7,392,460 B2 FIG, 3 iow 302US. Patent Jun. 24,2008 Sheet S of 7 US 7,392,460 B2 uy, (QPSK) [neo |? Inteteaver Troan} 230) Ups (160M) | VpaNpaer (16QAM) FIG. =a n| (220) Shyer tgaes (15a) |__| » 2 Yu (18CAM) ae eo 16,6 304, ~4 owt someon Sen, FIG 305, meets ] RE ps | r 306, ~|Prsaas| rma cel 3b, ; = 307, ~4 tii wey Pe 3 Lar so ES] ES a 304, faeUS. Throughput (Mbps) Patent Jun. 24,2008 Sheet 6 of 7 US 7,392,460 B2 (4,4) Throughput, 3 ken/h 2 r “en -. | | -&> Altematve A (QPSK) 18 | Altemative B (QPSK) | -6- Atematve A (16QAM) 1,6 -£- Altemative B (16QAM) | go” ee cca 1 4 0 5 10 i ladle (68) FIG.7US. Patent Jun. 24,2008 Sheet 7 0f 7 US 7,392,460 B2 40} —# Sep. TB, 180A, CooeRater fi : Aa 0 Oe. TB, 104, oes + Sep TB 80M, Covet Ove. TB, OH Cae 2 25 +] -asep 18, oF5« Coehate=4 Ove. TB OPS Cae ~¥- Sep TK Coekae FO TB, CPS, oleae Sip THANE One I HilCine Throughput (Mbps) T lotloc (aB) FIG. 8US 7,392,460 B2 1 MOBILE COMMUNICATION SYSTEM AND SIGNAL PROCESSING METHOD THEREOF ‘CROSS-REFERENCE TO A RELATED APPLICATION s This application claims the benefit of Korean Application(s) No, 10-2003-0031026 filed on May 15, 2003, ‘which is incorporated by reference BACKGROUND OF THE INVENTION 1. Feld of the Invention The present invention relates to wireless communication systems, and more pariculaey to a mobile communication system and signal processing method in which an indicator suchas cycle redundaneycheck(CRC)eodeadded wo adata block is used to determine whether an error in transmission has occurred, 2. Background ofthe Invention ‘Maltiple-inpat multiple-output (MIMO) witless commu ication systems use mulple-clement antenna arrays t0 ‘increase a user capacity in rich multipath environments by exploiting the spatial properties ofthe multipath channel One such system isthe vertical BLAST (Bell Laboratories Lay= > cred Space-Time) system, which uses a vertically layered space-time architecture as opposed to the diagonally layered space-time architecture of a D-BLAST. system, The \V-BLAST system is described in “V-BLAST: An Architec~ ture for Realizing Very High Data Rates Over the Rich-Scat- {ering Wireless Chane!” (ISSSE "98, October 1998) by PW ‘Wolniansky, G. J. Foschini,G. D. Goldea, and R.A. Valen ‘ela and in “Detection algorithm and inital laboratory resulls using V-BLAST spacetime communication achiter- ture” (IFEE, Vol. 35, No. 1, January 1999) by the same authors, both of which are incorporated by reference. In the above-desribad V-BLAST system, the ability to separate the transmitted and reveived data substreams depends on the slight differences in how the different sub- streams propagate through the enviroament. Hence, the \V-BLAST system relies on the independence ofthe divided substreams launched via the plurality of transmitter antnas. This independence, however, is notalways maitained result. ing in data not being properly detects 8 SUMMARY OF THE INVENTION Accordingly, one object ofthe present inventions to solve at leas the above probloms andr disadvantages and to pro- vide atleast the advantages described hereinafter. Anoier objet of the present invention isto peserve the intogrty ofa sigaal being transmitted from aa array of trans miter antennas. ‘Yet another object ofthe resent invention isto enable a ‘mobile device to confirm the accurate detection of the signa. ‘To achieve these objects and ether advantages in aeeor- dance withthe present invention, as embodied and broadly eseribed herein, the present invention provides. a novel ‘method of mobile communication including a temsmitter hhoving multiple rnsmiters and a eceiver having multiple «a receivers and including adding a cyclic redundancy chock (CRC) code toa data block to-be transmitted, and spatially segmenting the data block according oa modulation scheme and a coding rate ofeach respective transmit antenna of the ‘multiple antennas. « Additional advantages, objects, and estures of the inven ‘tion wil be set forth in pat inthe description whieh follows 2 and in part will become apparent to those having ordinary sill nthe art upon examination ofthe following or may be leaned from praticeoftheinvention.Theobjectsandadvan- tages of the invention may be realized and stained as particu [arly pointed ont inthe appended claims, BRIEF DESCRIPTION OF THE DRAWINGS The invention willbe described in detail with reference to the following drawings in which ike reference numerals refer tolike elements where: FIG. 1 is a schematic diagram of a V-BLAST wireless system FIG. 24 is representative diagram of a data steam w be ‘uansmited, in which a CRC codes added in accordance with the signal processing method ofthe present vention: FIG. 2B is a representative diagram of a segmented data stream tobe transmitted fromapluraity ofsntennss, showing, the data steam of FIG, 2A sepmented in socordance wih a signal processing method ofthe present invention; FIG. 3isan operational fw diagram ofthe signal process- ‘ng method ofthe present iveatin: FIG. 4A is an operational low diagram illustrating rte ‘matching being performed before spatial segmentation according othe present iveation; FIG. 4B is an operational flow diagram illastating rate ‘matching being performed ater spatial segmentation accor ng to the present invention; FIG. $ isa sehematie diagram of an interleaver, FIG. 6 is an operational flow diagram of another signal processing method of the present invention: FIG, Tis graph illustrating results ofa ink level simula: tion according to one example ofthe present invention; and FIG. Bisa groph ilutating results ofa ink level simula. tion according to another example ofthe present invention. BEST MODE OF THE INVENTION An example of a V-BLAST wireless system is schemati- cally illustrated in FIG, 1, in which a single data stream is divided into multiple substreams for transmission in a rich scattering (multipath) environment. The V-BLAST system. ‘reas the multiplicity of scattering pahs as separate parallel stubchunnels, each carrying a substeam of data Refering i FIG. 1, the V-BLAST systems includes vector ‘encoder 11 and a V-BLAST signal processor 21 ata receiver 20, The vector encoder 1, for examples part ofa fixed host 10(e.,abase station or Node B) ora transmitting devie, is connected parallel to M anteanas Fr respectively transmnit- ting plurality of data substeams 3 -2,TheV-BLAST signal processor21, as pat of subscriber unit a mobile terminal ‘mobile device or a user equipment (UE) 20, for example, (hereinafter, a mobile terminal is connected i parallel to N antennas, eich for receiving the plurality of wansmited data substreams. As shown inthe exampleofFIG. 1, thenumberot ‘wansmiters (TX) and transite antennas is four, ie, M4, and the number of receivers (RX) and receiver antennas issix, i.e, N=6. Nevertheless, M may be any integer greater than ‘one and, ina vertical BLAST system, is values assumed to be less than or equal to, ‘The transmitter data steam, i, series data, is passed ‘through the vector encoder 11, which includes a serial-to- parallel circuit to generate parallel data by dividing the series data into M subsireams, each to be ransinitted separately as ‘unique signal roma corresponding transmitter antenna ofthe fixed host 10. In doing so, the vector encoder 11 performs {quadrature amplitude modulation (QAM) to output the datsUS 7,392,460 B2 3 suibstreams ay-2, 88 QAM symbol streams. Each data sob- stream is a differen signal transmitted from a different antenna without employig a space-time code, suc that there is preferably no separate signal processing or code diversity ‘required for improving transmission quality ‘To receive such a transmission, the V-BEAST signal pro cessor 21 ofthe mobile terminal 20 uses an algorithm, for ‘example, to dete the datasubstreams individually. Indetect- ing the data substeam of a predetennined transmitter antenna, the superimposed set of data substreams aya, received at each roveiver antenna is considered. The \V-BLAST signal processor 2 tu looks at al of the signals, using the algorithm to irs extract the data substream having the greatest signal-to-noise (SIN) ratio and to then proceed with the remaining weaker signals, which are easier to recover once the stronger signals have been removed as a source of interference For the method tobe effective, the independence ofthe data shoul be maintained over a mobile communication channel during the transmission stage from the transmitter and while the received signals are being processed in the mobile teem nal. In reality, however, at Jeast some deyree of correlation persists among the transmitter antennas as well among the receiver antennas, such that signal independence cannot be suaranteed. In sition, independent transmission and reception ‘mobile communication channels ae also required, but the channel independence also cannot be guaranteed, In the absence of channel independence, proper detection atthe ‘mobile host ofthe separate data substeam of apredetermined transmitter antenna is impeded, and improper detection resulisinexcessiveerorratesat the mobilehost oradetetion ‘ofthe wrong signal. Accordingly, the V-BLAST technology oes not effectively handle the environmental futustons in ‘a mobile communication channel. Further, a HS:DSCH (High-Speed Downlink Shared Channel is preferably operated over a MIMO environment. Assuming each data steam is transmitted through a MIMO. ‘wansmiter, the MIMO system can be considered as a spatial ‘multiplexing system. In other words, multiple diferent data, stream are simultaneously transmitted via multiple transmit. antennas during one TTI (Transmission Time Interval). Cure rently, HS-DSCH des not consider spatial multiplexing so that a single dat stream can be transmitted during one TT ‘Tosol¥e these problems, the present invention inches an algorithm, for example, in the host 10 for attaching a eyelic realundaney check (CRC) code toa data lock such that the ‘mobile terminal 20 may chock the transmittal data to deter- ‘mine if any errors have occurred. The data is also spatially segmented secording to a modulation scheme and a coding rate of a respective antenna, Tn more detail, the mobile terminal 20 also includes a {demodulator (not shown) ineloded in the V-BLAST signal processor 21, which demodulates a data block transmitted froma fised host of another mobile communication system, Anerror check algorithm (not shown) in the mobile terminal 20 gathers and decodes the demodulated data blocks odeter- ‘nine whether there was atrnsmission eror. In ehecking for cemors present inthe transmitted data block, an interference culling method may be used, which is achieved using a zero forcing (ZF) or minimum mean-squared enor (MMSE) tech- nique. The mobile terminal may also incorporate interference cancelling as part of its detection method “Turing next to FIG. 2A, which illustrates a CRC attached to transport block inching a stream of segmented blocks (ie, SL, 82, $3, S4 and SB ), FIG. 28 illustrates the seg ‘mented blocks being supplied to the respective anteans x“ 8 s 4 [Note thatthe CRC is added tothe end ofthe transport block in FIG. 2A and thusistransmitted fom the Mahanteain FIG, 2B. However, the CRC may beaded anywhere in the trans- port block (¢., at the beginning between the segmented blocks SI and 82, et.) ‘Turing now to FIG. 3, which illustetes an operational ‘ow diagram according vo one example ofthe present inven tion, In this example, only one transport block arives atthe ‘muiplexing chain every TT so that one CRC is attaches to ‘the one input transport black and the eatire transport Blocks ‘transmitted duringaTTTifan errr occurs Further, because ‘only one transport block per TT aves atthe multiplexing cain, a spatial segmentation block (discussed in more detail late) is used to segment the input block into multiple blocks for simultaneous tansmission of multiple data steams, That is.after change coding the coded block is segmented into N strwams in the spatial segmentation block, where N denotes the numberof simultaneously transmitted data steams via ‘multiple wansmit antennas during one TTT. Hybeid-ARQ functionality uit performs rate matching fora separate MCS (Modulation Code Seheme) conto! for each data steam. In dition, this example requires only one uplink ACKINACK, signal, because there is only one transport block. In adition, ‘because the performance of one transport blocks decided by the combined perfomances of the multiple streams, i i generally more difficult to determine the MCS for each steam, Asshowinin FIG. 3, fist, instep S301, the CRC is attached to one transport block including the steam of segmented ‘locks to enable ere detection, CCRC attachment forthe HS-DSCH transport channel may be performed using the following method. In more detail, cemor detetion is provided on transport blocks through the (Cyclic Redundancy Check (CRC). The size ofthe CRCis 24, 16, 12,80r bitsand what CRC size should he foreach TeCH is sent from higher layers, Farther, the entre transport block is use to calculate the ‘CRC parity bis foreach tensport Block. ‘The parity bits may be generated by one of the following eyelic generator poly ‘nomial, for example: sD DPD Del excl excl DDD sexe AD D°sD!SDD' De gcxcDPDDDDDat Tin this example, the bits in a transport block delivered to layer Lare denoted by iq yas Bg tthe party tsare denoted by PnP Pie Pn, Further, , i the size ofa transport block of THCH i, mis the transport block ‘number, and L, isthe numberof parity bits. L, ean take the values 4,16, 12,8, or0 depending on what i signalled from higher layers The encoding may be performed in a systematic form, ‘which means that in GF(), the polynomial; se sowie ce edgy Pad ‘eka emainder ua tO when divided by Regen(Dh the polynomial: 2D aad. DHE A Atm sD taUS 7,392,460 B2 5 yields remainder equal Owhen divided by gegeva(D)the polynomial: See Pood APD yieks remainder equal t O when divided by gexe.(D),and ‘he polynomial: eat DI EP De PD at yes a remainder equal 10 0 when divided by Benex(D) If no transport blocks are input to the CRC calelation (M0), CRCattechmentis not perfomed.Itranspoa blocks are input to the CRC calculation (M20) andthe size of transport blocks zero (A,~0),CRCattachment is performed, egal parity bits equal to ze, “The relationship between input and output of the CRC tachment block is as follows, Assuming the bits ater CRC attachment are denoted by BBs nas + «Bigg WEE BAL, Then, the relation Between dy, and bors bm 23, Patra AML ARABS os Ay ‘The advantages of adding the CRC to the transport block. (cther than adding a CRC 10 each inividal segmented lock 1, S2, 83 Sand SS) include at east he following 1) there isan transmission enor in one f the segmeated blocs SI, $2, 3, S4and8in which he CRC iad tothe cn ofthe tansprt block, the entire steam of segmented blocks St, $2, $3, $4 and S8 i eransmited. Although, the transmission efcieny is redved compared to when CRC is added 10 each segmented block (in Which only the tans- ited segmented block having an error would have fo be ‘etansmited), the overall CRC overhead requirements are reduces compared the situation a which a RC isaddedto cach segmented Block SI, $2, 83, $4 and SS. 2) To request data be reransnited, a Hybrid automatic repeat request FLARQ) technique my be wed. HARQisan acknowledged retransmission scheme tats used on High- Speed, Downlink Shared Channel (HS-DSCH).. ‘The [HS-DSCH chanel is transport channel anda niirecionl owalink channel shared by several maile oss. The mobile hostrepies withan ACK ifchecking the CRC codeindiates tno transite block was received ror re and replies with a NACK (Neqatve Acknowledgement) if ebocking the CRC indicates the transmitted block has beea received in ero ‘Upon receiving the NACK fom the mobile sation, the ARQ functionality automatically reeansmits the tanspon bck Tn system according tothe present invention that uses ARQ with 2 CRC adodt the transport block (rather than CRC aed to each seumented block S1.S2. 3, S4andSS), tnly one ACK/NACK is required to request retansisson ‘Tati, fa CRC vadded to cach segmented blockS1,S2,$3, Sand 8, a comespuning ACKINACK is equied jor each ‘etansmissioa, esting in sigatianly more ACKINACKS ‘wing require. Accordingly, when only one ACK/NACK is required per transport block, a smaller amoust of data is transite onan uplink, which inprovespeakto-averge- power ratio ofthe uplink 3) Complicated and dtd telecammunicaton speifica- tion define the requirements for communicating with the upper layers (ep. the MAC layer and Radio Link Control GRLC) layer, Ratio Resource Control (RRC) lye, et.) These telecommuniction speifictions were developed ale significant involvement with epreseaatives from Se\~ 6 cal different clements of the communication industy: “Accordingly, any changes mato these uper layer requite- ames are Hikely to be signflean ant ree a sistant amount of volvement ofthe tlesommanizaionsrepresen- 5. taves, However, because the CR is aed othe anspor. bck acconing othe present invention (ater han adding a CCRC to each segmented block SI, SZ, S3,S4 and SS), the required modifications to the upper layer specifications are ‘ignifcaly duced compar tothe required mesifeatons ofthe specifications forthe upper ayers f CRC sad 0 cach block Returning again to FIG. 3. Aer the CRC is tached tothe transport block, eda Block having te atached CRC code is bitscrambled using a predtemuned code any (S302) That, the bls cutut fom the HS-DSCH CRC afachmest are scrambled in the bit serambler For example sssume the bits input to the scrambler are denoted by ota vo Dna ‘where B is the number of bits input to dhe HS-DSCH bit scrambler and the bis after bit scrambling ae denoted Gaathnoths Thea, bt scrambling may be defined by the following elation Ana dha tastned 212 B andy, results from the following operation: syosee 8 (Serpe teyen Bio} -10000.00.00.00,10.1.1.0.1}, Seva ‘Thea, the bitsrambled output bit aay’ is divided into a phirality of end blocks in same size throegh ede clock Ba, Wher iste TACHL ‘numer, misthe anspor block number and, isthe umber oF bits in each book ining CRC). Furber, assume the ‘number of wanspor blocks oa TxCH is denoted by M andthe bits after concatenation are denoted By Xu%a> Kay + Ray ‘where iis the eCHT mumber and X/-M(, The flowing equations ae then ws 68 rehab 2B seta ah Beth Bede 2B,US 7,392,460 B2 1 san 2A 2802 28, Saharan MDB elo i Segmentation of the bit sequence from transport block concatenation is performed if X>Z. The code blocks afer Seumentaton ar ofthe same size. Further, assume the nom ber of ede locks on TCH is denoted by C, the number oF bis input tothe sepmeatatia, X, isnot multiple of filler bits re ded tothe begining ote fst block. uzbo coving is selected and X40, for example filler its are aed to the begining of the cade block. Te fille its are ‘rast and they are always set 0 In addin, the ‘asim codeblock sizes in this example ae convolutional cong: 2-S08 turbo coding: 25114 Asoume the bis tpt frm codeblock seymentatio, for C0, are denoted by 0.000 where isthe HCH umber, rs he’ code block nunber, and K, is he umber of bis per code Block. Then, the following may be calculated. ‘Number of eode blocks: cota [Number of bits in each code black (applicable for C0 only 92, 10%, efo,. cosy show i the below Table 1, where P2, is the original column position of the jh permuted column, After pemnutstion of the columns, the bits are denoted by y', 8 s 10 Soe ‘The ouput ofthe blockintereaer isthe bt sequence read out column by column. fom the iner-column permuted R2sC2 marx. The outputs praned by deleting dmmny bits that were pat the input ofthe matrix before the inter cola permutation, i. bis that coresponds tity ‘with JU are removed from the output. The bis afer 2" interleaving are denoted by vpn +» =» Ven WBE Vp comespondsiothebity,, wilamullestindexaterpranig, Vjatothebity, with Sond sles! index Kallerproning, and soon TABLE [nectar pation aati relia ‘imberofesmae ners peat patie ° AUSF PAC» » 105,15 25,51 INI 6,16, 26,4, 14, 24,19, 9,2, 12,2, 7,22, Bt ‘The interleaver is ofa fixed size: R2-32 rows and C2-30 columns, in this example Inaiiton, for 16 QAM, there are two identical interleav- cers of the same fixed size R2xC2-32x30. The output bits from the physical channel segmentation are divided two by ‘wobetween theinterleavers: bitsy, andy, ., goto the fis interleaver and bits u,.. and ys goto the second inter- leave. In addition, bis are collected two by two from the interleaver its vx and. are obtained from the first interleaver and bts Vy Ad py are obtained from the second interleaver, where k mod! Next, 16 QAM constellation arrngementrearangement is performed. In this example, 16 QAM modulated bits are assumed Table 2descrbes the operations none examplethat produce the diferent rearangemens. Note, the bits of the ‘input sequence are mapped in groups of 480 that, pyar. Vass ¥ pa te Used, Where Kod. TABLE? Conlon 6 QAM outtaton ‘ain Onpatbit paruncers—ssene Opera taut Name Seas Seoping MSDs with LSBs aaa ‘Seaping MS with LSB Imre flopeal ere LSB ‘The output bit sequences from Table 2 map to the ouput bits in groups of 4, 08 pantsSpansFpaen Where Kk mod +1 A QAM arrangementrearragement process disclosed in related U.S. application Ser_No. 10834,210,fledon Apr. 29,US 7,392,460 B2 " 2000 may alo be sed Note this elated US. application Ser. 'No, 10834,210i incorporated herein in ts entire. ‘Next, pyscal channel sepmentation (S306,-$306,) and ‘mapping (S309 -S309,) are provided for mul-code trans- nissionviaa plurality (P) of physical channels PHChEL PHCh#P. The bits input to the physical channel mapping ae denote by 1.» fen Where pis the physical channel ‘number an ste number fits inone radio subframe for ‘one HS-PDSCH. The bits, are mappedto the PHCHsso that the bits for acl PACH are rans over thesia ascend ing onder with respect tok. Returning again to FIGS, 4A and 4B, In FIG. AA, spatial seamentationisprocessedafter rate matching. The numberof ‘ils transmitted inthe physical channel during a TTTisdepen- ent onthe mosiltion scheme andthe mmiber of malticodes, ofeach stream. higher layer selects the modulation scheme and the number of multcodes of each stwam based on the (CQls (Channel Quality Indicator) reported per stream. Then, arate matched data block is tobe sepmente in proportion 0 the ratio ofthe mimber of bits per stream, 12 transport blocks are atthe muplexing chain every TT, ‘where N denotes the umber of simultaneously transite ds seeams. Thus, each seymente Bock hus separate attached CRC, which enables independent retansmision 5. cont. Then spatial distribution Block 310 distributes the received seumented blocks iato the N branches, and each Seumented block goes hough te sume multiplexing cain FoellS-DSCH asa 1G. 3 Further, because only the enone. cs segmented block othe wanspor block eather than all of the seumented Bock) has o be etrasmite, the rtans- risson process eli performed, However, th uplink [ACKINACK signal pe steam is needed fe the retansis sion proces. From the viewpoint of the CQl deiition, a Same'CQI mapping ble canbe sed fr cah data steam Ia auton, afer the spataldstibuson block 10, the a plexing chain ean be used in multiple without moifctions, However, the amount of infomation reguited. forthe HS- _DSCH transmission s increased N times ‘Neat, the features ofeach muplexing altemative shown ‘nFIGS. 8,44, 4B and and the equ jnaing becca Node B and UE is summarized inthe Bolow Table 3 TABLES Salinas fois cain eras or 1S DSC MEV Saline nossa _—____Desnins __ Chane. Node Tango oink iosion tm ack HARQ ack! Muxcsis _aideret_shome net CQI_ ACK Ata But Sunt a atl Cede capcom uate a ‘tral ses) ) Spe se ual (Code ai spur ena m2 forechsean) (The ener ofp ocak ate mashing ‘eskistmasste french sea) (H6.6) OW RNa ‘heDes St ie oro i pray onli ‘a Yorech tea) ‘Because a transport block goes through one rate matching block, the code cates ofall steams end up being the same. Thats, the modulation scheme andthe numberof muicodes «ean be sepately contolled per stream but the coderate can't bbe separtely contmlled per stream in FIG. 4A. In this ‘example, channelization code set and modulation scheme per stream, and 9 tanspor block size are signaled from a higher layer. Single HARQ related information is sufficient as in current HSDPA. In FIG. 4B, spatial segmentation is processed before rate ‘matching. A higher layer selets the modulation scheme and the number ofmulticodes ofeschsteam. Inadditon,ahigher layer informs the physical layer the number of input bits to cach rte matching block. Because rate matching is per- formed separately, the code ate can be contaled separately for each steam, Further, the transport block size i induced from the sum of segmented bits. In thi example, the ch aclization cade set, modulation scheme and the number of ‘input bits to the rate matching block are signaled from a higher layer. Further, single HARQ related information can ‘be share by all the trams. Turing next w FIG. 6, which Mlustates an altematve araagement ofthe process i FIG. 3. In this altematve, N Septet cont 48 the prseat inventors also perfemed ink level simula- tions and messured the throughput to compare both altema- tives Shown in FIGS.3 and6. Thealteratives were appliedto Code Resse (CR) MIMO transmitter and VBLAST receiver with 4 Ts and 4 Rx antennas. ‘The following simolation parameters were used in «first example ss Sprang ece 6 Nunberofmaicodes Fran eth 20m) Tle ie Figs pth ape kh UE spent) Conese msde ry © CRC kagt sunspot ook Noss GeSK QAM Fe) Nae Retain s HARQeombinig see CC s IG. Tillsrates the throughputs forallemative A (in FIG, 3)and altemative (in FIG. 6) for both QPSK and QAM. AsUS 7,392,460 B2 13 shown, the independent retransmission contol available in alternative B may preferably provide throughput gains. Ina high geometry region, the retransmission will nt be 2s Ire= «quent and thus the throughput diference is smal. Further 3s shown in FIG. 7, theeflectof CRC overhead on throughput in this example i smal In ation, if MCS control over each data steam is used, a scheduler selects the MCS based on a FER (Frame Err Rate target. [the FER target fr the MCS selection is low enough (eg. <10%6), the operating range of selected! MCS. ‘would be ins high geometry region o tha the performance ilerence appears negligible. Ina second simulation example, the following simulation parameters were used Speier Te Nenterofmaitioaer | Fee ah Lome ssi) EL 8 Tadngimse pth Raph Sh UE sped) Conelaoe model a (hans on Poe fora Now Notilaion (as sq na Colente SosiFaad HaRQeombigscdeae CC FIG, Bshows the throughpurs of both slternatives ia FIGS, 4 and 6 in this second simulation example, Assuming MCS that maximize the throughput in each geometry, the hui curves show thatthe second alternative in FIG, 6 (separate ‘transport block) performs slightly better than the first alter- native in FIG. 3 (one transport block). There is also slight. performance gain inthe second alternative. Accordingly. a a MIMO wireless communication system, according othe present invention, to preserve the integrity of signal being transmitted from an aray of transmit anten- ‘as atthe transiting party, the receiving party confiems the ‘ecurate detection ofthe signal of atrnsmiter antenna ofthe amy by sending a corresponding ACK or NACK message to the transmitting pat: It should be appreciated that such a MIMO. wireless communications system includes a \V-BLAST system, aperantenna atecontol (PARC) system, 4 perstream rte contol (PSRC) system, and the like. The data blocks including the CRC are also spatially eumented according to the preset invention thereby optimizing the ‘transmission proces, This invention may be conveniently implemented using 2 conventional general purpose digital omputer or micropro ‘cessor programmed acconfing to the teachings othe present specification, as well be apparent to thse skied inthe com puler ar. Appropriate software ending can readily be pre- pared by skilled programmers base om the teachings ofthe resent disclosure, 2s willbe apparent to those skilled in the sofware art. The vention may also he implemented by the preparation of application specific integrated circuits or by {terconaecting an appropiate network of conventional com- ponent czcuits,as will be readily apparent to those skilled in thea. Farther, the present invention inchudes computer program product which is a storage medium including instructions Which can be used to program a computer to perform a pro cess the invention. The storage medium ean include, but is ‘ot Limited wo, any typeof disk including Nappy disks, optical dises, CD-ROMs, and magneto-optical disks, ROMs, RAMs, w 8 s 4 EPROMs, EEPROMSs, magnetic or optical cards, or any type ‘of media suitable for storing electronic instructions, ‘The foregoing embodiments and advantages are merely xeanplary and are not to be constmied es limiting te present invention, The present teaching can be readily applied 10 ther types of apparatuses. The description of the present invention is intended to be illsteative, and not to limit the scope of the claims. Many alternatives, modifications, and variations wll be apparent o those skilled in the ar. ‘What is claimed is: 1. A method of transmitting data by a transmitter having ‘nuiple antennas, comprising: ‘addinga cyelic redundancy check (CRC) code toanywhere ina transport block tobe transmit performing rate matching on the transport block after the CRC is added: spatially sogmenting the CRC-added transport block into ‘at least two data steams according to 2 modulation scheme and a coding rate sed by a respective antenna; and transmitting the segmented transport block via each of the sntple antennas 2. The method of claim 1 futher comprising: ‘ode segmenting the anspor block o fitwithin a transport block: sizeof physical channel: and channel coding the code segmented transport block according oa coding rte 3. The method of claim 1, wherein the step of adding the ‘CRC code to the transport block enables independent tans anission contol, 4Themethodof caim3, wherein the independent retrans- mission contol is performed by a hybrid automatic request. (H-ARQ) scheme. 5, A mobile communication apparatus having multiple antennas, comprising: ‘an error contol unit configured to ad a yeti ralundaney chek (CRO) code o anywhere ina transport block tobe transmitted; ‘arate matching uit coafigured to perform rate matching ‘on the transport block ater the CRC is added: «8 spatially segmeatation uait configured to spatially eg ment the CRC-aded transport Block into at leat two data steams according 0 a modulation scheme and a coding rte used by a respective antenna, 6. Theapparats of elim, wherein the apparatus rtran nits the transport block upon receiving a Hybrid Automatic ‘Repeat Request (HARQ) fom the receiving apparatus. 7. The apparatus of claim §, futher comprising: ‘code segmenting unit configured to cade segment the teanspont block to fit within a anspor Block sizeof @ physical channel; and a channel coding unit configured to code the code seg ‘mented transport blacks according toa coding rate 8. The apparatus of claim 5, where the err contol units ‘first algorithm configured to add the CRC codeto the tans port block to be tnusmited and the spatially segmentation ‘tsa second algorithm configured to spatially segment the data block according to the modulation seheme and the cod ing rate 9. A method of transiting data by @ eansmitter having nuple antennas, comprising addingaeyelic redundaney check (CRC) code toanywhere ‘in each of multiple wansport blocks tobe tansmited performing rate matching on each ofthe transport blocks tafler the CRC is addedUS 7,392,460 B2 15 spatially segmenting each of the CRC-added transport blocks into at least two data streams according to a ‘modulation scheme and a coding rate used by arespec- tive antenna; and transmitting the segmented transport blocks via multiple s antennas. 10. 4 method of transmiting data in a multiple input, snultple ouput (MIMO) system, the method comprising: sptially segmenting multiple transport blocks according ‘wa modulation scheme and a coding rate of respective 10 antennas ‘adding a cyelic redundancy check (CRC) cade to each of ‘lip transport blocks to enable independent rtrans- rission contol ofeach of the multiple transport blocks transmitted via multiple antennas, wherein the CRC 1s code is added anywhere in each transport block; and 16 performing rate matching on each ofthe multiple transport blocks after the CRC is added, ‘wherein the modulation scheme and the coding rate are ‘applied independealy foreach aureus 11. Themethod of lata 10, whercinthe step of atematch- ing is performed as « hybrid automate request (H-ARQ) funciona 12, The method of claim 10, wherein the independent retransmission control is performed by a hybrid automatic request (H-ARQ) scheme. 13. The method of claim 10, furber comprising channel coding the each of the multiple transport Blacks per each steam,