Search Images Maps Play YouTube News Gmail Drive More »
Advanced Patent Search | Web History | Sign in

Patents

A scrambling code generating apparatus of a downlink transmitter in a UMTS mobile communication system, which uses one primary scrambling code for separation of base stations and multiple secondary scrambling codes for channel separation. The apparatus includes a first m-sequence generator for generating a first m-sequence and a second m-sequence generator for generating a second m-sequence. A first summer adds the first and second m-sequences to generate the primary scrambling code. A plurality of first masking sections each shift the first m-sequence, and a plurality of second masking sections corresponding to the respective first masking sections each shifts the second m-sequence. A plurality of second summers each adds one of the first shifted m-sequences with the second m-sequence corresponding to the first m-sequence. The output of the second summers thus generates the multiple secondary scrambling codes.

Inventors: Jae-Yoel Kim, Hee-Won Kang
Original Assignee: Samsung Electronics Co., Ltd
Primary Examiner: Kambiz Zand
Secondary Examiner: Carl Colin
Attorney: The Farrell Law Firm, PC
Current U.S. Classification: 380/275; 375/150; 375/152; 380/33; 380/34; 380/47; 380/268; 380/273

View patent at USPTO
Search USPTO Assignment Database

Citations

Cited PatentFiling dateIssue dateOriginal AssigneeTitle
US3818442Nov 8, 1972Jun 1, 1974HOLDING REGISTER
US4320513May 11, 1972Mar 16, 1982Siemens AktiengesellschaftElectric circuit for the production of a number of different codes
US4707839Sep 26, 1983Nov 17, 1987Harris CorporationSpread spectrum correlator for recovering CCSK data from a PN spread MSK waveform
US5771288Feb 10, 1997Jun 23, 1998Ericsson, IncMultiple access coding for radio communications
US6108369Jul 11, 1997Aug 22, 2000Telefonaktiebolaget LM EricssonChannelization code allocation for radio communication systems
US6141374Oct 14, 1998Oct 31, 2000Lucent Technologies Inc.Method and apparatus for generating multiple matched-filter PN vectors in a CDMA demodulator
US6339646Nov 3, 1998Jan 15, 2002Telefonaktiebolaget LM EricssonSlotted mode code usage in a cellular communications system
US6459722Dec 4, 2000Oct 1, 2002Texas Instruments IncorporatedPseudorandom noise generator for WCDMA
US6496474Sep 23, 1998Dec 17, 2002Fujitsu LimitedSpread encoding device and method
US6526091Aug 17, 1998Feb 25, 2003Telefonaktiebolaget LM EricssonCommunication methods and apparatus based on orthogonal hadamard-based sequences having selected correlation properties
US6542478Mar 23, 1999Apr 1, 2003Samsung Electronics, Co., Ltd.Device and method for generating PN sequence in CDMA communication system
US6560212Mar 16, 1999May 6, 2003Agere Systems Inc.Generating an offset de-bruijn sequence using masks for a CDMA communication system
US6574205Apr 29, 1999Jun 3, 2003NEC CorporationCDMA cellular system and method of detecting spreading code in CDMA cellular system
US6728305Jun 21, 2002Apr 27, 2004NTT Mobile Communications Network, Inc.Simultaneous plural code series generator and CDMA radio receiver using same
US6728411Sep 7, 2001Apr 27, 2004AT&T Corp.Compression of partially-masked image data

Referenced by

Citing PatentFiling dateIssue dateOriginal AssigneeTitle
US7844299May 6, 2008Nov 30, 2010NTT DoCoMo, Inc.Mobile station capable of and a method for generating chip patterns for transmission
US8102996Nov 18, 2005Jan 24, 2012Renesas Electronics CorporationScrambler, descrambler and method, and disc apparatus

Claims

1. A method for generating a primary scrambling code, the method comprising the steps of:

generating a first m-sequence from a first m-sequence generator including first shift registers having first shift register values ai, wherein i=0 to c−1 and where c is the total number of the registers;

generating a second m-sequence from a second m-sequence generator including second shift registers having values bj, wherein j=0 to c−1, and where c is the total number of the registers;

masking the first shift register values ai with a first set or mask values Ki, wherein i=0 to c−1 to generate a third m-sequence;

adding the first m-sequence with the second m-sequence to generate a primary scrambling code; and
adding the third m-sequence and the second m-sequence to generate a secondary scrambling code;
wherein, the masking step shifts the first m-sequence cyclically by L chips to generate an Lth secondary scrambling code associated with the primary scrambling code.

2. The method of claim 1, wherein the primary scrambling code is one of a plurality primary scrambling codes and a Kth primary scrambling code is a ((K−1)*M+K)th gold code, where M is a total number of secondary scrambling codes per primary scrambling code and 13. The method of claim 1, wherein the secondary scrambling codes associated with a Kth primary scrambling code are from ((K−1)*M+K+1)th to (K*M+K)th gold codes, where M is a total number of secondary scrambling codes per primary scrambling code and 14. The method of claim 1, wherein 15. The method of claim 1, wherein the masking step is expressed by Σ(ki×ai).

6. The method of claim 1, further comprising:

masking the first shift register values ai with a second set of mask values Kj to generate a fourth m-sequence, wherein j=0 to c−1; and

adding the fourth m-sequence and the second m-sequence to generate an Nth secondary scrambling code associated with the primary scrambling code;

wherein, the masking step shifts the first m-sequence cyclically by N chips to generate an Nth secondary scrambling code.

7. The method of claim 6, wherein 18. The method of claim 1, further comprising the step of delaying at least one of the primary scrambling code and secondary scrambling code to produce a Q-channel component, wherein the primary scrambling code and secondary scrambling code are I-channel components.

9. A scrambling code generator, comprising:

a first m-sequence generator to generate a first m-sequence by using a plurality of first registers with first shift register values ai, wherein i=0 to c−1 and where c is the total number of the first registers;

a second m-sequence generator to generate a second m-sequence by using a plurality of second registers with second shift register values bj, wherein j=0 to c−1 and where c is the total number of second registers;

a masking section to mask the first shift register values ai with a first set of mask values Ki to generate a third m-sequence, wherein i=0 to c−1 to generate a third m-sequence;

a first adder to add the first m-sequence and the second m-sequence to generate a primary scrambling code; and
a second adder to add the third m-sequence and the second m-sequence to generate a secondary scrambling code,
wherein the masking section shifts the first m-sequence cyclically by L chips to generate an Lth secondary scrambling code associated with the primary scrambling code.

10. The scrambling code generator of claim 9, wherein the primary scrambling code is one of a plurality of primary scrambling codes and a Kth primary scrambling code is a ((K−1)*M+K)th gold code, where M is a total number of secondary scrambling codes per primary scrambling code and 111. The scrambling code generator of claim 10, wherein the secondary scrambling codes associated with the Kth primary scrambling code are ((K−1)*M+K+1)th to (K*M+K)th gold codes.

12. The scrambling code generator of claim 9, further comprising:

a second masking section to mask the first shift register values ai, with a second set of mask values Kj, wherein j=0 to c−1, to generate a fourth m-sequence; and

a third adder to add the fourth m-sequence and the second m-sequence to generate an N-th secondary scrambling code associated with the primary scrambling code,

wherein the second masking section shifts the first m-sequence cyclically by N chips to generate the Nth secondary scrambling code.

13. The scrambling code generator of claim 9, wherein the masking section shifts the first m-sequence cyclically by masking the first shift register values ai in accordance with Σ(Ki×ai).

14. The scrambling code generator of claim 9, wherein the first m-sequence generator cyclically shifts the first shift register values and the second m-sequence generator cyclically shifts the second shift register values.

15. The scrambling code generator of claim 9, wherein the first m-sequence generator adds predetermined shift register values of the first shift registers based on a first generating polynomial of the first m-sequence, right shifts the first shift register values ai of the first shift registers, and replaces the first register value ac−1 with the result of the addition of the predetermined register values.

16. The scrambling code generator of claim 9, wherein the first m-sequence generator adds a first shift register value a0 with a first shift register a7 to form a next first shift register ac−1.

17. The scrambling code generator of claim 9, wherein the second m-sequence generator adds predetermined shift register values of the second shift registers based on a second generating polynomial of the second m-sequence, right shifts the second shift register values bj of the second shift registers, and replaces the second register value bc−1 with the result of the addition of the predetermined register values.

18. The scrambling code generator of claim 9, wherein the second m-sequence generator adds a second shift register value b0 with a second shift register value b5, b7, and a second shift register value b10 to form a next second shift register value bc−1.

19. The apparatus of claim 9, further comprising a means for delaying at least one of the primary scrambling code and the secondary scrambling code to produce Q-channel component, wherein the primary scrambling code and the secondary scrambling code are I-channel components.

20. A method for generating scrambling codes in mobile communication system having a scrambling code generator, the method comprising the steps of:

generating a ((K−1)*M+K)th gold code as a Kth primary scrambling code, where K is a natural number and M is a total number of secondary scrambling codes per one primary scrambling code; and

generating ((K−1)*M+K+1)th through (K*M+K)th gold codes as secondary scrambling codes associated with the Kth primary scrambling code,

wherein an Lth Gold code is generated by adding an (L−1)-times shifted first m-sequence and a second m-sequence.

21. The method as claimed in claim 20, wherein K is a primary scrambling code number and 1≦K≦512.

22. The method as claimed in claim 21, wherein the first m-sequence is generated from a first shift register memory having a plurality of first shift registers with first shift register values ai, wherein i=0 to c−1 and where c is the total number of the first registers and the (L−1)-times shifted first m-sequence is generated by masking the first shift register values ai with mask values Ki, where i=0 to c−1.

23. The method as claimed in claim 22, wherein the masking is performed according to: Σ(Ki×ai).

24. The method as claimed in claim 20, wherein the generated primary scrambling code and secondary scrambling code are I-channel components and the method further comprises delaying at least one of the primary scrambling code and secondary scrambling code to produce Q-channel components.

25. An apparatus for generating scrambling codes in mobile communication system having a scrambling code generator, comprising:

a first m-sequence generator to generate a first m-sequence;

a second m-sequence generator to generate a second m-sequence; and

at least one adder for generating a ((K−1)*M+K)th Gold code as a Kth primary scrambling code by adding a (((K−1)*M+K)−1)-times shifted first m-sequence and the second m-sequence,

wherein K is a natural number and M is a total number of secondary scrambling codes per one primary scrambling code.

26. The apparatus of claim 25, wherein the secondary scrambling codes of the Kth primary scrambling codes are the ((K−1)*M+K+1)th through (K*M+K)th Gold codes.

27. The apparatus as claimed in claim 26, wherein K is a primary scrambling code number and 1≦K≦512.

28. The apparatus as claimed in claim 25, wherein the first m-sequence generator comprises a plurality of first registers with first shift register values ai, wherein i=0 to c−1 and where c is the total number of the first shift registers, and the scrambling code generator further comprising at least one masking section for generating the n-times shifted first m-sequence by masking the first shift register values ai with mask values Ki, where i=0 to c−1.

29. The apparatus as claimed in claim 28, wherein the masking is performed according to: Σ(Ki×ai).

30. The apparatus as claimed in claim 25, wherein the primary scrambling code and secondary scrambling code are I-channel components and the apparatus further comprises a means for delaying at least one of the primary scrambling codes and secondary scrambling code to produce Q-channel components.

31. A method for generating scrambling codes in mobile communication system having a scrambling code generator, comprising the steps of:

generating a first m-sequence;

generating a second m-sequence; and

generating a ((K−1)*M+K)th Gold code as a Kth primary scrambling code by adding a (((K−1)*M+K)−1)-times shifted first m-sequence and the second m-sequence,

wherein K is a natural number and M is a total number of secondary scrambling codes per one primary scrambling code.

32. The method as claimed in claim 31, further comprising generating ((K−1)*M+K+1)th to (K*M+K)th Gold codes as secondary scrambling codes corresponding to the Kth primary scrambling code.

33. The method as claimed in claim 31, wherein K is a primary scrambling code number and 1≦K≦512.

34. The method as claimed in claim 31, wherein the first m-sequence is generated from a first shift register memory having a plurality of first shift registers with first shift register values ai, wherein i=0 to c−1 and where c is the total number of the first registers and the n-times shifted first m-sequence is generated by masking the first shift register values ai with mask values Ki, where i=0 to c−1.

35. The method as claimed in claim 34, wherein the masking is performed according to: Σ(Ki×ai).

36. The method as claimed in claim 31, wherein each scrambling code is used as an I-channel component and a Q-channel component, corresponding to the I-channel component, is generated by delaying the I-channel component for a predetermined time.

Drawings