Change search
ReferencesLink to record
Permanent link

Direct link
Data packets encoding and scheduling method for sending node in e.g. cellular wireless communication system, involves transmitting optimal composite packet obtained by decoding composite packet using intended receiving node.
Ericsson Research, Isafjordsgatan 14E, 164 93 Kista, Sweden.
2005 (English)Patent (Other (popular science, discussion, etc.))
Abstract [en]

NOVELTY - The method involves selectively storing data packets (X, Y, Z) received by a receiving node (410, 415, 420) and feeding back priori information to a sending node (405) i.e. base station. A composite data packet (450) is transmitted to the receiving nodes by the sending node by utilizing the priori information, where the composite data packet comprises information designated to the receiving nodes, and is encoded by the sending node. The composite packet is decoded by an intended receiving node to obtain optimal composite packet. The optimal composite packet is transmitted by the sending node. USE - Method for encoding and scheduling data packets in a sending node i.e. base station, of a communication system such as cellular wireless communication system and multihop system (all claimed). Can also be used for a mobile station, laptop computer and personal digital assistant (PDA) in an ad-hoc network system. ADVANTAGE - The method effectively encodes and schedules the data packets in the sending node of the communication system such that flexibility and throughput i.e. bit rate, of the system can be improved, and the system can be easily adapted to changing radio environment, thus improving the end-to-end latency characteristics. The method can easily determine, which optimal composite packets are formed in which levels, thus providing a possibility to improve the creation of composite packets. The method allows the sending node and receiving node to utilize the priori information such that the number of transmissions needed to transfer the data can be reduced, thus improving power and energy efficiency. DETAILED DESCRIPTION - An INDEPENDENT CLAIM is also included for a sending node comprising a feedback receiver. DESCRIPTION OF DRAWING(S) - The drawing shows a schematic illustration of transmission sequences in a communication system. Data packets (X, Y, Z) Sending node (405) Receiving nodes (410, 415, 420) Composite data packet (450)

Place, publisher, year, edition, pages
Keyword [en]
Network coding, arq, automatic repeat request, unicast
National Category
Communication Systems Telecommunications
URN: urn:nbn:se:kth:diva-74255ISI: 2007895934OAI: diva2:490148
US 7710908 B2 (2010-05-04)

US 7940712-B2 (2011-05-10); JP 4787320-B2 (2011-10-05); CN101213781-B (2012-08-08); EP 1900137-B1 (2013-01-23); EP 1900136-B1 (2013-03-27)

Available from: 2012-02-03 Created: 2012-02-02 Last updated: 2013-08-06Bibliographically approved

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Larsson, Peter
Communication SystemsTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 27 hits
ReferencesLink to record
Permanent link

Direct link