value step 222 also flow passes back to step 204 the loop of steps 204 220 repeats continuously regardless of the value of the counters if the counters are equal to or greater than the threshold the rnc is signaled step 224 the rnc then signals the wtru to adjust the ul transmission power step 226 and the method ends step 228 if the counters are below the threshold step 222 then the method ends step 228 when the base station decodes the received 32 bit code word steps 106 206 the output of the decoding process can be viewed as one of n distinct hypotheses where the number of information bits n is related to m by m 2n in tdd n 10 in other words one out of m symbols is sent from the wtru to base station the hypothesis test at the base station selects the most likely member of the m symbol alphabet and then converts it back into the n information bits that the symbol i e the encoded code word represents different decision algorithms exist to determine what represents the most likely received symbol often varying on what is known about the symbols for example if it is more likely that a particular symbol is sent then incorporating this knowledge into the decision algorithm provides an advantage over an algorithm which supposes that all symbols are sent equally often to further illustrate in the fdd context the decoder can operate like 32 matched filters with one filter for each symbol wherein each symbol has a particular waveform chip bit sequence each matched filter correlates the received waveform with the waveform corresponding to a particular symbol the correlation outputs from each of the 32 matched filters are basically a peak corresponding.