The fetch target buffer (FTB) holds information on basic blocks to predict taken branches in the fetch stream and also their target addresses. We propose a variation to FTB, the self-indexed FTB, which, through an extra level of indirection, provides the high hit rate of a relatively large, high-associative FTB with the fast access delay of a small, direct-mapped FTB. The critical and most frequent operation -predicting the next FTB entry- is speeded up, whilst less frequent operations -such as recovering from FTB misses- are slightly slowed down. The new design is both analyzed and simulated. Performance increase on a 512-entry FTB is estimated at between 15% and 30%.