WO2012171556A1 - Latency - Google Patents
Latency Download PDFInfo
- Publication number
- WO2012171556A1 WO2012171556A1 PCT/EP2011/059891 EP2011059891W WO2012171556A1 WO 2012171556 A1 WO2012171556 A1 WO 2012171556A1 EP 2011059891 W EP2011059891 W EP 2011059891W WO 2012171556 A1 WO2012171556 A1 WO 2012171556A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- transport block
- indication
- computer program
- acknowledgement message
- quality
- Prior art date
Links
- 238000004590 computer program Methods 0.000 claims abstract description 41
- 230000005540 biological transmission Effects 0.000 claims abstract description 35
- 238000000034 method Methods 0.000 claims description 41
- 230000011664 signaling Effects 0.000 claims description 13
- 238000012360 testing method Methods 0.000 claims description 13
- 230000002123 temporal effect Effects 0.000 claims description 4
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 33
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 33
- 238000004891 communication Methods 0.000 description 15
- 230000006870 function Effects 0.000 description 9
- 238000012545 processing Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 4
- 239000000969 carrier Substances 0.000 description 3
- 125000004122 cyclic group Chemical group 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000018109 developmental process Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 244000287680 Garcinia dulcis Species 0.000 description 1
- 230000003466 anti-cipated effect Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000013213 extrapolation Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000002040 relaxant effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 208000037918 transfusion-transmitted disease Diseases 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1816—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of the same, encoded, message
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1692—Physical properties of the supervisory signal, e.g. acknowledgement by energy bursts
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/009—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location arrangements specific to transmitters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0091—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location arrangements specific to receivers, e.g. format detection
Definitions
- the invention relates to apparatuses, methods, a system, computer programs, computer program products and computer-readable media. Background
- ARQ Automatic repeat request
- HARQ hybrid automatic repeat request
- an apparatus comprising: at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- an apparatus comprising: at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- a method comprising: preparing a transmission of a no- acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- a method comprising: preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- an apparatus comprising: means for preparing a transmission of a no- acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- an apparatus comprising: means for preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- a computer program embodied on a computer-readable storage medium, the computer program comprising program code for controlling a process to execute a process, the process comprising: preparing a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- a computer program embodied on a computer-readable storage medium, the computer program comprising program code for controlling a process to execute a process, the process comprising: preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- Figure 1 illustrates an example of a system
- Figure 2 is a flow chart
- Figure 3 is another flow chart
- FIG. 4 illustrates examples of apparatuses
- Embodiments are applicable to any user device, such as a user terminal, relay node, server, node, corresponding component, and/or to any communication system or any combination of different communication systems that support required functionalities.
- the communication system may be a wireless communication system or a communication system utilizing both fixed networks and wireless networks.
- the protocols used, the specifications of communication systems, apparatuses, such as servers and user terminals, especially in wireless communication, develop rapidly. Such development may require extra changes to an embodiment. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, embodiments.
- Embodiments are mainly targeted to so-called "Beyond 4G" systems which are now only in the developing phase.
- Systems beyond 4G are designed to fulfil international mobile telecommunications advanced+ ( I MT- Advanced +) requirements, at least as to data rates.
- I MT- Advanced + international mobile telecommunications advanced+
- Common assumption in the field is that rata rates will be 10 Gbit/s for a low mobility case and 1 Gbit/s for a high mobility case.
- the structure and elements of the systems are not yet decided. However, it is presumed that one option of such a system when specified will resemble that of the Long Term Evolution (LTE) Advanced or it will be a development of it.
- LTE Long Term Evolution
- an example of the system is described as if it were according to an LTE Advanced system.
- Figure 1 only shows an assumption of a not yet specified system. It should be understood that typically the names of network elements are somewhat different than the ones used in an earlier system generation to make it easier to tell the difference. However, due to the nature of communication systems, basic tasks the network has to carry out usually remain quite the same but implementations vary due to different, typically more demanding or progressive, requirements.
- LTE-A LTE Advanced
- SC-FDMA single-carrier frequency-division multiple access
- FDD frequency division duplex
- TDD time division duplex
- orthogonal frequency division multiplexing In an orthogonal frequency division multiplexing (OFDM) system, the available spectrum is divided into multiple orthogonal sub-carriers. In OFDM systems, available bandwidth is divided into narrower sub-carriers and data is transmitted in parallel streams. Each OFDM symbol is a linear combination of signals on each of the subcarriers. Further, each OFDM symbol is preceded by a cyclic prefix (CP), which is used to decrease Inter-Symbol Interference. Unlike in OFDM, SC-FDMA subcarriers are not independently modulated.
- CP cyclic prefix
- a (e)NodeB (“e” stands for evolved) needs to know channel quality of each user device and/or the preferred precoding matrices (and/or other multiple input-multiple output (MIMO) specific feedback information, such as channel quantization) over the allocated sub-bands to schedule transmissions to user devices.
- Required information is usually signalled to the (e)NodeB.
- Figure 1 depicts examples of simplified system architectures only showing some elements and functional entities, all being logical units, whose implementation may differ from what is shown.
- the connections shown in Figure 1 are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the system typically comprises also other functions and structures than those shown in Figure 1 .
- Figure 1 shows user devices 1 00 and 102 configured to be in a wireless connection on one or more communication channels 104, 106 in a cell with a (e)NodeB 108 providing the cell.
- the physical link from a user device to a (e)NodeB is called uplink or reverse link and the physical link from the NodeB to the user device is called downlink or forward link.
- the NodeB or advanced evolved node B (eNodeB, eNB) in LTE- Advanced, is a computing device configured to control the radio resources of communication system it is coupled to.
- the (e)NodeB may also be referred to a base station, an access point or any other type of interfacing device including a relay station capable of operating in a wireless environment.
- the (e)NodeB includes transceivers, for example. From the transceivers of the (e)NodeB, a connection is provided to an antenna unit that establishes bi-directional radio links to user devices.
- the antenna unit may comprise a plurality of antennas or antenna elements.
- the (e)NodeB is further connected to core network 1 10 (CN).
- CN core network 1 10
- the counterpart on the CN side can be a serving gateway (S-GW, routing and forwarding user data packets), packet data network gateway (P-GW), for providing connectivity of user devices (UEs) to external packet data networks, or mobile management entity (MME), etc.
- S-GW serving gateway
- P-GW packet data network gateway
- MME mobile management entity
- a communications system typically comprises more than one (e)NodeB in which case the (e)NodeBs may also be configured to communicate with one another over links, wired or wireless, designed for the purpose. These links may be used for signalling purposes.
- the communication system is also able to communicate with other networks, such as a public switched telephone network or the Internet 1 1 2.
- the user device also called UE, user equipment, user terminal, terminal device, etc.
- UE user equipment
- user terminal terminal device
- any feature described herein with a user device may be implemented with a corresponding apparatus, such as a relay node.
- a relay node is a layer 3 relay (self-backhauling relay) towards the base station.
- the user device typically refers to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (mobile phone), smartphone, personal digital assistant (PDA), handset, device using a wireless modem (alarm or measurement device, etc.), laptop and/or touch screen computer, tablet, game console, notebook, and multimedia device.
- SIM subscriber identification module
- the user device (or in some embodiments a layer 3 relay node) is configured to perform one or more of user equipment functionalities.
- the user device may also be called a subscriber unit, mobile station, remote terminal, access terminal, user terminal or user equipment (UE) just to mention but a few names or apparatuses.
- UE user equipment
- apparatuses have been depicted as single entities, different units, processors and/or memory units (not all shown in Figure 1 ) may be implemented.
- the depicted system is only an example of a part of a radio access system and in practise, the system may comprise a plurality of (e)NodeBs, the user device may have an access to a plurality of radio cells and the system may comprise also other apparatuses, such as physical layer relay nodes or other network elements, etc. At least one of the NodeBs or eNodeBs may be a Home(e)nodeB. Additionally, in a geographical area of a radio communication system a plurality of different kinds of radio cells as well as a plurality of radio cells may be provided.
- Radio cells may be macro cells (or umbrella cells) which are large cells, usually having a diameter of up to tens of kilometres, or smaller cells such as micro-, femto- or picocells.
- the (e)NodeB 108 of Figure 1 may provide any kind of these cells.
- a cellular radio system may be implemented as a multilayer network including several kinds of cells. Typically, in multilayer networks, one node B provides one kind of a cell or cells, and thus a plurality of node Bs are required to provide such a network structure.
- LTE/LTE-Advanced with data rates 0.1 -1 Gbps provides 5 10 ms latency (round trip time). Generally speaking, latency must decrease at the same pace as the data rate increases.
- a very small latency (such as 0.1 ms) is beneficial, if the content is located at proximity, such as in the same office network or the same campus. Otherwise there would be too much delay on the i o link between the server and the access point.
- Physical layer latency is hard-coded in existing radio systems.
- processing requirements i.e., computational complexity
- these requirements may be presented in the form of a node and/or user
- PDSCH physical downlink control channel
- PUSCH physical uplink shared channel
- HARQ hybrid automatic repeat request
- ACK/NACK acknowledgement/no-acknowlegdement
- a hybrid-automatic repeat request is an important feature to enhance the performance of packet data transmission.
- the HARQ controls and initiates packet retransmission on layer 1 (physical layer), to
- HARQ is a "stop and wait" protocol of a nature: a subsequent transmission may take place only after receiving an ACK/NACK from a receiving entity.
- the first rate matching stage matches a selected number of input bits to the virtual buffer.
- the second rate matching stage matches the number of bits after the first rate matching stage to physical channel bits for one transmission time interval (TTI).
- TTI transmission time interval
- a fixed HARQ subsystem does not take into account variable data rates, variable latency requirements, variable signal processing capability or a variable HARQ operation point, for example .
- LTE Rel-8/9/10 does not meet Beyond 4G targets.
- One aspect needing reconsidering is HARQ-retransmissions.
- One target of some embodiments is to speed up HARQ retransmissions by allowing signalling of a NACK-message even before the corresponding packet has been received completely (or even before it has been sent or transmitted completely).
- Some embodiments enable minimising HARQ re-transmission delay and relaxing processing requirements while achieving improved latency performance.
- Latency performance may be improved in particular for retransmitted data packets. It should be emphasized that usually these are the packets that determine general delay for higher layers or applications, because packets are typically segmented into a plurality of radio packets and a receiver has to wait until all physical layer packets have arrived.
- the embodiment of Figure 2 is usually related to a user device, home node or a web stick.
- the embodiment begins in block 200.
- the retransmission procedure of the LTE-Advanced comprises a HARQ functionality which is described above.
- a no- acknowledgement message conveyed earlier than in a conventional HARQ- procedure may be that at least one coding block of a transport block has already been received erroneously or a receiver identifies that a channel or its interference conditions have deteriorated after a scheduling decision (or after a previous channel state information report), or that they are insufficient for the modulation coding scheme (MCS) selected by a transmitter (e.g. because reports have been lost or corrupted, and therefore the transmitter assumed incorrectly too good a signal-to-interference and noise- ratio (SINR) or used beamforming or precoding in a non-optimum manner).
- MCS modulation coding scheme
- Term “early NACK” denotes that a NACK-message is conveyed in an earlier phase than conventionally in current systems supporting Hybrid ARQ (hybrid automatic repeat request).
- the early NACK may be based on anticipated transmission time interval (TTI) quality according to predefined rules or policies.
- TTI transmission time interval
- "early NACK” is signaled using an "on-off keying" principle in which a related acknowledgement state corresponds to "no transmission” in order to save power and reduce interference caused by an ACK/NACK signal.
- “no transmission” corresponds to the situation where the receiving node has not identified any reason to transmit "early NACK”.
- Early NACK may have a fixed or flexible timing relationship with relation to data reception. In the case of the flexible timing, a receiver node, such as a user device, is allowed to transmit "early NACK" using ACK/NACK resources corresponding to a first available ACK/NACK resource prior to a regular or conventional ACK/NACK.
- the "early NACK" may be transmitted using a first temporal resource that is available for (HARQ) feedback signaling. It should be appreciated that an early NACK may cancel or substitute a regular or conventional (ACK/)NACK, since it would be unnecessary redundancy and thus waste of resources. This embodiment may be based on an observation that a part of a transport block has been received erroneously.
- signaling both "early NACK” and “early ACK” is an option.
- This option may make timing flexible.
- the early ACK/NACK may be transmitted right after the entire packet is received and decoded correctly without the need to wait for the "regular ACK/NACK" procedure.
- the quality of a received signal is inadequate, even after a few Turbo decoding iterations, it may become obvious that the decoding metric does not improve and the turbo decoder does not start to converge.
- an early NACK-message may be sent. This embodiment may be based on an indication of inadequate quality of at least part of a transport block.
- Another embodiment may utilize not only "early NACK” but also 5 some other signaling, such as a channel quality information (CQI) report, as a trigger for "early retransmission".
- CQI channel quality information
- a transmitting node for example a (e)nodeB
- a receiving node for example a user device
- a transmitting node for example a (e)nodeB
- a receiving node for example a user device
- a node may come to a conclusion i o based on these reports that a channel quality has decreased and send a retransmission.
- An exemplary transport block (TB) with the duration of one TTI consists of multiple Turbo-coded coding blocks each having a separate cyclic redundancy check (CRC). "Early NACK" may be triggered immediately after a
- a certain part of a transport block such as one coding block, is erroneous or corrupted. It should be understood that due to interleaving, quality among different blocks is typically well aligned. Hence, already a first coding block may reflect the quality of the entire transport block quite accurately. It should also be appreciated that in order to enhance pipeline
- interleaving should take place only in a frequency domain.
- the number of coding blocks is small (as may be when a data rate is low and/or TTI length is long), it is possible to arrange the coding blocks in such a manner that at least one (usually a small) coding block (a test coding block) or some other means indicating the quality of the coding block(s)
- the test coding block may be arranged to be the first one in a transport block. It may also be located in another position in the transport block.
- the test coding block may have a low coding gain and therefore it may be transmitted with a lower code rate. This may not be efficient, but it relates only to a small part of data. Alternatively, it may be
- NACK-messages may be sent flexibly in time, an indication to which TTI a message relates to is added to the NACK-messages. This may be a single bit indicating whether it is an early ACK/NACK or a conventional one. Another option is that multiple bits (e.g., two bits) may be used for indicating also a HARQ process number.
- ACK/NACK signaling is that "early NACK" is transmitted at the same time and using the same resources as a conventional ACK/NACK for a block. In this manner, “early NACK” for a following block may implicitly also indicate an ACK for the block. This may be implemented by using the "on-off keying" approach, by choosing the polarity of a transmitted early NACK to be different from the one of an ordinary ACK. In complex coordinates, the ACK may be +1 and the "early" NACK may be -1 , while an ordinary ACK may be coded as 0. This embodiment provides an option to save resources. Another option is to apply quadrature phase shift keying (QPSK) constellation in a such a manner that "early (ACK/)NACK” and ordinary ACK/NACK are transmitted using a same modulation symbol.
- QPSK quadrature phase shift keying
- the embodiment ends in block 204.
- the embodiment is repeatable in many ways. One example is shown by arrow 206 in Figure 2.
- Another embodiment is usually related to a node, host or server.
- the embodiment will be described by means of Figure 3.
- the embodiment begins in block 300.
- a transport block for data conveyance is prepared.
- the transport block comprises an indication of quality.
- the quality indication may be implemented by means of a transport block specific cyclic redundancy check (CRC).
- CRC transport block specific cyclic redundancy check
- the number of coding blocks is small (as may be when a data rate is low and/or TTI length is long), it is possible to arrange the coding blocks in such a manner that at least one certain (usually a small) coding block (a test coding block) or some other means indicating the quality of the coding block(s) accurately enough is provided.
- the test coding block is usually arranged to be the first one in a transport block. It may also be located in another position in the transport block.
- the test coding block may have a low coding gain and therefore it may be transmitted with a lower code rate. This may not be efficient, but it relates only to a small part of data.
- it may be possible to increase the number of coding blocks by splitting a transmission time interval into multiple smaller coding blocks, again at the expense of a coding gain.
- a test coding block may be used as an indication of quality.
- the embodiment ends in block 304.
- the embodiment is repeatable in many ways. One example is shown by arrow 306 in Figure 3.
- steps/points, signaling messages and related functions described above in Figures 2 and 3 are in no absolute chronological order, and some of the steps/points may be performed simultaneously or in an order differing from the given one. Other functions may also be executed between the steps/points or within the steps/points and other signaling messages sent between the illustrated messages. Some of the steps/points or part of the steps/points can also be left out or replaced by a corresponding step/point or part of the step/point.
- conveying, transmitting and/or receiving may herein mean preparing a data conveyance, transmission and/or reception, preparing a message to be conveyed, transmitted and/or received, or physical transmission and/or reception itself, etc. on a case by case basis.
- An embodiment provides an apparatus which may be any user device, home node, web stick or any other suitable apparatus capable to carry out processes described above in relation to Figure 2.
- Another embodiment provides an apparatus which may be any server, node, host or any other suitable apparatus capable to carry out processes described above in relation to Figure 3.
- Figure 4 illustrates a simplified block diagram of an apparatus according to an embodiment especially suitable for communicating a no- acknowledgement information.
- an apparatus 400 such as a user device, relay node or web stick, including facilities in a control unit 404 (including one or more processors, for example) to carry out functions of embodiments according to Figure 2.
- block 406 includes parts/units/modules need for reception and transmission, usually called a radio front end, RF-parts, radio parts, etc. This block is optional.
- an apparatus 400 may include at least one processor 304 and at least one memory 402 including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- Yet another example of an apparatus comprises means 404 for preparing a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
- FIG. 5 illustrates a simplified block diagram of an apparatus according to an embodiment especially suitable for communicating a no- acknowledgement information.
- an apparatus 500 such as a server, host or node, including facilities in a control unit 504 (including one or more processors, for example) to carry out functions of embodiments according to Figure 3.
- a control unit 504 including one or more processors, for example
- block 506 includes parts/units/modules need for reception and transmission, usually called a radio front end, RF-parts, radio parts, etc. This block is optional.
- an apparatus 500 may include at least one processor 504 and at least one memory 502 including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- Yet another example of an apparatus comprises means 504 for preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- Yet another example of an apparatus comprises a preparing unit configured to prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
- apparatuses may include or be coupled to other units or modules etc, such as radio parts or radio heads, used in or for transmission and/or reception. This is depicted in Figures 4 and 5 as optional blocks 406 and 506.
- An apparatus may in general include at least one processor, controller or a unit designed for carrying out control functions operably coupled to at least one memory unit and to various interfaces.
- the memory units may include volatile and/or non-volatile memory.
- the memory unit may store computer program code and/or operating systems, information, data, content or the like for the processor to perform operations according to embodiments.
- Each of the memory units may be a random access memory, hard drive, etc.
- the memory units may be at least partly removable and/or detachably operationally coupled to the apparatus.
- the memory may be of any type suitable for the current technical environment and it may be implemented using any suitable data storage technology, such as semiconductor-based technology, flash memory, magnetic and/or optical memory devices.
- the memory may be fixed or removable.
- the apparatus may be a software application, or a module, or a unit configured as arithmetic operation, or as a program (including an added or updated software routine), executed by an operation processor.
- Programs also called program products or computer programs, including software routines, applets and macros, may be stored in any apparatus-readable data storage medium and they include program instructions to perform particular tasks.
- Computer programs may be coded by a programming language, which may be a high-level programming language, such as objective-C, C, C++, Java, etc., or a low-level programming language, such as a machine language, or an assembler.
- routines may be implemented as added or updated software routines, application circuits (ASIC) and/or programmable circuits. Further, software routines may be downloaded into an apparatus.
- the apparatus such as a node device, or a corresponding component, may be configured as a computer or a microprocessor, such as single-chip computer element, or as a chipset, including at least a memory for providing storage capacity used for arithmetic operation and an operation processor for executing the arithmetic operation.
- Embodiments provide computer programs embodied on a distribution medium, comprising program instructions which, when loaded into electronic apparatuses, constitute the apparatuses as explained above.
- the distribution medium may be a non-transitory medium.
- inventions provide computer programs embodied on a computer readable medium, configured to control a processor to perform embodiments of the methods described above.
- the computer readable medium may be a non-transitory medium.
- the computer program may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, distribution medium, or computer readable medium, which may be any entity or device capable of carrying the program.
- carrier include a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package, for example.
- the computer program may be executed in a single electronic digital computer or it may be distributed amongst a number of computers.
- the computer readable medium may be a non-transitory medium.
- the techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware (one or more devices), firmware (one or more devices), software (one or more modules), or combinations thereof.
- the apparatus may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, digitally enhanced circuits, other electronic units designed to perform the functions described herein, or a combination thereof.
- ASICs application specific integrated circuits
- DSPs digital signal processors
- DSPDs digital signal processing devices
- PLDs programmable logic devices
- FPGAs field programmable gate arrays
- processors controllers, micro-controllers, microprocessors, digitally enhanced circuits, other electronic units designed to perform the functions described herein, or a combination thereof.
- the implementation may be carried out through modules of at least one chip set (e.g., procedures, functions, and so on) that perform the functions described herein.
- the software codes may be stored in a memory unit and executed by processors.
- the memory unit may be implemented within the processor or externally to the processor. In the latter case it may be communicatively coupled to the processor via various means, as is known in the art.
- the components of systems described herein may be rearranged and/or complimented by additional components in order to facilitate achieving the various aspects, etc., described with regard thereto, and they are not limited to the precise configurations set forth in the given figures, as will be appreciated by one skilled in the art.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to an apparatus comprising: at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
Description
Latency
Field
The invention relates to apparatuses, methods, a system, computer programs, computer program products and computer-readable media. Background
The following description of background art may include insights, discoveries, understandings or disclosures, or associations together with disclosures not known to the relevant art prior to the present invention but provided by the invention. Some such contributions of the invention may be specifically pointed out below, whereas other such contributions of the invention will be apparent from their context.
Automatic repeat request (ARQ) or hybrid automatic repeat request (HARQ) performs an error-control system wherein a receiver generates a request for retransmission, if an error in transmission is detected. Brief description
According to an aspect of the present invention, there is provided an apparatus comprising: at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
According to another aspect of the present invention, there is provided an apparatus comprising: at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
According to yet another aspect of the present invention, there is provided a method comprising: preparing a transmission of a no- acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
According to yet another aspect of the present invention, there is provided a method comprising: preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
According to yet another aspect of the present invention, there is provided an apparatus comprising: means for preparing a transmission of a no- acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
According to yet another aspect of the present invention, there is provided an apparatus comprising: means for preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
According to yet another aspect of the present invention, there is provided a computer program embodied on a computer-readable storage medium, the computer program comprising program code for controlling a process to execute a process, the process comprising: preparing a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
According to yet another aspect of the present invention, there is provided a computer program embodied on a computer-readable storage medium, the computer program comprising program code for controlling a process to execute a process, the process comprising: preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
List of drawings
Some embodiments of the present invention are described below, by way of example only, with reference to the accompanying drawings, in which
Figure 1 illustrates an example of a system;
Figure 2 is a flow chart;
Figure 3 is another flow chart;
Figure 4 illustrates examples of apparatuses, and
Figure 5 illustrates other examples of apparatuses. Description of embodiments
The following embodiments are only examples. Although the specification may refer to "an", "one", or "some" embodiment(s) in several locations, this does not necessarily mean that each such reference is to the same embodiment(s), or that the feature only applies to a single embodiment. Single features of different embodiments may also be combined to provide other embodiments.
Embodiments are applicable to any user device, such as a user terminal, relay node, server, node, corresponding component, and/or to any communication system or any combination of different communication systems that support required functionalities. The communication system may be a wireless communication system or a communication system utilizing both fixed networks and wireless networks. The protocols used, the specifications of communication systems, apparatuses, such as servers and user terminals, especially in wireless communication, develop rapidly. Such development may require extra changes to an embodiment. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, embodiments.
Embodiments are mainly targeted to so-called "Beyond 4G" systems which are now only in the developing phase. Systems beyond 4G are designed to fulfil international mobile telecommunications advanced+ ( I MT- Advanced +) requirements, at least as to data rates. Common assumption in the field is that rata rates will be 10 Gbit/s for a low mobility case and 1 Gbit/s for a high
mobility case. The structure and elements of the systems are not yet decided. However, it is presumed that one option of such a system when specified will resemble that of the Long Term Evolution (LTE) Advanced or it will be a development of it. Thus, in the following, an example of the system is described as if it were according to an LTE Advanced system. It is however emphasized that Figure 1 only shows an assumption of a not yet specified system. It should be understood that typically the names of network elements are somewhat different than the ones used in an earlier system generation to make it easier to tell the difference. However, due to the nature of communication systems, basic tasks the network has to carry out usually remain quite the same but implementations vary due to different, typically more demanding or progressive, requirements.
In the following, different exemplifying embodiments will be described using, as an example of an access architecture to which the embodiments may be applied, a radio access architecture based on LTE Advanced, LTE-A, that is based on orthogonal frequency multiplexed access (OFDMA) in a downlink and a single-carrier frequency-division multiple access (SC-FDMA) in an uplink, without restricting the embodiments to such an architecture, however. It is obvious for a person skilled in the art that the embodiments may also be applied to other kinds of communications networks having suitable means by adjusting parameters and procedures appropriately. For example, the embodiments are applicable to both frequency division duplex (FDD) and time division duplex (TDD).
In an orthogonal frequency division multiplexing (OFDM) system, the available spectrum is divided into multiple orthogonal sub-carriers. In OFDM systems, available bandwidth is divided into narrower sub-carriers and data is transmitted in parallel streams. Each OFDM symbol is a linear combination of signals on each of the subcarriers. Further, each OFDM symbol is preceded by a cyclic prefix (CP), which is used to decrease Inter-Symbol Interference. Unlike in OFDM, SC-FDMA subcarriers are not independently modulated.
Typically, a (e)NodeB ("e" stands for evolved) needs to know channel quality of each user device and/or the preferred precoding matrices (and/or other multiple input-multiple output (MIMO) specific feedback information, such as channel quantization) over the allocated sub-bands to schedule transmissions to user devices. Required information is usually signalled to the (e)NodeB.
Figure 1 depicts examples of simplified system architectures only showing some elements and functional entities, all being logical units, whose implementation may differ from what is shown. The connections shown in Figure 1 are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the system typically comprises also other functions and structures than those shown in Figure 1 .
The embodiments are not, however, restricted to the system given as an example but a person skilled in the art may apply the solution to other communication systems provided with necessary properties.
Figure 1 shows a part of a radio access network based on E-UTRA, LTE, LTE-Advanced (LTE-A) or LTE/EPC (EPC = evolved packet core, EPC is enhancement of packet switched technology to cope with faster data rates and growth of Internet protocol traffic). E-UTRA is an air interface of Release 8 (UTRA= UMTS terrestrial radio access, UMTS= universal mobile telecommunications system). Some advantages obtainable by LTE (or E- UTRA) are a possibility to use plug and play devices, and Frequency Division Duplex (FDD) and Time Division Duplex (TDD) in the same platform.
Figure 1 shows user devices 1 00 and 102 configured to be in a wireless connection on one or more communication channels 104, 106 in a cell with a (e)NodeB 108 providing the cell. The physical link from a user device to a (e)NodeB is called uplink or reverse link and the physical link from the NodeB to the user device is called downlink or forward link.
The NodeB, or advanced evolved node B (eNodeB, eNB) in LTE- Advanced, is a computing device configured to control the radio resources of communication system it is coupled to. The (e)NodeB may also be referred to
a base station, an access point or any other type of interfacing device including a relay station capable of operating in a wireless environment.
The (e)NodeB includes transceivers, for example. From the transceivers of the (e)NodeB, a connection is provided to an antenna unit that establishes bi-directional radio links to user devices. The antenna unit may comprise a plurality of antennas or antenna elements. The (e)NodeB is further connected to core network 1 10 (CN). Depending on the system, the counterpart on the CN side can be a serving gateway (S-GW, routing and forwarding user data packets), packet data network gateway (P-GW), for providing connectivity of user devices (UEs) to external packet data networks, or mobile management entity (MME), etc.
A communications system typically comprises more than one (e)NodeB in which case the (e)NodeBs may also be configured to communicate with one another over links, wired or wireless, designed for the purpose. These links may be used for signalling purposes.
The communication system is also able to communicate with other networks, such as a public switched telephone network or the Internet 1 1 2.
The user device (also called UE, user equipment, user terminal, terminal device, etc.) illustrates one type of an apparatus to which resources on the air interface are allocated and assigned, and thus any feature described herein with a user device may be implemented with a corresponding apparatus, such as a relay node. An example of such a relay node is a layer 3 relay (self-backhauling relay) towards the base station.
The user device typically refers to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (mobile phone), smartphone, personal digital assistant (PDA), handset, device using a wireless modem (alarm or measurement device, etc.), laptop and/or touch screen computer, tablet, game console, notebook, and multimedia device.
The user device (or in some embodiments a layer 3 relay node) is configured to perform one or more of user equipment functionalities. The user
device may also be called a subscriber unit, mobile station, remote terminal, access terminal, user terminal or user equipment (UE) just to mention but a few names or apparatuses.
It should be understood that, in Figure 1 , user devices are depicted to include 2 antennas only for the sake of clarity. The number of reception and/or transmission antennas may naturally vary according to a current implementation.
Further, although the apparatuses have been depicted as single entities, different units, processors and/or memory units (not all shown in Figure 1 ) may be implemented.
It is obvious for a person skilled in the art that the depicted system is only an example of a part of a radio access system and in practise, the system may comprise a plurality of (e)NodeBs, the user device may have an access to a plurality of radio cells and the system may comprise also other apparatuses, such as physical layer relay nodes or other network elements, etc. At least one of the NodeBs or eNodeBs may be a Home(e)nodeB. Additionally, in a geographical area of a radio communication system a plurality of different kinds of radio cells as well as a plurality of radio cells may be provided. Radio cells may be macro cells (or umbrella cells) which are large cells, usually having a diameter of up to tens of kilometres, or smaller cells such as micro-, femto- or picocells. The (e)NodeB 108 of Figure 1 may provide any kind of these cells. A cellular radio system may be implemented as a multilayer network including several kinds of cells. Typically, in multilayer networks, one node B provides one kind of a cell or cells, and thus a plurality of node Bs are required to provide such a network structure.
Studies and extrapolations from recent developments predict a total mobile broadband traffic increase by a factor of 100 or even up to 1000 until 2020. These figures assume 10 times increase in broadband mobile subscribers and up to 100 times higher traffic per user. The relative fastest growth is expected in smartphones. Besides the overall traffic, the achievable throughput per user has to be increased significantly. A rough estimation predicts an at least 10 times increase in average as well as in peak data rate.
Moreover, some essential design criteria have to be paid higher attention to than it used to be today's systems. One important target is latency minimisation or optimisation.
Nowadays, LTE/LTE-Advanced with data rates 0.1 -1 Gbps provides 5 10 ms latency (round trip time). Generally speaking, latency must decrease at the same pace as the data rate increases.
It is generally understood that a very small latency (such as 0.1 ms) is beneficial, if the content is located at proximity, such as in the same office network or the same campus. Otherwise there would be too much delay on the i o link between the server and the access point.
Physical layer latency is hard-coded in existing radio systems. For instance the LTE-Advanced specification defines processing requirements (i.e., computational complexity) for the node and/or user device receiver. These requirements may be presented in the form of a node and/or user
15 device processing time after receiving a physical downlink control channel (PDSCH) and/or physical uplink shared channel (PUSCH) message and before sending a hybrid automatic repeat request (HARQ) acknowledgment/no-acknowlegdement (ACK/NACK) message. A physical layer latency, which defines node and/or user device processing time
20 requirements, depends mainly on computational complexity and processing parallelization possibilities.
A hybrid-automatic repeat request (HARQ) is an important feature to enhance the performance of packet data transmission. Usually, the HARQ controls and initiates packet retransmission on layer 1 (physical layer), to
25 reduce retransmission delay caused by higher layer transmission. In the case of a link error, caused for instance by interference, a receiving entity may request retransmission of corrupted data packets. HARQ is a "stop and wait" protocol of a nature: a subsequent transmission may take place only after receiving an ACK/NACK from a receiving entity.
30 HARQ is currently typically implemented by using two rate-matching stages and a virtual memory buffer. In principle, the first rate matching stage matches a selected number of input bits to the virtual buffer. The second rate
matching stage matches the number of bits after the first rate matching stage to physical channel bits for one transmission time interval (TTI).
A fixed HARQ subsystem does not take into account variable data rates, variable latency requirements, variable signal processing capability or a variable HARQ operation point, for example .
The latency performance of LTE Rel-8/9/10 does not meet Beyond 4G targets. One aspect needing reconsidering is HARQ-retransmissions.
Some embodiments are disclosed in further details in relation to Figures 2 and 3. One target of some embodiments is to speed up HARQ retransmissions by allowing signalling of a NACK-message even before the corresponding packet has been received completely (or even before it has been sent or transmitted completely).
Some embodiments enable minimising HARQ re-transmission delay and relaxing processing requirements while achieving improved latency performance. Latency performance may be improved in particular for retransmitted data packets. It should be emphasized that usually these are the packets that determine general delay for higher layers or applications, because packets are typically segmented into a plurality of radio packets and a receiver has to wait until all physical layer packets have arrived.
The embodiment of Figure 2 is usually related to a user device, home node or a web stick. The embodiment begins in block 200.
In block 202, a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained, is prepared. The retransmission procedure of the LTE-Advanced comprises a HARQ functionality which is described above.
Potential reasons for "early NACK" (that is to say a no- acknowledgement message conveyed earlier than in a conventional HARQ- procedure) may be that at least one coding block of a transport block has already been received erroneously or a receiver identifies that a channel or its interference conditions have deteriorated after a scheduling decision (or after a
previous channel state information report), or that they are insufficient for the modulation coding scheme (MCS) selected by a transmitter (e.g. because reports have been lost or corrupted, and therefore the transmitter assumed incorrectly too good a signal-to-interference and noise- ratio (SINR) or used beamforming or precoding in a non-optimum manner).
Term "early NACK" denotes that a NACK-message is conveyed in an earlier phase than conventionally in current systems supporting Hybrid ARQ (hybrid automatic repeat request). The early NACK may be based on anticipated transmission time interval (TTI) quality according to predefined rules or policies.
In an embodiment, "early NACK" is signaled using an "on-off keying" principle in which a related acknowledgement state corresponds to "no transmission" in order to save power and reduce interference caused by an ACK/NACK signal. In other words, only NACK is signaled, whereas "no transmission" corresponds to the situation where the receiving node has not identified any reason to transmit "early NACK". Early NACK may have a fixed or flexible timing relationship with relation to data reception. In the case of the flexible timing, a receiver node, such as a user device, is allowed to transmit "early NACK" using ACK/NACK resources corresponding to a first available ACK/NACK resource prior to a regular or conventional ACK/NACK. Hence, the "early NACK" may be transmitted using a first temporal resource that is available for (HARQ) feedback signaling. It should be appreciated that an early NACK may cancel or substitute a regular or conventional (ACK/)NACK, since it would be unnecessary redundancy and thus waste of resources. This embodiment may be based on an observation that a part of a transport block has been received erroneously.
In another embodiment, signaling both "early NACK" and "early ACK" is an option. This option may make timing flexible. The early ACK/NACK may be transmitted right after the entire packet is received and decoded correctly without the need to wait for the "regular ACK/NACK" procedure. In cases wherein the quality of a received signal is inadequate, even after a few Turbo decoding iterations, it may become obvious that the decoding metric
does not improve and the turbo decoder does not start to converge. Thus an early NACK-message may be sent. This embodiment may be based on an indication of inadequate quality of at least part of a transport block.
Another embodiment may utilize not only "early NACK" but also 5 some other signaling, such as a channel quality information (CQI) report, as a trigger for "early retransmission". For this option a transmitting node (for example a (e)nodeB) and a receiving node (for example a user device) have sufficient flexibility to assign HARQ processes in a dynamic manner. If a user device reports channel quality regularly, a node may come to a conclusion i o based on these reports that a channel quality has decreased and send a retransmission.
An exemplary transport block (TB) with the duration of one TTI consists of multiple Turbo-coded coding blocks each having a separate cyclic redundancy check (CRC). "Early NACK" may be triggered immediately after a
15 receiver identifies that a certain part of a transport block, such as one coding block, is erroneous or corrupted. It should be understood that due to interleaving, quality among different blocks is typically well aligned. Hence, already a first coding block may reflect the quality of the entire transport block quite accurately. It should also be appreciated that in order to enhance pipeline
20 processing, interleaving should take place only in a frequency domain.
In the case the number of coding blocks is small (as may be when a data rate is low and/or TTI length is long), it is possible to arrange the coding blocks in such a manner that at least one (usually a small) coding block (a test coding block) or some other means indicating the quality of the coding block(s)
25 accurately enough is provided. The test coding block may be arranged to be the first one in a transport block. It may also be located in another position in the transport block. The test coding block may have a low coding gain and therefore it may be transmitted with a lower code rate. This may not be efficient, but it relates only to a small part of data. Alternatively, it may be
30 possible to increase the number of coding blocks by splitting a transmission time interval into multiple smaller coding blocks, again at the expense of a
coding gain. One or more of these split coding blocks comprise an indication of inadequate quality of at least part of the transport block.
Usually, the concept of "early NACK" needs to be combined with other HARQ signaling. Systems supporting "early NACK" typically provide means to adjust HARQ processes in a flexible manner that is to say the usage of certain HARQ processes in certain uplink TTIs is not required. Thus asynchronous HARQ may be used whenever available in order to materialize enhanced HARQ feedback signaling in shortened retransmission latency.
In order NACK-messages may be sent flexibly in time, an indication to which TTI a message relates to is added to the NACK-messages. This may be a single bit indicating whether it is an early ACK/NACK or a conventional one. Another option is that multiple bits (e.g., two bits) may be used for indicating also a HARQ process number.
One example of ACK/NACK signaling is that "early NACK" is transmitted at the same time and using the same resources as a conventional ACK/NACK for a block. In this manner, "early NACK" for a following block may implicitly also indicate an ACK for the block. This may be implemented by using the "on-off keying" approach, by choosing the polarity of a transmitted early NACK to be different from the one of an ordinary ACK. In complex coordinates, the ACK may be +1 and the "early" NACK may be -1 , while an ordinary ACK may be coded as 0. This embodiment provides an option to save resources. Another option is to apply quadrature phase shift keying (QPSK) constellation in a such a manner that "early (ACK/)NACK" and ordinary ACK/NACK are transmitted using a same modulation symbol.
The embodiment ends in block 204. The embodiment is repeatable in many ways. One example is shown by arrow 206 in Figure 2.
Another embodiment is usually related to a node, host or server. The embodiment will be described by means of Figure 3. The embodiment begins in block 300.
In block 302, a transport block for data conveyance is prepared. The transport block comprises an indication of quality.
The quality indication may be implemented by means of a transport block specific cyclic redundancy check (CRC).
In the case the number of coding blocks is small (as may be when a data rate is low and/or TTI length is long), it is possible to arrange the coding blocks in such a manner that at least one certain (usually a small) coding block (a test coding block) or some other means indicating the quality of the coding block(s) accurately enough is provided. The test coding block is usually arranged to be the first one in a transport block. It may also be located in another position in the transport block. The test coding block may have a low coding gain and therefore it may be transmitted with a lower code rate. This may not be efficient, but it relates only to a small part of data. Alternatively, it may be possible to increase the number of coding blocks by splitting a transmission time interval into multiple smaller coding blocks, again at the expense of a coding gain. A test coding block may be used as an indication of quality.
The embodiment ends in block 304. The embodiment is repeatable in many ways. One example is shown by arrow 306 in Figure 3.
The steps/points, signaling messages and related functions described above in Figures 2 and 3 are in no absolute chronological order, and some of the steps/points may be performed simultaneously or in an order differing from the given one. Other functions may also be executed between the steps/points or within the steps/points and other signaling messages sent between the illustrated messages. Some of the steps/points or part of the steps/points can also be left out or replaced by a corresponding step/point or part of the step/point.
It should be understood that conveying, transmitting and/or receiving may herein mean preparing a data conveyance, transmission and/or reception, preparing a message to be conveyed, transmitted and/or received, or physical transmission and/or reception itself, etc. on a case by case basis.
An embodiment provides an apparatus which may be any user device, home node, web stick or any other suitable apparatus capable to carry out processes described above in relation to Figure 2.
Another embodiment provides an apparatus which may be any server, node, host or any other suitable apparatus capable to carry out processes described above in relation to Figure 3.
Figure 4 illustrates a simplified block diagram of an apparatus according to an embodiment especially suitable for communicating a no- acknowledgement information.
As an example of an apparatus according to an embodiment, it is shown an apparatus 400, such as a user device, relay node or web stick, including facilities in a control unit 404 (including one or more processors, for example) to carry out functions of embodiments according to Figure 2.
In Figure 4, block 406 includes parts/units/modules need for reception and transmission, usually called a radio front end, RF-parts, radio parts, etc. This block is optional.
Another example of an apparatus 400 may include at least one processor 304 and at least one memory 402 including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
Yet another example of an apparatus comprises means 404 for preparing a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
Yet another example of an apparatus comprises a preparing unit configured to prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
Figure 5 illustrates a simplified block diagram of an apparatus according to an embodiment especially suitable for communicating a no- acknowledgement information.
As an example of an apparatus according to an embodiment, it is shown an apparatus 500, such as a server, host or node, including facilities in a control unit 504 (including one or more processors, for example) to carry out functions of embodiments according to Figure 3.
In Figure 5, block 506 includes parts/units/modules need for reception and transmission, usually called a radio front end, RF-parts, radio parts, etc. This block is optional.
Another example of an apparatus 500 may include at least one processor 504 and at least one memory 502 including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to: prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
Yet another example of an apparatus comprises means 504 for preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
Yet another example of an apparatus comprises a preparing unit configured to prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
It should be understood that the apparatuses may include or be coupled to other units or modules etc, such as radio parts or radio heads, used in or for transmission and/or reception. This is depicted in Figures 4 and 5 as optional blocks 406 and 506.
Although the apparatuses have been depicted as one entity in Figures 4 and 5, different modules and memory may be implemented in one or more physical or logical entities.
An apparatus may in general include at least one processor, controller or a unit designed for carrying out control functions operably coupled to at least one memory unit and to various interfaces. Further, the memory
units may include volatile and/or non-volatile memory. The memory unit may store computer program code and/or operating systems, information, data, content or the like for the processor to perform operations according to embodiments. Each of the memory units may be a random access memory, hard drive, etc. The memory units may be at least partly removable and/or detachably operationally coupled to the apparatus. The memory may be of any type suitable for the current technical environment and it may be implemented using any suitable data storage technology, such as semiconductor-based technology, flash memory, magnetic and/or optical memory devices. The memory may be fixed or removable.
The apparatus may be a software application, or a module, or a unit configured as arithmetic operation, or as a program (including an added or updated software routine), executed by an operation processor. Programs, also called program products or computer programs, including software routines, applets and macros, may be stored in any apparatus-readable data storage medium and they include program instructions to perform particular tasks. Computer programs may be coded by a programming language, which may be a high-level programming language, such as objective-C, C, C++, Java, etc., or a low-level programming language, such as a machine language, or an assembler.
Modifications and configurations required for implementing functionality of an embodiment may be performed as routines, which may be implemented as added or updated software routines, application circuits (ASIC) and/or programmable circuits. Further, software routines may be downloaded into an apparatus. The apparatus, such as a node device, or a corresponding component, may be configured as a computer or a microprocessor, such as single-chip computer element, or as a chipset, including at least a memory for providing storage capacity used for arithmetic operation and an operation processor for executing the arithmetic operation.
Embodiments provide computer programs embodied on a distribution medium, comprising program instructions which, when loaded into
electronic apparatuses, constitute the apparatuses as explained above. The distribution medium may be a non-transitory medium.
Other embodiments provide computer programs embodied on a computer readable medium, configured to control a processor to perform embodiments of the methods described above. The computer readable medium may be a non-transitory medium.
The computer program may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, distribution medium, or computer readable medium, which may be any entity or device capable of carrying the program. Such carriers include a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package, for example. Depending on the processing power needed, the computer program may be executed in a single electronic digital computer or it may be distributed amongst a number of computers. The computer readable medium may be a non-transitory medium.
The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware (one or more devices), firmware (one or more devices), software (one or more modules), or combinations thereof. For a hardware implementation, the apparatus may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, digitally enhanced circuits, other electronic units designed to perform the functions described herein, or a combination thereof. For firmware or software, the implementation may be carried out through modules of at least one chip set (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit and executed by processors. The memory unit may be implemented within the processor or externally to the processor. In the latter case it may be communicatively coupled to the processor via various means, as is known in
the art. Additionally, the components of systems described herein may be rearranged and/or complimented by additional components in order to facilitate achieving the various aspects, etc., described with regard thereto, and they are not limited to the precise configurations set forth in the given figures, as will be appreciated by one skilled in the art.
It will be obvious to a person skilled in the art that, as technology advances, the inventive concept may be implemented in various ways. The invention and its embodiments are not limited to the examples described above but may vary within the scope of the claims.
Claims
1 . An apparatus comprising:
at least one processor and at least one memory including a computer program code, the at least one memory and the computer program 5 code configured to, with the at least one processor, cause the apparatus at least to:
prepare a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the i o transport block has been obtained.
2. The apparatus of claim 1 , wherein the no-acknowledgement message is in relation to a hybrid automatic repeat request (HARQ) procedure.
15 3. The apparatus of claim 1 or 2, wherein the no-acknowledgement message is transmitted using a first temporal resource available for Hybrid automatic repeat request (HARQ) feedback signaling.
4. The apparatus of any preceding claim, wherein the no- 20 acknowledgement message is signaled using an "on-off keying" principle.
5. The apparatus of any preceding claim, the apparatus further being caused to:
utilize a channel quality information (CQI) report as means for 25 evaluating the need for the no-acknowledgement message.
6. The apparatus of any preceding claim, wherein the part of the transport block is a coding block.
30 7. The apparatus of any preceding claim, wherein the indication of inadequate quality of at least part of the transport block is at least one specified test block located in the transport block.
8. The apparatus of any preceding claim, wherein a transmission 35 time interval is split into multiple smaller coding blocks of which split coding blocks at least one comprises the indication of inadequate quality of at least part of the transport block
9. The apparatus of any preceding claim, the apparatus comprising a user device, relay node or web stick.
10. A computer program comprising program instructions which, when loaded into the apparatus, constitute the modules of any preceding claim
I to 8.
1 1 . An apparatus comprising:
at least one processor and at least one memory including a computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to:
prepare a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
12. The apparatus of claim 1 1 , wherein the indication of inadequate quality of at least part of the transport block is at least one specified test block located in the transport block.
13. The apparatus of claim 1 1 or 12, wherein a transmission time interval is split into multiple smaller coding blocks of which split coding blocks at least one comprises the indication of inadequate quality of at least part of the transport block.
14. The apparatus of any preceding claim 1 1 to 1 3, the apparatus comprising a server, node or host.
15. A computer program comprising program instructions which, when loaded into the apparatus, constitute the modules of any preceding claim
I I to 13.
16. A method comprising: preparing a transmission of a no-acknowledgement message to be conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
17. The method of claim 16, wherein the no-acknowledgement message is in relation to a hybrid automatic repeat request (HARQ) procedure.
18. The method of claim 16 or 1 7, wherein the no-acknowledgement message is transmitted using a first temporal resource available for Hybrid automatic repeat request (HARQ) feedback signaling.
19. The method of any preceding claim 16 to 18, wherein the no- acknowledgement message is signaled using an "on-off keying" principle.
20. The method of any preceding claim 16 to 19, further comprising: utilize a channel quality information (CQI) report as means for evaluating the need for the no-acknowledgement message.
21 . The method of any preceding claim 16 to 20, wherein the part of the transport block is a coding block.
22. The method of any preceding claim 16 to 21 , wherein the indication of inadequate quality of at least part of the transport block is at least one specified test block located in the transport block.
23. The apparatus of any preceding claim 16 to 22, wherein a transmission time interval is split into multiple smaller coding blocks of which split coding blocks at least one comprises the indication of inadequate quality of at least part of the transport block
24. An apparatus comprising means for carrying out the method according to any one of claims 16 to 23.
25. A method comprising: preparing a transport block for data conveyance, the transport block comprising an indication of a quality of at least part of a transport block.
26. The method of claim 25, wherein the indication of inadequate 5 quality of at least part of the transport block is at least one specified test block located in the transport block.
27. The method of claim 25 or 26, wherein a transmission time interval is split into multiple smaller coding blocks of which split coding blocks i o at least one comprises the indication of inadequate quality of at least part of the transport block
28. An apparatus comprising means for carrying out the method according to any one of claims 25 to 27.
15
29. A computer program embodied on a computer-readable storage medium, the computer program comprising program code for controlling a process to execute a process, the process comprising:
preparing a transmission of a no-acknowledgement message to be 20 conveyed to a node, when a part of a transport block has been received erroneously or an indication of inadequate quality of at least part of the transport block has been obtained.
30. The computer program of claim 29, wherein the no- 25 acknowledgement message is in relation to a hybrid automatic repeat request
(HARQ) procedure.
31 . The computer program of claim 29 or 30, wherein the no- acknowledgement message is transmitted using a first temporal resource
30 available for Hybrid automatic repeat request (HARQ) feedback signaling.
32. The computer program of any preceding claim 29 to 31 , wherein the no-acknowledgement message is signaled using an "on-off keying" principle.
35
33. The computer program of any preceding claim 29 to 32, further comprising:
utilize a channel quality information (CQI) report as means for evaluating the need for the no-acknowledgement message.
5
34. The computer program of any preceding claim 29 to 33, wherein the part of the transport block is a coding block.
35. The computer program of any preceding claim 29 to 34, wherein i o the indication of inadequate quality of at least part of the transport block is at least one specified test block located in the transport block.
36. The computer program of any preceding claim 29 to 35, wherein a transmission time interval is split into multiple smaller coding blocks of which
15 split coding blocks at least one comprises the indication of inadequate quality of at least part of the transport block
37. A computer program comprising:
preparing a transport block for data conveyance, the transport block 20 comprising an indication of a quality of at least part of a transport block.
38. The computer program of claim 37, wherein the indication of inadequate quality of at least part of the transport block is at least one specified test block located in the transport block.
25
39. The computer program of claim 37 or 38, wherein a transmission time interval is split into multiple smaller coding blocks of which split coding blocks at least one comprises the indication of inadequate quality of at least part of the transport block
30
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2011/059891 WO2012171556A1 (en) | 2011-06-15 | 2011-06-15 | Latency |
EP11725924.2A EP2721755A1 (en) | 2011-06-15 | 2011-06-15 | Latency |
CN201180071633.6A CN103918207A (en) | 2011-06-15 | 2011-06-15 | Latency |
US14/126,166 US20140201586A1 (en) | 2011-06-15 | 2011-06-15 | Latency |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2011/059891 WO2012171556A1 (en) | 2011-06-15 | 2011-06-15 | Latency |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012171556A1 true WO2012171556A1 (en) | 2012-12-20 |
Family
ID=44627128
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2011/059891 WO2012171556A1 (en) | 2011-06-15 | 2011-06-15 | Latency |
Country Status (4)
Country | Link |
---|---|
US (1) | US20140201586A1 (en) |
EP (1) | EP2721755A1 (en) |
CN (1) | CN103918207A (en) |
WO (1) | WO2012171556A1 (en) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2014097357A1 (en) * | 2012-12-19 | 2014-06-26 | 富士通株式会社 | Radio terminal, radio base station, radio communication system, and radio communication method |
CN107113242A (en) * | 2014-11-06 | 2017-08-29 | 诺基亚通信公司 | Improve communication efficiency |
CN107210840B (en) * | 2015-07-30 | 2020-01-21 | 华为技术有限公司 | Communication method and communication equipment |
US10581559B2 (en) | 2016-07-18 | 2020-03-03 | Sharp Kabushiki Kaisha | User Equipment, base stations and methods |
US10595166B2 (en) | 2016-07-18 | 2020-03-17 | Sharp Kabushiki Kaisha | Systems and methods for processing time reduction signaling |
US10440706B2 (en) | 2016-08-08 | 2019-10-08 | Sharp Kabushiki Kaisha | Systems and methods for PUCCH resource allocation and HARQ-ACK reporting with processing time reduction |
CN107809800B (en) * | 2016-09-09 | 2021-08-10 | 上海诺基亚贝尔股份有限公司 | Method and equipment for sending data |
CN108347311B (en) * | 2017-01-25 | 2021-05-11 | 华为技术有限公司 | Method for sending and receiving feedback information, access network equipment and terminal equipment |
ES2963883T3 (en) | 2017-05-12 | 2024-04-03 | Koninklijke Philips Nv | Receiver, transmitter, communication network, data signal and procedure to improve a retransmission process in a communication network. |
CN110611554B (en) * | 2018-06-14 | 2021-02-23 | 华为技术有限公司 | Transmission method and device of feedback information |
GB2576210B8 (en) * | 2018-08-10 | 2020-10-21 | Tcl Communication Ltd | Downlink transmission with two-stage feedback:early prediction-based feedback of Physical Downlink Shared Channel and Hybrid Automatic Repeat Request feedback |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040258096A1 (en) * | 2003-06-18 | 2004-12-23 | Yoon Young C. | Forward ACK/NACK channel for CDMA system |
US20050063344A1 (en) * | 2003-09-22 | 2005-03-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods and apparatus for efficient decoding |
US20070060060A1 (en) * | 2005-04-18 | 2007-03-15 | Feng Qian | Power-efficient signaling for asymmetric multi-carrier communications |
US20090274139A1 (en) * | 2008-05-05 | 2009-11-05 | Qualcomm Incorporated | Pre-emptive acknowledgement for data transmission in a communication system |
WO2010074157A1 (en) * | 2008-12-24 | 2010-07-01 | 京セラ株式会社 | Communication system, communication device, wireless base station, and communication method |
US20100262886A1 (en) * | 2009-04-09 | 2010-10-14 | Texas Instruments Incorporated | Selective decoding of re-transmitted data blocks |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6671849B2 (en) * | 2002-05-14 | 2003-12-30 | Motorola, Inc. | Reliability-based type-II hybrid ARQ scheme |
JP5485870B2 (en) * | 2007-04-30 | 2014-05-07 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | Methods and configurations for communication networks |
WO2009096752A1 (en) * | 2008-02-03 | 2009-08-06 | Lg Electronics Inc. | Method and apparatus for supporting harq |
US8634333B2 (en) * | 2008-05-07 | 2014-01-21 | Qualcomm Incorporated | Bundling of ACK information in a wireless communication system |
US8639996B2 (en) * | 2008-07-11 | 2014-01-28 | Qualcomm Incorporated | Systems and methods for uplink inter-cell interference cancellation using hybrid automatic repeat request (HARQ) retransmissions |
US8555128B2 (en) * | 2010-03-24 | 2013-10-08 | Futurewei Technologies, Inc. | System and method for transmitting and receiving acknowledgement information |
-
2011
- 2011-06-15 CN CN201180071633.6A patent/CN103918207A/en active Pending
- 2011-06-15 US US14/126,166 patent/US20140201586A1/en not_active Abandoned
- 2011-06-15 EP EP11725924.2A patent/EP2721755A1/en not_active Withdrawn
- 2011-06-15 WO PCT/EP2011/059891 patent/WO2012171556A1/en active Application Filing
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040258096A1 (en) * | 2003-06-18 | 2004-12-23 | Yoon Young C. | Forward ACK/NACK channel for CDMA system |
US20050063344A1 (en) * | 2003-09-22 | 2005-03-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods and apparatus for efficient decoding |
US20070060060A1 (en) * | 2005-04-18 | 2007-03-15 | Feng Qian | Power-efficient signaling for asymmetric multi-carrier communications |
US20090274139A1 (en) * | 2008-05-05 | 2009-11-05 | Qualcomm Incorporated | Pre-emptive acknowledgement for data transmission in a communication system |
WO2010074157A1 (en) * | 2008-12-24 | 2010-07-01 | 京セラ株式会社 | Communication system, communication device, wireless base station, and communication method |
US20110320899A1 (en) * | 2008-12-24 | 2011-12-29 | Kyocera Corporation | Communication system, communication apparatus, radio base station, and communication method |
US20100262886A1 (en) * | 2009-04-09 | 2010-10-14 | Texas Instruments Incorporated | Selective decoding of re-transmitted data blocks |
Also Published As
Publication number | Publication date |
---|---|
CN103918207A (en) | 2014-07-09 |
US20140201586A1 (en) | 2014-07-17 |
EP2721755A1 (en) | 2014-04-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20140201586A1 (en) | Latency | |
KR102670267B1 (en) | Codeword determination for confirmation response information | |
CN111684751B (en) | Communication apparatus, infrastructure equipment and method | |
EP3547585B1 (en) | Wireless communication having reduced feedback delay | |
US20140204961A1 (en) | Signaling | |
EP3590214A1 (en) | Methods and apparatus for enhanced spectral efficiency and reliability of transmissions without grant | |
US11362767B2 (en) | Receiver, transmitter, system and method implementing a retransmission process responsive to an indication that encoded data on allocated resources is not decodable | |
US20190173623A1 (en) | Reallocation of control channel resources for retransmission of data in wireless networks based on communications mode | |
WO2014067090A1 (en) | Multiplexed transmission of data from multiple harq processes for a switching operation | |
EP3903436B1 (en) | Communications devices, infrastructure equipment and methods | |
US9749096B2 (en) | Methods, arrangements and nodes for providing composite acknowledgement information in a wireless communication system | |
JP6479216B2 (en) | Search for increased capacity in reliable and low-latency communications | |
US20150172030A1 (en) | Method and Apparatus for Signalling of HARQ Timing at UL/DL Subframe Reconfiguration | |
US20180359050A1 (en) | Adaptive network coding in wireless communications | |
US20140192760A1 (en) | Backward Compatibility of PUCCH Formats | |
CN108464046B (en) | Apparatus, system, and method for adaptive downlink scheduling and link adaptation | |
WO2022207719A1 (en) | Dynamic transmission parameter values for retransmissions | |
FI20195875A1 (en) | Joint link adaptation for downlink control channel and data channel for wireless networks | |
JP2015173492A (en) | signaling |
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: 11725924 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14126166 Country of ref document: US |