in the typical csi vector quantizer ( vq ), the quantization of the channel vector space is performed as in fig1 : the available space is tessellated by voronoi regions 20 with corresponding centroids 22 that represent all vector realizations within each voronoi region . the number of such regions ( centroids ) is defined by the number of available bits and each centroid is assigned an index 23 with the binary representation of length equal to the number of available feedback bits . the indices can also be represented by arbitrary sequences of symbols , so long as each index is represented by a unique sequence of symbols , and the symbols can be transmitted by the feedback channel . when the receiver transmits its channel state information to the transmitter , it is the bits ( or symbols ) representing the centroid indices that are physically sent over the feedback channel . when the term “ binary index ” is used , one could substitute “ the sequence of symbols representing the index ”. in the claims when a mapping of indices to channel states is mentioned , a mapping of symbol sequences to indices would serve the same purpose and so the claims should be construed to cover both . all presented solutions can be used for both eigenmode and singular value codebooks in systems ranging from only one active receiver at a time to systems with multiple receivers being active simultaneously ( where we define being active as receiving transmissions ). the design of the feedback encoding solutions can be applied to quantized matrices of orthogonal eigenmodes , subsets of eigenmodes and scalar singular values as necessary . the following descriptions will be generic in form so that they can easily be applied to any type of csi quantizing solution . fig2 shows the basic structure of the system proposed in u . s . patent application no . 11 / 754 , 965 . the system works as follows : 1 . before the transmission epoch , each receiver 38 estimates 40 its channel matrix h for a feedforward channel 34 and uses this information to perform the singular value decomposition ( svd ) 42 of the matrix . 2 . the eigenmode and singular value components are separately quantized 44 using two codebooks v 46 and d 48 , respectively . 3 . the indices of the selected codewords are encoded 52 , 54 and fed back 56 , 58 to the transmitter 36 on a feedback channel 50 . 4 . the transmitter includes an indexer and optimizer 66 which uses all decoded 60 , 62 indices 64 from all receivers in the system to choose 68 , 70 the preselected linear modulation and power allocation matrices b and s , respectively . the choice is based on a predefined set of rules ( maximum fairness , throughput etc .). 5 . the input signal 72 is modulated using the modulation 74 and power allocation 76 matrices , transmitted to the receiver over the feedforward channel 34 , using antennas 32 , and the transmitted modulated signal is processed 78 by the receiver . the feedback channel 50 shown in fig2 will inevitably suffer from the transmission errors and the indices of the channel vectors reported by the receivers will be erroneously decoded at the transmitter . even if the feedback information is protected by channel codes , in a multiple user scenario , it is possible that the interference will cause the indices to be detected with errors , which will lower the system &# 39 ; s throughput . for example , in fig1 , during the first part of the actual vector trajectory 24 , the centroid index number 3 represented by bits 011 would be reported to the transmitter . however , if for some reason , the second index bit would be recovered with an error , the centroid index number 1 ( represented by bits 001 ) would instead be received by the transmitter , which would cause it to choose improper modulation matrices b and s ( see previous section ). the basic transmission of the feedback indices 23 may comprise the following steps : 1 . selection of the indices 23 representing the centroids 22 closest to the actual channel vectors . 2 . ( optional ) adding error detection check bits to the binary representation of the centroid indices . 3 . ( optional ) adding channel error correction check bits . 4 . transmission of all the bits . 5 . ( conditioned on 3 ) performing channel decoding of the received bits . 6 . ( conditioned on 2 ) performing error detection of the received bits . 7 . reporting the received channel vector indices to the optimizer / indexer in fig2 . 8 . ( optional ) reporting which indices contain errors to the optimizer / indexer in fig2 . this step can use results from 6 or any alternative method as outlined later on . based on the above eight steps , the indexer will now be able to make decision on the choice of modulation matrices for the next transmission epoch . three exemplary approaches to the problem are : 1 . if error detection codes or any alternative error detection method is used and the base station optimizer is aware of erroneous receiver indices , it may discard them and only use the correct ones in the optimization phase . 2 . if error detection codes or any alternative error detection method is used and the base station optimizer is aware of erroneous receiver indices , it may attempt to recover them and use all received indices ( correct and recovered ) in the optimization phase . 3 . if error detection is not used at all , the optimizer assumes that the received indices are very close to the actual transmitted indices and use them as if they were all correct . a basic difference between methods 1 , 2 and 3 lies in whether the error detection methods are used to detect problems in channel information indices fed back to the base station . if such methods are used , the transmitter may recognize which indices are incorrect and can take appropriate actions . if no error detection may be performed and the received indices are used ‘ as - is ’, the vector quantizer indexing must be properly designed as shown in fig3 a . the mapping of the indices to the centroids in a quantizer is a complex task that can influence the system &# 39 ; s performance tremendously when errors in the feedback link are not negligible . fig3 a and 3 b shows the situation , where the identical vector quantizer has a different mapping of indices 23 and the results of one bit error in the transmission of the centroid indices . in fig3 a , the mapping was done in a way that ensured that one bit error in the last position of the index moved the centroid received at the transmitter not far from the actual one . in other words , the small hamming distance of the difference between the actual and received indices of the centroid corresponds to the small distance 26 between the actual centroids . the centroid distance 2 - 6 function will be discussed further in the document . in fig3 b , the small hamming weight of index error does not correspond to the small centroid distance . in this case , a 1 - bit error forces the centroid to move far away from the actual one , which may have a very negative influence on the system &# 39 ; s performance . 1 . design of the indexing for csi mimo vector quantizers . 2 . actual operation of the system using encoded feedback link with csi mimo quantizers with or without error detection . the algorithm for the design of the indexing can be carried out in any suitable computing device , including for example pen and paper . typically the design will be carried out prior to the initialization of the mimo system . v k — the kth centroid in codebook v . k , l — indices of centroids in codebook v . d kl — the distance between the centroids specified by indices k and l . d ( k ; e )— distance profile for centroid v k and a given number of bit errors e . gdp ( e )— global distance profile for a given number of bit errors e . i , j — binary indices of a codeword in a vector quantizer . h ij — the hamming distance between indices i and j . i — the number of iterations of the index optimization algorithm n — the length of the binary representation of centroid indices i , j . it is assumed that the indexing design follows the design of the channel vector quantizer v using any of the existing methods , for example the method shown in the patent application “ quantization of channel state information in multiple antenna systems ” ( u . s . patent ser . no . 11 / 754 , 965 pending ). the input to the quantizer indexing algorithm is the distance matrix d with number or rows and columns equal to the number of all centroids v k ( with our notation the number of rows and columns is equal to 2 n ). the entries in the matrix are distances between the centroids — for example , the kth row and lth entry is given by d kl . in particular , the entries on the diagonal of the matrix are equal to 0 . the methods used to calculate the distance matrix d as well as the centroid distances are immaterial in this patent application . however , some of the methods to calculate the centroid distances for the matrix d can be defined as follows : 1 . d kl is the angle between the centroids v k and v l . 2 . d kl is the smaller of the angles between the centroids v k and v l and between the centroids v k and − v l . 3 . d kl is the euclidean distance between the centroids v k and v l . 4 . d kl is the average system throughput loss when centroid v k is chosen instead of v l . 5 . d kl is the user system throughput loss when centroid v k is chosen instead of v l . 6 . any other distance definition depending on the system design parameters in addition to the distance metric d kl , representing a distance between two specified quantizer centroids , a set of distance profiles , d ( k ; e ), and a global distance profile , gdp ( e ), are used to represent the distance profile of the indexed quantizer . a distance profile d ( k ; e ) for a given centroid k and a number of errors e represents a set of numbers corresponding to the distances between all erroneous representations of the centroid v k and the actual centroid v k , assuming that e errors appeared during the transmission of its corresponding index i . in other words , d ( k ; e )=[ d 1 , d 2 , d 3 , . . . , d n , . . . , d e ], where e is the number of e - element subsets in n - long binary representation of codebook indices and d kl corresponds to distances d kl between the centroid v k and its erroneous version v l containing e index errors . finally , to characterize the entire codebook , a global distance profile gdp ( e ) is defined as the union of all distance profiles d ( k ; e ). indexing design algorithm . design of the indexing based on the distance matrix d is performed using a heuristic algorithm operating in two phases : the initialization phase and optimization phase . since the initialization phase of the algorithm depends on random initial choice of indices , it is recommended that both phases of the algorithm are repeated storing the index map after each optimization step for a given number of iterations i until the best solution has been found or the design constraint has been met . the general operation of the indexing design algorithm is shown in fig4 and described below . 1 . in step 80 , initialize iteration counter i and in step 82 the previous global distance profile gdp previous . 2 . in step 84 , run the initialization phase of the algorithm ( see below ). 3 . in step 86 , run the optimization phase of the algorithm ( see below ). 4 . in step 88 , store index map and calculate the new global distance profile gdp ( e ). 5 . in step 90 compare gdp ( e ) with gdp previous ; in step 92 check if gdp ( e ) improves gdp previous and if so then in step 94 exchange gdp previous with gdp ( e ) and store the current index map . 6 . in step 96 increase i by 1 . 7 . in step 98 if i & lt ; i go to 2 . 8 . in step 100 , stop . 1 . in step 102 , generate the distance matrix d ; in step 104 initialize the lists of unassigned indices , centroids and processed entries in d . 2 . in step 106 , find the smallest unprocessed entry d u & gt ; 0 in the matrix d . 3 . mark the entry d kl as processed . 4 . in step 108 search for centroids v k and v l corresponding to d kl ; in step 110 check if any indices have been assigned to either centroid . if neither centroids v k nor v l corresponding to d kl have been assigned any indices i or j , in step 112 ( a - c ), step 118 ( d - e ) and step 120 ( f ): a ) choose a random index i from the list of the unused indices . b ) assign the index i to the centroid v k . c ) mark the ith entry in the list of used indices list as taken . d ) choose a random index j from the list of the unused indices in such a way that the corresponding h ij is minimized . e ) assign the index j to the centroid v l . f ) mark the jth entry in the list of used indices list as taken , and v l as having an index assigned to it in the list of used centroids . 5 . in step 114 , check if only one of the centroids v k or v l have been assigned an index , and if so in step 118 ( a - b ) and step 120 ( c ): a ) choose a random index j from the list of the unused indices in such a way that h ij is minimum , where it is assumed ( step 116 ) that i is the binary index of the already indexed centroid . b ) assign the index j to the unassigned centroid . c ) mark the jth entry in the list of used indices as taken , and mark the unassigned centroid as assigned . 6 . if both centroids v k or v l have been assigned an index , go to 7 . 7 . in step 122 , if there are still unassigned indices , go to 2 . 8 . in step 124 , stop . the operation of the initialization phase is presented in fig5 . after the completion of the initialization phase , all centroids v k in the codebook v have been assigned the binary indices i , with the majority of smallest distances d kl in matrix d coupled to the binary indices i and j with small hamming distances . however , the initialization phase can only reach locally optimum solutions and , in the next step , an improved solution is iteratively searched for . 1 . in step 130 , generate the distance matrix d and initialize the global distance profile gdp ( e ). 2 . in step 132 , initialize the list of processed entries in d . 3 . in step 134 , set the previous global error distance as gdp previous = gdp ( e ). 4 . in step 136 , find the smallest unprocessed entry d kl & gt ; 0 in the matrix d , and mark it as processed . 5 . in step 138 , find the binary indices i and j assigned to the centroids k and l . choose whether to swap them as follows : a ) in step 140 , calculate the global distance profile gdp original ( e ) with mapping of centroid v k to binary index i and centroid v l to binary index j . b ) in step 142 and 144 , calculate the global distance profile gdp swapped ( e ) with mapping of centroid v k to binary index j and centroid v l to binary index i . c ) in step 146 choose the mapping corresponding to better global distance profile from 6a ) and 6b ) and in step 148 assign the indices of centroids accordingly . 6 . in step 150 , check the list of the processed entries d kl , and if there are still unprocessed entries , go to 4 . 7 . in step 152 , calculate the gdp ( e ) with the current mapping of centroids and indices . if it is better than gdp previous then go to 2 . 8 . in step 154 , if there are no improvements over gdp previous stop . the operation of the optimization algorithm is presented in fig6 . the optimization phase iteratively searches for better mapping between centroids and indices by swapping the binary representation of the closest pairs . after each such swap , the global distance profile for swapped mapping is compared to the unswapped mapping and the globally better solution is chosen . the algorithm is repeated iteratively through all centroids and stops when no improvement can be achieved by consecutive swapping of the indices . a more general version of this approach to indexing is shown in fig9 . in fig5 , pairs of centroids ( that is , channel states representing a region of channel state space for purposes of quantization ) near one another in terms of the chosen distance measure are chosen and are assigned indices also near one another in hamming distance , hamming distance being a proxy for the probability of one index being mistakenly received as another ( the less the distance , the more likely they will be confused ). since the feedback bandwidth is limited , there will have to be indices near one another in hamming distance and the effect of feedback errors is reduced if such nearby indices are assigned to nearby channel states , so as to reduce the effect on transmission quality if they are mistaken for one another . hence the initialization phase depicted in fig5 can be regarded as choosing multiple mappings of indices to channel states in step 220 ( the different possible assignments of indices to a pair of channel states ), estimating the effect of feedback errors of each in step 222 ( using hamming distance as a proxy in this case ), and selecting one in step 224 ( in this case one with the minimum hamming distance ) so as to reduce the effect of feedback errors . similarly the optimization phase shown in fig6 includes choosing multiple mappings of indices to channel states in step 220 ( in this case differing from one another by the swapping of pairs of indices ), estimating the effect of feedback errors of each mapping ( in this case using the global distance profile ), and selecting a mapping to reduce the expected effect of feedback errors ( by choosing the one with the best global distance profile in this case ). no matter how the mapping is selected , it is used in step 226 to send feedback of information concerning a channel state from a receiver to a transmitter , the receiver representing the channel state using the index mapped to the exemplary state ( eg . centroid ) for the region of channel state space in which the channel state lies . if the system uses error detecting codes in the feedback link , its operation can be summarized as follows : 1 . in step 160 , initialize transmission epoch to t = 1 . 2 . in step 162 , each receiver estimates its channel matrix h [ t ]. 3 . in step 164 , each receiver performs the vector quantization of the channel state information . 4 . in step 166 , the channel state information indices are encoded using error detecting code ( such as crc ). 5 . ( optional ) in step 168 , the channel state information indices with the error - detection redundancy are encoded using error correcting code ( such as convolutional or turbo codes ). 6 . in step 170 , the encoded channel state information indices are fed back to the transmitter . 7 . ( conditional on 5 ) in step 172 , the received channel state information indices are decoded in a channel decoder that attempts to correct possible channel transmission errors . 8 . in step 174 , the decoded indices are checked by an error - detecting decoder . 9 . in step 176 , the receiver counts the number of erroneously decoded indices . 10 . depending ( in step 178 ) on the implementation , the receiver may then : a ) in step 180 , expurgate the erroneous indices , if there are still enough indices for optimization process , and process only the remaining ones b ) in step 184 , ignore the errors and use the erroneous indices . c ) in step 182 , regenerate the erroneous indices , for example , by using the channel prediction techniques from pending us patent application “ quantized channel state information prediction in multiple antenna systems ” ser . no . 11 / 852 , 206 . 11 . in step 186 , the transmitter performs the selection of active users using any method ( maximum fairness , maximum throughput etc .) and chooses the corresponding modulation matrices . 12 . the signal is transmitted to the selected active receivers . 13 . in step 188 , increase transmission epoch as t = t + 1 . 14 . go to 2 . the operation of the algorithm is presented in fig7 . if the system uses no error detecting codes in the feedback link , its operation can be summarized as follows : 1 . in step 190 , initialize transmission epoch to t = 1 . 2 . in step 192 , each receiver estimates its channel matrix h [ t ]. 3 . in step 194 , each receiver performs the vector quantization of the channel state information . 4 . ( optional ) in step 196 , the channel state information indices with the error - detection redundancy are encoded using error correcting code ( such as convolutional or turbo codes ). 5 . in step 198 , the encoded channel state information indices are fed back to the transmitter using the method described in previous sections . 6 . ( conditional on 4 ) in step 200 , the received channel state information indices are decoded in a channel decoder that attempts to correct possible channel transmission errors . 7 . if ( step 202 ) the index error detection is possible using alternative methods , for example , channel prediction techniques such as the one presented in the pending us patent application “ quantized channel state information prediction in multiple antenna systems ” ser . no . 11 / 852 , 206 , the transmitter may : a . in step 206 , expurgate the erroneous indices if there are still enough indices for optimization process , b . in step 204 , regenerate the erroneous indices using , for example , channel prediction techniques . 8 . if ( step 202 ) the index error detection is impossible , in step 208 the receiver uses the received indices as correct ones , 9 . in step 210 , the transmitter performs the selection of active users using any method ( maximum fairness , maximum throughput etc .) and chooses the corresponding modulation matrices . 10 . the signal is transmitted to the selected active receivers . 11 . in step 212 , increase transmission epoch as t = t + 1 . 12 . go to 2 . the operation of the algorithm is presented in fig8 . immaterial modifications may be made to the embodiments described here without departing from what is covered by the claims . in the claims , the word “ comprising ” is used in its inclusive sense and does not exclude other elements being present . the indefinite article “ a ” before a claim feature does not exclude more than one of the feature being present . each one of the individual features described here may be used in one or more embodiments and is not , by virtue only of being described here , to be construed as essential to all embodiments as defined by the claims .