a detailed description of embodiments of the present invention is provided with respect to fig1 - 6 . in fig1 a simplified diagram of an integrated circuit processor which includes the address generator of present invention is provided . thus , an integrated circuit device 10 includes a program memory 11 , a data memory 14 , and a processor core 12 , such as a processor core including a circular address generator 15 for data memory access , a register file 13 in which circular buffer program registers reside in , and other logic such as instruction decoder , alu etc . the circular address generator 15 according to the present invention provides management for buffers in data memory 14 with a length ( l + 1 ) and a selectable boundary base , which can be based on an implied higher boundary , or based on a combination implied higher boundary or an implied lower boundary . for example , the processor 12 executes instructions from the program memory 11 . instructions include direct address instructions and indirect address instructions . the indirect address instructions rely on the circular buffer program registers in the register file 13 . in one embodiment , there are four sets of circular buffer program registers , each of which includes a first register that stores a current address a , a second register that stores an offset value m , and a third register that stores a buffer length value l . for the embodiment that supports both higher and lower address boundaries , a high / low control signal is provided which indicates , for each access , whether the higher or lower address boundary buffer is to be used . the high / low control signal may be provided independently , as part of an instruction which uses the circular addressing , or as a high bit in the register which stores the offset value m , as the offset value m is limited to values that use only the lower order bits in the register . for example , an instruction “ ld × 1 , ar2 , m2 ” is interpreted by a decoder in the processor core 12 to load memory data into a register × 1 of the register file . the memory data is retrieved from the address specified by register ar2 in a set of circular buffer program registers storing the current address a as incremented by the offset value m stored in the register m2 in the set of circular buffer program registers . the register 12 in the set of second buffer program registers which stores the buffer length value l is pre - configured by the processor , or otherwise . in one embodiment , if the buffer length value l for a 16 - bit address is set to hex ffff , then linear addressing is used in response to the indirect address instructions that specify registers in the corresponding set of circular buffer program registers . fig2 a - 2 c illustrate circular addressing using the implied lower address boundary , implied higher address boundary , and combined lower and higher address boundary embodiments . in fig2 a , the prior art implied lower address boundary approach is shown with circular buffer 1 and circular buffer 2 . in this example , circular buffer 1 has a length l + 1 equal to 10 , and its allocation is between 0a00 ( hex ) and 0a09 ( hex ). assume there is a circular buffer 2 having a length l + 1 equal to 6 that a user wants to define . although the length of the address set between 0a0 a ( hex ) and 0a0f ( hex ) is equal to 6 , this address set cannot be used for circular buffer 2 , because it must have an implied lower boundary in which the lower 3 are zeros . so we locate circular buffer 2 between 0a10 ( hex ) and 0a15 ( hex ), this leaves an unused space between 0a0 a ( hex ) and 0a0f ( hex ). fig2 b illustrates the implied higher address boundary approach of the present invention . the circular buffer 1 and the circular buffer 2 are shown . in this case , the higher address boundary is implied . thus for circular buffer 1 with a length l + 1 equal to 10 , and with allocation between 0a0f ( hex ) and 0a06 ( hex ). in this example , the user defines circular buffer 2 has a length l = 1 equal to 6 . the most compact and closest allocation to buffer 1 , locates buffer 2 between 0a17 ( hex ) and 0a12 ( hex ) by implied higher boundary base . this still leaves an unused space between buffer 1 and buffer 2 . fig2 c illustrates circular buffer 1 with an implied lower address boundary , and circular buffer 2 with an implied higher address boundary , configured said there is no unused space between them . in this example , circular buffer 1 has a length l + 1 equal to 10 . for a current address a between 0a00 ( hex ) and 0a09 ( hex ), the circular address generator produces the next address within the range 0a00 ( hex ) to 0a09 ( hex ). circular buffer 2 with a length l + 1 equal to 6 in this example has an implied higher address boundary 0a0f ( hex ). for an access to the circular buffer 2 , using a current address between 0a0f ( hex ) and 0a0 a ( hex ), the circular address generator produces the next address within the range 0a0f ( hex ) to 0a0 a ( hex ). as can be seen , the two circular buffers can be configured so there is no unused space between them . the address generation logic for a buffer with an implied lower address boundary and for a buffer with implied higher address boundary are described below with reference to fig3 and 4 . if the buffer is selected with an implied lower boundary , then the implied lower boundary is determined by inserting 0s in the lower n bits of the current address a , where the value n is the bit position of the first leading “ 1 ” of the buffer length parameter l . the value n also could be declared by the equation of 2 { circumflex over ( )}( n − 1 )& lt ;= l & lt ; 2 { circumflex over ( )} n . according to this technique , the lower boundary can located at any multiple of 2 { circumflex over ( )} n . the lower boundary of this buffer is specified by the higher w − n bits of a at left concatenated with 0s in the lower n bits at right , where w is the number of address bits used for the memory . once a lower boundary is determined , the higher boundary is determined by adding l to lower boundary for buffer of length l + 1 . that is , the higher boundary is specified by the higher w − n bits of a at the left concatenated with the lower n bits of l at right . for example : consider a case in which w = 16 , l is 0000 0000 0010 1011 ( 16 bits in binary ), and the current address a to this buffer is 0011 1001 0101 1110 . the leading 1 in l is at bit position 6 , so we have n = 6 . the implicit lower boundary is 0011 1001 0100 0000 , and the implicit higher boundary is 0011 1001 0110 1011 . for ease of description , we take the higher w − n bits out of a , higher boundary and lower boundary , and use i to represent the lower n bits of a , use 0 to represent lower boundary , and use l to represent higher boundary . m is an offset between current address i and target next address i . m is a signed number , and could be a positive number or a negative number . in case m is a positive number , there are three conditions : ( 1 ) i + m & gt ;= 2 { circumflex over ( )} n , ( 2 ) i + m & gt ;= l + 1 , and ( 3 ) i + m & lt ; l + 1 , for consideration in connection with the logic used by the circular address generator . in condition 1 with m positive , i + m & gt ;= 2 { circumflex over ( )} n . the absolute address ( i + m ) exceeds the higher boundary l . the next address needs to be wrapped to the lower area of the circular buffer . the target next address i can be calculated by deducting buffer length ( l + 1 ) from the absolute address ( i + m ). the equation is i + m −( l + 1 ), which for a 2 &# 39 ; s complement system is converted to i + m +( l \). in condition 2 with m positive , i + m & gt ;= l + 1 . the absolute address ( i + m ) also exceeds the higher boundary l . the next address needs to be wrapped to the lower area of the buffer . the target next address i can be calculated by deducting buffer length from the absolute address . the equation is the same as in condition 1 , i + m −( l + 1 ), which for a 2 &# 39 ; s complement system is equal to i + m +( l \). in condition 3 with m positive , i + m & lt ; l + 1 . the absolute address i + m does not exceed the higher boundary l . so the target next address i is equal to i + m . in a hardware implementation , the condition 1 ( i + m & gt ;= 2 { circumflex over ( )} n ) is indicated by a carry out generated from i + m , and the condition 2 ( i + m & gt ;= l + 1 ) is indicated by a carry out generated from i + m +( l \). the condition 3 is indicated if there is no carry out generated from i + m . in case m is a negative number , there are two conditions : ( 1 ) i + m & lt ; 0 , ( 2 ) i + m & gt ;= 0 , for consideration in connection with the logic used by the circular address generator . in condition 1 with m negative , i + m & lt ; 0 . the absolute address ( i + m ) is a negative number below the lower boundary 0 of the circular buffer . the next address needs to be wrapped to the higher area of the circular buffer . the target next address i can be calculated by adding buffer length l + 1 to the absolute address i + m , the equation is : i + m + l + 1 . in condition 2 with m negative , i + m & gt ;= 0 . the absolute address ( i + m ) lies above the lower boundary 0 , so the target i is equal to i + m . in the hardware implementation , condition 1 with m negative ( i + m & lt ; 0 ) is indicated by no carry out generated from i + m . condition 2 with m negative ( i + m & gt ;= 0 ) is indicated by a carry out generated from i + m . thus , a hardware implementation of an implied lower address boundary circular buffer is implemented logically as shown in fig3 . the logic in fig3 includes a first adder 201 and a second adder 202 . the inputs to the first adder 201 include the values i and m . the output of the first adder 201 , referred to herein as the absolute address , is provided on line 207 , and equals i + m . a carry out signal from the adder 201 is supplied on line 206 . the inputs to the second adder 202 include the output of the exclusive nor gate 203 and the output on line 207 of the first adder 201 . the inputs to the exclusive nor gate 203 include the length value l and a sign bit of a address offset m . the second adder 202 receives the sign bit of m as a carry in on line 211 . the output of the second adder 202 , referred to herein as the wrapped address , is supplied on line 209 . a multiplexer 213 receives the absolute address on line 207 , and the wrapped address on line 209 as inputs , and supplies the target next address on line 210 . a control signal is supplied to the multiplexer 213 on line 212 to indicate which of the computed absolute address and wrapped address is provided as the output . the signal line 212 is provided by the output of the multiplexer 214 , which acts in response to the sign bit of m on line 211 , to select logic for the case in which the sign bit of m is one ( m is negative ), and the case in which the sign bit of m is zero ( m is positive ). in the case in which the sign bit of m is one , the output of the inverter 205 is provided as the control signal on line 212 . the input of the inverter 205 is the carry out signal on line 206 from the first adder 201 . thus , if the sign bit of m is one , the wrapped address is selected if the carry out of the first adder 201 is zero , and the absolute address is selected if the carry out of the first adder 201 is one . in the case in which the sign bit of m is zero , the output of the or gate 204 is provided as the control signal on line 212 . the inputs of the or gate 204 include the carry out signal on line 208 from the second adder 202 , and the carry out signal on line 206 from the first adder 201 . thus , if the sign bit of m is zero , the wrapped address is selected if at least one of the carry out signals on lines 206 and 208 is one . if the sign bit of m is zero , the absolute address is selected if both of the carry out signals on lines 206 and 208 are 0 . if the buffer is selected with an implied higher boundary , then the implied higher boundary is determined by concatenating 1s in the lower n bits of the current address a , where n is the bit position of the first leading “ 1 ” of the length parameter l . n may also be determined by the equation of 2 { circumflex over ( )}( n − 1 )& lt ;= l & lt ; 2 { circumflex over ( )} n . in other words , the higher boundary can be located at ( any multiple of 2 { circumflex over ( )} n )+( 2 { circumflex over ( )} n − 1 ). an address a including w bits , to this buffer can the used to locate higher and lower boundaries of the buffer . the higher boundary of this buffer is specified as the higher w − n bits of a at left concatenated with 1s in the lower n bits at right . once the higher boundary is determined , the lower boundary is determined by deducting l from higher boundary . thus , the lower boundary is specified by the higher w − n bits of a at left concatenated with the lower n bits of ( l \) at right . here l \ is 1 &# 39 ; s complement of l . for example , consider the case in which w = 16 , l is 0000 0000 0010 1011 ( 16 bits in binary ), and the current address to this buffer is 0011 1001 0101 1110 . then we will have n = 6 , and the implicit higher boundary is 0011 1001 0111 1111 , and the implicit lower boundary is 0011 1001 0101 0100 . as above for ease of description , we take the higher w − n bits out of a , the higher boundary and the lower boundary , and use i to represent the lower n bits of a , use f to represent higher boundary , and use ( l \) to represent lower boundary . m is an offset between current i and target i . m is a signed number , and could be positive or negative . in case m is a positive number , there are two cases : ( 1 ) i + m & gt ;= f + 1 and ( 2 ) i + m & lt ; f + 1 , for consideration in connection with the logic used by the circular address generator . in condition 1 with m positive , ( i + m & gt ;= f + 1 ). the absolute address ( i + m ) exceeds the higher boundary ( f , all 1s ), and the next address needs to be wrapped to the lower area of buffer . the target ( wrapped ) address i can be calculated by deducting absolute address with buffer length . the equation is i + m −( l + 1 ), for a 2 &# 39 ; s complement system i + m −( l + 1 ) is equal to i + m +( l \). in condition 2 with m positive , ( i + m & lt ; f + 1 ). the absolute address i + m does not exceed the higher boundary f . in this case , the target address i is equal to i + m . in a hardware implementation , condition 1 ( i + m & gt ;= f + 1 ) is indicated by a carry out generated from i + m . condition 2 ( i + m & lt ; f + 1 ) is indicated by no carry out generated from i + m . in case m is a negative number , there are three cases : ( 1 ) i + m & lt ; 0 , ( 2 ) i + m & lt ;( l \) and ( 3 ) i + m & gt ;=( l \), for consideration in connection with the logic used by the circular address generator . in condition 1 with m negative , i + m & lt ; 0 . the absolute address ( i + m ) is a negative number and lies below the lower boundary ( l \) of the circular buffer . thus , the target next address needs to be wrapped to the higher area of buffer . the target ( wrapped ) next address i is calculated by adding buffer length to the absolute address , so the equation is : i + m + l + 1 . in condition 2 with m negative , i + m & lt ;( l \). the absolute address also lies below the lower boundary ( l \) of the circular buffer . therefore the target ( wrapped ) next address i will be i + m + l + 1 . in condition 3 with m negative , i + m & gt ;=( l \). the absolute address ( i + m ) does not extend below the lower boundary ( l \). therefore , the target i is equal to i + m . for a hardware implementation , condition 1 with m negative ( i + m & lt ; 0 ) can be indicated by no carry out generated from i + m . condition 2 with m negative ( i + m & lt ;( l \)) can be indicated by no carry out generated from i + m + l + 1 . thus , a hardware implementation of an implied higher address boundary circular buffer is implemented logically as shown in fig4 . the logic in fig4 includes a first adder 301 and a second adder 302 . the inputs to the first adder 301 include the values i and m . the output of the first adder 301 , referred to herein as the absolute address , is provided on line 307 , and equals i + m . a carry out signal from the first adder 301 is supplied on line 306 . the inputs to the second adder 302 include the output of the exclusive nor gate 303 and the output on line 307 of the first adder 301 . the inputs to the exclusive nor gate 303 include the length value l and a sign bit of the address offset m . the second adder 302 receives the sign bit of m as a carry in on line 311 . the output of the second adder 302 , referred to herein as the wrapped address , is supplied on line 309 . a multiplexer 313 receives the absolute address on line 307 , and the wrapped address on line 309 as inputs , and supplies the target next address on line 310 . a control signal is supplied to the multiplexer 313 on line 312 to indicate which of the computed absolute address and wrapped address is provided as the output . the signal on line 312 is provided by the output of the multiplexer 314 , which acts in response to the sign bit of m on line 311 , to select logic for the case in which the sign bit of m is one ( m is negative ), and the case in which the sign bit of m is zero ( m is positive ). in the case in which the sign bit of m is one , the output of the nand gate 305 is provided as the control signal on line 312 . the inputs of the nand gate 305 include the carry out signal on line 306 from the first adder 301 and the carry out signal on line 308 from the second adder 302 . thus , if the sign bit of m is one , the wrapped address is selected if the carry out of at least one of the first adder 301 and the second adder 302 is zero , and the absolute address is selected if the both of the carry outs of the first adder 301 and a second adder 302 are one . in the case in which the sign bit of m is zero , the carry out on line 306 of the first adder 301 is provided as the control signal on line 312 . thus , if the sign bit of m is zero , the wrapped address is selected if the carry out signal on line 306 is one . if the sign bit of m is zero , the absolute address is selected if the carry out signal on line 306 is zero . fig5 shows a block diagram of one of possible embodiment , in which the two adders 401 , 402 are shared by the lower boundary scheme and the higher boundary scheme . for this apparatus there are four inputs and one output : 1 . buffer length l 409 , which is a programmed value ( actual buffer length is l + 1 ). 2 . current access address a 407 , boundaries of the circular buffers are implicit in a and l . 3 . an offset m 408 between current address 407 and target address 414 . m is a signed value . the absolute value of m is not greater than l . 4 . a programmable control signal on line 431 that is used to select whether the buffer based on an implied lower boundary or an implied higher boundary is to be used . 1 . target next address 414 , which will be used as current address 407 for subsequent address generation . adder 401 performs an addition of a 407 and m 408 , and generates the sum 412 — an absolute address , and generates the carry - outs 419 from each bit weight . xnor 403 is used to take an inversion of l 409 if sign bit 410 of m 408 is equal to 0 . if the sign bit 410 of m 408 is equal to 1 , then the output 411 of xnor 403 is equal to l 409 . adder 402 performs an addition of the absolute address 412 and the output 411 of xnor 403 , plus a carry - in equal to the sign bit 410 of m 408 at the least significant bit , and generates the sum 413 — a wrapped address and the carry - outs 420 from each bit weight . the target address 414 is selected from the absolute address 412 or the wrapped address 413 though multiplexer 414 by control signal 418 . priority selector 421 selects the nth - bit carry - out from the carry - outs 419 of adder 401 by detection of the leading “ 1 ” in l 409 as an output 415 . priority selector 422 selects the nth bit carry - out from the carry - outs 420 of adder 402 in response to l 409 as an output 416 . the wire 431 is used to select one of two inputs of multiplexer 423 , if wire 431 is equal to 0 , then the control signal 418 comes from wire 425 . this also means the buffer is defined as a lower boundary based . otherwise wire 424 is selected , and the buffer is based on higher boundary . if wire 431 is 0 , then this buffer is lower boundary based . while m is a positive number , the wire 428 is selected as the control signal 418 through multiplexer 426 , wire 425 and multiplexer 423 . if at least one of carry out 415 generated from adder 401 through priority selector 421 or carry out 416 generated from adder 402 through priority selector 422 is set , the sum 413 ( wrapped address ) of adder 402 will be selected as target address 414 through the multiplexer 404 . the or function is performed by the or gate 430 . the wire 428 is the output of or gate 430 and also is the input of multiplexer 426 . while m is a negative number , the wire 427 is selected as the control signal 418 through multiplexer 426 , wire 425 and multiplexer 423 . if the carry out 415 generated from adder 401 through priority selector 421 is clear , the sum 413 ( wrapped address ) of adder 402 will be selected as target address 414 . the inverter 429 is used to recognize the clear status of wire 415 , and the wire 427 is the output of inverter 429 . if wire 431 is set to 1 , then this buffer is higher boundary based . while m is a positive number , the wire 415 is selected as the control signal 418 through multiplexer 406 , wire 424 and multiplexer 423 . if the carry out 415 generated from adder 401 through priority selector 421 is set , the sum 413 ( wrapped address ) of adder 402 will be selected as target next address 414 with the multiplexer 404 , else the absolute address generated from adder 402 will be selected . while m is a negative number , the wire 417 is selected as the control signal 418 through multiplexer 406 , wire 424 and multiplexer 423 . if at least one of the carry out 415 generated from adder 401 through priority selector 421 or the carry out 416 generated from adder 402 through priority selector 422 is cleared , the sum 413 ( wrapped address ) of adder 402 will be selected as the target next address 414 with the multiplexer 404 , else the absolute address is selected . the or function is performed by the nand gate 405 . the wire 417 is the output of nand gate 405 and the input of multiplexer 406 . in some embodiments of the invention , the implied higher boundary scheme is used alone , as shown in fig6 . in fig6 adder 501 performs a 507 + m 508 and generates an absolute address 512 . if m 508 is a positive number ( the sign bit 510 of m is equal to 0 ), then xnor gate 503 takes inversion of l 519 . if m 508 is a negative number ( the sign bit 510 of m is equal to 1 ), then the output 511 of xnor 503 is equal to l 519 . adder 502 performs an addition with the absolute address 512 and the output 511 of xnor 503 , plus a carry - in equal to the sign bit 510 of m , in the least significant bit . output 513 of adder 502 is the wrapped address , which is selected if the absolute address exceeds the boundary of the buffer . the target output 514 is selected from absolute address 512 or wrapped address 513 though a multiplexer 504 by control signal 518 . in case m is positive , the signal 515 is selected as the control signal 518 by multiplexer 506 . priority selector 521 selects the nth - bit carry - out as output 515 from the carry - outs 519 of adder 501 by detection of the leading “ 1 ” of l 509 . the output 515 of priority selector 521 represents the nth - bit carry - out status of adder 501 . “ 1 ” at nth carry - out from adder 501 means the absolute address ( a + m ) exceeds the higher boundary of buffer , and the wrapped address 513 will be selected as the output 514 . otherwise the absolute address 512 is selected as output 514 . in case m is negative , the signal 517 is selected as the control signal 518 from multiplexer 506 . in this case , there are two 515 , 516 nth bit carry out signals used . lines 515 and 516 are supplied to nand gate 505 , which provides a signal 517 as output . a “ 0 ” value of signal 515 indicates no carry - out generated by a + m , which means the absolute address 512 has a negative value and is below the lower boundary of the buffer . thus the wrapped address 513 is taken as the target next address output 514 . priority selector 522 selects the nth bit carry - out as an output 516 from the carry - outs 520 of adder 502 by detection of the leading “ 1 ” of l 509 . a “ 0 ” value of signal 516 indicates no carry - out generated by adder 502 , which means a + m & lt ;( l \), and the absolute address is below the lower boundary of the buffer . in this case , the wrapped address 513 is selected as the target next address output 514 . if the two wrapped conditions are not met , then the absolute address 512 is selected as target next address output 514 . in summary , an address generator for generating addresses to access a circular buffer in a linear memory space is provided . this buffer has a programmed length ( l + 1 ), with the buffer base defined with an implied lower boundary or an implied higher boundary . if the implied lower boundary is used to define the circular buffer , then its lower boundary will be an address in which lower n bits are all 0s , where n is the bit position of first leading 1 of l . if the implied higher boundary is used to define the circular buffer , then its higher boundary will an address in which lower n bits are all 1s . an absolute address is calculated by adding an offset m to a current address a , where m is a signed number , and the absolute value of m is not greater than l . if the absolute address exceeds the boundary of the buffer , it will wrap to another side of the boundary by adding or deducting the buffer length ( l + 1 ). in this way the target next address is always located inside the buffer . such address generator is used for digital signal processing applications , as well as other applications in data processing . while the present invention is disclosed by reference to the preferred embodiments and examples detailed above , it is to be understood that these examples are intended in an illustrative rather than in a limiting sense . it is contemplated that modifications and combinations will readily occur to those skilled in the art , which modifications and combinations will be within the spirit of the invention and the scope of the following claims .