Encoder and method for efficient synchronisation channel encoding in UTRA TDD mode
View Patent ↗An encoder and method for efficient synchronization channel encoding in UTRA TDD mode by: producing a codeword a, where a=dG+z modulo-2, where d represents a predetermined code group to be encoded, G represents a predetermined generator matrix, and z represents a function of the code group number and a row of the generator matrix; producing values s k =2a 2k+1 +a k ;k=0, 1, 2, 3, and associated values b 0 ,b 1 ,b 2 ; and producing a value S ssc associated with the code group, where S ssc =(b 0 c π(0) ,b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j). This provides an efficient encoding architecture for the synchronization channel in UTRA TDD mode; and, in addition, by simple manipulation of the generation matrix, a higher chip rate signal may be signalled while still preserving the signalling information for the lower chip rate.
1. A computer-implemented method for an encoder, for efficient synchronization channel (SCH) encoding in time division duplex (TDD) mode, comprising:
producing a codeword a, where a=dG+z modulo-2, where d represents a predetermined code group to be encoded for synchronization channel encoding, G represents a predetermined generator matrix, and z represents a function of the code group number and a row of the generator matrix;
producing values s k for synchronization channel encoding, and associated values b 0 ,b 1 ,b 2 , wherein s k is a function of a 2k+1 and a 2k ; k=0, 1, 2, 3; and
producing a value S SSC associated with the code group for synchronization channel encoding, where S ssc =(b 0 c π(0) ,b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j).
2. The method of claim 1 , wherein the generator matrix in a first case is based upon the matrix:
[
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0
]
.
3. The method of claim 1 , wherein the generator matrix in a second case is based upon the matrix:
[
0
0
0
0
0
1
0
1
0
1
0
0
0
0
0
1
0
0
1
0
1
0
0
0
]
.
4. The method of claim 1 wherein in a first case:
d comprises (f,u 0 ,u 1 ,u 2 ), where f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 3 (u 2 +1)g 3 reduced modulo-2, where g 3 represents a row of the generator matrix.
5. The method of claim 1 wherein in a second case:
d comprises (K,f,u 0 ,u 1 ), where K is 0 for a k th slot and 1 for a (k+1) th slot, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 2 (u 1 +1)g 3 reduced modulo-2, where g 3 represents a row of the generator matrix.
6. The method of claim 1 , wherein the values s k =2a 2k+1 +a 2k ; k=0, 1, 2, 3.
7. A computer-implemented method for an encoder, for efficient synchronization channel (SCH) encoding in time division duplex (TDD) mode, comprising:
producing a codeword from a predetermined code group to be encoded for synchronization channel encoding, a predetermined generator matrix G, and a function of the code group number and a row of the generator matrix, and
producing a value S ssc associated with the code group for synchronization channel encoding, where S ssc =(b 0 c π(0) , b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(± 1 ,±j),
wherein the generator matrix has values such that a parameter produced therefrom changes between a first value indicating a first chip rate and a second value indicating a second chip rate.
8. The method of claim 7 , wherein the generator matrix in a first case is based upon the matrix:
[
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
1
0
0
1
0
1
0
0
0
]
.
9. The method of claim 7 , wherein the generator matrix in a second case is based upon the matrix:
[
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
1
0
0
1
0
1
0
0
0
]
.
10. The method of claim 7 , wherein the codeword a, is represented by a=dG+z modulo-2, where d represents a predetermined code group to be encoded, G represents a predetermined generator matrix, and z represents a function of the code group number and a row of the generator matrix.
11. The method of claim 10 wherein in a first case:
d comprises (C r ,f,u 0 ,u 1 ,u 2 ), where C r represents a bit indicative of chip rate, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 3 (u 2 +1)g 4 reduced modulo-2, where g 4 represents a row of the generator matrix.
12. The method of claim 10 wherein in a second case:
d comprises (C r ,K,f,u 0 ,u 1 ), where C r represents a bit indicative of chip rate, K is 0 for a k th slot and 1 for a (k+1) th slot, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 2 (u 1 +1)g 4 reduced modulo-2, where g 4 represents a row of the generator matrix.
13. An encoder for efficient synchronisation channel encoding in UTRA TDD mode, comprising:
means for producing a codeword a, where a=dG+z modulo-2, where d represents a predetermined code group to be encoded, G represents a predetermined generator matrix, and z represents a function of the code group number and a row of the generator matrix,
means for producing values s k , and associated values b 0 ,b 1 ,b 2 , wherein s k is a function of a 2k+1 and a 2k ; k=0, 1, 2, 3, and
means for producing a value S ssc associated with the code group, where S ssc =(b o c π(0) ,b 1 c π(1) ,b 2 C π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j).
14. The encoder of claim 13 , wherein the generator matrix in a first case is based upon the matrix:
[
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0
]
.
15. The encoder of claim 13 , wherein the generator matrix in a second case is based upon the matrix:
[
0
0
0
0
0
1
0
1
0
1
0
0
0
0
0
1
0
0
1
0
1
0
0
0
]
.
16. The encoder of claim 13 wherein in a first case:
d comprises (f,u 0 ,u 1 ,u 2 ), where f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 3 (u 2 +1)g 3 reduced modulo-2, where g 3 represents a row of the generator matrix.
17. The encoder of claim 13 wherein in a second case:
d comprises (K,f,u 0 ,u 1 ), where K is 0 for a k th slot and 1 for a (k+1) th slot, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 2 (u 1 +1)g 3 reduced modulo-2, where g 3 represents a row of the generator matrix.
18. The method of claim 13 , wherein the values s k =2a 2k+1 +a 2k ; k=0, 1, 2, 3.
19. An encoder for efficient synchronisation channel encoding in Universal Terrestrial Radio Access time division duplex (UTRA TDD) mode, comprising:
means for producing a codeword from a predetermined code group to be encoded, a predetermined generator matrix G, and a function of the code group number and a row of the generator matrix, and
means for producing a value S ssc associated with the code group, where S ssc =(b o c π(0) ,b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j),
wherein the generator matrix has values such that a parameter produced therefrom changes between a first value indicating a first chip rate and a second value indicating a second chip rate.
20. The encoder of claim 19 , wherein the generator matrix in a first case is based upon the matrix:
[
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0
]
.
21. The encoder of claim 19 , wherein the generator matrix in a second case is based upon the matrix:
[
0
0
0
0
1
0
0
0
0
0
0
1
0
1
0
1
0
0
0
0
0
1
0
0
1
0
1
0
0
0
]
.
22. The encoder of claim 19 , wherein the codeword a, is represented by a=dG+z modulo-2, where d represents a predetermined code group to be encoded, G represents a predetermined generator matrix, and z represents a function of the code group number and a row of the generator matrix.
23. The encoder of claim 22 wherein in a first case:
d comprises (C r ,f,u 0 ,u 1 ,u 2 ), where C r represents a bit indicative of chip rate, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 3 (u 2 +1)g 4 reduced modulo-2, where g 4 represents a row of the generator matrix.
24. The encoder of claim 22 wherein in a second case:
d comprises (C r ,K,f,u 0 ,u 1 ), where C r represents a bit indicative of chip rate, K is 0 for a k th slot and 1 for a (k+1) th slot, f is 0 for a first frame and 1 for a second frame, u 0 ,u 1 ,u 2 represent bits from a binary representation of the code group number, and
z=u 2 (u 1 +1)g 4 reduced modulo-2, where g 4 represents a row of the generator matrix.
25. A wireless base station for use for efficient synchronization channel encoding in time division duplex mode in a UMTS system, comprising:
means for producing a codeword a, where a=dG+z modulo-2, where d represents a predetermined code group to be encoded, G represents predetermined generator matrix, and z repesents a function of the code group number and a row of the generator matrix,
means for producing values s k , and associated values b 0 ,b 1 ,b 2 , wherein s k is a function of a 2k+1 and a 2k ; k=0, 1, 2, 3, and
means for producing a value S ssc , and associated with the code group, where S ssc =(b o c π(0) ,b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j).
26. A computer readable medium encoded with program code for performing the method of:
producing a codeword a, where a=dG+z modulo-2, where d represents a predetermined code group to be encoded, for synchonization channel encoding, G represents a predetermined generator matrix, and z repesents a function of the code group number and a row of the generator matrix,
producing values s k , for synchonization channel encoding, and associated values b 0 ,b 1 ,b 2 , wherein s k is a function of a 2k+1 and a 2k ; k=0, 1, 2, 3, and
producing a value S ssc associated with the code group for for synchonization channel encoding, where S ssc =(b o c π(0) ,b 1 c π(1) ,b 2 c π(2) ), c π represents a code within the code group, and b 0 ,b 1 ,b 2 ε(±1,±j).