APPARATUS, AND ASSOCIATED METHOD, FOR PAGING AN ACCESS TERMINAL IN A RADIO COMMUNICATION SYSTEM

• US 20080064417A1
• Filed: 09/11/2007
• Published: 03/13/2008
• Est. Priority Date: 09/11/2006
• Status: Active Grant

• Current Assignee: Malikie Innovations Limited (Key Patent Innovations Limited)
• Original Assignee: Blackberry Limited
• Inventors: ISLAM, MUHAMMAD, WILLEY, WILLIAM
• Granted Patent: US 8,065,530 B2
• Time in Patent Office: Days
• US Class Current: 455/458
• CPC Class Codes: H04W 68/025 Indirect paging

Abstract

Apparatus, and an associated method for facilitating paging of an access terminal operable in a radio communication system. A plurality of random numbers are generated. And, for each of the random numbers, a hash value is created by applying the random number to a hash function. The hash values identify bit locations of a paging message. When the paging message is formed, bit locations associated with the hash values are populated with bit values are populated with bit values that identify whether the access terminal is being paged. And, the access terminal checks the bit values at the bit locations associated with the hash values to determine whether the access terminal is being paged.

Claims

1. A method for generating hash values used pursuant to communication of a paging message, said method comprising:

generating a first hash value using a first DECORR value, the first DECORR, decorrelate, value derived from a first number;

using the first hash value to utilize a first location of the paging message;

rotating the first number by a first amount; and

generating a second hash value using a second DECORR value, the second DECORR value derived from the first number, once rotated.

2. The method claim 1 wherein the first number comprises at least a portion of a session seed.

3. The method claim 2 wherein the first number comprises a group of significant bits of the session seed.

4. The method of claim 1 wherein said rotating the first number comprises rotating the first number a first number of bits.

5. The method of claim 1 wherein the first number comprises a multi-bit binary number and wherein said rotating comprises multiplying the multi-bit binary number.

6. The method of claim 1 wherein the first hash value and the second hash value are dissimilar.

7. The method of claim 1 wherein said generating the first hash value and said generating the second hash value are performed using a common hash function.

8. The method of claim 1 wherein the first DECORR value is a first multiple of the first number.

9. The method of claim 1 wherein the second DECORR value is derived from a second multiple of the first number.

10. The method of claim 1 wherein the paging message comprises a received paging message received at an access terminal and wherein generating the first hash value, using, rotating, and generating the second hash value are performed at the access terminal.

11. The method of claim 1 wherein the paging message comprises a send-paging message formed at a network entity and wherein generating the first hash value, using, rotating, and generating the second hash value are performed at the network entity.

12. The method of claim 1 further comprising generating a signaling message that includes indication of configuration of the paging message.

13. The method of claim 1 further comprising configuring the paging message to be an atomic message.

14. The method of claim 1 further comprising:

using the second hash value to utilize a second location of the paging message;

rotating the first number by a second amount;

generating a third hash value using a third DECORR value, the third DECORR value derived from the first number, once rotated by the second amount; and

using the third hash value to utilize a third location of the paging message.

15. A method for generating hash values used pursuant to communication of a paging message, said method comprising:

generating a first hash value using a first DECORR, decorrelate, value, the first DECORR value derived from a first number;

using the first hash value to utilize a first location of the paging message, the first location being in a first group of bits of the paging message;

rotating the first number by a first amount;

generating a second hash value using a second DECORR value, the second DECORR value derived from the first number, once rotated by the first amount;

using the second hash value to utilize a second location of the paging message, the second location being in a second group of bits of the paging message, the second group of bits equal in size to the first group of bits and nonoverlapping with the first group of bits;

rotating the first number by a second amount;

generating a third hash value using a third DECORR value, the third DECORR value derived from the first number, once rotated by the second amount;

using the third hash value to utilize a third location of the paging message, the third location being in a third group of bits of the paging message, the third group of bits equal in size to the second group of bits and nonoverlapping with the first group of bits and nonoverlapping with the second group of bits;

rotating the first number by a third amount;

generating a fourth hash value using a fourth DECORR value, the fourth DECORR value derived from the first number, once rotated by the third amount;

using the fourth hash value to utilize a fourth location of the paging message, the fourth location being in a fourth group of bits of the paging message, the fourth group of bits equal in size to the third group of bits and nonoverlapping with the first group of bits, nonoverlapping with the second group of bits, and nonoverlapping with the third group of bits.

16. An apparatus for generating hash values used pursuant to communication of a paging message, said apparatus comprising:

a hash generator configured to generate a first hash value using a first DECORR, decorrelate, value, the first DECORR value derived from a first number and to generate a second hash value using a second DECORR value, the second DECORR value derived from rotation of the first number; and

a paging message element adapted to receive the first hash value and the second hash value, said paging message element configured to utilize the first and second hash values, respectively, to identify locations of a paging message.

17. The apparatus of claim 16 wherein the first number comprises at least a portion of a session seed.

18. The apparatus of claim 16 wherein the first number comprises a group of bits of the session seed.

19. The apparatus of claim 16 wherein the first number comprises a multi-bit binary number.

20. The apparatus of claim 16 wherein the first DECORR value is a first multiple of the first number.

21. The apparatus of claim 16 wherein the second DECORR value is derived from a second multiple of the first number.

22. The apparatus of claim 16 wherein said paging message element comprises a network-positioned element.

23. The apparatus of claim 16 wherein said paging message element comprises an access-terminal positioned element.

24. The apparatus of claim 16 further comprising a signaling message generator configured to generate a signaling message that includes indication of configuration of the paging message.