CN1299457C - Symbol mapping and channelizing device of asynchronous CDMA communication system - Google Patents
Symbol mapping and channelizing device of asynchronous CDMA communication system Download PDFInfo
- Publication number
- CN1299457C CN1299457C CNB031365477A CN03136547A CN1299457C CN 1299457 C CN1299457 C CN 1299457C CN B031365477 A CNB031365477 A CN B031365477A CN 03136547 A CN03136547 A CN 03136547A CN 1299457 C CN1299457 C CN 1299457C
- Authority
- CN
- China
- Prior art keywords
- binary
- bit
- mentioned
- output
- xor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/16—Code allocation
- H04J13/18—Allocation of orthogonal codes
- H04J13/20—Allocation of orthogonal codes having an orthogonal variable spreading factor [OVSF]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/38—Transceivers, i.e. devices in which transmitter and receiver form a structural unit and in which at least one part is used for functions of transmitting and receiving
- H04B1/40—Circuits
Abstract
The present invention relates to a symbol mapping and channelizing device of an asynchronous code division multiple access (CDMA) communication system, which comprises a binary converter for weighting symbols, a binary symbol converter, a binary OVSF code generator, a binary channelization converter and a mapping device. The device does not use a storage table or a complex operation but uses a binary operation for treatment when carrying out the symbol mapping and channelizing process by a 3G TDD mode; therefore, the present invention has the effects of decreasing required runtime when channelization is carried out in software or hardware, and decreasing system complexity when the device is formed.
Description
Technical field
The present invention relates to a kind of sign map and channel device of asynchronous CDMA communication system, when especially under the 3GPP tdd mode, carrying out the QPSK modulation, not to use multiplication, but come conversion symbol mapping and channelizing process with binary arithmetic operation, in software and hardware practice, can reduce processing time and complexity.
Background technology
Generally speaking, code division multiple address communication system carries out the reception and the transmission of several subscriber signals by same channel.Especially the communication system of employing code division multiple access (Code Division Multiple Access) mode, because it is distinguished each subscriber signal mutually according to orthogonalized code, so, can utilize identical channel, transmit several subscriber signals in the identical time.
For this reason, in the sender of code division multiple address communication system, each data bit of each subscriber signal after multiply by the intrinsic orthogonalization code of distributing to relative users, transmits by same channel.On the contrary, in receiver, each data bit of each subscriber signal that receives by same channel multiply by orthogonalized code identical when transmitting once more, then at a chip period integrates output bit, exports the signal of relative users.
This reception/transmission work can be in the receiver of code division multiple address communication system, supposes and has known that the intrinsic orthogonal code of the subscriber signal that receives implements in advance.
At this moment, represent that the spreading rate (Chip Rate) of the transfer rate of above-mentioned orthogonalization code is higher than the transfer rate-bit rate (Bit Rate) of user data.
So (Spreading Factor, SF), this spreading factor (SF) expression is used to multiply by the length of the orthogonalization code of a bits of user data just can to obtain spreading factor to spreading rate divided by bit rate.
On the other hand, in the receiver of code division multiple address communication system, multiply by identical orthogonal code twice, so, though can extract the user data that needs, because the composition of orthogonalization code can not be eliminated, corresponding to disturbing and wrong other data still keep with the form of noise.This noise is behind the integrator that has passed through receiver, and its intensity reduces greatly.
Therefore, realized time synchronized between each user data, in addition, when the spreading rate of supposing all customer data was identical, code division multiple access system made the code of distinguishing each user carry out orthogonalization mutually, thereby can remove the interference between each user data.At this moment, if each subscriber signal is used the different code spread factors, so, each user's data transfer rate is then different.This code is called as OVSF (Orthogonal Variable Spreading Factor-Orthogonal Variable Spreading Factor OVSF) sign indicating number.
Above-mentioned ovsf code is to put forward in the physical layer at the standardized size-3GPP asynchronous system of the 3rd third-generation mobile communication technology, is used for distinct channel or user in down channel, is used for distinct channel in up channel.
In down channel, the data-modulated mode is used QPSK, and following table 1 is for each binary data is mapped as the table that the QPSK symbol defines.
Table 1
| Continuous pattern of binary bits b}`_{ (1, n) } ^{ (k, i) }, b}`_{ (2, n) } ^{ (k, i) } | Complex symbol d}`_{n}^{ (k, i) } |
| 00 | +j |
| 01 | +1 |
| 10 | -1 |
| 11 | -j |
When 3GPP TDD used QPSK, each bit of physical channel mapping was according to table 1, and per 2 bits are mapped as complex symbol.That is, continuous 2 bits { b}`_{ (1, n) } ^{ (k, i) }, { b}`_{ (2, n) } ^{ (k, i) } be mapped to a complex symbol { d}`_{n}^{ (k, i) }.So the complex symbol of mapping can pass through the channelizing process.
In order to carry out the channelizing process, at first, should generate the channelizing symbol according to spreading factor.The channelizing symbol is the symbol with orthogonality, serves as that the basis generates with the code tree as Fig. 1.
At this moment, { c}`_{Q=1}^{k=1} is the beginning of code tree, from { c}`_{Q=1}^{k=1} isolates the code of doing { c}`_{Q=2}^{k=1} and the { c}`_{Q=2}^{k=2} that are equivalent to two ends.That is, { { the c}`_{Q=1}^{k=1} code forms c}`_{Q=2}^{k=1} code, and { { c}`_{Q=1}^{k=1} takes advantage of the code of (1) and { the c}`_{Q=1}^{k=1} code forms by connecting for c}`_{Q=2}^{k=2} for code by connecting two.
{ c}`_{Q=2}^{k=1} is with { c}`_{Q=2}^{k=2} also utilizes the process identical with said method, is divided into doing of two ends, draws code tree from code.
At this moment, the code a of user k
K, jIn, at spreading factor=N
kC
Q, n, n=1,2 ... select it to use in the lump among the Q, the ovsf code of Shi Yonging begins certainly, to the root of code tree the ovsf code of doing that c}`_{Q=1}^{k=1} extends and from the ovsf code that will use the ovsf code on isolated the doing, should be by system's use at present.
As shown in Figure 2, the channelizing process is that (S13 S14) carries out, and promptly according to the notation index k of spreading factor in each data symbol and use, (S11 S12), multiply by ovsf code then, carries out spread spectrum to multiply by the multiplier factor that defines in the following table 2 with spectrum spreading method.As a result,, should preserve mapping table, realize channelizing, need carry out complex multiplication for making by this table mapped symbol in order to carry out sign map.
But in above-mentioned conventional art, when using the QPSK modulation system under the 3GPP tdd mode, per 2 bits of binary message that shone upon by physical channel are mapped as a symbol, and mapped symbol can be passed through the channelizing process.But, in order to carry out sign map, need mapping table, in addition,, also need complex multiplication in order to carry out the channelizing process.This computing of crossing the range request considerable scale, so, when constituting software or hardware, the problem that exists complexity to increase.
Table 2
| k | {w}`_{Q＝1} ^{(k)} | {w`}_{Q＝2} ^{(k)} | {w}`_{Q＝4} ^{(k)} | {w}`_{Q＝8} ^{(k)} | {w}`_{Q＝16} ^{(k)} |
| 1 | 1 | 1 | -j | 1 | -1 |
| 2 | + | 1 | +j | - | |
| 3 | +j | + | 1 | ||
| 4 | -1 | -1 | 1 | ||
| 5 | -j | +j | |||
| 6 | -1 | -1 | |||
| 7 | -j | -1 | |||
| 8 | 1 | 1 | |||
| 9 | -j | ||||
| 10 | +j | ||||
| 11 | 1 | ||||
| 12 | +j | ||||
| 13 | -j | ||||
| 14 | -j | ||||
| 15 | +j | ||||
| 16 | -1 |
Summary of the invention
Therefore, the present invention develops for solving as above problem, purpose is to provide a kind of sign map and channel device of asynchronous CDMA communication system, when it carries out sign map and channelizing process at the 3G tdd mode, do not use storage list or complex operation, but handle, therefore with binary arithmetic operation, when constituting software and hardware, can reduce processing time and complexity.
For achieving the above object, feature of the present invention is to have following structure: weighting symbol binary translator output is corresponding to 0,1 binary number of weighting symbol with corresponding to 0,1 binary number of weighting imaginary number; The binary character transducer carries out two continuous bit streams " XOR " logical operation, by logical not it is divided into real part and imaginary part then, according to binary number, above-mentioned real part and imaginary part are exchanged and exported afterwards corresponding to the imaginary number of exporting from above-mentioned weighting symbol binary translator; Binary system OVSF code generator is mapped as 0,1 also output to the ovsf code that generates according to the selection of spreading factor; The binary channel transducer, it has following structure: the 1st XOR receive the expression weighting symbol come from weighting symbol binary translator bit, come from the bit stream that depends on the binary system ovsf code of binary system OVSF code generator, they are carried out XOR computing and output; The 2nd XOR is to from the bit of the expression weighting imaginary number of above-mentioned weighting symbol binary translator input with from the above-mentioned the 1st " XOR " bit stream of logic output carries out XOR computing and output; And the 1st logic product is to carrying out logic product computing and output from the bit of above-mentioned the 2nd XOR input with corresponding to the bit of the real part of an above-mentioned binary character transducer; The 2nd logic product is to carrying out logic product computing and output from the bit of above-mentioned the 1st XOR input with corresponding to the bit of the imaginary part of above-mentioned binary character transducer; Mapper is mapped as 1 ,-1 binary number and output to 0,1 binary number that is divided into real part and imaginary part from above-mentioned binary channel transducer input respectively.
Description of drawings
Fig. 1 generates the required code tree schematic diagram of OVSF code.
Fig. 2 is the flow chart of sign map and channelizing process in the past.
Fig. 3 is the sign map of Asynchronous Code Division Multiple Access of the present invention system and the structured flowchart of channel device.
Fig. 4 is the structured flowchart of the binary system OVSF code generator of Fig. 3.
Embodiment
Describe embodiments of the invention with reference to the accompanying drawings in detail.
Fig. 3 is the sign map of Asynchronous Code Division Multiple Access of the present invention system and the structured flowchart of channel device.As shown in the figure, it has following structure: weighting symbol binary translator (20) output is corresponding to 0,1 binary number of weighting symbol with corresponding to 0,1 binary number of weighting imaginary number; Binary character transducer (10) carries out the XOR computing to two continuous bit streams, by logical not it is divided into real part and imaginary part, then according to corresponding to virtual binary number, the data of above-mentioned real part and imaginary part are exchanged and export from the output of above-mentioned weighting symbol binary translator; Binary system OVSF code generator (40) is mapped as 0,1 also output to the ovsf code that generates according to the selection of spreading factor; Binary channel transducer (30) from the binary number that is divided into real part and imaginary part of above-mentioned binary character transducer (10) input each with the binary number of above-mentioned weighting symbol binary translator (20) input with carry out the binary number that the XOR computing draws from the binary number of above-mentioned binary system OVSF code generator (40) input and carry out logic product computing and output; Mapper (50) is mapped as 1 ,-1 binary number and output to 0,1 binary number that is divided into real part and imaginary part from above-mentioned binary channel transducer (30) input respectively.
The feature of above-mentioned binary character transducer (10) is to be made of following structure: XOR (11) receives two continuous bit streams, carries out XOR computing and output; Logical not (12) reverses to the bit from above-mentioned XOR (11) input, generates imaginary part and output; Transducer (13) is according to the bit of expression weighting imaginary number in the weighting symbol binary translator (20), to corresponding to real part through the output bit of above-mentioned XOR (11) computing with change and export corresponding to the output bit through above-mentioned logical not (12) computing of imaginary part, or directly export without conversion.
Above-mentioned binary channel transducer (30) has following structure: the 1st XOR (33) receive the expression weighting symbol come from weighting symbol binary translator (20) bit, come from the bit stream that depends on the binary system ovsf code of binary system OVSF code generator (40), they are carried out XOR computing and output; The 2nd XOR (34) is to carrying out XOR computing and output from the bit of the expression weighting imaginary number of above-mentioned weighting symbol binary translator (20) input with from the bit stream of above-mentioned the 1st XOR (33) output; Trigger (flip-flop) (31,32) is preserved respectively corresponding to the real part of importing from above-mentioned binary character transducer (10) and the bit of imaginary part in the process that generates ovsf code; The 1st logic product (35) is to carrying out logic product computing and output from the bit of above-mentioned the 2nd XOR (34) input with corresponding to the bit of the real part of above-mentioned trigger (flip-flop) (31); The 2nd logic product (36) is to carrying out logic product computing and output from the bit of above-mentioned the 1st XOR (33) input with corresponding to the bit of the imaginary part of above-mentioned trigger (flip-flop) (32).Embodiments of the invention are described with reference to the accompanying drawings.
Binary system OVSF code generator (40) generates ovsf code according to the spreading factor of selecting, with the code that generates ± 1 be mapped as 0,1 and output.Fig. 3 is a binary system OVSF code generator structure chart.According to the difference of clock, shelter device (42), the XOR (43) that carries out XOR computing and output from the above-mentioned bit stream of sheltering device (42) output is constituted by the 8 bit generators (41) that generate 8 bit streams, to what the output of above-mentioned 8 bit generators (41) was sheltered and exported.
At this, the ovsf code generating process of binary system OVSF code generator (40) belongs to and exceeds technology contents of the present invention, therefore omits its detailed operation explanation.
Weighting symbol binary translator (20) generates corresponding to the bit of weighting symbol with corresponding to the bit of weighting imaginary number and also exports.Wherein, when the weighting symbol is negative, be 1 corresponding to the bit of symbol, on the contrary, when being positive number, then export 0.
In addition, bit corresponding to the imaginary number of weighting symbol binary translator (20) is imported from binary character transducer (10), it has determined it is the real part of conversion binary signal converter (10) and the output bit and the output of imaginary part, still do not change and directly output, if imaginary number is arranged in the weighting, so, the upconverter of binary character transducer (10) is changed downwards, down-converter is changed upward, otherwise does not change.
Binary character transducer (10) receives two continuous bit stream inputs and carries out the XOR computing, generates the bit corresponding to real part, with this bit inversion, generates the bit corresponding to imaginary part by logical not (12).
As the above-mentioned explanation of doing, the transducer (13) of binary character transducer (10) is according to the bit corresponding to the imaginary number of importing from weighting symbol binary translator (20), to changing and export, or do not change and directly output corresponding to the bit of real part and imaginary part.
Corresponding to from the real part of above-mentioned binary character transducer (10) output and the bit of imaginary part, be imported into the trigger (flip-flop) (31,32) of binary channel transducer (30), and be retained to the ovsf code generation.
The 1st XOR (33) of binary channel transducer (30) receive the expression weighting symbol that comes from weighting symbol binary translator (20) bit, come from the bit stream that depends on the binary system ovsf code of binary system OVSF code generator (40), they are carried out XOR computing and output.
In addition, the 2nd XOR (34) of binary channel transducer (30) carries out XOR computing and output to the bit of expression weighting imaginary number in the above-mentioned weighting symbol binary translator (20) with from the bit stream that above-mentioned the 1st XOR (33) is exported.
Above-mentioned two XORs (33,34) are being undertaken a kind of bit calculating process, promptly the bit corresponding to real part and imaginary part be multiply by symbol and imaginary number.The following describes calculating process corresponding to the final output bit of the real part of binary channel transducer (30) and imaginary part.
The 1st logic product (35) of binary channel transducer (30) is to carrying out logic product computing and output from the bit of above-mentioned the 2nd XOR (34) input with corresponding to the bit of the real part of above-mentioned trigger (flip-flop) (31).
And the 2nd logic product (36) of binary channel transducer (30) is to carrying out logic product computing and output from the bit of above-mentioned the 1st XOR (33) input with corresponding to the bit of the imaginary part of above-mentioned trigger (flip-flop) (32).
Corresponding to being input to mapper (50) from the real part of above-mentioned binary channel transducer (30) output and the bit of imaginary part, shine upon and export, wherein, 0 mapping 1,1 shines upon-1.
Through said process, the value of final output is to be mapped as symbol by binary data, and symbol is carried out the resulting complex values of channelizing.
As the above-mentioned detailed description of doing, when the present invention carries out sign map and channelizing process at the 3G tdd mode, do not use storage list or complex operation, but only handle with binary arithmetic operation, therefore, can reduce in software and hardware, to carry out channelizing process required running time, the complexity of system when reducing constituent apparatus.
Claims (3)
1. the sign map of an asynchronous CDMA communication system and channel device is characterized in that comprising: weighting symbol binary translator (20), and its output is corresponding to 0,1 binary number of weighting symbol with corresponding to 0,1 binary number of weighting imaginary number; Binary character transducer (10), it carries out the XOR computing to two continuous bit streams, by logical not it is divided into real part and imaginary part then, according to binary number, above-mentioned real part and imaginary part are exchanged and exported afterwards corresponding to the imaginary number of exporting from above-mentioned weighting symbol binary translator (20); Binary system OVSF code generator (40), its ovsf code that generates according to the selection of spreading factor are mapped as 0,1 also output; Binary channel transducer (30), it has following structure: the 1st XOR (33) receives the bit that comes from weighting symbol binary translator (20) expression weighting symbol, the bit stream that depends on the binary system ovsf code that comes from binary system OVSF code generator (40), and they are carried out XOR computing and output; The 2nd XOR (34) is to from the bit of the expression weighting imaginary number of above-mentioned weighting symbol binary translator (20) input with from the above-mentioned the 1st " XOR " bit stream of logic (33) output carries out XOR computing and output; And the 1st logic product (35) is to carrying out logic product computing and output from the bit of above-mentioned the 2nd XOR input with corresponding to the bit of the real part of an above-mentioned binary character transducer (10); The 2nd logic product (36) is to carrying out logic product computing and output from the bit of above-mentioned the 1st XOR (33) input with corresponding to the bit of the imaginary part of above-mentioned binary character transducer (10); Mapper (50), its 0,1 binary number that is divided into real part and imaginary part from above-mentioned binary channel transducer (30) input is mapped as 1 ,-1 binary number and output respectively.
2. asynchronous CDMA communication system sign map according to claim 1 and channel device, it is characterized in that above-mentioned binary character transducer (10) has following structure: XOR (11) receives two continuous bit streams, carries out XOR computing and output; Logical not (12) reverses to the bit from above-mentioned XOR (11) input, generates imaginary part and output; Transducer (13) is according to the bit of expression weighting imaginary number in the weighting symbol binary translator, to corresponding to real part through the output bit of above-mentioned XOR computing with change corresponding to the output bit through above-mentioned logical not computing of imaginary part and output or real part and imaginary part without directly output of conversion.
3. asynchronous CDMA communication system sign map according to claim 1 and channel device, it is characterized in that above-mentioned binary channel transducer (30) also comprises: two trigger flip-flop (31,32), it is preserved respectively corresponding to the real part of importing from above-mentioned binary character transducer (10) and the bit of imaginary part in the process that generates ovsf code.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR0065687/2002 | 2002-10-26 | ||
| KR10-2002-0065687A KR100511294B1 (en) | 2002-10-26 | 2002-10-26 | Symbol mapping and channelization apparatus for asynchronous cdma |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1492613A CN1492613A (en) | 2004-04-28 |
| CN1299457C true CN1299457C (en) | 2007-02-07 |
Family
ID=34270519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031365477A Expired - Fee Related CN1299457C (en) | 2002-10-26 | 2003-05-23 | Symbol mapping and channelizing device of asynchronous CDMA communication system |
Country Status (2)
| Country | Link |
|---|---|
| KR (1) | KR100511294B1 (en) |
| CN (1) | CN1299457C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100511299B1 (en) * | 2002-12-13 | 2005-08-31 | 엘지전자 주식회사 | Data symbol mapping and spreading apparatus for mobile communication system |
| CN111769845B (en) * | 2020-06-30 | 2022-03-22 | 电子科技大学 | Weighted superposition channelization method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1337798A (en) * | 2001-09-03 | 2002-02-27 | 信息产业部电信传输研究所 | Distribution method of orthogonal variable bandspread factor code |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100396649B1 (en) * | 1999-11-16 | 2003-09-02 | 엘지전자 주식회사 | optimal code mapping method of bi-orthogonal coding for variable bit-length information |
| IT1314345B1 (en) * | 1999-12-30 | 2002-12-09 | Telit Mobile Terminals Spa | PROGRAMMABLE GENERATOR FOR THE GENERATION OF ORTHOGONAL CODES VARIABLE SPREADING FACTOR FOR COMMUNICATION SYSTEMS A |
| DE10004873A1 (en) * | 2000-02-04 | 2001-08-23 | Infineon Technologies Ag | Generating orthogonal code with variable spreading factor enables code words to be generated with very low circuit costs - involves computing computation index, storing as binary word, computing computation index data word width, exchanging significant data bits, logic processing |
| US7248698B2 (en) * | 2001-04-06 | 2007-07-24 | Interdigital Technology Corporation | System for generating pseudorandom sequences |
-
2002
- 2002-10-26 KR KR10-2002-0065687A patent/KR100511294B1/en not_active IP Right Cessation
-
2003
- 2003-05-23 CN CNB031365477A patent/CN1299457C/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1337798A (en) * | 2001-09-03 | 2002-02-27 | 信息产业部电信传输研究所 | Distribution method of orthogonal variable bandspread factor code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1492613A (en) | 2004-04-28 |
| KR100511294B1 (en) | 2005-08-31 |
| KR20040036482A (en) | 2004-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1105437C (en) | Despreading of direct sequence spread spectrum communications signals | |
| CN1260895C (en) | Spread spectrum signal generating device and method in transmitter of mobile communications system | |
| CN1250284A (en) | Code division multiple access system | |
| CN109587090B (en) | Three-path carrier index differential chaotic shift keying modem and method | |
| CN1754324A (en) | Application of spreading codes to signals | |
| AU2001220988B2 (en) | Efficient spreader for spread spectrum communication systems | |
| CN1145274C (en) | Spread-spectrum communication device | |
| AU2001220988A1 (en) | Efficient spreader for spread spectrum communication systems | |
| CN1992689B (en) | Method for improving inter-carrier interference of OFDM system | |
| CN1426635A (en) | Post processing of spreading codes in mobile telecommunications system | |
| CN1434588A (en) | Time-frequency union spreading method based on OFDM-CDMA for broadband radio communication system | |
| CN1299457C (en) | Symbol mapping and channelizing device of asynchronous CDMA communication system | |
| CN1140074C (en) | Frequency modulation circuit | |
| CN1327632C (en) | Apparatus for mapping and spreading data symbols in mobile communication systems | |
| CN1118975C (en) | Discontinuous emission treating method and device in wideband CDMA system | |
| CN1155185C (en) | Method for limiting dynamic range of CDMA signals | |
| CN101288253B (en) | Method and system for spreading and scrambling downlike physical channels | |
| CN101295995B (en) | Method and device for signal modulation and spread-spectrum process | |
| CN1251435C (en) | Method of generating bidimensional orthogonal variable spread spectrum coefficient code in multi-carrier wave direct sequency CDMA cemmunication system | |
| CN1694373A (en) | Method for solving multidress interference in TD-SCDMA system | |
| CN1148027C (en) | Multistage CDMA spectrum spreading communication method for efficient information transmission | |
| CN1606852A (en) | Method and apparatus of cross-correlation | |
| CN1449144A (en) | CDMA frequency spreading and despreading method and transmitter, receiver and communication system | |
| Olsovsky et al. | An efficient digital signal processing method for RRNS-based DS-CDMA systems. | |
| CN101087279B (en) | Code channel allocation method for code division and multi-task system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: LANGCHAO LEJIN DIGITAL MOBILE COMMUNICATION CO., L Free format text: FORMER OWNER: LG ELECTRONICS (CHINA) R + D CENTER CO., LTD. Effective date: 20120328 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100102 CHAOYANG, BEIJING TO: 264001 YANTAI, SHANDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20120328 Address after: 264001 No. 228 Changjiang Road, Yantai economic and Technological Development Zone, Shandong, China Patentee after: Langchao Lejin Digital Mobile Communication Co., Ltd. Address before: Two Beijing 100102 Chaoyang District city in Wangjing Lize Park No. 203 Petrova building block B Patentee before: LG Electronic (China) Research and Development Center Co., Ltd. |
|
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070207 Termination date: 20140523 |