1. A compound of formula IA or IB:
or a pharmaceutically acceptable salt or hydrate thereof; wherein:
R1 represents H, CF3 or C1-4alkyl;
R2 represents H, C1-6alkyl or C3-6cycloalkyl, either of which optionally bears a substituent selected from halogen, CF3, C1-4alkoxy and C1-4alkoxycarbonyl;
A represents a group selected from:
m is 0 or 1;
R3 represents C1-6alkyl;
R4 and R5 are independently selected from H, halogen, C1-6alkyl, C3-6cycloalkyl, C1-6alkoxy, C1-6alkylamino and di(C1-6alkyl)amino;
R6 represents H or C1-6alkyl;
R7 represents \u2014(CO)n-L1-X;
n is 0 or 1;
L1 represents a divalent linking group selected from cyclopropane-1,2-diyl and C1-6alkylene which optionally bears up to 2 substituents independently selected from OH, \u2550O, F and C1-4alkyl;
X represents C1-4alkoxy, C3-6cycloalkylC1-4alkoxy, tetrahydrofuryl, tetrahydropyranyl, Ar, ArO or ArNH;
or R6 and R7 together with the nitrogen atom which they are mutually attached complete a ring represented by:
x is 1 or 2;
y1 and y2 are independently 1 or 2;
z is 0, 1 or 2;
W represents CH2, CH2CH2 or CH2CH2O with the proviso that z=0 when W represents CH2CH2O;
R8 and R9 are attached to the same carbon atom or to different carbon atoms and independently represent H, halogen, CF3, C1-4alkyl or C1-4alkoxy; or when attached to the same carbon atom R8 and R9 may together represent \u2550O; or when attached to different carbon atoms R8 and R9 may together represent a \u2014CH2CH2\u2014 or \u2014CH2CH2CH2\u2014 bridge;
R10 represents a group -L2-Y;
Y represents H, Ar, OAr, NHAr, SAr, SO2Ar, ORa, N(Ra)2, CN, halogen, CF3, CORa, CO2Ra, SO2Ra, diphenylhydroxymethyl, C3-6cycloalkyl, tetrahydrofuryl or tetrahydropyranyl, said C3-6cycloalkyl, tetrahydrofuryl or tetrahydropyranyl optionally bearing up to 3 substituents independently selected from halogen, CF3, C1-4alkyl, oxo and C1-4alkoxy;
L2 represents a bond or C1-6alkylene which optionally bears up to 3 substituents selected from halogen, C1-4alkyl, OH and \u2550O, with the proviso that L2 cannot represent a bond unless Y represents H, Ar, CORa, CO2Ra, SO2Ra or C3-6cycloalkyl;
the two R11 groups together represent a fused carbocyclic or heterocyclic ring of up to 6 ring atoms in total which optionally bears up to 2 substituents independently selected from halogen, CF3, C1-4alkoxy and hydroxyC1-4alkyl;
R12 represents H or a group \u2014(Z)p-L3-Y;
R13 represents, H, OH, Ar or C1-6alkyl;
or R12 and R13 together represent \u2550CH\u2014Ar or \u2550C(Ar)2 where the Ar groups are the same or different;
or R12 and R13 together complete a spiro-linked 5-membered ring in which at least 1 of the ring atoms is N, O or S, said ring optionally being benzo-fused and said ring optionally bearing up to 2 substituents selected from oxo, Ar, CF3, halogen, C1-4alkyl, C1-4alkoxy and C1-4alkylcarbonyl;
Z represents O, S, SO2, or NH;
p is 0 or 1;
L3 represents a bond or C1-6alkylene which optionally bears up to 3 substituents selected from halogen, C1-4alkyl, OH and \u2550O, with the proviso that p is 0 when L3 represents a bond;
Ar represents phenyl or 5- or 6-membered heteroaryl, any of which optionally bears up to 3 substituents selected from halogen, CN, phenyl, Rb, ORa, N(Ra)2, CO2Ra, CON(Ra)2 and SO2Rb;
each Ra independently represents H or C1-4alkyl, C3-6cycloalkyl, or C3-6cycloalkylC1-4alkyl, any of which optionally bears up to 3 fluorine substituents, or two Ra groups attached to the same nitrogen optionally together complete a heterocyclic ring of 4, 5 or 6 members which optionally bears up to 3 substituents independently selected from halogen, C1-4alkyl, C1-4alkoxy, CF3; and oxo;
and Rb represents Ra that is other than H; or two Rb groups attached to adjacent ring positions may complete a fused 5- or 6-membered ring optionally bearing up to 3 substituents independently selected from halogen, CF3, C1-4alkyl, oxo and C1-4alkoxy.
2. A compound according to claim 1 wherein R6 and R7 complete a ring selected from:
3. A compound according to claim 1 wherein R6 and R7 complete a ring selected from:
4. A compound according to claim 2 wherein R10 represents Ar or ArCH2.
5. A compound according to claim 4 wherein R10 represents 4-methoxyphenyl or 4-pyridylmethyl.
6. A compound according to claim 3 wherein R12 represents Ar or ArS and R13 is H.
7. A compound according to claim 6 wherein R12 represents 4-pyridyl or 4-pyridylthio.
8. A compound according to claim 1 wherein R6 is H and R7 represents \u2014(CO)n-L1-X.
9. A compound according to claim 8 wherein X represents Ar.
10. A compound according to claim 9 wherein R7 represents 2-(4-pyridyl)ethyl or 2-(1-methyl-1H-pyrazol-4-yl)ethyl.
11. A compound according to claim 1 wherein A represents
12. A pharmaceutical composition comprising a compound according to claim 1 and a pharmaceutically-acceptable carrier.
13. A method of treating or preventing a disease associated with deposition of A\u03b2 in the brain comprising administration to a patient in need thereof a therapeutically effective amount of a compound of formula IA or IB as defined in claim 1 or a pharmaceutically-acceptable salt or hydrate thereof.
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 decoding multi-dimensional encoded data, the method comprising:
receiving a set of multi-dimensional encoded data encoding each input bit in a set of input bits by multiple different component codes in multiple different encoding dimensions, the multi-dimensional data potentially having errors;
using a map to locate each set of intersection bits that encode the same input bit by multiple unsolved component codes;
decoding the unsolved component codes using one or a plurality of tested error correction hypotheses that yields a decoding success, each hypothesis correcting a different set of intersection bits for a different input bit.
2. The method of claim 1, wherein the set of intersection bits that encode the same input bit by multiple unsolved component codes has a relatively high probability of having errors.
3. The method of claim 1, wherein each hypothesis for correcting a different input bit is used sequentially and independently to decode the multi-dimensional data on-the-fly.
4. The method of claim 1, wherein a different one of the plurality of hypotheses is decoded in each sequential clock cycle.
5. The method of claim 1, wherein the map defines the locations of multiple intersection bits in the multiple respective dimensions for each input bit tested by the current hypothesis.
6. The method of claim 1, wherein the map locating the set of intersection bits for each input bit is generated on-the-fly while processing the input bit.
7. The method of claim 6, wherein the map is generated on-the-fly for each input bit using multiple (M) processing threads, wherein each thread determines the location of the intersection encoding the input bit in a different dimension.
8. The method of claim 7 comprising executing a number (N) of the processing threads in parallel equal to the number (N) of dimensions to determine the locations of the complete intersection set encoding each input bit in the multiple (N) dimensions in a single clock cycle.
9. The method of claim 1, wherein decoding is successful when a hypothesis generates multi-dimensional encoded data that has a reduced, optimal or threshold error metric in some or all encoding dimensions.
10. The method of claim 9, wherein, for each hypothesis, error metrics are computed for component codes in all encoding dimensions in parallel.
11. The method of claim 9, wherein the error metrics are syndrome values.
12. The method of claim 1, wherein each input bit is encoded with a different component code andor in a different arrangement of neighboring bits in each dimension.
13. The method of claim 12, wherein the component codes are BCH codes.
14. The method of claim 1, wherein (N)-dimensional encoded data includes a plurality of (N) intersection bits encoding each input bit.
15. A system for decoding multi-dimensional encoded data, the method comprising:
a memory to store a set of multi-dimensional encoded data encoding each input bit in a set of input bits by multiple different component codes in multiple different encoding dimensions; and
a processor to receive the set of multi-dimensional encoded data from the memory with potential errors, to use a map to locate each set of intersection bits that encode the same input bit by multiple unsolved component codes and to decode the unsolved component codes using one or a plurality of tested error correction hypotheses that yields a decoding success, wherein each hypothesis corrects a different set of intersection bits for a different input bit.
16. The system of claim 15, wherein the set of intersection bits that encode the same input bit by multiple unsolved component codes has a relatively high probability of having errors.
17. The system of claim 15, wherein the processor uses each hypothesis to correct a different input bit sequentially and independently to decode the multi-dimensional data on-the-fly.
18. The system of claim 15, wherein the processor decodes a different one of the plurality of hypotheses in each sequential clock cycle.
19. The system of claim 15, wherein the map defines the locations of multiple intersection bits in the multiple respective dimensions for each input bit tested by the current hypothesis.
20. The system of claim 15, wherein the processor generates the map locating the set of intersection bits for each input bit on-the-fly while processing the input bit.
21. The system of claim 20, wherein the processor uses multiple (M) processing threads to generate the map on-the-fly for each input bit, wherein the processor uses each thread to determine the location of the intersection encoding the input bit in a different dimension.
22. The system of claim 21, wherein the processor executes a number (N) of the processing threads in parallel equal to the number (N) of dimensions to determine the locations of the complete intersection set encoding each input bit in the multiple (N) dimensions in a single clock cycle.
23. The system of claim 15, wherein the processor decodes successfully when a hypothesis generates multi-dimensional encoded data that has a reduced, optimal or threshold error metric in some or all encoding dimensions.
24. The system of claim 23, wherein, for each hypothesis, the processor computes error metrics for component codes in all encoding dimensions in parallel.
25. The system of claim 23, wherein the error metrics are syndrome values.
26. The system of claim 15, wherein the processor encodes each input bit with a different component code andor in a different arrangement of neighboring bits in each dimension.
27. The system of claim 26, wherein the component codes are BCH codes.
28. The system of claim 15, wherein (N)-dimensional encoded data includes a plurality of (N) intersection bits encoding each input bit.