Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Improved re-transmission capability in semi-persistent transmission

A semi-persistent scheduling, hybrid automatic retransmission technology, applied in transmission systems, digital transmission systems, error prevention/detection using return channels, etc., can solve problems such as increasing UE complexity and storage requirements

Inactive Publication Date: 2010-10-27
NOKIA TECHNOLOGLES OY
View PDF3 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In one exemplary scenario, using more HARQ processes may mean that more signaling is required in the PDCCH, which in turn increases UE complexity and memory requirements

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Improved re-transmission capability in semi-persistent transmission
  • Improved re-transmission capability in semi-persistent transmission
  • Improved re-transmission capability in semi-persistent transmission

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach 1

[0089] Embodiment 1A: PDCCH signaling can signal X number of HARQ processes (for example, X=8 using 3 bits). One of the values ​​of X indicates semi-persistent HARQ scheduling. The number of HARQ processes for the semi-persistent case is given by N and this number is signaled via RRC signaling with one HARQ process ID indicating semi-persistent. A HARQ buffer indicating semi-persistent (eg, buffer 7 when X=8) is divided into N sub-buffers (eg, 7, 8, . . . , 7+N-1). Since semi-persistent allocation is more suitable for traffic with small packets, such as VoIP, it is assumed that the size of these sub-buffers is sufficient for semi-persistent traffic. Then for each semi-persistent allocation (for new packets), the subbuffer identification can be implicitly derived from the periodic pattern, the number of TTIs and the number of HARQ buffers reserved for semi-persistent use. One such equation is as follows:

[0090] sub-buffer=[trunc(current_TTI / SP_period)]modNumber_of_semi-per...

Embodiment approach 2

[0095] Embodiment 2A: In the PDCCH, one of X HARQ processes may be signaled (for example, X=8 using 3 bits). One of these X values ​​indicates that the parameters in the PDCCH are used for semi-persistent allocation. The number of HARQ processes used for semi-persistent is N and this value is signaled via RRC signaling with one HARQ process ID indicating semi-persistent eg last HARQ buffer X-1. The HARQ buffer is divided into X+N-1 buffers, which do not need to be of equal size, eg smaller sized buffers may be sufficient for semi-persistent allocation. Then if the PDCCH indicates semi-persistent via the HARQ process ID, or if semi-persistent allocation is in use, the correct HARQ buffer for semi-persistent transmission of new packets can be derived from the following equation:

[0096] HARQ buffer=X-1+[trunc(current_TTI / SP_period)]modNumber_of_semi-persistent_HARQ

[0097] For the retransmission of semi-persistent allocation, several possible signaling schemes are given in t...

Embodiment approach 3

[0098] Embodiment 3A: PDCCH signaling can transmit X HARQ processes. Multiple HARQ processes and HARQ IDs are reserved for semi-persistent. One of them indicates the semi-persistence in the initial allocation to identify that the semi-persistence is in use. All these HARQ IDs form a HARQ process vector Y. The HARQ process used in the case of semi-persistent allocation can be derived, for example, from the following equation:

[0099] vector_index=[trunc(current_TTI / SP_period)]modNumber_of_semi-persistent_HARQ

[0100] HARQ buffer=Y(vector_index)

[0101] For retransmissions of semi-persistent allocations, possible signaling schemes are described with reference to embodiments 1B, 2B, 3B and 4B.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

One or more hybrid automatic repeat request process identifications are configured for scheduling without associated control signaling. A particular HARQ process ID to be assumed for a given subframe is determined based on at least one of: a) system frame number; b) number of hybrid automatic repeat request processes that are allocated for semi- persistent scheduling; and c) periodicity for semi-persistent scheduling. In various embodiments: a) is broadcast and b) and c) are sent via RRC signaling; and the assumed particular HARQ process ID is determined as a function of [Current TTI / SP_Period] mod Num_SP_HARQ: wherein Current TTI is a number for the given subframe derived from the system frame number and the term [Current TTI / SP_Period] is rounded to an integer prior to the modulo operation; SP_Period is the periodicity of the semi-persistent scheduling; and Num_SP_HARQ is the number of hybrid automatic repeat request processes that are allocated for semi-persistent scheduling.

Description

technical field [0001] The exemplary and non-limiting embodiments of the present invention relate generally to wireless communication systems, methods, devices and computer program products, and more particularly to techniques for use with semi-persistent resource allocation and hybrid automatic repeat request techniques. Background technique [0002] The various abbreviations appearing in the specification and / or drawings are defined as follows: [0003] ACK confirmation [0004] aGW access gateway [0005] BCH broadcast channel [0006] CCH control channel [0007] CDM code division multiplexing [0008] DL downlink [0009] DTX discontinuous transmission [0010] eNB EUTRAN Node B (Evolved Node B) [0011] EUTRAN Evolved UTRAN [0012] FDD frequency division multiplexing [0013] FDMA frequency division multiple access [0014] 3GPP Third Generation Partnership Project [0015] HARQ Hybrid Automatic Repeat Request [0016] LTE Long Term Evolution [0017] NAC...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L1/18
CPCH04L1/1887H04L1/1812H04L1/1854H04L1/1822
Inventor E·M·马尔卡马基J·K·奥雅拉J·P·吕登
Owner NOKIA TECHNOLOGLES OY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com