WO2016019686A1 - Procédé pour planifier la programmation de la transmission de canaux en liaison montante et dispositif associé - Google Patents

Procédé pour planifier la programmation de la transmission de canaux en liaison montante et dispositif associé Download PDF

Info

Publication number
WO2016019686A1
WO2016019686A1 PCT/CN2014/094814 CN2014094814W WO2016019686A1 WO 2016019686 A1 WO2016019686 A1 WO 2016019686A1 CN 2014094814 W CN2014094814 W CN 2014094814W WO 2016019686 A1 WO2016019686 A1 WO 2016019686A1
Authority
WO
WIPO (PCT)
Prior art keywords
processing
timing
scheduling
ifft
uplink channel
Prior art date
Application number
PCT/CN2014/094814
Other languages
English (en)
Chinese (zh)
Inventor
杨睿
颜达
Original Assignee
深圳市中兴微电子技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 深圳市中兴微电子技术有限公司 filed Critical 深圳市中兴微电子技术有限公司
Publication of WO2016019686A1 publication Critical patent/WO2016019686A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to a channel transmission technology, and in particular, to a scheduling method and apparatus for uplink channel transmission timing in an evolved Long Term Evolution Advanced (LTE-A) system.
  • LTE-A Long Term Evolution Advanced
  • the uplink channel includes a Physical Uplink Shared Channel (PUSCH), a Physical Uplink Control CHannel (PUCCH), and a Sounding Reference Signal (SRS).
  • PUSCH Physical Uplink Shared Channel
  • PUCCH Physical Uplink Control CHannel
  • SRS Sounding Reference Signal
  • Channel type such as physical random access channel (PRACH)
  • information processed by the uplink channel includes uplink service data, Hybrid Automatic Repeat Request Acknowledgement (HARQ-ACK), and rank indication (RI) , Rand Index), Channel Quality Indicator (CQI), Scheduling Request Signal (SR, Scheduling Request), Sounding Reference Signal, Preamble, Demodulation Reference Signal (DMRS) And other information.
  • PRACH Physical random access channel
  • HARQ-ACK Hybrid Automatic Repeat Request Acknowledgement
  • RI rank indication
  • CQI Channel Quality Indicator
  • SR Scheduling Request
  • Sounding Reference Signal Preamble
  • DMRS Demodulation Reference Signal
  • the data range sent by the PUSCH is 1 RB to 100 RB.
  • the location of the PUSCH DMRS is symbol 2 and symbol 9, and the extended cyclic prefix (ECK, Extended cyclic prefix)
  • the location of the PUSCH DMRS is symbol 1 and symbol 7;
  • the PUCCH transmission data is 1 RB; wherein the location of the PUCCH DMRS in the case of the Normal cyclic prefix and the Extended cyclic prefix is different according to different PUCCH format formats, such as As shown in 1 Table 1 shows the correspondence between the location of the PUCCH DMRS in the case of the Normal cyclic prefix and the Extended cyclic prefix and the PUCCH format format.
  • the SRS transmission data is a minimum of 2 RBs and a maximum of 48 RBs.
  • the mapping position of the SRS is transmitted only in the last symbol, or only in the second last symbol, or in the last two symbols, depending on the situation.
  • each subframe is composed of 12 or 14 symbols in different CP modes.
  • the transmission mechanism of the entire uplink is: latching the parameters of the high-level configuration at the time point of transmitting the 10th symbol of one subframe before the current subframe is processed; when processing the symbols of the current subframe, the time pair of the two symbols is advanced.
  • the data is subjected to corresponding symbol level calculation, and the data is subjected to Inverse Fast Fourier Transform (IFFT) and filter processing in advance of one symbol; finally, it is transmitted through the corresponding RF module.
  • IFFT Inverse Fast Fourier Transform
  • the embodiments of the present invention provide a scheduling method and apparatus for uplink channel transmission timing, which can at least solve the above problems in the prior art.
  • the embodiment of the invention provides a scheduling method for uplink channel transmission timing, and the method includes:
  • the timing of each uplink channel transmission is scheduled according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the determining a maximum time overhead for a signal processing procedure of each uplink channel includes: determining a symbol level processing procedure of each uplink channel, an inverse fast Fourier transform IFFT data processing, and a one-half carrier frequency offset processing, respectively.
  • the scheduling of the timings of sending the uplink channels according to the maximum time overhead of the signal processing procedure of each uplink channel includes:
  • the timing sequence scheduling is performed on the IFFT output process and the IFFT random access memory RAM reading process. cloth;
  • the method further includes: performing timing on the demodulated reference signal DMRS processing procedure, the channel sounding reference signal SRS processing procedure, and the scheduling request signal SR processing process according to a maximum time overhead of a symbol level processing procedure of each uplink channel. The scheduling on the top.
  • the method further includes:
  • the timing of the filter processing is determined based on the timing of the input data to the buffer process.
  • An embodiment of the present invention further provides a scheduling apparatus for uplink channel transmission timing, where the apparatus includes: a time determining module and a timing scheduling module, where
  • the time determining module is configured to determine a maximum time of a signal processing process of each uplink channel
  • the timing scheduling module is configured to schedule the timing of each uplink channel transmission according to a maximum time overhead of the signal processing procedure of each uplink channel.
  • the time determining module determines the maximum time overhead of the signal processing process of each uplink channel, including: determining symbol level processing of each uplink channel, IFFT data processing, and one-half carrier frequency offset processing, and inputting data, respectively.
  • the maximum time overhead to the buffer buffer process.
  • the timing scheduling module includes a first scheduling unit, a second scheduling unit, and a third scheduling unit, where
  • the first scheduling unit is configured to perform scheduling scheduling on the PUSCH processing process and the PUCCH processing process according to a maximum time overhead of a symbol level processing procedure of each uplink channel;
  • the second scheduling unit is configured to: according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing procedure and the PUCCH processing procedure, the IFFT output process, the IFFT random access memory RAM The reading process performs scheduling scheduling on the timing;
  • the third scheduling unit is configured to process according to IFFT data and one-half carrier frequency offset processing Maximum time overhead of the process, maximum time overhead of input data to the buffer process, and timing of the PUSCH process, the PUCCH process, the IFFT output process, the IFFT random access memory RAM read process, the input data to the buffer, and the IFFT sign bit
  • the clearing process is scheduled for scheduling.
  • the timing scheduling module further includes a fourth scheduling unit, configured to perform a demodulated reference signal DMRS processing procedure, a channel sounding reference signal SRS processing process, according to a maximum time overhead of a symbol level processing procedure of each uplink channel,
  • the scheduling request signal SR process performs scheduling scheduling on the timing.
  • the timing scheduling module includes a fifth scheduling unit, configured to determine a timing of the resource mapping process according to timings of the PUSCH processing procedure and the PUCCH processing procedure, and determine filtering according to timing of the input data to the buffer process. The timing of the process.
  • the method and device for scheduling the uplink channel transmission timing determines the maximum time overhead of the signal processing process of each uplink channel; and sends the uplink channel according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the timing is scheduled. In this way, resources can be reused to the maximum extent under the premise of function coverage, so as to save power consumption and area; and each channel is arranged reasonably in timing, thereby avoiding conflicts in timing.
  • FIG. 1 is a schematic flowchart of a scheduling method for uplink channel transmission timing according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a signal processing process of an uplink channel according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of an arrangement of non-SRS uplink timings according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of an SRS uplink timing arrangement according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a scheduling apparatus for uplink channel transmission timing according to an embodiment of the present invention.
  • determining a maximum time overhead of a signal processing process of each uplink channel The timing of each uplink channel transmission is scheduled according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the determining a maximum time overhead of the signal processing process of each uplink channel includes: determining a symbol level processing process, an IFFT data processing, and a half carrier frequency offset processing process of each uplink channel, and inputting data into a buffer (buffer) The maximum time overhead of the process.
  • the scheduling of the timing of sending each uplink channel according to the maximum time overhead of the signal processing procedure of each uplink channel includes:
  • the PUSCH processing procedure the PUCCH processing procedure, the IFFT output process, and the IFFT random storage Taking a memory (RAM, Ramdom Access Memory) reading process, inputting data to buffer, and IFFT sign bit clearing process, DMRS processing, SRS processing, and SR processing to perform timing scheduling; and according to the PUSCH
  • the processing procedure and the timing of the PUCCH processing process determine the timing of the resource mapping process; and determine the timing of the filter processing process according to the timing of the input data to the buffer process.
  • the flow of the scheduling method for the uplink channel transmission timing in the embodiment of the present invention is as shown in FIG. 1 , and includes the following steps:
  • Step 101 Determine a maximum time overhead of a signal processing process of each uplink channel.
  • the determining the maximum time overhead of the signal processing procedure of each uplink channel includes: determining a symbol level processing procedure of each uplink channel, an IFFT data processing, a half carrier frequency offset processing, and inputting data to a buffer buffer process, respectively.
  • the maximum time overhead includes: determining a symbol level processing procedure of each uplink channel, an IFFT data processing, a half carrier frequency offset processing, and inputting data to a buffer buffer process, respectively.
  • FIG. 2 is a schematic diagram of a signal processing process of the uplink channel according to the embodiment of the present invention, as shown in FIG.
  • the signal processing process in the embodiment of the present invention includes the following steps Step:
  • Step 101a performing symbol level processing on each channel
  • symbol level processing refers to modulation, scrambling and spread spectrum processing of data.
  • the data is processed according to the protocol for easy transmission and reception.
  • the symbol level processing for each channel includes the following procedure.
  • the labels A1-C1 in the following process are only for distinguishing different processing procedures, and do not limit the execution order.
  • Step A1 performing symbol level processing on the PUSCH
  • the data stored in the interleaved memory unit needs to be read, the symbol level data processing is performed, and then the processed data is subjected to discrete Fourier transform (DFT, Discrete Fourier Transform) calculation;
  • DFT discrete Fourier transform
  • Step B1 performing symbol level processing on the PUCCH
  • the symbol level processing for PUCCH is mainly processing of symbol level data, but PUCCH format 3 (format 3 of an uplink control channel specified by the protocol) in the PUCCH needs to perform DFT operation after performing symbol level data processing;
  • Step C1 performing symbol level processing on the SRS, the PUSCH DMRS, and the PUCCH DMRS;
  • SRS, PUSCH DMRS, and PUCCH DMRS only need to process symbol data.
  • the PUSCH DMRS and SRS processing time is relatively long, it needs to be calculated in advance and then stored.
  • Step 101b performing resource mapping processing on each channel
  • the transmitted address protocol is required. Therefore, after performing symbol level processing on the channel, the corresponding data needs to be matched with the corresponding address through resource mapping processing, so that the next processing can be performed.
  • the weighting coefficient is related to the empirical value of the conventional transmitted data, and is determined according to the following calculation process:
  • PUCCH_scale1 8/sqrt(LinearPowerRate)
  • PUSCH_scale1 8*sqrt(LinearPowerRate)
  • LinearPowerRate is linear power
  • M_PUSCH_RB is the bandwidth indicating uplink transmission, represented by the number of resource blocks
  • N is the number of points of the ifpt
  • scale1 and scale3 are two different weighting factors
  • PUCCH scale and PUSCH scale respectively represent the weighting factors of different channels.
  • Step 101c performing IFFT processing
  • the IFFT processing is to convert the data in the frequency domain and the time domain, and the purpose is to realize modulation of multiple carriers to ensure correct data transmission.
  • the processing of the IFFT it is first necessary to read data output by the resource mapping process in the IFFT RAM, where the data includes PUCCH, PUSCH, PRACH, and corresponding reference signals such as: SRS, PUCCH DMRS, PUSCH DMRS, SR, etc.;
  • the data is subjected to IFFT processing.
  • the IFFT process may contain some or all of the above data. After performing IFFT calculation on the data of each channel, the process proceeds to a half-carrier frequency offset processing;
  • Step 101d one-half carrier frequency offset processing
  • the data needs to be weight-weighted according to the parameters of the upper layer, and then the data is written to the buffer according to different carrier modes.
  • the parameters of the high-level configuration determine the working state of the one-half carrier frequency offset module.
  • the high-level configuration is a single-tone mode, and the data is directly written to the corresponding one.
  • the address unit is the other is the non-monophonic mode, which causes the weighted data to be processed again for the carrier frequency offset; the two different processing methods are configured by the upper layer.
  • the carrier mode includes a single carrier and a dual carrier; when a single carrier is used, only two storage units are used for storage: the storage unit A and the storage unit B.
  • the storage mode is ping-pong storage mode, that is, the first segment of data is stored in the storage unit A, the second segment of data is stored in the storage unit B, the third segment of data is stored in the storage unit A, and so on; in the dual-carrier mode Four storage units are used, and each two data storage for one carrier.
  • Step 101e performing filter processing
  • filter processing is performed; in the processing of the filter, it is necessary to read data stored in one-half carrier frequency offset processing, and then perform internal calculation of the filter.
  • the multi-level multiplication and addition calculation is performed according to different orders of the filter, and the result of the calculation is a fixed-point number after the saturation truncation.
  • the real part of the imaginary part of the calculation result has a bit width of 18 bits. .
  • the maximum time overhead of the signal processing process of each uplink channel is determined separately.
  • the maximum time overhead of the signal processing process of each uplink channel is determined by using the 245 MHz as an example, but is not limited to the following steps:
  • Step A2 determining a maximum time overhead of a symbol level process of each uplink channel
  • PUCCH format3 needs to perform DFT operation after performing symbol level data processing, the maximum time overhead of PUCCH processing is also determined; the most occupied time in PUCCH processing is processing of PUCCH format3, which is approximately 205. Clk;
  • Step B2 determining the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing
  • the maximum time is 2048 points, which requires 3166 clk;
  • Step C2 determining the maximum time overhead of inputting data to the buffer process
  • the maximum occupied time of the IFFT output data into the buffer is 2048 points, which requires 2048 clk, and the output data cannot exceed half of the symbol time;
  • the time for the symbol 0 is shorter than the normal symbol when the time adjustment (TA) is adjusted to the maximum, and separate calculation is required;
  • the timing arrangement under the NCP is also applicable to the case of the ECP.
  • the method for determining the maximum time overhead of the signal processing procedure of each uplink channel in the embodiment of the present invention is merely exemplified by 245 MHz, but the 245 MHz clock range is not limited.
  • Step 102 Schedule the timing of each uplink channel transmission according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the scheduling of the timing of sending each uplink channel according to the maximum time overhead of the signal processing procedure of each uplink channel includes:
  • the IFFT data processing and the one-half carrier frequency offset processing, and the maximum time overhead of the input data to the buffer buffer process at the PUSCH Process, PUCCH process, IFFT output process, IFFT RAM read process, input data to buffer and IFFT sign bit clearing process, DMRS process, SRS process, SR process, scheduling scheduling, and Determining a timing of the resource mapping process according to the timing of the PUSCH processing procedure and the PUCCH processing procedure; determining a timing of the filter processing procedure according to the timing of the input data to the buffer process.
  • scheduling scheduling of the physical uplink shared channel PUSCH processing process and the physical uplink control channel PUCCH processing process according to the maximum time overhead of the symbol level processing procedure of each uplink channel;
  • the timing sequence scheduling is performed on the IFFT output process and the IFFT random access memory RAM reading process. cloth;
  • the demodulated reference signal DMRS processing procedure, the channel sounding reference signal SRS processing procedure, and the scheduling request signal SR processing procedure are scheduled in time sequence.
  • the timing of the filter processing is determined based on the timing of the input data to the buffer process.
  • FIG. 3 includes FIG. 3-0, FIG. 3-1, FIG. 3-2, and FIG. 3-3.
  • the processing time of each symbol is 17536clk as an example.
  • the time of each channel is allocated to a time of 8768clk of half symbol, at each time.
  • Symbol start A counter counts each clock pulse and performs timing scheduling of the upstream channel based on the count.
  • FIG. 3 - 0 is a schematic diagram of non-SRS uplink timing arrangement according to an embodiment of the present invention.
  • FIG. 3-0 is divided into FIG. 3-1, FIG. 3-2, and FIG. 3, wherein, FIG. 3-1, FIG. 3-2, and FIG. 3-3 are respectively a part of FIG. 3-0; wherein 1200 and 12 represent PUSCH and process, For the PUSCH DMRS process, For the PUCCH DMRS calculation process, Output/write buffer process for IFFT, For the SRS calculation process; the size of each process in Figure 3 on the timing diagram is only illustrative, and the duration of each process in the sequence is based on the data in Figure 3.
  • Step A3 Determine the timing of the PUSCH processing process and the PUCCH processing process according to the maximum time overhead of the symbol level processing procedure of each uplink channel;
  • the maximum is 6950clk, so the end point of the PUSCH is set to a point of 6950; since the PUCCH and the PUSCH are to be concurrently supported, and the PUCCHformat3 needs to use the DFT module, in order to avoid timing conflict, the PUCCH is used. After the processing is scheduled to be on the PUSCH, as shown in Figure 3-1.
  • Step B3 determining the timing of the IFFT output process according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing procedure and the PUCCH processing procedure;
  • Step C3 determining the timing of the IFFT RAM reading process according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing, the PUCCH processing, and the IFFT output process;
  • the maximum time overhead required for the IFFT RAM from data input to the first data output is 3166clk, so the reading of the IFFT RAM is set at 1884;
  • Step D3 Maximum time overhead according to IFFT data processing and one-half carrier frequency offset processing, maximum time overhead of input data to buffer process, and PUSCH processing procedure, PUCCH processing procedure, IFFT output process, IFFT random access memory The timing of the RAM read process, determining the timing of the input data to the buffer and the clearing of the IFFT sign bit;
  • the IFFT After the IFFT has data output, it starts to input data to the buffer. At this time, the IFFT input ram can be released. In order to avoid the influence of the data, the IFFT needs to be cleared. Therefore, when the IFFT has data output, it can be The corresponding sign bit is cleared to 0, so the input data is buffered and the IFFT sign bit is cleared to the point at 5050clk;
  • Step E3 determining a timing of the DMRS processing process according to a maximum time overhead of a symbol level processing process of each uplink channel;
  • the DMRS of the PUSCH takes up a lot of time in the maximum case, the DMRS of the PUSCH starts to be calculated at a time of 5 symbols in advance and is stored in the corresponding ram.
  • the DMRS is read.
  • the corresponding ram is shown in Figure 3-0, 3-1, 3-2.
  • Step F3 determining a timing of the SRS processing process according to a maximum time overhead of a symbol level processing procedure of each uplink channel;
  • FIG. 4 is a schematic diagram of an SRS uplink timing arrangement according to an embodiment of the present invention.
  • the current symbol is that there is no PUSCH or PUCCH channel data transmission, and the SRS processing also needs to be long.
  • the hardware will start the calculation of the SRS channel data and store it in the corresponding ram according to the symbol bit and the corresponding carrier condition that the SRS needs to transmit. This is shown in Figure 4.
  • the processing of the SR is performed during the PUCCH processing
  • the timing of the resource mapping process is determined; and the timing of the filter processing procedure is determined according to the timing of the input data to the buffer process.
  • the timing of the resource mapping process can be determined according to the timing of the PUSCH processing process and the PUCCH processing procedure, that is, in the PUSCH. After the process and the PUCCH process, the resource mapping process is performed. After inputting the data to the buffer, the filter processing is entered. Therefore, the timing of the filter processing is determined according to the timing of the input data to the buffer process.
  • the processing of the second channel is the same as the processing of the first channel, except that the starting point is 7165clk;
  • the symbol 0 of NCP is the shortest, which is 14320clk, as shown in Figure 3-3.
  • channel 2 cannot be completed when the amount of processed data is relatively large, so it will be borrowed from symbol 1.
  • the corresponding clearing operation is performed on the counter, and the data of symbol 1 is processed according to the normal situation, that is, the counter is accumulated from 0, and the corresponding data is processed at the corresponding node;
  • the method in the embodiment of the present invention is a scheduling method for the uplink channel transmission timing of the LTE-A system in the case of the 245 MHz clock, but the range is not limited. In the case of the working clock and bandwidth of other frequencies, the embodiment of the present invention is used. In the method, only the node of the counter needs to be moved correspondingly, and reasonable scheduling can be realized, thereby achieving the purpose of function coverage and saving area power consumption.
  • the embodiment of the present invention further provides a scheduling device for uplink channel transmission timing.
  • the device includes: a time determining module 51 and a timing scheduling module 52, where
  • the time determining module 51 is configured to determine a maximum time overhead of a signal processing process for each uplink channel
  • the time determining module 51 determines that the maximum time overhead of the signal processing process of each uplink channel includes: determining symbol level processing processes, IFFT data processing, and one-half carrier frequency offset processing, and input data of each uplink channel, respectively.
  • the maximum time overhead to the buffer buffer process includes: determining symbol level processing processes, IFFT data processing, and one-half carrier frequency offset processing, and input data of each uplink channel, respectively. The maximum time overhead to the buffer buffer process.
  • the time determining module 51 determines that the maximum time overhead of the symbol level processing procedure of each uplink channel includes: in the case of a PUSCH with a maximum of 100 RBs, the most time spent in the symbol level processing process Is the process of performing DFT processing on the 96RB (1152 point) PUSCH symbol, which is approximately 6920 clk;
  • the time determining module 51 also determines the maximum time overhead of the PUCCH processing process; the most occupied time in the PUCCH processing process is processing the PUCCH format 3 Process, about 205 clk;
  • the time determining module 51 determines that the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing process includes: from the IFFT data input to the buffer after the first data is output to the half of the carrier frequency offset.
  • the maximum time is 2048 points, which requires 3166 clk;
  • the time determining module 51 calculates a maximum time overhead for determining the input data to the buffer process, including the maximum occupied time of the IFFT output data into the buffer is 2048 points, and 2048 clk is required. And the output data cannot exceed half of the symbol time;
  • the time for the symbol 0 is shorter than the normal symbol when the TA is adjusted to the maximum, and a separate calculation is required;
  • the timing scheduling module 52 is configured to schedule the timing of each uplink channel transmission according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the scheduling of the uplink channel transmission by the timing scheduling module 52 according to the maximum time overhead of the signal processing procedure of each uplink channel includes: the timing scheduling module 52 according to the symbol level processing procedure of each uplink channel, and the IFFT data. Processing and one-half carrier frequency offset processing, maximum time overhead of input data to buffer process; processing of PUSCH process, PUCCH process, IFFT output process, IFFT RAM read process, input data to buffer, and IFFT symbol bit clear The zero process, the DMRS process, the SRS process, and the SR process are scheduled for scheduling.
  • the timing scheduling module 52 includes a first scheduling unit 521, a second scheduling unit 522, and a third scheduling unit 523;
  • the first scheduling unit 521 is configured to perform scheduling scheduling on the PUSCH processing process and the PUCCH processing process according to a maximum time overhead of a symbol level processing procedure of each uplink channel.
  • the first scheduling unit 521 determines, according to the maximum time overhead of the symbol level processing procedure of each uplink channel, the timing of the PUSCH processing procedure and the PUCCH processing procedure, including: when the PUSCH is in the DFT processing, the maximum is 6950 clk, so the PUSCH is The end point is set at 6950; since the PUCCH and PUSCH are to be supported, and the PUCCH format 3 needs to use the DFT module, in order to avoid timing conflict, the first scheduling unit 521 sets the processing of the PUCCH after the PUSCH; In the symbol-level processing process, since the other channels only need to perform symbol-level data processing, there is no timing conflict with the PUSCH processing process and the PUCCH processing process, and the time overhead of the process is smaller than the time overhead of the PUSCH processing process and the PUCCH processing process. Therefore, the symbol level processing of other channels can be combined with PUSCH processing, PUCCH The process is executed concurrently.
  • the second scheduling unit 522 is configured to: according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing procedure and the PUCCH processing procedure, the IFFT output process, the IFFT random access memory
  • the RAM reading process performs scheduling on the timing;
  • the second scheduling unit 522 determines the timing of the IFFT output process according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing procedure and the PUCCH processing procedure, including: The calculation of 2048 points, that is, the point at which the output is started to the filter ends at 7165clk at the latest, therefore, the timing scheduling module 52 sets the point of the IFFT output at a point of 5050clk in consideration of the time overhead;
  • the second scheduling unit 522 determines the timing of the IFFT RAM reading process according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, and the timing of the PUSCH processing procedure and the PUCCH processing procedure, including: IFFT RAM from The data is input to the first data output, and the maximum time overhead required is 3166clk. Therefore, the reading of the IFFT RAM by the second scheduling unit 522 is set at the point of 1884;
  • the third scheduling unit 523 is configured to: according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, the maximum time overhead of the input data to the buffer process, and the PUSCH processing procedure, the PUCCH processing procedure, and the IFFT output. The timing of the process, the IFFT random access memory RAM read process, and the scheduling of the input data to the buffer and the IFFT sign bit clear are scheduled.
  • the third scheduling unit 523 is configured according to the maximum time overhead of the IFFT data processing and the one-half carrier frequency offset processing, the maximum time overhead of the input data to the buffer process, and the PUSCH processing procedure, the PUCCH processing procedure, the IFFT output process, and the IFFT.
  • the timing of the random access memory RAM reading process determines the input data to the buffer and the timing of the IFFT sign bit clearing includes: after the IFFT has data output, the data input to the buffer is started, and the input ram of the IFFT at this time It can be released. In order to avoid the influence of data, it is necessary to clear the IFFT. When the IFFT has data output, it can be cleared to 0 by the corresponding sign bit.
  • the third scheduling unit 523 will input the data to the buffer. And the IFFT sign bit is cleared to a point at 5050clk;
  • the timing scheduling module 52 further includes a fourth scheduling unit 524, configured to perform a demodulated reference signal DMRS processing procedure, a channel sounding reference signal SRS processing procedure, and a scheduling request according to a maximum time overhead of a symbol level processing procedure of each uplink channel.
  • the signal SR process performs scheduling on the timing.
  • the timing of determining the DMRS processing procedure by the fourth scheduling unit 524 according to the maximum time overhead of the symbol level processing procedure of each uplink channel includes: since the DMRS of the PUSCH is in a maximum case, it takes more time, so the DMRS of the PUSCH will The calculation starts at the time of 5 symbols in advance and is stored in the corresponding ram. When the PUSCH DMRS data processing is required, the corresponding ram is read.
  • the fourth scheduling unit 524 determines the timing of the SRS processing procedure according to the maximum time overhead of the symbol level processing procedure of each uplink channel, including in the case of SRS transmission, the current symbol is data transmission without PUSCH or PUCCH channel,
  • the processing of the SRS also takes a long time.
  • the hardware starts the calculation of the SRS channel data and stores it in the corresponding ram according to the symbol bit and the corresponding carrier condition that the SRS needs to transmit.
  • the fourth scheduling unit 524 performs the processing procedure of the SR in the PUCCH processing process
  • the timing scheduling module 52 further includes a fifth scheduling unit 525, configured to determine a timing of the resource mapping process according to timings of the PUSCH processing procedure and the PUCCH processing procedure; and determine a filter according to timing of the input data to the buffer process The timing of the process.
  • a fifth scheduling unit 525 configured to determine a timing of the resource mapping process according to timings of the PUSCH processing procedure and the PUCCH processing procedure; and determine a filter according to timing of the input data to the buffer process The timing of the process.
  • the timing of the resource mapping process can be determined according to the timing of the PUSCH processing process and the PUCCH processing procedure, that is, in the PUSCH. Process and PUCCH process After that, resource mapping processing is performed. After inputting the data to the buffer, the filter processing is entered. Therefore, the timing of the filter processing is determined according to the timing of the input data to the buffer process.
  • the processing of the second channel is the same as the processing of the first channel, except that the starting point is 7165clk;
  • the symbol 0 of NCP is the shortest, which is 14320clk.
  • channel 2 cannot be completed when the amount of processed data is relatively large, so some time in symbol 1 is borrowed, and channel 1 is completed.
  • the counter is cleared to the corresponding operation, and the data of the symbol 1 is processed according to the normal situation, that is, the counter is accumulated from 0, and the corresponding data is processed at the corresponding node;
  • each processing module in the scheduling apparatus of the uplink channel transmission timing shown in FIG. 5 can be understood by referring to the foregoing description of the scheduling method of the uplink channel transmission timing. It should be understood by those skilled in the art that the functions of the processing units in the scheduling apparatus of the uplink channel transmission timing shown in FIG. 5 may be implemented by a program running on the processor, or may be implemented by a specific logic circuit, such as : Can be implemented by a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP), or a field programmable gate array (FPGA).
  • CPU central processing unit
  • MPU microprocessor
  • DSP digital signal processor
  • FPGA field programmable gate array
  • the disclosed method, apparatus, and system may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the modules is only a logical function division.
  • there may be another division manner for example, multiple modules or components may be combined, or Can be integrated into another system, or some features can be ignored or not executed.
  • the communication connections between the various components shown or discussed may be indirect coupling or communication connections through some interfaces, devices or modules, and may be electrical, mechanical or otherwise.
  • the modules described above as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical units, that is, may be located in one place.
  • the party may also be distributed to multiple network units; some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional module in each embodiment of the present invention may be integrated into one processing module, or each module may be separately used as one module, or two or more modules may be integrated into one module;
  • the module can be implemented in the form of hardware or in the form of hardware plus software functional units.
  • the foregoing program may be stored in a computer readable storage medium, and when executed, the program includes The foregoing steps of the method embodiment; and the foregoing storage medium includes: a removable storage device, a read-only memory (ROM), a magnetic disk or an optical disk, and the like, which can store program codes.
  • ROM read-only memory
  • the above-described integrated module of the embodiment of the present invention may be stored in a computer readable storage medium if it is implemented in the form of a software function module and sold or used as a stand-alone product.
  • the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions.
  • a computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes various media that can store program codes, such as a mobile storage device, a ROM, a magnetic disk, or an optical disk.
  • the present invention is an example of the scheduling method and apparatus for the uplink channel transmission timing described in the example.
  • the foregoing embodiment is only used as an example, but is not limited thereto, and those skilled in the art should understand that it can still be described in the foregoing embodiments.
  • the technical solutions are modified, or some or all of the technical features are equivalently replaced; and the modifications or substitutions do not deviate from the technical solutions of the embodiments of the present invention.
  • the present invention discloses a scheduling method and apparatus for uplink channel transmission timing, which can determine the maximum time overhead of the signal processing procedure of each uplink channel, and send to each uplink channel according to the maximum time overhead of the signal processing procedure of each uplink channel.
  • the timing is scheduled. In this way, resources can be reused to the maximum extent under the premise of function coverage, so as to save power consumption and area; and each channel is arranged reasonably in timing, thereby avoiding conflicts in timing.

Abstract

L'invention concerne un procédé pour planifier la programmation de la transmission de canaux en liaison montante. Le procédé consiste à : déterminer le surdébit temporel maximum pendant le traitement des signaux de chaque canal en liaison montante; planifier la programmation de la transmission de chaque canal en liaison montante en fonction du surdébit temporel maximum pendant le traitement des signaux de chaque canal en liaison montante. L'invention concerne également un dispositif pour planifier la programmation de la transmission de canaux en liaison montante.
PCT/CN2014/094814 2014-08-07 2014-12-24 Procédé pour planifier la programmation de la transmission de canaux en liaison montante et dispositif associé WO2016019686A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410386887 2014-08-07
CN201410386887.2 2014-08-07

Publications (1)

Publication Number Publication Date
WO2016019686A1 true WO2016019686A1 (fr) 2016-02-11

Family

ID=55263089

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/094814 WO2016019686A1 (fr) 2014-08-07 2014-12-24 Procédé pour planifier la programmation de la transmission de canaux en liaison montante et dispositif associé

Country Status (2)

Country Link
CN (1) CN106162835B (fr)
WO (1) WO2016019686A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101523830A (zh) * 2006-10-09 2009-09-02 摩托罗拉公司 用于共享信道上的上行链路调度的装置和方法
CN102665284A (zh) * 2012-04-13 2012-09-12 华为技术有限公司 上行业务传输调度方法和终端
WO2013138043A1 (fr) * 2012-03-16 2013-09-19 Intel Corporation Equipement d'utilisateur et procédé pour réduire le retard dans un réseau d'accès radio
CN103428868A (zh) * 2012-05-15 2013-12-04 华为技术有限公司 上行发射方法和用户设备

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040214602A1 (en) * 2002-04-08 2004-10-28 Takahisa Aoyama Base station apparatus and upstream packet transmitting method
CN101043254B (zh) * 2006-03-24 2010-05-26 大唐移动通信设备有限公司 一种终端发射上行信号的处理方法
BRPI0819128A2 (pt) * 2007-10-30 2015-05-05 Ericsson Telefon Ab L M Métodos de ajuste de sincronização de enlace ascendente para um nób, para um controlador de rede de rádio em um sistema de comunicação e para um equipamento de usuário de um acesso por múltipla divisão de código de banda larga, nób, controlador de rede de rádio, e , equipamento de usuário.
CN101801048B (zh) * 2008-11-26 2012-06-06 联发科技股份有限公司 上行链路的传输时序及初始传输超前时序的设定方法
CN104902555B (zh) * 2011-12-19 2018-04-20 华为技术有限公司 一种上行发射功率控制方法及用户设备
CN103826294B (zh) * 2012-11-16 2017-05-24 电信科学技术研究院 功率控制方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101523830A (zh) * 2006-10-09 2009-09-02 摩托罗拉公司 用于共享信道上的上行链路调度的装置和方法
WO2013138043A1 (fr) * 2012-03-16 2013-09-19 Intel Corporation Equipement d'utilisateur et procédé pour réduire le retard dans un réseau d'accès radio
CN102665284A (zh) * 2012-04-13 2012-09-12 华为技术有限公司 上行业务传输调度方法和终端
CN103428868A (zh) * 2012-05-15 2013-12-04 华为技术有限公司 上行发射方法和用户设备

Also Published As

Publication number Publication date
CN106162835B (zh) 2020-04-24
CN106162835A (zh) 2016-11-23

Similar Documents

Publication Publication Date Title
US10813129B2 (en) Method and apparatus for sending and receiving uplink data, terminal, and base station
EP3627753B1 (fr) Procédé de transmission d'informations de commande de liaison montante, dispositif terminal et dispositif réseau
CN110392433B (zh) 一种数据传输方法及装置
US20160242121A1 (en) Uplink Signal Sending Method and User Equipment
US10554367B2 (en) Narrowband uplink resource configuration
CN110381593B (zh) 一种laa侦听资源分配方法和装置
WO2016070704A1 (fr) Procédé et dispositif de transmission de données dans une bande de fréquences non autorisée
EP3713129A1 (fr) Procédé et appareil de configuration de ressource, et support de stockage informatique
CN110430619B (zh) 一种基于蜂窝网的窄带通信的方法和装置
EP4340288A2 (fr) Procédé et dispositif de transmission de srs
WO2019157905A1 (fr) Procédé d'envoi et de réception pour signal de référence, station de base, terminal et support lisible
WO2016150224A1 (fr) Procédé et appareil de transmission de données
WO2017194004A1 (fr) Procédé de détermination de ressources, appareil associé, et système
WO2018018776A1 (fr) Procédé et dispositif de traitement de données de liaison montante-liaison descendante, et support de stockage informatique
US20160301502A1 (en) Information transmission method, user equipment, and base station
US20200187238A1 (en) Methods and apparatuses for control resource mapping
CN106576025A (zh) 增强的随机接入信道过程
CN107294663B (zh) 上行传输的harq反馈方法、装置及接收方法
WO2019128879A1 (fr) Procédé et dispositif de transmission de segments trs
TWI704787B (zh) 一種上行控制通道傳輸方法及裝置
WO2019096081A1 (fr) Procédé et dispositif de traitement de communication
WO2018121150A1 (fr) Procédé et dispositif de transmission d'informations
WO2016046627A2 (fr) Procédé et dispositif de réduction de la complexité de décodage en aveugle pour un dispositif mtc à couverture améliorée
US20220039069A1 (en) Data sending and receiving method, device, system, terminal, base station, and storage medium
WO2016019686A1 (fr) Procédé pour planifier la programmation de la transmission de canaux en liaison montante et dispositif associé

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14899229

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14899229

Country of ref document: EP

Kind code of ref document: A1