MESSAGE ENCODING IN VARIABLE RATE

    公开(公告)号:JP2002044014A

    公开(公告)日:2002-02-08

    申请号:JP2001169185

    申请日:2001-06-05

    Abstract: PROBLEM TO BE SOLVED: To identify a message group which can be used for transmitting by using previous messages. SOLUTION: As a message group contains the different number of messages, as a result, the messages from a smaller group can be expressed by using smaller bits than in the messages from a greater group. As the smallest group contains the messages accompanied by the highest possibility to be transmitted, the possibility of using the messages expressed by the smaller number of bits is maximized. The messages from the different groups are transmitted at different power level, and a receiver can determine the message group. As this result, the receiver identifies the messages by using previous messages, the power levels relating to the received messages, and the received message bits.

    4.
    发明专利
    未知

    公开(公告)号:DE60100981T2

    公开(公告)日:2004-08-12

    申请号:DE60100981

    申请日:2001-06-18

    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.

    EFFICIENT BLOCK CIPHER METHOD
    6.
    发明专利

    公开(公告)号:CA2282051A1

    公开(公告)日:2000-04-20

    申请号:CA2282051

    申请日:1999-08-30

    Abstract: The present invention solves the aforementioned inefficiencies by providing an encryption or cipher method that uses the same pseudorandom function twice rather than different pseudorandom functions. Additionally, the present invention uses hashing functions that are highly efficient. The hashing functions of the present invention are square hashing functions that square a sum of a key and a data string rather than using a multiplication. As a result the hashing operation only requires operations rather than the w2 operations required by the inefficient hashing functions used in the prior art.. Additionally, the present invention replaces the exclusive ORed operations of the prior art with modular "n" summing operations.

    A METHOD FOR GENERATING PSUEDO RANDOM NUMBERS

    公开(公告)号:CA2260683C

    公开(公告)日:2003-03-18

    申请号:CA2260683

    申请日:1999-02-04

    Abstract: The present invention is a method for outputting larger bit size pseudo-rand om number z; 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 exponenti al function xi = g xt-i 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 .

    10.
    发明专利
    未知

    公开(公告)号:DE60111189T2

    公开(公告)日:2006-03-23

    申请号:DE60111189

    申请日:2001-11-19

    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. Any scheduling algorithm may be used; for example, scheduling may be based on the amount of data to be transmitted, the age of the data or the service priority associated with the mobile station. The interference control is used to prevent the occurrence of catastrophic levels of interference while maximizing the utilization of resources on the uplink.

Patent Agency Ranking