Abstract: A method for long-term reference prediction video compression, includes: dividing a viewing area into a plurality of viewing sections; measuring an elevation and an azimuth of a field of view (fov) in one or more of the viewing sections; determining a storage location of a video frame associated with the field of view based on the measured elevation and azimuth. A long-term reference prediction video compression encoder, includes: a buffer for storing long-term video frames; a detector to measure an elevation and an azimuth of a field of view associated with a video frame; a buffer manager to determine, based on the measured elevation and azimuth, to store data associated with the video frame in the long-term frame buffer.

Abstract: A method for long-term reference prediction video compression, includes: dividing a viewing area into a plurality of viewing sections; measuring an elevation and an azimuth of a field of view (fov) in one or more of the viewing sections; determining a storage location of a video frame associated with the field of view based on the measured elevation and azimuth. A long-term reference prediction video compression encoder, includes: a buffer for storing long-term video frames; a detector to measure an elevation and an azimuth of a field of view associated with a video frame; a buffer manager to determine, based on the measured elevation and azimuth, to store data associated with the video frame in the long-term frame buffer.

Abstract: A translation table apparatus used to perform both forward and backward bitmap vector translations. The translation table is used with bit vectors where it is desired to displace one or more bits to different bit positions in accordance with a configurable bitmap translation table. The translation of one bit vector to another is performed in real time and any number of bits can be moved simultaneously. In addition, both the bit vectors and the contents of the translation table can be changed on the fly. Translations are performed on multiple bits simultaneously wherein several bits can be displaced at the same time in accordance with the translation table. The same hardware used to implement the translation table is used for backward translations as well.

Abstract: A configurable weighted round robin arbitration mechanism adapted to receive as input a vector of order N, wherein each bit in the vector represents the eligibility of a queue or other source of data to participate in the arbitration process. A bit set to `1` in the vector indicates that the corresponding queue is eligible to participate in the arbitration process. Conversely, a bit set to `0` in the vector indicates that the corresponding queue is not eligible to participate. The arbitration process of the present invention enables a user to assign each queue (which corresponds to one of the bits in the vector) an individual weight. This results in a modified vector that represents the incoming vector after being handled by the weighting process. By giving each bit in the vector a weight, the user can control the probability of each bit, i.e., queue, being selected in the arbitration process.