Patents by Inventor Brandon Carl Smith

Brandon Carl Smith has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method and apparatus for performing a binary search on an expanded tree
    Patent number: 6826561
    Abstract: A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match.
    Type: Grant
    Filed: May 22, 2001
    Date of Patent: November 30, 2004
    Assignee: Broadcom Corporation
    Inventors: Jun Cao, Brandon Carl Smith, Eric Ng
  • Method and apparatus for performing a binary search on an expanded tree
    Publication number: 20010056417
    Abstract: A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match.
    Type: Application
    Filed: May 22, 2001
    Publication date: December 27, 2001
    Applicant: Broadcom Corporation
    Inventors: Jun Cao, Brandon Carl Smith, Eric Ng