Abstract: An electronic circuit (200) for use with an accessing circuit (110) that supplies a given address and a partial write data portion and also has dummy cycles. The electronic circuit (200) includes a memory circuit (230) accessible at addresses, an address buffer (410), a data buffer (440) coupled to the memory circuit (230), and a control circuit (246) operable in the dummy cycles to read data from the memory circuit (230) to the data buffer (440) from a next address location in the memory circuit (230) and to store that next address in the address buffer (410).

Abstract: Conserving call logic during handoff may be provided. First, a call may be received at a first server. Next, the first server may determine that it cannot handle the call. Then the call may be transferred by the first server to a second server with enough information so that the second server can take up the call where the first server left off. Transferring the call to the second server with enough information so that the second server can take the call up where the first server left off may comprise placing the information in a REFERRED-BY header and sending the REFERRED-BY header to the second server.

Abstract: Conserving call logic during handoff may be provided. First, a call may be received at a first server. Next, the first server may determine that it cannot handle the call. Then the call may be transferred by the first server to a second server with enough information so that the second server can take up the call where the first server left off. Transferring the call to the second server with enough information so that the second server can take the call up where the first server left off may comprise placing the information in a REFERRED-BY header and sending the REFERRED-BY header to the second server.

Abstract: An electronic circuit (200) for use with an accessing circuit (110) that supplies a given address and a partial write data portion and also has dummy cycles. The electronic circuit (200) includes a memory circuit (230) accessible at addresses, an address buffer (410), a data buffer (440) coupled to the memory circuit (230), and a control circuit (246) operable in the dummy cycles to read data from the memory circuit (230) to the data buffer (440) from a next address location in the memory circuit (230) and to store that next address in the address buffer (410).

Abstract: An electronic circuit (200) for use with an accessing circuit (110) that supplies a given address and a partial write data portion and also has dummy cycles. The electronic circuit (200) includes a memory circuit (230) accessible at addresses, an address buffer (410), a data buffer (440) coupled to the memory circuit (230), and a control circuit (246) operable in the dummy cycles to read data from the memory circuit (230) to the data buffer (440) from a next address location in the memory circuit (230) and to store that next address in the address buffer (410).

Abstract: This invention generates the random seed patterns using simple, low-area overhead digital circuitry on-chip. This circuit is implemented as a finite state machine whose states are the seeds as contrasted to storing the seeds in the prior art. These seeds are used to control pseudo-random pattern generation for built-in self-tests. This invention provides a large reduction in chip area in comparison with storing seeds on-chip or off-chip.

Abstract: An electronic circuit (200) for use with an accessing circuit (110) that supplies a given address and a partial write data portion and also has dummy cycles. The electronic circuit (200) includes a memory circuit (230) accessible at addresses, an address buffer (410), a data buffer (440) coupled to the memory circuit (230), and a control circuit (246) operable in the dummy cycles to read data from the memory circuit (230) to the data buffer (440) from a next address location in the memory circuit (230) and to store that next address in the address buffer (410).

Abstract: Conserving call logic during handoff may be provided. First, a call may be received at a first server. Next, the first server may determine that it cannot handle the call. Then the call may be transferred by the first server to a second server with enough information so that the second server can take up the call where the first server left off. Transferring the call to the second server with enough information so that the second server can take the call up where the first server left off may comprise placing the information in a REFERRED-BY header and sending the REFERRED-BY header to the second server.

Abstract: This invention generates the random seed patterns using simple, low-area overhead digital circuitry on-chip. This circuit is implemented as a finite state machine whose states are the seeds as contrasted to storing the seeds in the prior art. These seeds are used to control pseudo-random pattern generation for built-in self-tests. This invention provides a large reduction in chip area in comparison with storing seeds on-chip or off-chip.