1. A lattice reduction method for a multiple-input multiple-output communication system, the method comprising:
providing a channel matrix corresponding to a channel in a multiple-input multiple-output communication system;
preprocessing the channel matrix to form at least an upper triangular matrix;
implementing a relaxed size reduction process on elements of the upper triangular matrix, comprising:
choosing a first relaxed size reduction parameter for a first-off-diagonal element of the upper triangular matrix;
choosing a second relaxed size reduction parameter, which is greater than the first relaxed size reduction parameter, for a second-off-diagonal element of the upper triangular matrix;
evaluating whether a first relaxed size reduction condition is satisfied for the first-off-diagonal element of the upper triangular matrix; and
evaluating whether a second relaxed size reduction condition is satisfied for the second-off-diagonal element of the upper triangular matrix; and
implementing a basis update process on diagonal elements of the upper triangular matrix.
2. The lattice reduction method according to claim 1, wherein implementing a relaxed size reduction process further comprises performing a relaxed size reduction process using an integer rounded divider based on a single Newton-Raphson iteration if the first or second relaxed size reduction condition is not satisfied.
3. The lattice reduction method according to claim 1, wherein implementing a relaxed size reduction process further comprises performing a relaxed size reduction process using only addition operations if the first or second relaxed size reduction condition is not satisfied.
4. The lattice reduction method according to claim 1, wherein implementing a relaxed size reduction process further comprises performing a relaxed size reduction process using only addition operations and an integer rounded divider based on a single Newton-Raphson iteration if the first or second relaxed size reduction condition is not satisfied.
5. A lattice reduction method for a multiple-input multiple-output communication system, the method comprising:
providing a channel matrix corresponding to a channel in a multiple-input multiple-output communication system;
preprocessing the channel matrix to form at least an upper triangular matrix;
performing a size reduction process on elements of the upper triangular matrix; and
implementing a rapid basis update process on diagonal elements in the upper triangular matrix, comprising
choosing an efficient Siegel condition factor; and
evaluating whether the first Siegel condition is satisfied between a first pair of adjacent diagonal elements of the upper triangular matrix comprising a first diagonal element and a second diagonal element without using multiplication operations.
6. The lattice reduction method according to claim 5, wherein the implementing a rapid basis update process further comprises evaluating whether a second Siegel condition is satisfied between a second pair of adjacent diagonal elements of the upper triangular matrix comprising the second diagonal element and a third diagonal element without using multiplication operations.
7. The lattice reduction method according to claim 6, wherein the implementing a rapid basis update process further comprises evaluating whether a third Siegel condition is satisfied between a third pair of adjacent diagonal elements of the upper triangular matrix comprising the third diagonal element and a fourth diagonal element without using multiplication operations.
8. The lattice reduction method according to claim 7, wherein the efficient Siegel condition factor is 2.06640625.
9. The lattice reduction method according to claim 7, wherein a state machine tracks at least whether the first Siegel condition is satisfied, whether the second Siegel condition is satisfied, and whether the third Siegel condition is satisfied, and the lattice reduction method further comprises terminating when the state machine indicates that the first, second, and third Siegel conditions are satisfied.
10. The lattice reduction method according to claim 7, wherein a first state machine tracks whether at least the first Siegel condition is satisfied, a second state machine tracks whether at least the second Siegel condition is satisfied, and a third state machine tracks whether at least the third Siegel condition is satisfied, and the lattice reduction method further comprises terminating when at least the first, second, and third state machines indicate that at least the first, second, and third Siegel conditions are satisfied.
11. The lattice reduction method according to claim 7, wherein the evaluating whether the first Siegel condition is satisfied, the evaluating whether the second Siegel condition is satisfied, and the evaluating whether the third Siegel condition is satisfied are performed using a comparator and two adders.
12. The lattice reduction method according to claim 7, wherein the evaluating whether the first Siegel condition is satisfied, evaluating whether the second Siegel condition is satisfied, and evaluating whether the third Siegel condition is satisfied each occur while memory of the upper triangular matrix is being filled.
13. The lattice reduction method according to claim 7, wherein implementing a rapid basis update process further comprises performing a basis update process and evaluating at least the first and third Siegel conditions, if the second Siegel condition is not satisfied.
14. A lattice reduction method for a multiple-input multiple-output communication system, the method comprising:
providing a channel matrix corresponding to a channel in a multiple-input multiple-output communication system;
preprocessing the channel matrix to form at least an upper triangular matrix;
performing a size reduction process on elements of the upper triangular matrix; and
implementing an iterative basis update process on elements in the upper triangular matrix, comprising computing a 2\xd72 unitary matrix using a number of vectoring iterations,
wherein the computing the 2\xd72 unitary matrix is completed in a number of cycles equal to a number of pipeline stages plus the number of vectoring iterations minus one.
15. The lattice reduction method according to claim 14, wherein the computing a 2\xd72 unitary matrix using a number of vectoring iterations employs a single iteration per cycle Householder CORDIC architecture that has been unrolled and includes the number of pipeline stages configured to concurrently execute at least one vectoring iteration and at least one rotation iteration.
16. The lattice reduction method according to claim 15, wherein each of the number of pipeline stages is can operate in a vectoring mode or a rotation mode.
17. The lattice reduction method according to claim 15, wherein each of the number of pipeline stages comprises at least one multiplexer with an input and a plurality of outputs equivalent to the number of vectoring iterations divided by the number of pipeline stages.
18. A lattice reduction system, comprising
a master processor configured to transmit a complex-integer output to a first FIFO queue and a 2\xd72 unitary matrix output to a second FIFO queue;
a first slave processor in indirect communication with the master processor by way of at least the first FIFO queue and configured to receive the complex-integer output from the first FIFO queue and process a unimodular matrix; and
a second slave processor in indirect communication with the master processor by way of at least the second FIFO queue and configured to receive the 2\xd72 unitary matrix output from the second FIFO queue and process a second unitary matrix,
wherein the master processor, the first slave processor, and the second slave processor utilize a single multiplier pipeline structure.
19. The lattice reduction system according to claim 18, wherein the master processor, the first slave processor, and the second slave processor each comprises two memory banks configured so that multiple channel matrices may be processed concurrently.
20. The lattice reduction system according to claim 18, configured so that the multiplier pipeline structure has a utilization rate greater than 80%.
21. The lattice reduction system according to claim 18, wherein the master processor is configured to stall if the first FIFO queue or the second FIFO queue has a minimum number of empty entries.
22. The lattice reduction system according to claim 18, wherein the first slave processor utilizes the multiplier pipeline structure when the master processor is not utilizing the multiplier pipeline structure.
23. The lattice reduction system according to claim 18, wherein the second slave processor utilizes the multiplier pipeline structure when the master processor and the first slave processor are not using the multiplier pipeline structure.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for preparing an elastomeric base composition having a fluorocarbon continuous phase comprising:
(I) mixing
(A) a fluorocarbon elastomer with
(B) a compatibilizer,
(C) an optional catalyst,
(II) mixing the product of step (I) with
(D) a silicone base comprising
(D\u2032) a curable organopolysiloxane, and
(D\u2033) a filler,
(E) an optional crosslinking agent,
(F) a cure agent in an amount sufficient to cure said organopolysiloxane; and
(III) dynamically vulcanizing the organopolysiloxane,
wherein the weight ratio of fluorocarbon elastomer (A) to silicone base (B) in the elastomeric base composition ranges from 95:5 to 30:70 and wherein the fluorocarbon elastomer (A) has a glass transition point of less than 20\xb0 C.
2. The method of claim 1 wherein the fluorocarbon elastomer (A) comprises a polymer, copolymer, or terpolymer prepared from at least one monomer having a carbon-bonded reactive group selected from hydrogen, chlorine, bromine or iodine, and one monomer having a carbon-bonded fluorine.
3. The method of claim 1 wherein the fluorocarbon elastomer (A) comprises a copolymer or terpolymer of:
vinylidene fluoride and hexafluoropropene;
vinylidene fluoride, hexafluoropropene and tetrafluoroethene;
vinylidene fluoride, tetrafluoroethene, and perfluoromethylvinyl ether.
4. The method of claim 1 wherein (B) the compatibilizer is selected from;
(B\u2032) organic compounds which contain 2 or more olefin groups,
(B\u2032) organopolysiloxanes containing at least 2 alkenyl groups and
(B\u2032\u2033) olefin-functional silanes which also contain at least one hydrolyzable group or at
least one hydroxyl group attached to a silicon atom thereof, and
(B\u2033\u2033) is an organapolysiloxane having at least one organofunctional group selected
from amine, amide, isocyanurate, phenol, acrylate, epoxy, and thiol groups.
5. The method of claim 1 wherein the compatibilizer (B) is selected from hydroxy terminated polymethylvinylsiloxanes.
6. The method of claim 1 wherein the compatibilizer (B) is triallyl isocyanurate.
7. The method of claim 1 wherein the compatibilizer (B) is selected from a reaction product of a organopolysiloxane and a fluorocarbon polymer.
8. The method of claim 1 wherein the catalyst (C) is present and is a radical initiator.
9. The method of claim 8 wherein the radical initiator is an organic peroxide selected from hydroperoxides, diacyl peroxides, ketone peroxides, peroxyesters, dialkyl peroxides, peroxydicarbonates, peroxyketals, peroxy acids, acyl alkylsulfonyl peroxides and alkyl monoperoxydicarbonates.
10. The method of claim 1 wherein the curable organopolysiloxane comprises a diorganopolysiloxane gum containing at least 2 alkenyl groups.
11. The method of claim 1 wherein the filler (D\u2033) is fumed silica having a surface area of 50 to 400 m2g.
12. The method of claim 10 wherein the crosslinker (E) is present and is an organohydrido silicon compound containing at least 2 silicon-bonded hydrogen atoms.
13. The method of claim 10 wherein the cure agent (F) is a hydrosilylation catalyst.
14. The method of claim 13 wherein the hydrosilation catalyst is a platinum catalyst.
15. The method of claim 1 wherein;
(A) comprises a copolymer or terpolymer of:
vinylidene fluoride and hexafluoropropene;
vinylidene fluoride, hexafluoropropene and tetrafluoroethene; or
vinylidene fluoride, tetrafluoroethene, and perfluoromethylvinyl ether,
(B) is a hydroxy terminated polymethylvinylsiloxane,
(C) is present and is an organic peroxide,
(D) is a diorganopolysiloxane gum containing at least 2 alkenyl groups,
(E) is present and is an organopolysiloxane which contains at least 2 silicon-bonded
hydrogen atoms in each molecule and
(F) is a platinum catalyst.
16. The method of claim 1 wherein the silicone base (D) comprises a diorganopolysiloxane gum containing at least 2 silicone bonded hydroxy groups.
17. The method of claim 16 wherein the cure agent (F) is a condensation cure catalyst.
18. The method of claim 1 wherein the cure agent (F) is a free radical initiator.
19. The method of claim 1 wherein;
(A) comprises a copolymer or terpolymer of:
vinylidene fluoride and hexafluoropropene;
vinylidene fluoride, hexafluoropropene and tetrafluoroethene; or
vinylidene fluoride, tetrafluoroethene, and perfluoromethylvinyl ether,
(B) is a hydroxy terminated polymethylvinylsiloxane,
(C) is present and is an organic peroxide,
(D) is a diorganopolysiloxane gum containing at least 2 alkenyl groups, and
(F) is an organic peroxide.
20. The product produced by the method claimed in claim 1.
21. A cured fluorocarbon elastomer composition prepared from the product of claim 20.
22. An article of manufacturing comprising the cured fluorocarbon elastomer composition of claim 21.