Abstract: A portable power system for powering an appliance connected thereto. The portable power system includes an inverter unit and a rechargeable primary energy storage unit having a first energy storage capacity. The inverter unit includes an inverter, a power outlet, and portions defining a receptacle space configured to releasably receive the primary energy storage unit therein. The inverter unit and the primary energy storage unit are configured to be electrically connected together when the primary rechargeable energy storage unit is received within the receptacle space and to provide electric power to the power outlet. The inverter unit also including a short term energy storage device that is configured to provide electric power to the power outlet and a connected appliance when the primary energy storage unit is released and removed from the inverter unit.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: There is provided a cooking apparatus for cooking multiple food items, including: a housing including multiple separate cooking bays; a control module communicatively linked to each of the cooking bays to receive or determine a cooking time and cooking temperature for the food item received by the respective cooking bay; and a coordination module configured to: determine a total cooking time for each of a plurality of the cooking bays; determine the cooking bay with the longest associated cooking time; determine an offset of the start of the cooking process for each of the other cooking bays such that the cooking times of all the cooking bays end approximately simultaneously; and at each determined offset, direct the respective cooking bay to start the cooking process at the cooking temperature.

Abstract: A tonneau system for use with a bed of a pickup truck. The tonneau system includes a tonneau cover and latch assemblies to retain the tonneau cover to the bed of the truck. The cover is moveable between an unfolded positon where the cover encloses the bed and a folded position where the bed is uncovered. The latch assemblies can include latch bases that define discreet mounting positons for a latch handle assembly that employ retention members to retain the latch handle assembly in a particular mounting positon. Another latch assembly includes a latch base having an endless belt to positon the latch handle assembly. A rail attachment is also provided to mount to the bed and provide an anchor point for keep in to tonneau cover engage over the bed.

Abstract: A memory device may include memory components to store data. The memory device may also include a processor that may decode a codeword associated with the data. The processor may receive the codeword and determine whether the codeword is independently decodable using a BCH decoder. The processor may then decode the codeword using the BCH decoder when the codeword is determined to be independently decodable using the BCH decoder. Otherwise, the processor may decode the codeword using a second decoder and the BCH decoder when the codeword is not determined to be independently decodable using the BCH decoder.

Abstract: A memory device may include memory components to store data. The memory device may also include a processor that may decode a codeword associated with the data. The processor may receive the codeword and determine whether the codeword is independently decodable using a BCH decoder. The processor may then decode the codeword using the BCH decoder when the codeword is determined to be independently decodable using the BCH decoder. Otherwise, the processor may decode the codeword using a second decoder and the BCH decoder when the codeword is not determined to be independently decodable using the BCH decoder.

Abstract: A memory device may include memory components to store data. The memory device may also include a processor that may decode a codeword associated with the data. The processor may receive the codeword and determine whether the codeword is independently decodable using a BCH decoder. The processor may then decode the codeword using the BCH decoder when the codeword is determined to be independently decodable using the BCH decoder. Otherwise, the processor may decode the codeword using a second decoder and the BCH decoder when the codeword is not determined to be independently decodable using the BCH decoder.

Abstract: A memory device may include memory components to store data. The memory device may also include a processor that may decode a codeword associated with the data. The processor may receive the codeword and determine whether the codeword is independently decodable using a BCH decoder. The processor may then decode the codeword using the BCH decoder when the codeword is determined to be independently decodable using the BCH decoder. Otherwise, the processor may decode the codeword using a second decoder and the BCH decoder when the codeword is not determined to be independently decodable using the BCH decoder.

Abstract: Internet Protocol address prefixes are hashed into hash tables allocated memory blocks on demand after collisions occur for both a first hash and a single rehash. The number of memory blocks allocated to each hash table is limited, with additional prefixes handled by an overflow content addressable memory. Each hash table contains only prefixes of a particular length, with different hash tables containing prefixes of different lengths. Only a subset of possible prefix lengths are accommodated by the hash tables, with a remainder of prefixes handled by the content addressable memory or a similar alternate address lookup facility.

Abstract: A series of hardware pipeline units each processing a stride during prefix search operations on a multi-bit trie includes, within at least one pipeline unit other than the last pipeline unit, a mechanism for retiring search results from the respective pipeline unit rather than passing the search results through the remaining pipeline units. Early retirement may be triggered by either the absence of subsequent strides to be processed or completion (a miss or end node match) of the search, together with an absence of active search operations in subsequent pipeline units. The early retirement mechanism may be included in those pipeline units corresponding to a last stride for a maximum prefix length shorter than the pipeline (e.g., 20 or 32 bits rather than 64 bits), in pipeline units selected on some other basis, or in every pipeline unit. Worst-case and/or average latency for prefix search operations is reduced.

Abstract: A multi-bit trie network search engine is implemented by a number of pipeline logic units corresponding to the number of longest-prefix strides and a set of memory blocks for holding prefix tables. Each pipeline logic unit is limited to one memory access, and the termination point within the pipeline logic unit chain is variable to handle different length prefixes. The memory blocks are coupled to the pipeline logic units with a meshed crossbar and form a set of virtual memory banks, where memory blocks within any given physical memory bank may be allocated to a virtual memory bank for any particular pipeline logic unit. An embedded programmable processor manages route insertion and deletion in the prefix tables, together with configuration of the virtual memory banks.

Abstract: For use in a pipeline network search engine of a router, a path compression optimization system and method is disclosed for eliminating single entry trie tables. The system embeds in a parent trie table (1) path compression patterns that comprise common prefix bits of a data packet and (2) skip counts that indicate the length of the path compression patterns. The network search engine utilizes the path compression patterns and the skip counts to eliminate single entry trie tables from a data structure. Each path compression pattern is processed one stride at a time in subsequent pipeline stages of the network search engine. The elimination of unnecessary single entry trie tables reduces memory space, power consumption, and the number of memory accesses that are necessary to traverse the data structure.

Abstract: Prefixes terminating with end node entries each containing identical length prefix portions in a single child table are compressed by replacing the end node entries with one or more compressed single length (CSL) prefix entries in the child table that contain a bitmap for the prefix portions for the end node entries. A different type parent table trie node entry is created for the child table. Where the prefix portions are of non-zero length, the parent table contains a bitmap indexing the end node entries. Where the prefix portions are of length zero, the parent table may optionally contain a bitmap for the prefix portions, serving as an end node. The number of prefix portions consolidated within the CSL node entry is based upon the prefix portion length.

Abstract: Sparsely distributed prefixes within a bitmapped multi-bit trie are compressed by one or more of: replacing a single entry table string terminating with a single prefix end node with a parent table entry explicitly encoding a prefix portion; replacing a table with only two end nodes or only an end node and an internal node with a single parent table entry explicitly encoding prefix portions; replacing two end nodes with a single compressed child entry at a table location normally occupied by an internal node and explicitly encoding prefix portions; and replacing a plurality of end nodes with a prefix-only entry located at the table end explicitly encoding portions of a plurality of prefixes. The compressed child entry and the prefix-only entry, if present, are read by default each time the table is searched. Run length encoding allows variable length prefix portions to be encoded.

Abstract: A method and an apparatus for aligning the elevation of an automotive radar unit.

Abstract: For use in a pipeline network search engine of a router, a path compression optimization system and method is disclosed for eliminating single entry trie tables. The system embeds in a parent trie table (1) path compression patterns that comprise common prefix bits of a data packet and (2) skip counts that indicate the length of the path compression patterns. The network search engine utilizes the path compression patterns and the skip counts to eliminate single entry trie tables from a data structure. Each path compression pattern is processed one stride at a time in subsequent pipeline stages of the network search engine. The elimination of unnecessary single entry trie tables reduces memory space, power consumption, and the number of memory accesses that are necessary to traverse the data structure.