Quick Page Message Partial Identifier Bit Length Optimization
Solution Overview
Problem
Current quick paging schemes in radio communication systems, such as CDMA2000 EV-DO, face challenges in minimizing false wakeups of access terminals, leading to excessive battery depletion, especially when paging multiple terminals, as the available bits in the quick page message are not optimally utilized, increasing the likelihood of incorrect wakeups.
Innovation Solution
The solution involves forming a quick page message with partial identities of varying bit lengths to create redundant values, which are then removed, allowing the freed bits to increase the length of other partial identities, thereby reducing the likelihood of false wakeups. This is achieved through a determiner that determines page values and a rearranger that adjusts bit lengths to maximize redundancy, ensuring better utilization of bits in the quick page message.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Duration of action of stationary object
If partial hash comparison scheme is used to reduce false wakeup probability, then battery longevity is improved, but the scheme is not usable when more than five access terminals are paged due to increased false wakeup possibility
Solution Approach 1:
The access terminal identifier is divided into multiple partial identifiers of different bit lengths. This segmentation allows the system to page multiple terminals while maintaining low false wakeup probability by using shorter bit lengths that create sufficient redundancy and collision avoidance in the page message structure.
Solution Approach 2:
Different partial identifiers are assigned different bit lengths based on their position and function in the page message. This local differentiation optimizes the balance between paging capacity and false wakeup reduction, allowing the system to handle more than five terminals without increasing false wakeup probability.
2Reliability
If bit length of partial identifiers is shortened to create redundant values, then false wakeup probability is reduced, but the number of available page indication locations decreases
Solution Approach 1:
The system dynamically adjusts the bit lengths of partial identifiers based on the number of terminals being paged. When fewer terminals are paged, shorter bit lengths are used to maximize redundancy and minimize false wakeups. When more terminals are paged, the system adapts by allocating bits more efficiently across the partial identifiers.
Solution Approach 2:
The bit length parameter of partial identifiers is changed dynamically based on paging requirements. By varying the bit lengths and creating redundant values, the system maintains low false wakeup probability while still accommodating multiple terminals in the page message.
3Device complexity
If equal bit lengths are used for all partial identifiers, then the page message structure is simple, but bits are not optimally utilized and false wakeup probability increases
Solution Approach 1:
The patent employs asymmetric bit lengths for different partial identifiers rather than equal bit lengths. This asymmetry allows optimal utilization of available bits in the page message, creating a structure that is both manageable in complexity and highly effective at reducing false wakeup probability through strategic bit allocation.
Data Source
AI summary
Apparatus, and an associated method, by which to form a quick page message for broadcast to access terminals to alert the access terminals of pending communication. The quick page message includes a structure formed of page identifier sets. During formation of the structure, a rearranger shortens the bit length of one or more of the page identifier sets. By reducing the bit length, the likelihood of a resultant redundant page identifier set, of the same bit length, is increased. Redundant page identifier sets are removable from the resultant quick page message.