[0001] This relates generally to a transceiver and, more particularly, to a physical transceiver (PHY) having a flexible architecture.

BACKGROUND

[0002] FIG. 1 shows an example of a conventional system 100. In this system 100, hosts

102-1 to 102-N (which can be; for example, a computer, router, or switch) are able to communicate with one another over communications medium 112 (which can; for example, be an optical fiber, backplane, or twisted pair) through network interfaces 104-1 to 104-N. In this example, the network interfaces 104-1 to 104-N employ Ethernet over Electrical Backplanes and, more specifically, lOGBase-KR. A description of lOGBase-KR can be found in the Institute of Electrical and Electronics Engineers (IEEE) standard 802.3-2008 (which is dated December 26, 2008 and which is incorporated by reference herein for all purposes). These network interfaces 104-1 to 104-N employ media access control (MAC) circuits 106-1 to 106-N that communicate with PHYs 110-1 to 110-N, via media independent interfaces (Mils) 108-1 to 108-N (which can typically have half-duplex or full-duplex operation),each of which is described in IEEE standard 802.3-2008.

[0003] Of interest here, however, are PHYs 110-1 to 110-N, and, as can be seen in greater detail in FIG. 2, PHYs 110-1 to 110-N (hereinafter PHY 110), PHY 110 employs several sublayers. This PHY 110 can be an independent integrated circuit (IC) or can be integrated with a MAC circuit (i.e., MAC circuit 106-1) and an Mil 108. As shown, the PHY 110 is generally comprised of physical medium dependent (PMD) sublayer logic 212; physical medium attachment (PMA) sublayer logic 210, forward error correction (FEC) sublayer logic 204, and physical coding (PCS) sublayer logic 202. These sublayer logic circuits 202, 204, 210, and 212 interact with one another to provide communications between Mil 108 and communications medium 112. For transmission, the FEC sublayer logic 204 employs an encoder 206 as described in IEEE standard 802.3-2008, clause 74, and, for reception, the FEC sublayer logic 204 employs a decoder 308 as described in IEEE standard 802.3-2008, clause 74.

[0004] As can be seen in FIG. 3, the PCS sublayer logic 202 can be a transceiver, having a PCS transmitter 302 and a PCS receiver 304. The transmitter 302, in this example, is able to receive data from Mil 108, encode the data with encoder 306, scramble the encoded data with scrambler 308, and convert (so as to be used by FEC sublayer logic 204) with gearbox 310. The receiver 304, in this example, is able to convert data from FEC sublayer logic 204 using gearbox 312, descramble the data with descrambler 314, and decode the data (for use with Mil 108) with decoder 316. The details of PCS sublayer logic 202 can, for example, be seen in IEEE standard 802.3-2008, clauses 48 and 74.

[0005] Of interest here are the scrambler 308 and descrambler 314. In this example, the scrambler 308 and descrambler 314 are able to perform data scrambling/descrambling and error checking. One purpose in scrambling/descrambling data with the PHYs 110-1 to 110-N is to substantially randomize the data to reduce the impact of electromagnetic interference (EMI) and improve signal integrity. This is typically accomplished by the use of a pseudorandom bit sequence (PRBS) generated with a specified polynomial. For example, for 8b/10b encoding, a PRBS-7 (or l+x ⁶ +x ⁷ ) can be employed, and, for synchronous optical networking or SONET (as specified in ITU O.150), PRBS-23 (or X ²³ +X ¹⁸ +l). Similarly, this PRBS signaling can be employed for error checking.

[0006] However, as demonstrated above, one polynomial is generally not applicable to all standards (e.g., 802.3-2008 and SONET); each standard usually specifies its own polynomial. Conventionally, this meant that each PHY (e.g., 110-1) would be designed for a particular standard (e.g., PRBS-7 for 802.3-2008) and would lack the flexibility to be used with other standards. A reason for this is that the serial and parallel implementations for the PHYs (e.g., 110-1) would be too costly in terms of area, price, and power consumption to be generally applicable.

[0007] Therefore, there is a need for a flexible transceiver architecture.

[0008] Some examples of conventional systems are described in U.S. Patent Nos.

4,744,104; 5,267,316; 6,820,230; 6,907,062; 7,124,158; 7,414,112; 7,486,725; 7,505,589; and in U.S. Patent Publication Nos. 2003/0014451; 2007/008997; and 2007/0098160. SUMMARY

[0009] In accordance with an embodiment, an apparatus is provided. The apparatus comprises a polynomial register having a plurality of bits, wherein the polynomial register is configured to store a user-defined polynomial; a first bus; a second bus; and a transceiver that is coupled to the first bus, the second bus, and the polynomial register, wherein the transceiver includes: a self- synchronous scrambler that is configured to generate a scrambled signal from a first signal using the user-defined polynomial; and a self-synchronous descrambler that is configured to generate a descrambled signal from a second signal using the user-defined polynomial.

[0010] In accordance with an embodiment, the first bus further comprises a first input bus and a second input bus, and wherein the second bus further comprises a first output bus and a second output bus, and wherein the transceiver further comprises: a transmitter having an encoder that is coupled to the first input bus and the self-synchronous scrambler, wherein the self-synchronous scrambler is coupled of the first output bus; and a receiver having a decoder that is coupled to the second output bus and the self-synchronous descrambler, wherein the self- synchronous descrambler is coupled to the second input bus.

[0011] In accordance with an embodiment, the first input bus has a programmable width.

[0012] In accordance with an embodiment, each of the self-synchronous scrambler and self- synchronous descrambler further comprises: a first matrix circuit that is configured to include a first matrix corresponding to the user-defined polynomial; a second matrix circuit that is configured to include a first matrix corresponding to the user-defined polynomial; a first multiplier that is coupled to the second matrix circuit and that is coupled to the respective one of the encoder and the second input bus; a data register; a second multiplier that is coupled to the first matrix circuit and the data register; and an XOR circuit that is coupled to the first and second multipliers and that is coupled to the respective one of the first output bus and the decoder.

[0013] In accordance with an embodiment, the data register of the self-synchronous scrambler is coupled to the encoder, and wherein the data register of the self-synchronous descrambler is coupled to the second input bus.

[0014] In accordance with an embodiment, the polynomial register has 32 bits. [0015] In accordance with an embodiment, a method is provided. The method comprises retrieving a user-defined polynomial from a polynomial register having a plurality of bits; generating first and second matrices based at least in part on the user-defined polynomial; multiplying the first matrix by a first data set to generate a second data set; retrieving a third data set from a data register; multiplying the third data set by the second matrix to generate a fourth data set; XORing the second and fourth data sets to generate a fifth data set; and outputting the fifth data set.

[0016] In accordance with an embodiment, the method further comprises loading the fifth data set into the data register to form the third data set.

[0017] In accordance with an embodiment, the step of outputting further comprises outputting the fifth data set over a bus.

[0018] In accordance with an embodiment, the method further comprises loading the first data set into the data register to form the third data set.

[0019] In accordance with an embodiment, an apparatus is provided. The apparatus comprises a media access control (MAC) circuit; a interface that is coupled to the MAC circuit; a physical transceiver (PHY) having: physical coding sublayer (PCS) logic having: a polynomial register having a plurality of bits, wherein the polynomial register is configured to store a user- defined polynomial; a bus that is coupled to the interface; an encoder that is coupled to the first bus; a self-synchronous scrambler that is coupled to the encoder and the first output bus, wherein that is configured to generate a scrambled signal from a first signal using the user-defined polynomial; a decoder that is coupled to the bus; and a self-synchronous descrambler that is configured to generate a descrambled signal from a second signal using the user-defined polynomial; forward error correction (FEC) logic that is coupled to the PCS logic; physical medium attachment (PMA) logic that is coupled to the FEC logic; and physical dependent medium (PMD) logic that is coupled to the PMA logic.

[0020] In accordance with an embodiment, the PCS logic further comprises: a first gearbox that is coupled between the self-synchronous scrambler and the FEC logic; and a second gearbox that is coupled between the self-synchronous descrambler and the FEC logic.

[0021] In accordance with an embodiment, the bus has a programmable width.

[0022] In accordance with an embodiment, the each of the self-synchronous scrambler and self- synchronous descrambler further comprises: a first matrix circuit that is configured to include a first matrix corresponding to the user-defined polynomial; a second matrix circuit that is configured to include a first matrix corresponding to the user-defined polynomial; a first multiplier that is coupled to the second matrix circuit and that is coupled to the respective one of the encoder and the second input bus; a data register; a second multiplier that is coupled to the first matrix circuit and the data register; and an XOR circuit that is coupled to the first and second multipliers.

[0023] In accordance with an embodiment, the apparatus further comprises: a host that is coupled to the MAC circuit; and a communications medium that is coupled to the PHY.

BRIEF DESCRIPTION OF THE DRAWINGS

[0024] FIG. 1 is a diagram of an example of a conventional system;

[0025] FIG. 2 is a diagram of an example of a PHY of FIG. 1;

[0026] FIG. 3 is a diagram of a PCS sublayer logic of FIG. 2;

[0027] FIGS. 4 and 5 are diagrams of an example of a PCS sublayer logic in accordance with embodiments of the present invention;

[0028] FIG. 6 is a diagram of an example of the programmable transmission and reception circuits of FIGS. 4 and 5;

[0029] FIG. 7 is a diagram of an example of the scrambler of FIG. 6; and

[0030] FIG. 8 is a diagram of an example of the descrambler of FIG. 6.

DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS

[0031] FIGS. 4 and 5 illustrate an example of the transceivers 400-A and 400-B. The illustrated transceiver 400-A may be used as part of PCS sublayer logic 202 of FIG. 3, and, as shown in the example of FIG. 5, transceiver 400-B may be used to communicate with a serializer/deserializer (SERDES) device. Other implementations may use transceivers 400-A and 400-B, including implementations that omit encoder 306 and decoder 316. In each case, the transceivers 400-A and 400-B employ programmable transmission and reception circuits 406- A/406-B and 408-A/408-B that can perform scrambling/descrambling and error checking based on a user-specified or user-defined polynomial.

[0032] FIG. 6 illsutrates the programmable transmission and reception circuits 406-

A/406-B and 408-A/408-B (which are referred to hereinafter as 406 and 408) in greater detail. Collectively, circuits 406 and 408 can be considered to be a transceiver. As shown in this example, circuit 406 generally comprises a PRBS generator 504 and a scrambler 502, while circuit 408 generally comprises a descrambler 506 and PRBS checker 508. As shown, there can also be a detector 512 that is in communication with the PRBS generator 504 and 508. This detector 512 can cause the PRBS generator 504 to transmit PRBS data sets over a communications medium (e.g., 112) and receive the bit errors from the PRBS checker 508. Based on this information, the detector 512 can search for optimal settings by transmitting repeated PRBS data sets (after each adjustment iteration) and receiving the bit errors, or it can characterize the communication channel (e.g., 114), allowing the detector 512 to detect the communication medium type (e.g., twist pair, optical, and so forth). Additionally, the busses that communicate with the scrambler 502 and descrambler 506 can have a programmable width (e.g., a maximum width of 32 bits but adjustable down to 1 bit).

[0033] Also, as can be seen in the example of FIG. 6, there is a polynomial register 510 shown. This polynomial register 510 typically has a predetermined width or number of bits (e.g., 32 bit) that is accessible to a user. The user is able to write to this register 510 so as to store a user-defined polynomial. As an example, if a user chooses to use PRBS-7 (which has a polynomial of l+x ⁶ +x ⁷ ) for scrambler 502, the user can write the following to a 32-bit register (e.g., register 510):

Thus, for an example register (e.g., 5) having a width of 32 bits, the user can specify any of approximately 2xl0 ⁹ polynomials. This user-defined polynomial (which can be retrieved from register 510) can be used by the scrambler 502, PRBS generator 504, descrambler 506, and PRBS checker 508 accordingly. Alternatively, there can be multiple polynomial registers (e.g. 510), and each of the scrambler 502, PRBS generator 504, descrambler 506, and PRBS checker 508 may have a separate polynomial register (e.g., 510).

[0034] Turning to FIG. 7, an example of the scrambler 502 can be seen in greater detail.

In operation, the signal POLY (which generally corresponds to the user-defined polynomial stored in register 510) can be used by the matrix circuits 602 and 604 to generate matrices, which can be referred to a polynomial state matrix (or P-matrix) and a data matrix or (D-matrix) respectively. The P- and D-matrices and Z> ^are typically square binary matrices that are a function of or based at least in part on the user-defined polynomial. The basis for forming the P- and D-matrices P and D are identity matrices Ip and I _D (respectively), which typically have uniquely assigned vectors for each column of the first row of the P- and D-matrices P and D (i.e., Po _j and D _0j ). An example of identity matrix I _P can be seen below:

1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

The identity matrix I _D is generally comprised of the matrix I _P that is shifted or adjusted based on the desired input bus width. For example, the identity matrix I _D (which is derived from the matrix I _P shown above) can be as follows for a 20-bit bus width: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

An adjustment vector A is also determined. Typically, when the signal POLYl is transmitted, the lowest bit is truncated, and a '0' is appended to signal POLYl to form adjustment vector A . For example, with the PRBS-7 polynomial used above, the adjustment vector A would be:

The P- and D-matrices P and D can then be determined. [0035] Looking first to the P-matrix P , it can be determined on a row-by-row basis through the use of a set of matrices (e.g., 32-32x32 matrices), which can be referred to a working matrices WP[r] , where r denote the P-matrix P row. These working matrices WP[r] , , in this example, are based at least in part on the identity matrix I _P and can be determined using the following formula:

WP[0] = I _P

(1) WPr] = WP _u [r] = WP rll≤r,i≤ n;2≤j≤n

WP _i0 [r] = FNP[r],\≤r≤n

where

(2) FNP[r] = {wP _j [r - lj Θ 2)· ... · {t¥P ₀ [r - lj Θ l).

The P-matrix P can then be extracted from working matrices WP[r] by application of the following equation:

0,i>BW

(3) WP _{t j} [BW -l], otherwise

where BW is the bus width. For example, with the PRBS-7 polynomial used above and a 20-bit bus width BW, the P-matrix P should be:

ΊΓ θ Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο Ο ~(Γ 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 1

[0036] Similarly, with D-matrix Z) , it can be determined on a row-by-row basis through the use of a set of matrices (e.g., 32-32x32 matrices) or working matrices WD[r] . These working matrices WD[r] , in this example, are based at least in part on the identity matrix I _D and can be determined usin the following formula: ≤n

where

(5) FND[r] = wD _j [r - 1] Θ 2)· ... ·fVD ₀ [r - 1] Θ l).

The D-matrix D can then be extracted from working matrices WD[r] by application of the following equation:

0,i>BW

(6) D ^, . ^. =

WD _j [BW- 1], otherwise

[0037] Once the P- and D-matrices P and D have been generated by matrix circuits 602 and 604, respectively, the input data DATAIN1 for scrambler 502. The multiplier 606 can multiply the input data DATAIN1 (which can for example be 20-bits wide data vector) by the D- matrix D . The P-matrix P can be multiplied by the information (e.g., vector) stored in register

610 with multiplier 612. The outputs of multipliers 606 and 612 can then be XORed with circuit 608, written to register 610, and output (e.g., as an output data vector DATAOUT1). Thus, the scrambler 502 can function as a self-synchronous scrambler or parallel multiplicative scrambler that uses a user-defined polynomial so as to allow the scrambler 502 to be compliant with a wide variety of standards (e.g., communication protocols).

[0038] As can be seen in FIG. 8, the descrambler 506 operates in a similar matter to that of scrambler 502. Matrix circuits 702 and 704 can compute the P- and D-matrices P and D in a similar manner to that described above with respect to matrix circuits 602 and 604, and multipliers 706 and 712, register 710, and XOR circuit 708 can perform the same general functions as multipliers 606 and 612, register 610, and XOR circuit 608 in scrambler 502. One difference is that each cycle (for example), the input data vector DATAIN2 is written to register 710 instead of the data output vector DATAOUT2 (which would correspond to the operation of scrambler 502). As with the scrambler 502, descrambler 506 can function as a self-synchronous descrambler or parallel multiplicative descrambler that uses a user-defined polynomial so as to allow the descrambler 502 to be compliant with a wide variety of standards (e.g., communication protocols).

[0039] Those skilled in the art will appreciate that modifications may be made to the described example implementations, and also that many other embodiments exist, within the scope of the claimed invention.