Abstract: A method and a system for securely transmitting a digital content in a digital right management (DRM) network, the method comprising partitioning the digital content into a plurality of fragments. The method further comprises associating each fragment with a license key. Each fragment is encrypted with the corresponding license key and are sent to an electronic device in response to receiving a request for the digital content.

Abstract: A method and a system for securely transmitting a digital content in a digital right management (DRM) network, the method comprising partitioning the digital content into a plurality of fragments. The method further comprises associating each fragment with a license key. Each fragment is encrypted with the corresponding license key and are sent to an electronic device in response to receiving a request for the digital content.

Abstract: According to one embodiment, a system (900) includes a content addressable memory (CAM) address system (910) that receives voice packet data, and in response thereto, generates a channel number value (CHANNEL#). The CHANNEL# value can be used to generate a base address value for a voice packet buffer memory system (912). A base address value will correspond to a particular voice channel. The use of the CAM address system (910) can enable processing of voice data packets “on-the-fly,” allowing for rapid processing of voice data transmitted over a network structure and/or result in more efficient use of a buffer memory that stores voice data.

Abstract: A CAM cell array (100) that can provide a longest prefix matching operation without necessarily requiring data values to be stored in a particular order. A comparand value can be applied to a CAM cell array (100) to generate ternary match indications. The mask/prefix data values of ternary match indications can be combined to generate a longest prefix value. The longest prefix value can be compared with the mask/prefix data values of the ternary match indications to indicate a data value having a longest prefix match with the comparand value.

Abstract: A ternary CAM (100) includes a CAM cell array (102) arranged into groups (108-1 to 108-5) for storing data values having a predetermined prefix length. The groups (108-1 to 108-5) are arranged in an order that allows for longest prefix match searches. A prefix length translator (104) can receive prefix length values and translate them into corresponding CAM cell array addresses (CAM_ADD). Thus, a prefix value and corresponding data value can be applied to the CAM (100) and the data value can be written into the group (108-1 to 108-5) corresponding to its prefix length. In this way, a table update operation can be performed without having to reorder entries in the ternary CAM (100).

Abstract: A ternary content addressable memory (CAM) (800) having a massive, parallel shift capability is disclosed. The CAM (800) includes an array of CAM cells (802(1,1) to 802(1,4)), each of which includes a data value register (804(1,1) to 804(1,4)) and a mask value register (806(1,1) to 806(1,4)). To enable parallel shifting between a CAM cell in one row with a corresponding CAM cell in a higher row, each data value register (804(1,1) 804(1,4)) and mask value register (806(1,1) to 806(1,4)) includes an upper data input (UD) coupled the output of a CAM cell in the higher row. To enable parallel shifting between a CAM cell in one row with a corresponding CAM cell in a lower row, each data value register (804(1,1) 804(1,4)) and mask value register (806(1,1) to 806(1,4)) includes a lower data input (LD) coupled the output of a CAM cell in the lower row.