CN1150706C - Method for multiplexing WCDMA up channel - Google Patents
Method for multiplexing WCDMA up channel Download PDFInfo
- Publication number
- CN1150706C CN1150706C CNB011367091A CN01136709A CN1150706C CN 1150706 C CN1150706 C CN 1150706C CN B011367091 A CNB011367091 A CN B011367091A CN 01136709 A CN01136709 A CN 01136709A CN 1150706 C CN1150706 C CN 1150706C
- Authority
- CN
- China
- Prior art keywords
- data
- address
- channel
- ram
- row
- 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 - Lifetime
Links
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000008569 process Effects 0.000 claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims description 33
- 238000012545 processing Methods 0.000 claims description 20
- 230000011218 segmentation Effects 0.000 claims description 9
- 230000008676 import Effects 0.000 claims description 4
- 239000007787 solid Substances 0.000 claims description 3
- 239000003550 marker Substances 0.000 claims description 2
- 230000003252 repetitive effect Effects 0.000 claims description 2
- 238000012937 correction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
Images
Landscapes
- Error Detection And Correction (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a method for realizing multiplex processes of WCDMA up channels in a high-speed mode and a multiplexer by using the method. The present invention can realize the functions of all steps of interleaving in a flow, rate adaption and multiplexing, etc. Because the multiplex scheme of WCDMA up channel encoders is complex, if a channel multiplexer is directly designed, the long time delay and high complexity of a system can occur. The WCDMA up channel multiplexer of the present invention adopts the shift arithmetic based on the address calculation to greatly reduce the complexity of realization, and the multiplex processes of the WCDMA up channel is realized by using a short time delay, low storage and computation complexity.
Description
(1) technical field:
The invention belongs to the mobile communication technology field, relate in particular to the channel multiple connection technology of the multimedia service in the 3G (Third Generation) Moblie field.
(2) background technology:
WCDMA coding multiple connection scheme (multiplexing and channel coding scheme) mainly comprises CRC check, error correction coding, and rate-matched interweaves etc.The coding multiple connection scheme of concrete up link is shown in figure .1.Wherein, business of each transmission channel (TrCH) carrying, for the business that different delayed time requires, its transmission time interval (TTI) be different (TTI ∈ 10ms, 20ms, 40ms, 80ms}).
For up link, at first the input data in the transmission time interval (TTI) of each transmission channel are divided into each transmission block, and add the CRC check bit, so that receiving end is carried out error detection occurs at every end.Secondly will add that the data after the check digit are the unit packing with the encoding block, carry out error correction coding.The error correction coding mode has two kinds: the one, and convolution code, code rate are 1/2 or 1/3, two, Turbo code.Adopt Turbo code to improve reliability of data transmission greatly, be applicable to the business that qos requirement is higher.Data flow behind the coding also need be carried out wireless frame length equilibrium, promptly adds the filling bit of some, makes (every 10ms are a frame) such as the every frame data identical length of this transmission channel, and the data flow after filling is carried out interweaving the first time, and promptly interframe interweaves.As the transmission time interval TTI of this transmission channel during greater than 10ms, data flow must be divided into several continuous radio frames, and each frame data carries out rate-matched respectively.Rate-matched is according to certain algorithm some bit in the data flow to be carried out repetition or cutter to go operation, its role is to the data transfer rate of each transmission channel is carried out suitable adjustment, make the gross bit rate after the multiple connection and the data transmission rate of the physical channel that distributed be consistent.The through-rate coupling also can guarantee different rates, and the business datum of different QoS adopts identical power to send.
The data flow process is after above each step, every 10ms with radio frames order multiple connection of each transmission channel together, form a coded composite transport channel (CCTrCH), many if desired code channel transmission, then with the data average mark of this CCTrCH to the identical physical channel of each spreading ratio (being code channel), and the data of every physical channel are carried out interweaving the second time, the data after interweaving can be carried out band spectrum modulation and be sent.
Compare with traditional cdma system, the maximum characteristics of 3G (Third Generation) Moblie are to support to have the multiple business of the variable Rate of different QoS, and this just requires it to have the ability that the professional multiple connection of various radio multimediums is transmitted together.In order to reach this target, the WCDMA system has adopted the complicated coding multiple connection flow process (as shown in Figure 1) of a cover, can send with the solid size road after the business process coding multiple connection of different rates, therefore in wireless connections, even each service rate differs greatly, it also is constant sending data transfer rate and power, thereby has reduced the requirement to power amplifier linearization, has avoided crosstalking between code channel.
Yet, directly data stream is carried out the multiple connection processing and will increase system complexity greatly according to scheme.At first, this scheme step is various, all need between every step data are carried out buffer memory, and the maximum data rate that system supported can reach 2Mb/s, is the business of 80ms for TTI, and each step all needs the buffer memory of 160kb, and its required total storage capacity is huge.Secondly, data stream frequent writes that to read the processing time-delay that is caused be insufferable.
(3) summary of the invention:
The present invention adopts to realize WCDMA up channel multiplexer based on the algorithm of moving of address computation.It provides a kind of high efficiency implementation method for the up channel multiple connection of WCDMA.Compare with direct implementation method, not only reduced computational complexity, and significantly reduced storage capability and handled time-delay.
The inventive method is described below:
By further discovering to method, after the multiple connection of data flow process coding, in fact just variation has taken place in the deposit position in buffer memory, itself does not change data, can calculate the correspondence position of each data in output sequence in the list entries, directly will import data and " move " to outgoing position and get final product.Based on this thought, we have proposed the algorithm of moving based on address computation.
If sequence in={I (k) | k=1,2 ... L
i(L
iBe the in sequence length) and out={O (k) | k=1,2 ... L
o(L
oBe the out sequence length) be respectively the input and output sequence of modules A.If for any k ∈ 1,2 ... L
o, O (k) ∈ in is all arranged, then can set up address corresponding relation between out sequence and the in sequence k → f (k) | k=1,2 ..., L
o.Take out k the output that data promptly can be used as the out sequence from sequence f (k) address.Might as well be referred to as reverse addressing.Otherwise, if for any k ∈ 1,2 ... L
i, I (k) ∈ out is all arranged, then can set up address corresponding relation between in sequence and the out sequence k → f (k) | k=1,2 ..., L
i.Take out the individual output of f (k) that data promptly can be used as the out sequence from sequence k address.Might as well be referred to as forward addressing.
If certain system is X, each module of X inside to be taked addressing forward or backwards, thereby the input data of X are removed relevant position to the output sequence, this is the algorithm of moving based on address computation.This algorithm need be followed three criterions:
Criterion one: realize difficulty as disposable moving; Then can adopt and repeatedly move to reduce complexity, that is: for the X of system, if be difficult to obtain the direct address corresponding relation of its input and output sequence, then it can be divided into s subsystem (s=2,3,), add s-1 level buffer memory altogether at the subsystem boundary, make the addressing of each subsystem realize easily.
Criterion two: the buffer memory that takies is as far as possible few, that is: if adopt r (r=0,1 ...) system complexity of level behind the buffer memory can accept, and just do not take r+1 level buffer memory.
Criterion three: the subsystem addressing system is unified, that is: for each module of subsystem inside, if modules A
1, A
2... both can forward addressing, oppositely addressing again, and module B can only forward addressing or oppositely addressing, then the addressing system of all modules is all unified with module B in this subsystem.(if sub-system internal storage is at module B
1Can only forward addressing, module B
2Oppositely the situation of addressing then illustrates this subsystem direct addressin difficulty, need further decompose this subsystem.)
In the up multiple connection scheme of WCDMA, list entries and the address corresponding relation between the output sequence of directly determining system are the comparison difficulties, reason is that after the chnnel coding to the transmission channel multiple connection the input and output sequence address of each processing module is the relative address in each this TTI of transmission channel, the input and output sequence address of each processing module then was the relative address in this CCTrCH one frame between the transmission channel multiple connection was shone upon to physical channel later on, therefore address mapping relation more complicated between the two is difficult to realize disposable moving.According to criterion one, consider to place level cache, thereby be two subsystems: transmission channel processing section and CCTrCH processing section system divides in transmission channel multiple connection place.Respectively addressing is carried out in transmission channel processing section and CCTrCH processing section and realize than being easier to, therefore according to criterion two, the up multiple connection scheme of WCDMA after just obtaining simplifying, as shown in Figure 2.
A kind of method that realizes the multiple connection of WCDMA up channel, flow process according to the following steps: (1) adds the CRC check bit; (2) transmission block merging/code block segmentation; (3) chnnel coding; (4) transmission channel processing section; (5) CCTrCH processing section.
Produce sequence address at input, calculate each bit d in the sequence successively
1.i, d
2.i... through wireless frame length equilibrium, interweave the deposit position m after radio frame segmentation and the rate-matched in buffer memory for the first time
1, i, m
2, i, and write corresponding data.Other transport channel data are also done identical processing.On the other hand, produce sequence address equally, calculate each bit o among the output sequence O successively at transmitting terminal
1, o
2... through the transmission channel multiple connection, physical channel merges and the correspondence position n in buffer memory before that interweaves for the second time
1, n
2..., read corresponding bits and be data to be sent.Fig. 3 has described this and has moved process.
Can find out that thus this algorithm has been avoided the direct processing to data, but will import the relevant position of data-moving, thereby simplify treatment step, greatly reduce system complexity to output sequence according to the address corresponding relation of input and output sequence.
Beneficial effect of the present invention: this WCDMA up channel multiplexer only needs level cache, and realize owing to adopt the hardware that settles at one go, therefore the data length of a processing clock and a TTI of transmission channel is only depended in its time-delay, so not only greatly reduce implementation complexity, memory space and processing time-delay, and improved system works efficient and throughput, realized complicated WCDMA up channel multiple connection scheme with less cost.
(4) description of drawings:
Fig. 1 is WCDMA up channel coding multiple connection method;
Fig. 2 is the WCDMA coding multiple connection method after simplifying;
Fig. 3 moves algorithm principle figure for the address.
(5) embodiment:
On specific implementation, for the transmission channel processing section, at first produce the sequence address of the data in TTI of certain transmission channel, calculate row n ' and the row m ' of this address before interweaving for the first time.Try to achieve row m after interweaving by m ', i.e. frame number under this address date, according to the rate-matched e value of m frame with should cut a hole or whether repeat number size nrop calculates this address date and should cut a hole or repeat, and put corresponding marker bit, obtain the row n after the rate-matched simultaneously, then the storage address of these data in ram in slice is ram_waddr=Iniaddr (m)+n.Wherein iniaddr (m) deposits initial address for this transmission channel m frame data in ram in slice, calculates and inform this multiplexer by main control unit.From encoder buffer, call over data, and handle accordingly, when flag bit is invalid, data are write ram_waddr place in the ram in slice according to flag bit and rate-matched mode; When flag bit is effective, if cutter goes mode, write data in the ram in slice not then will be if repetitive mode then will write ram in slice after this data repetition.By above steps in sequence data are write relevant position in the ram in slice, promptly finished the radio frames equilibrium, interweave radio frame segmentation and rate-matched and transmission channel multiple connection step for the first time.
For the CCTrCH processing section, for the Computational Physics channel segmentation and the preceding address that interweaves for the second time, at first produce the sequence address of data in the solid size road, obtain the row m of data in interleaver and row n ' by this address, then according to the principle that interweaves for the second time (row writes, and row are read, column interleaving), by table look-up row n before obtaining interweaving of row n ', the address of data is intl_addr=m * 30+n before then interweaving.In addition,, promptly import data and be followed successively by because each code channel data is parallel conveys: the 0th data of code channel 0, the 0th data of code channel 1 ... the 0th data of code channel x, the 1st data of code channel 0 ...Therefore, code channel is deposited initial address iniaddr under should adding on the basis of intl_addr in buffer memory, so ram in slice is read address ram_raddr=intl_addr+iniaddr.Sense data is exported successively from the ram in slice appropriate address, has promptly finished physical channel segmentation and the step that interweaves for the second time.
Claims (2)
1. method that realizes the multiple connection of WCDMA up channel is characterized in that: flow process according to the following steps: (1) adds the CRC check bit; (2) transmission block merging/code block segmentation; (3) chnnel coding; (4) transmission channel processing section; (5) CCTrCH processing section; Wherein, in the transmission channel processing section, at first produce the sequence address of the data in TTI of certain transmission channel, calculate row n ' and the row m ' of this address before interweaving for the first time; Try to achieve row m after interweaving by m ', i.e. frame number under this address date, according to the rate-matched e value of m frame with should cut a hole or whether repeat number size nrop calculates this address date and should cut a hole or repeat, and put corresponding marker bit, obtain the row n after the rate-matched simultaneously, then the storage address of these data in ram in slice is ram waddr=Iniaddr (m)+n; Wherein iniaddr (m) deposits initial address for this transmission channel m frame data in ram in slice, calculate and inform this multiplexer by main control unit, from encoder buffer, call over data, and handle accordingly according to flag bit and rate-matched mode, when flag bit is invalid, data are write ram waddr place in the ram in slice; When flag bit is effective, if cutter goes mode, write data in the ram in slice not then, if repetitive mode, write ram in slice after then these data being repeated, data are write relevant position in the ram in slice, promptly finished the radio frames equilibrium by above steps in sequence, for the first time interweave radio frame segmentation and rate-matched and transmission channel multiple connection step.
2. a kind of method that realizes the multiple connection of WCDMA up channel according to claim 1, it is characterized in that: described CCTrCH processing section, for the Computational Physics channel segmentation and the preceding address that interweaves for the second time, at first produce the sequence address of data in the solid size road, obtain the row m of data in interleaver and row n ' by this address, then according to the principle that interweaves for the second time, row writes, row are read, column interleaving, by table look-up row n before obtaining interweaving of row n ', the address of data is intl addr=m * 30+n before then interweaving; In addition,, promptly import data and be followed successively by because each code channel data is parallel conveys: the 0th data of code channel 0, the 0th data of code channel 1 ... the 0th data of code channel x, the 1st data of code channel 0, Therefore, code channel is deposited initial address iniaddr under should adding on the basis of intl addr in buffer memory, so ram in slice is read address ram raddr=intl addr+iniaddr, sense data is exported successively from the ram in slice appropriate address, has promptly finished physical channel segmentation and the step that interweaves for the second time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011367091A CN1150706C (en) | 2001-10-22 | 2001-10-22 | Method for multiplexing WCDMA up channel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011367091A CN1150706C (en) | 2001-10-22 | 2001-10-22 | Method for multiplexing WCDMA up channel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1347213A CN1347213A (en) | 2002-05-01 |
| CN1150706C true CN1150706C (en) | 2004-05-19 |
Family
ID=4673848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011367091A Expired - Lifetime CN1150706C (en) | 2001-10-22 | 2001-10-22 | Method for multiplexing WCDMA up channel |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1150706C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100454796C (en) * | 2003-03-18 | 2009-01-21 | 华为技术有限公司 | Lattice code modulation method and multiple users receiver |
| CN100571088C (en) | 2004-07-27 | 2009-12-16 | 华为技术有限公司 | The interleaving and de-interleaving method that a kind of anti-period position disturbs |
| CN101488833B (en) * | 2009-01-20 | 2011-07-06 | 北京天碁科技有限公司 | Uplink channel encoding method and downlink channel decoding method for TD-SCDMA system |
| CN101932127B (en) * | 2009-06-23 | 2016-05-18 | 上海摩波彼克半导体有限公司 | The method for designing of digital baseband chip, GSM channel coding/decoding and implementation method |
-
2001
- 2001-10-22 CN CNB011367091A patent/CN1150706C/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| CN1347213A (en) | 2002-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| FI118943B (en) | Device and method for performing coding and speed matching in a CDMA mobile communication system | |
| CN1161887C (en) | Transmission system comprising error correction circuit, interlever and puncturing or repeating device | |
| CN101083512B (en) | Dual-binary system tailbaiting Turbo code coding method and apparatus | |
| CN102237953B (en) | LTE (Long Term Evolution) PDSCH (Physical Downlink Shared Channel) rate de-matching method and device | |
| CN108551384A (en) | The radio data transmission method of gigabit rate magnitude parallel encoding and modulation | |
| KR101498052B1 (en) | Method for multiplexing data information and control information in wireless communication system | |
| CN101087181B (en) | A method for removing interweaving and speed match | |
| CN1140060C (en) | Improved interleaver for Turbo code | |
| CN102447521B (en) | A kind of dissociation rate matching method and device | |
| CN101615915A (en) | The interleaving apparatus of communication system and method | |
| CN1165446A (en) | Technique for minimizing variance of inteference in packetized interference-limited wireless communication systems | |
| CN101060374B (en) | Turbo coding stream processing device and method | |
| CN101159513A (en) | Turbo code velocity matching and code bit reading method | |
| KR100430567B1 (en) | Apparatus and method for processing interleaving/de-interleaving with address generator and channel encoder system using it | |
| CN1150706C (en) | Method for multiplexing WCDMA up channel | |
| FI104673B (en) | Method of transforming the data rate of a signal and transmitter | |
| CN1515095A (en) | Combination of space-time coding and spatial multiplexing and use of orthogonal transforms in space-time coding | |
| CN1347219A (en) | Method for demultiplexing WCDMA up channel | |
| CN1150707C (en) | Method for demultiplexing WCDMA down channel | |
| CN101540651B (en) | Method and device for realizing column interleaving | |
| CN101459494A (en) | Multiple layer interleaving multiplex space-time code system, apparatus and method for data interleaving | |
| CN100438345C (en) | Interlaced device | |
| CN1377142A (en) | Method and device for implementing fast deinterleave | |
| CN1095620C (en) | Baseband shaping filter device and its digital implement method | |
| CN102694620B (en) | Data partitioning method of coding cooperation transmission and apparatus thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: MINISTRY OF INFORMATION INDUSTRY INSTITUTE OF TEL Free format text: FORMER OWNER: MINISTRY OF INFORMATION INDUSTRY INSTITUTE OF TELECOMMUNICATIONS TRANSMISSION; QINGHUA UNIVERSITY Effective date: 20060714 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20060714 Address after: 100045 Beijing City, 11 South Street on the altar Co-patentee after: Tsinghua University Patentee after: Telecommunication Transmission Inst., Ministry of Information Industry Co-patentee after: Zhanxun Communication (Shanghai) Co., Ltd. Address before: 100045 Beijing City, 11 South Street on the altar Co-patentee before: Tsinghua University Patentee before: Telecommunication Transmission Inst., Ministry of Information Industry |
|
| CX01 | Expiry of patent term | ||
| CX01 | Expiry of patent term |
Granted publication date: 20040519 |