Patent application number | Description | Published |
20090077448 | Forward error correction codec - A present invention discloses a method for performing forward error correction (FEC) in long-haul submarine transmission systems. Data is encoded at a transmitter by serially concatenated, binary Bose-Ray-Chaudhuri-Hochquenghem (BCH) error correcting codes. The invention encodes a stream of data employing a plurality of serially concatenated, binary Bose-Ray-Chaudhuri-Hochquenghem (BCH) error correcting codes, arranging said data into a frame of parallel data blocks (the outer frame) with redundancy bits appended by a BCH( | 03-19-2009 |
20090080564 | Context-sensitive overhead processor - The present invention discloses an overhead processor for data transmission in digital communications. First, incoming data is transmitted along a datapath. If the incoming data forms one group of data, said group of data is transmitted along the datapath, into an elastic store and then is transmitted into one or more flip-flop(s); if there are two or more groups of incoming data, arriving separately, the initial group(s) of received data can optionally be held in an elastic store until the arrival of additional group(s) of data, and upon the arrival of said additional group(s) of data, all of the received data are combined and then transmitted into said flip-flop(s). The data is then transmitted from said flip-flop(s) to a logic element, which uses the received data context to determine the new data context of any imminent incoming data. The logic element transmits this new data context to a second flip-flop, which transmits the new data context values into an elastic store. Said elastic store transmits the new data context back through the first flip-flop(s) and into the logic element, prior to any additional incoming bytes arriving along the datapath. Therefore, the present invention is able to reduce the number of overhead processors required for multi-byte data transmission, potentially reducing the number of required overhead processors in digital communications to 1. | 03-26-2009 |
20090319729 | Method of accessing stored information in multi-framed data transmissions. - The present invention discloses a method of accessing stored information in multi-framed data transmissions, comprising at least one control interface and at least one elastic store, wherein the control interface accesses the elastic store through a mailbox communications method. The control interface accesses the elastic store via the mailbox communications method, which comprises: (a) setting a address for a data location within said elastic store; (b) setting a request to read from, or write to, said data location within said elastic store; (c) issuing a “GO_” signal to retrieve data information from said data location within said elastic store, by writing said “GO_” signal to said microprocessor, which causes a circuit to read from said requested data location within said elastic store; (d) waiting for a possible, but not to be expected, de-assertion of a busy signal to be issued from said data location within said elastic store, and then; and then (e) reading back the value of said data information to said control interface. Where a busy signal occurs, the microprocessor must wait and issue a subsequent “GO_” signal to retrieve the data information from the data location; where a busy signal does not occur the “GO_” signal causes the circuit to read from the requested data location and send the data information back to the microprocessor, where the data information is stored in a user-accessible register. | 12-24-2009 |
20100014857 | Method of mapping OPUke into OTN frames - The present invention discloses a method of mapping Optical Payload Unit (OPU) k (k=1, 2, 3 or any positive integer) Ethernet signals (E) into Optical Transport Network (OTN) frames for 10 Gigabit Ethernet (10 GbE) Local Area Network Physical Layer (LAN PHY), wherein OPUk Overhead (OH) is altered by the relocation of Justification Control (JC) bytes, from the standardized ITU-T G.709 locations, into the novel locations of rows | 01-21-2010 |
20100215060 | Method of Multiple Lane Distribution (MLD) Deskew - The present invention discloses a method of detecting and correcting skew across a plurality of transmitting lanes. Through the use of an N framer system, including a frame start signal and a frame synchronization signal, skew can be detected and corrected by writing data from a plurality of framers into offsetting bit locations of a plurality of buffers. The present invention also provides a method of transmitting data in a multiple lane distribution (MLD) transmission system. | 08-26-2010 |
20100217960 | Method of Performing Serial Functions in Parallel - A method for performing serial functions in parallel, where a datapath is divided into several independent stages, or pipeline stages, so that logical functions can be implemented in each pipeline stage concurrently. In an illustrative embodiment of the invention, a pipelined logic tree is described. This method allows for n-bits to be input to the system and n-bits to output from the system concurrently. | 08-26-2010 |
20110019666 | Strict-Sense Minimal Spanning Switch Non-Blocking Architecture - The present invention discloses an apparatus to implement a m=n Non-Blocking Minimal Spanning Switch, where n=the total number of data input signals and m=the total number of data output signals and m=the number of crossbar connections in each switch. Data is input to the switch as a plurality of frames, whereby each crossbar connection contains a framer which detects framing patterns in the data. Skewed data is re-aligned and buffered so that the data output by each crossbar connection is equal and identical, thus any crossbar connection may be used to ensure a connection, eliminating the possibility of data interrupts. | 01-27-2011 |
20110182581 | CONTEXT-SENSITIVE OVERHEAD PROCESSOR - An overhead processor for data transmission in digital communications, where a state machine, including a logic element and a flip-flop, is able to process a “previous” data state and a “next” data state simultaneously by storing the previous state in an external elastic storage element until the next state arrives along the datapath. | 07-28-2011 |
20120147905 | METHOD OF MULTIPLE LANE DISTRIBUTION (MLD) DESKEW - The present invention discloses a method of detecting and correcting skew across a plurality of transmitting lanes. Through the use of an N framer system, including a frame start signal and a frame synchronization signal, skew can be detected and corrected by writing data from a plurality of framers into offsetting bit locations of a plurality of buffers. The present invention also provides a method of transmitting data in a multiple lane distribution (MLD) transmission system. | 06-14-2012 |
20120275462 | METHOD OF ACCESSING STORED INFORMATION IN MULTI-FRAMED DATA TRANSMISSIONS - The present invention discloses a method of accessing stored information in multi-framed data transmissions, comprising at least one control interface and at least one elastic store, wherein the control interface accesses the elastic store through a mailbox communications method. The control interface accesses the elastic store via the mailbox communications method, which comprises: (a) setting a address for a data location within said elastic store; (b) setting a request to read from, or write to, said data location within said elastic store; (c) issuing a “GO ______” signal to retrieve data information from said data location within said elastic store, by writing said “GO ______” signal to said microprocessor, which causes a circuit to read from said requested data location within said elastic store; (d) waiting for a possible, but not to be expected, de-assertion of a busy signal to be issued from said data location within said elastic store, and then; and then (e) reading back the value of said data information to said control interface. Where a busy signal occurs, the microprocessor must wait and issue a subsequent “GO ______” signal to retrieve the data information from the data location; where a busy signal does not occur the “GO ______” signal causes the circuit to read from the requested data location and send the data information hack to the microprocessor, where the data information is stored in a user-accessible register. | 11-01-2012 |
20120287927 | STRICT-SENSE MINIMAL SPANNING SWITCH NON-BLOCKING ARCHITECTURE - The present invention discloses an apparatus to implement a m=n Non-Blocking Minimal Spanning Switch, where n=the total number of data input signals and m=the total number of data output signals and m=the number of crossbar connections in each switch. Data is input to the switch as a plurality of frames, whereby each crossbar connection contains a framer which detects framing patterns in the data. Skewed data is re-aligned and buffered so that the data output by each crossbar connection is equal and identical, thus any crossbar connection may be used to ensure a connection, eliminating the possibility of data interrupts. | 11-15-2012 |
20130132794 | 2D PRODUCT CODE AND METHOD FOR DETECTING FALSE DECODING ERRORS - The present invention discloses a method and apparatus for performing forward error correction with a multi-dimensional Bose Ray-Chaudhuri Hocquenghem (BCH) product code, and a method for detecting false decoding errors in frame-based data transmission systems. | 05-23-2013 |
20130191702 | FORWARD ERROR CORRECTION WITH CONFIGURABLE LATENCY - A method of performing forward error correction with configurable latency, where a configurable latency algorithm evaluates a target Bit Error Rate (BER) against an actual BER and adjusts the size of a configurable buffer such that the target BER may be achieved when utilizing the smallest buffer size possible. When errors are corrected without the utilization of each of the configurable buffer locations, the algorithm reduces the size of the buffer by y buffer locations; the algorithm may continue to successively reduce the size of said buffer until the minimum number of buffer locations are utilized to achieve the target BER. If the buffer locations have been reduced such that the buffer size is too small and the target BER cannot be achieved, the algorithm may increase the size of the buffer until the minimum number of buffer locations are utilized to achieve the target BER. | 07-25-2013 |
20130272300 | STRICT-SENSE MINIMAL SPANNING SWITCH NON-BLOCKING ARCHITECTURE - The present invention discloses an apparatus to implement a m=n Non-Blocking Minimal Spanning Switch, where n=the total number of data input signals and m=the total number of data output signals and m=the number of crossbar connections in each switch. Data is input to the switch as a plurality of frames, whereby each crossbar connection contains a framer which detects framing patterns in the data. Skewed data is re-aligned and buffered so that the data output by each crossbar connection is equal and identical, thus any crossbar connection may be used to ensure a connection, eliminating the possibility of data interrupts. | 10-17-2013 |
20140189446 | FORWARD ERROR CORRECTION WITH CONFIGURABLE LATENCY - A method of performing forward error correction with configurable latency, where a configurable latency algorithm evaluates a target Bit Error Rate (BER) against an actual BER and adjusts the size of a configurable buffer such that the target BER may be achieved when utilizing the smallest buffer size possible. When errors are corrected without the utilization of each of the configurable buffer locations, the algorithm reduces the size of the buffer by y buffer locations; the algorithm may continue to successively reduce the size of said buffer until the minimum number of buffer locations are utilized to achieve the target BER. If the buffer locations have been reduced such that the buffer size is too small and the target BER cannot be achieved, the algorithm may increase the size of the buffer until the minimum number of buffer locations are utilized to achieve the target BER. | 07-03-2014 |