Multi-state pattern recognition handoff algorithms

In wireless cellular systems, handoff algorithms decide when and to which base station to handoff. Traditional handoff algorithms generally cannot keep both the average number of unnecessary handoffs and the handoff decision delay low. They do not exploit the relative constancy of path loss and shadow fading effects at any given location around a base station. This information can in fact be used to improve the efficiency of handoff algorithms, as we do in our new handoff algorithms using pattern recognition. Handoff algorithms with both a negligible number of unnecessary handoffs and a negligible decision delay can therefore be realized. We illustrate the benefits of using this kind of handoff algorithm by applying a two-state handoff algorithm to the problem of turning around a corner in a microcellular system