SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Larsson K.) ;mspu:(patent)"

Sökning: WFRF:(Larsson K.) > Patent

  • Resultat 1-7 av 7
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  • Glad, M, et al. (författare)
  • Separation Agent
  • 1983
  • Patent (populärvet., debatt m.m.)
  •  
4.
  • Larsson, Peter, 1966-, et al. (författare)
  • 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.
  • 2005
  • Patent (populärvet., debatt m.m.)abstract
    • 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)
  •  
5.
  • Larsson, Peter, 1966-, et al. (författare)
  • Method and arrangement for bi-directional relaying in wireless communication systems
  • 2005
  • Patent (populärvet., debatt m.m.)abstract
    • NOVELTY - The radio nodes (V1,V2) are engaged in bidirectional communication through relaying node (V3). The signal comprising data with respect to the nodes is transmitted concurrently to the relaying node (V3). A reduced representation of signals is formed by non-linearity encoding operating leading to superimposition of signals. The reduced representation data is transmitted to the radio nodes. USE - For wireless and cellular communication networks. ADVANTAGE - An efficient bidirectional communication is ensured. DETAILED DESCRIPTION - INDEPENDENT CLAIMS are also included for the following: (1) radio node sending and receiving method; (2) communication method; and (3) radio node. DESCRIPTION OF DRAWING(S) - The figure shows the flowchart illustrating the radio node relaying method.
  •  
6.
  • Larsson, Peter, 1966-, et al. (författare)
  • Method And Arrangement For Coding And Scheduling In Packet Data Communication Systems
  • 2005
  • Patent (populärvet., debatt m.m.)abstract
    • NOVELTY - The buffering, scheduling, encoding and transmission of the data packets containing information designated to a specific receiving node are performed in a sending node. The received information is stored selectively as priori information in the receiving node. The sending node utilizes information about the priori information fed back from the receiving nodes for transmitting a composite data packet containing information designated to multiple receiving nodes. USE - For communication system. ADVANTAGE - The encoding and scheduling operations performed in the sending node are improved by using the information about the priori information fed back from the receiving nodes. The throughput is improved and latency is reduced by sending less data packets from sending node to receiving nodes to achieve correct reception of transmitted data packets. DETAILED DESCRIPTION - INDEPENDENT CLAIMS are included for the following: (1) method of jointly encoding and scheduling multiple data packets; (2) decoding method for receiving node in communication system; (3) sending node adapted for use in communication system; (4) receiving node adapted for communication with sending node; and (5) communication system. DESCRIPTION OF DRAWING(S) - The figure shows a schematic illustration of the transmission sequences in the communication system. Sending node (405) Receiving nodes (410,415,420)
  •  
7.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-7 av 7

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy