Northrop Grumman Systems Corporation

Trw Limited

Lisa A Moy-Yee

Gefferie H Yee-Madera

Stuart T Linsky

Vincent Nguyen

Darren R Gregoire

Scott A Cooper

Reginald Jue

Jaime L Prieto, Jr

Scott M Takahashi

Esmaell Yousefi

Mark E Bever

Roland Y Wong

Fred C Tramm

Kevin M Yasui

Andrew T Nguyen

A downlink frame processing system () includes a packet switch () routing self addressed uplink data () from an input port to an output port, a memory () coupled to the output port, and a downlink scheduler () coupled to the memory (). The memory () includes storage for at least two downlink beam hop locations (). The downlink scheduler () processes from one of a plurality of segments at least one scheduling entry () that includes, for example, a header field () defining at least one of a payload and frame type () for at least one of a payload and frame () to be transmitted, and payload data pointers () into the memory ().

Beam hopping self addressed packet switched communication system with locally intelligent scheduling

A power gating module () for a downlink beam frame signal () includes a power amplifier () for amplifying for transmission frame signals that include at least a first header signal (), a first payload signal (), a second header signal (), and a second payload signal (). The power gating module () further includes a power gating circuit () coupled to the power amplifier (). The power gating circuit () includes a power gate input () and is responsive to a power gating signal to remove power from at least one of the first header signal () and first payload signal () in combination, and the second header signal () and second payload signal () in combination before amplification by the power amplifier ().

Gated power for a satellite hopped downlink with multiple payloads per frame

A method and apparatus for implementing multicast in a space-based communication system is disclosed. The present invention allows for the use of a buffer in which to store data packets prior to replication in a multicast application. The present apparatus includes a buffer ( ), a header memory ( ), and an ASIC ( ) to store and extract received data packets and replicate them as required. The ASIC ( ) includes a switch interface ( ), a queue manager ( ), a header processor ( ), a holding buffer ( ), and a arbitration interface ( ). The switch interface ( ) is connected to the queue manager ( ). The queue manager ( ) is connected to the buffer ( ), the header processor , the holding buffer ( ), and the arbitration and switch interface ( ). The header processor ( ) is connected to the header memory ( ). The header processor ( ) and the holding buffer ( ) are connected to an arbitration and switch interface ( ), whose output, in turn, is fed back through the switch matrix routing fabric ( ) for routing and eventual downlink transmission. The method includes the steps of receiving data packets from the switch matrix routing fabric ( ); storing the information payload and the header in the buffer( ); and extracting the information payload and header from the buffer ( ). The method further includes the steps of buffering the information payload to the holding buffer ( ); provisioning the header to the header processor ( ); addressing the header memory ( ); merging the new header obtained from the header memory with the information payload ( ); and performing subsequent processing on the assembled cell ( ). The latter two steps are repeated until all replicated cells are assembled and sent on for routing and eventual downlink transmission.

Method and apparatus for serial cell replication for multicast in a cell switch

The method allocates ( ) subclass entries in an ordered list ( ) (which may be organized as a table, for example). Each entry ( ) generally corresponds to one of several predetermined cell subclasses, and the allocation reserves a total number of each subclass entry in the ordered list according to a predetermined amount of bandwidth desired for each cell subclass. The subclasses may be associated with factors such as coding rate, downlink beam area, virtual paths or virtual circuits, quality of service parameters, and the like. The method then examines ( ) each subclass entry in the ordered list and selects ( ) a cell from a cell memory (which may be a queue) that matches the subclass entry. The matched cell is then transmitted ( ). The method may also allocate sets of subclass entries in groups corresponding to a frame size and dynamically update ( ) the ordered list during operation of the cell switch.

Table based scheduling algorithm for downlink bandwidth allocation

Growing community of inventors

Torrance, CA, United States of America

Lisa A Moy-Yee