1. An acid addition salt of a compound of formula (II)
wherein
R3 and R4 are selected independently from H and C1-C8 alkyl or together with the nitrogen to which they are bound form a ring having 3 to 7 members,
comprising said compound of formula (II) its enantiomers or mixtures therof, or its salts, and an acid.
2. The addition salt according to claim 1, wherein said acid is an organic or inorganic acid.
3. The addition salt according to claim 1, selected from hydrochloride, hydrobromide, sulfate, methanesulfonate, phosphate, nitrate, benzoate, citrate, tartrate, fumarate or maleate of the compound of formula (II).
4. The addition salt according to claim 1, wherein R3 and R4 are both isopropyl.
5. The addition salt according to claim 1, selected from N,N-diisopropyl-3-phenyl-2-propenamine hydrochloride and N,N-diisopropyl-3-phenyl-2-propenamine hydrobromide.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
What is claimed is:
1. A 2n1 shuffling network comprising:
a shuffle exchange network for receiving 2n1 data inputs and a dummy input and providing 2n outputs;
a replacement set of 2n1 data switches for receiving 2n1 outputs from said shuffle exchange network; and
a selection circuit for actuating selective ones of said 2n1 data switches in said replacement set to replace one of the 2n1 outputs of the shuffle exchange network with the 2nth output of the shuffle exchange network.
2. The 2n1 shuffling network of claim 1 in which said shuffle exchange network includes at least one set of shuffle data switches.
3. The 2n1 shuffling network of claim 2 in which each set of shuffle data switches includes at least 2n data switches.
4. The 2n1 shuffling network of claim 2 in which there are n sets of shuffle data switches.
5. The 2n1 shuffling network of claim 2 in which there are 2n data switches in each said set of shuffle data switches.
6. The 2n1 shuffling network of claim 1 in which each said data switch in said replacement set of data switches includes a two to one multiplexer.
7. The 2n1 shuffling network of claim 1 in which each said data switch in said set of shuffle data switches includes a two to one multiplexer.
8. The 2n1 shuffling network of claim 3 in which said shuffle exchange network includes a coding circuit for selectively actuating said sets of data switches in said set of shuffle data switches.
9. The 2n1 shuffling network of claim 8 in which said coding circuit actuates each set of shuffle data switches independently.
10. The 2n1 shuffling network of claim 8 in which said coding circuit actuates all of the data switches in a set of shuffle data switches together.
11. The 2n1 shuffling network of claim 8 in which said coding circuit includes a sequence generator for providing each data input at the data output only once each sequence cycle.
12. The 2n1 shuffling network of claim 11 in which said sequence generator includes a pseudo random number generator.