Global history can again be refined by localizing it in a different way. Use a bits of the branch instruction's address and b bits of global history as an index into a table of 2^a+b counters. Conceptually this means we have 2^a separate branch prediction tables with 2^b entries each. But only one b-bit shift register for global history and only a one-stage lookup!