Abstract: A hash function is applied to a prefix of a VIL input. The output is added to a suffix of the input. A block cipher is applied to results of the addition. An encryption function is performed on the prefix. The final output is the output of the block cipher and the encryption function. In a second encryption technique, a hash function is applied to an input, and the output of the hash function has first and second portions. A block cipher is applied to the second portion. The output of the block cipher is added to the first portion, and a second function is applied to the result of this first addition. The output of the second function is added to the second portion. An inverse hash function is then applied to the output of the first and second additions, creating an encrypted output.

Abstract: In a wireless network or other communication system, admission of users to the system is based on predicted scheduling gain. A scheduler is configured to manage access to network resources for users already admitted to the system. An admission control module is coupled to the scheduler, and determines a predicted scheduling gain of the scheduler under an operating scenario involving admission of at least one additional user to the system. The predicted scheduling gain is processed to generate at least one performance metric which is used to make an admission control decision regarding admission of the at least one additional user to the system.

Abstract: A multiple mode data communication system and method provides the flexibility to schedule wireless unit transmissions and/or allow the wireless unit to transmit autonomously. In certain embodiments, the wireless units can transmit autonomously and/or use scheduling depending on the data rate, the length of the data packet or the type of data. For example, the wireless units can transmit autonomously at lower data rates and use scheduling at higher data rates. Thus, the multiple mode system enables wireless unit transmissions to be scheduled and/or be transmit autonomously, and wireless units can simultaneously operate in different scheduling and/or autonomous modes.

Abstract: In a method of block coding, each character of the codeword may be thought of as a sum of characters of the message word, computed such that each message-word character that contributes to the sum is weighted by a respective weight coefficient. In the method described here, the weight coefficients are derived from a division polynomial of an elliptic curve.

Abstract: The present invention provides a method for encoding messages. The method includes identifying at least a first plurality of messages indicative of a corresponding first plurality of data transmission rates and a second plurality of messages indicative of a corresponding second plurality of data transmission rates based on a prior transmitted message, where the first and second pluralities of messages are unequal. The method also includes transmitting a message from one of at least the first and second pluralities of messages.

Abstract: The capacity of a reverse link is improved by realizing a scheme to effect sharp changes in pilot channel transmit power (PCTP) and data channel to pilot power ratio (DCPR), coordinated with the start of the data channel transmission. The change in pilot power and data channel to pilot power ratio is also applicable to mobiles that use multiple pilots and/or multiple antennas at the transmitter and/or receiver.

Abstract: Data rate determination is provided in a system where the available power fraction and available Walsh codes in each active leg are dynamically changing over time. This method adapts the rate (modulation and coding) based on the combined resource (power & code space) levels seen at each cell. The method results in maximization of the rate supportable by each cell given their resource constrained situation while meeting the constraints of target packet or frame error rate and orthogonality. Furthermore, improved fast cell selection by the mobile results due to this approach that is based on knowledge of combined resource (power & code space) levels across the cells in the active set.

Abstract: Disclosed is a method of integrating voice and data services onto a same frequency channel using available transmit power information to determine data rates, wherein the available transmit power information indicates an amount of transmit power available for future data transmissions over one or more data channels. In a “distributed” embodiment, a transmitter or base station transmits, via a forward link, an available power message to a receiver or mobile-telephone indicating an amount of available transmit power at some future time t+z. The mobile-telephone performs signal-to-interference measurements corresponding to the received forward link and received interference, and uses such signal-to-interference measurements and the available power message to determine a data rate that can be supported by the mobile-telephone. Preferably, the determined data rate corresponds to a maximum data rate at which a minimum level of quality of service can be achieved at the mobile-telephone.

Abstract: Efficient data communication in wireless communication system is provided by using centralized control of data communications, such as packet switched services, over the uplink channel (mobile station (MS) to base station (BS)). A multiple access protocol is used where packet data mobile stations make requests for uplink channel resources. The request messages transmitted by the MSs inform the BS of service parameters. Examples of such service parameters are available transmit power at the MS, the amount of data to transmit and Quality of Service (QoS). The BS then processes the received request messages and performs interference management calculations to determine the portion of the BS's receive power budget that can be allocated to the data user requesting service. These calculations are used to control the amount of interference seen at the base station, to assign a data rate to the user and to aid scheduling algorithms in computing service order priorities.

Abstract: A method of scheduling data communication over an uplink. The method enables two or more users seeking to transmit data over the uplink to be scheduled in response to their path loss. The user having the most attractive determined path loss among the two or more users seeking to transmit data over the uplink us scheduled first. Thereafter, the next user having the next most attractive path loss among the remaining users may be subsequently scheduled if the total noise rise leftover is greater than zero. This process repeats so long as or until the total noise rise leftover is about zero.

Abstract: An embodiment of the present invention provides a method for improving the capacity of a reverse link by realizing a scheme to effect sharp changes in pilot channel transmit power (PCTP) and data channel to pilot power ratio (DCPR), coordinated with the start of the data channel transmission. The change in pilot power and data channel to pilot power ratio is also applicable to mobiles that use multiple pilots and/or multiple antennas at the transmitter and/or receiver.

Abstract: A method for the reduction of soluble aluminum species in an evaporated salt alkali metal halide brine containing up to 500 ppb aluminum species to provide a brine feedstock suitable for use in a chlor-alkali membrane cell process, said method comprising treating said brine with a magnesium salt in an amount to provide a Mg to Al molar ratio selected from 5-20 to 1 at a Mg concentration selected from 0.5-10 ppm, and sufficient alkali metal hydroxide to provide an excess alkalinity concentration of between 0.1-0.5 g/L alkali metal hydroxide to effect precipitation of a magnesium aluminum hydroxide complex; and removing said complex to provide said brine feedstock.

Abstract: In a method of block coding, each character of the codeword may be thought of as a sum of characters of the message word, computed such that each message-word character that contributes to the sum is weighted by a respective weight coefficient. In the method described here, the weight coefficients are derived from a division polynomial of an elliptic curve.

Abstract: A hash function is applied to a prefix of a VIL input. The output is added to a suffix of the input. A block cipher is applied to results of the addition. An encryption function is performed on the prefix. The final output is the output of the block cipher and the encryption function. In a second encryption technique, a hash function is applied to an input, and the output of the hash function has first and second portions. A block cipher is applied to the second portion. The output of the block cipher is added to the first portion, and a second function is applied to the result of this first addition. The output of the second function is added to the second portion. An inverse hash function is then applied to the output of the first and second additions, creating an encrypted output.

Abstract: Efficient data communication in wireless communication system is provided by using centralized control of data communications, such as packet switched services, over the uplink channel (mobile station (MS) to base station (BS)). A multiple access protocol is used where packet data mobile stations make requests for uplink channel resources. The request messages transmitted by the MSs inform the BS of service parameters. Examples of such service parameters are available transmit power at the MS, the amount of data to transmit and Quality of Service (QoS). The BS then processes the received request messages and performs interference management calculations to determine the portion of the BS's receive power budget that can be allocated to the data user requesting service. These calculations are used to control the amount of interference seen at the base station, to assign a data rate to the user and to aid scheduling algorithms in computing service order priorities.

Abstract: A multiple mode data communication system and method provides the flexibility to schedule wireless unit transmissions and/or allow the wireless unit to transmit autonomously. In certain embodiments, the wireless units can transmit autonomously and/or use scheduling depending on the data rate, the length of the data packet or the type of data. For example, the wireless units can transmit autonomously at lower data rates and use scheduling at higher data rates. Thus, the multiple mode system enables wireless unit transmissions to be scheduled and/or be transmit autonomously, and wireless units can simultaneously operate in different scheduling and/or autonomous modes.

Abstract: Data rate determination is provided in a system where the available power fraction and available Walsh codes in each active leg are dynamically changing over time. This method adapts the rate (modulation and coding) based on the combined resource (power & code space) levels seen at each cell. The method results in maximization of the rate supportable by each cell given their resource constrained situation while meeting the constraints of target packet or frame error rate and orthogonality. Furthermore, improved fast cell selection by the mobile results due to this approach that is based on knowledge of combined resource (power & code space) levels across the cells in the active set.

Abstract: The present invention is a method for outputting larger bit size pseudo-random number zi that is cryptographically secure. Since larger bit size pseudo-random numbers are being outputted, larger bit size segments of messages may be encrypted resulting in a speedier encryption process than encryption processes of the prior art. In one embodiment, the present invention is a pseudo-random number generator defined by a modular exponential function xi=gxi−1 mod p. The output of the pseudo-random number generator being a pseudo-random number zi comprising a j−1 bit size segment of xi. The value of j being less than or equal to m−2c (i.e., j≦m−2c). In an embodiment of the present invention, the pseudo-random number zi includes the j least significant bits of xi excluding the least significant bit of xi.