Search

Hsilin T Huang

age ~56

from Cupertino, CA

Also known as:
  • Hsilin Te Huang
  • Hsi Lin Huang
  • Hsi Tung Huang
  • Hsi L Huang
  • Hsi T Huang
  • Hsi-Lin Huang
  • Hsil Huang
  • N Huang
  • Lin Huang
  • Li Huang
Phone and address:
10075 Carmen Rd, Cupertino, CA 95014
408-725-8810

Hsilin Huang Phones & Addresses

  • 10075 Carmen Rd, Cupertino, CA 95014 • 408-725-8810
  • 3581 Sepulveda Ave, Merced, CA 95348
  • Fresno, CA
  • Oakland, CA
  • Milpitas, CA
  • Saratoga, CA
  • Santa Clara, CA
  • 10075 Carmen Rd, Cupertino, CA 95014 • 619-203-3305

Education

  • Degree:
    Graduate or professional degree

Us Patents

  • Method And System For Optimized Fifo Full Conduction Control

    view source
  • US Patent:
    7072998, Jul 4, 2006
  • Filed:
    May 13, 2003
  • Appl. No.:
    10/436822
  • Inventors:
    Hsilin Huang - Milpitas CA, US
  • Assignee:
    Via Technologies, Inc. - Taipei
  • International Classification:
    G06F 3/00
  • US Classification:
    710 57, 710 52, 710 53, 710 55, 710 56
  • Abstract:
    Method and system for generating an optimized full signal in a FIFO device. In one embodiment of the present invention, the optimized full signal control circuit checks the storage capacity of the FIFO memory by aggregating the number of occupied word entries and the number of occupied pipelines.
  • Vertex Reordering In 3D Graphics

    view source
  • US Patent:
    7088359, Aug 8, 2006
  • Filed:
    Apr 23, 2003
  • Appl. No.:
    10/422406
  • Inventors:
    Hsilin Huang - Milpitas CA, US
    Jeff Jiao - San Jose CA, US
    Chiente Ho - Santa Clara CA, US
  • Assignee:
    VIA Technologies, Inc.
  • International Classification:
    G06T 17/00
  • US Classification:
    345419, 345619
  • Abstract:
    A method and apparatus for reordering the vertices of a graphics primitive. The vertices of the primitive are received in a circular order, but the position of the vertices in the circular order is arbitrary. The vertices include coordinates with respect to an origin. Comparison logic operates on the coordinates of each vertex to determine which vertex is the minimum vertex, which the vertex that is a minimum distance away from the origin. Once the minimum vertex is known, the vertices are shuffled into the proper order, with the minimum vertex in the lowest order position, the next vertex in circular order in the next position and so on. An apparatus saves the information for reordering the vertices, so that the order is preserved for parameter information for each vertex.
  • Head/Data Request In 3D Graphics

    view source
  • US Patent:
    7148888, Dec 12, 2006
  • Filed:
    Apr 4, 2003
  • Appl. No.:
    10/407448
  • Inventors:
    Hsilin Huang - Milpitas CA, US
  • Assignee:
    VIA Technologies, Inc.
  • International Classification:
    G06T 15/00
  • US Classification:
    345419, 345506, 345537, 345538, 345556, 345586
  • Abstract:
    A method for efficiently processing graphics data for graphics primitives, the graphics data including vertex coordinate information and vertex attribute data. Coordinate information, in the form of homogeneous coordinates, of the graphics primitive determines whether the graphics primitive is to be rendered. If the primitive is to be rendered, then attribute data associated with the location information is retrieved. However, if the data is not to be rendered, then the location information is discarded. By only retrieving parameters for a primitive that is rendered, performance is increased. In one embodiment, the attribute data is fetched before it is known whether or not the graphics primitive is to be rendered, and if not, the prefetch is aborted, and new location information is fetched.
  • Two-Level Rejection In 3D Graphics

    view source
  • US Patent:
    7154499, Dec 26, 2006
  • Filed:
    May 13, 2003
  • Appl. No.:
    10/436713
  • Inventors:
    Hsilin Huang - Milpitas CA, US
  • Assignee:
    VIA Technologies, Inc.
  • International Classification:
    G06T 15/30
  • US Classification:
    345421, 345621
  • Abstract:
    A method and apparatus for efficiently rejecting a graphics primitive that is not visible in a defined area having a maximum x and y-coordinate. A data calculation block is configured to perform the rejection calculation on two levels. In the first level, the data calculation block determines if the graphics primitive is outside of the defined area or outside of the view frustum. This determination can take as little as one clock cycle. In the second level, the data calculation block determines whether the primitive is visible based on a vector normal to the primitive and the direction of culling. This determination may take as many as five clock cycles. When many of the rejections can be performed at the first level, there is a large performance increase. Furthermore, the sooner a rejection is determined, the sooner a new primitive can be processed by the data calculation block.
  • Bounding Box In 3D Graphics

    view source
  • US Patent:
    7218331, May 15, 2007
  • Filed:
    May 13, 2003
  • Appl. No.:
    10/436712
  • Inventors:
    Hsilin Huang - Milpitas CA, US
    Peng Yu - San Jose CA, US
    Peifeng Wu - Sunnyvale CA, US
  • Assignee:
    VIA Technologies, Inc. - Hsin-Tien Taipei
  • International Classification:
    G09G 5/00
    G06T 15/30
  • US Classification:
    345622
  • Abstract:
    A system and method for processing a graphics primitive for display in a display area defined by a scissoring window. The graphics primitive is part of an object in view space which also includes a near and a far plane and possibly one or more user-defined clipping planes. These planes may affect the portion of the graphics primitive to be rendered in the display area. The graphics primitive is enclosed by a bounding box, which is then reduced, if possible, based on the Znear clipping plane intersecting the graphics primitive. The reduced bounding box is then subjected to the scissoring window if a portion of the bounding box lies outside the window. The final bounding box determines how much of the graphics primitive should be rendered in the display area. This reduces the amount of rendering that is required of the graphics system, and increases the performance of the system.
  • Head/Data Scheduling In 3D Graphics

    view source
  • US Patent:
    7259765, Aug 21, 2007
  • Filed:
    Apr 4, 2003
  • Appl. No.:
    10/407446
  • Inventors:
    Hsilin Huang - Milpitas CA, US
  • Assignee:
    S3 Graphics Co., Ltd. - Cayman Islands, Grand Cayman
  • International Classification:
    G09G 5/36
    G06F 13/00
  • US Classification:
    345556, 345558, 345536, 345422, 711128, 711133
  • Abstract:
    A system for processing graphics data for a stream of graphics primitives, such as triangles. The system has a plurality of memories each for storing an index of the primitive. A controller selects a memory to store the index and assigns a thread id to the index, the thread id indicating in which memory the index is stored. The thread id is stored in both a HEAD ID FIFO and a DATA ID FIFO, to maintain the order of the primitives during processing. A first multiplexer accesses a selected memory based on a thread id provided by the HEAD ID FIFO and a second multiplexer accesses a selected memory based on a thread id provided by the DATA ID FIFO. For each of the vertices of the graphics primitive, the first multiplexer provides a pointer for accessing coordinate information and the second multiplexer provides a pointer for accessing attribute information.
  • Head/Data Request In 3D Graphics

    view source
  • US Patent:
    7310096, Dec 18, 2007
  • Filed:
    Jul 12, 2006
  • Appl. No.:
    11/457102
  • Inventors:
    Hsilin Huang - Milpitas CA, US
  • Assignee:
    Via Technologies, Inc. - Hsin-Tien, Taipei
  • International Classification:
    G06T 15/00
  • US Classification:
    345419, 345506, 345537, 345538, 345556, 345586
  • Abstract:
    A method for efficiently processing graphics data for graphics primitives, the graphics data including vertex coordinate information and vertex attribute data. Coordinate information, in the form of homogeneous coordinates, of the graphics primitive determines whether the graphics primitive is to be rendered. If the primitive is to be rendered, then attribute data associated with the location information is retrieved. However, if the data is not to be rendered, then the location information is discarded. By only retrieving parameters for a primitive that is rendered, performance is increased. In one embodiment, the attribute data is fetched before it is known whether or not the graphics primitive is to be rendered, and if not, the prefetch is aborted, and new location information is fetched.
  • Dynamic Instruction Dependency Monitor And Control System

    view source
  • US Patent:
    7430654, Sep 30, 2008
  • Filed:
    Jul 9, 2003
  • Appl. No.:
    10/616647
  • Inventors:
    Hsilin Huang - Milpitas CA, US
    Kuoyin Weng - Milpitas CA, US
    Yijung Su - Alviso CA, US
  • Assignee:
    VIA Technologies, Inc. - Hsinchu, Taipei
  • International Classification:
    G06F 9/30
  • US Classification:
    712217
  • Abstract:
    Method and system for controlling the dynamic latency of an arithmetic logic unit (ALU). In one embodiment, the identification of the destination operand of an instruction is stored in a temporary register ID/thread control ID pair pipeline if the destination operand is a temporary register. Furthermore, each source operand of an instruction is checked against the identifications stored in a group of temporary register ID/thread control ID pipelines. If a source operand is matched to an identification stored in the temporary register ID/thread control ID pipelines, the ALU does not execute the instruction until the matched identification is no longer matched in the pipelines.

Facebook

Hsilin Huang Photo 1

Hsilin Huang

view source
Friends:
Charles Huang, Jennifer Kuo, TingWei Yuan, Jonathan Chang

Get Report for Hsilin T Huang from Cupertino, CA, age ~56
Control profile