The optimal resource allocation policy is studied in this paper, for nonreal-time users in CDMA reverse link. The resource allocation policy of interest includes channel coding, spreading gain control and power allocation under the conventional receiver operation-multiuser detection technique is not considered. The constraints in the optimization include peak transmit power of the mobile station, total received power at the base station and QoS in the form of minimum SINR for each user. The coding and spreading gain control can be separated from the power allocation strategy. Our results show that the optimal power allocation policy depends on the objective function: to maximize the sum of throughput from each user, a greedy policy is optimal where the good users (mobile stations with good radio conditions) transmit with full power, bad users (mobile stations with poor radio conditions) barely achieve their QoS and there is at most one user in-between; on the other hand, to maximize the product of throughput from each user, a fair policy is optimal where the bad users transmit with full power and the good users transmit with powers to reach a common received power level. The fairness of the optimal policy in the latter case makes QoS constraint unnecessary. Furthermore, we have found a unified approach in deriving these optimal policies. This approach can also be applied to other power allocation problems in CDMA reverse link. We also present numerical results on the channel capacity under both objectives and the effect of QoS constraint.

The IS-856 system delivers high spectral efficiency on the forward link by using dynamic link adaptation, hybrid ARQ and multi-user diversity scheduling. The channel coding/modulation scheme used on the forward link is designed to support incremental redundancy for hybrid ARQ, while maximizing the coding gain over static channels. This paper presents the design of the channel-coding scheme used on the IS-856 forward link. It highlights a "novel" interleaver design that provides near-optimal code puncturing and modulation symbol mapping, in addition to randomizing burst errors on the channel.

In this paper, trellis group codes are introduced as an extension of Slepian group codes to codes over sequence spaces. A trellis group code is defined over R/sup n/ as the orbit of a bi-infinite "seed sequence", x/sub 0//spl isin/(R/sup n/)/sup Z/, under an infinite, defining group of transformations. This group of transformations is generated by a symbolic system. The theory is developed by combining a nontrivial extension of the notion of an isometric labeling, with results from the theory of symbolic dynamics over groups. New results presented here include a useful characterization of uniform partitions and a symbolic dynamic classification of trellis group codes. The theory is used to develop a class of rotationally invariant, nonabelian trellis group codes for QAM modulation. It is also shown that the 8-state, rotationally invariant trellis code designed by Wei (1984), used in the V.32 (and V.32 bis) international modem standard, belongs to this class.>