Abstract: We provide a method of compressing a data stream for transmission, including: generating a data sequence representing a received data stream, generating a plurality of data substreams, each comprising a portion of the data sequence, identifying a formal concept defining a dependency between a first one of the data substreams and one or more further ones of the data substreams that are dependent on the first data substream, removing those dependent data substreams from the plurality of data substreams, and transmitting the remaining data substreams, and a method of reconstructing a data stream at a receiver, including: receiving a received data sequence representing a received data stream, identifying that a substream has been removed from the data stream prior to transmission, identifying a formal concept definition for regenerating the removed substream based on an identified substream of the received data sequence, regenerating a data substream using the formal concept definition and the identified substrea

Abstract: We provide a method of compressing a data stream for transmission, including: generating a data sequence representing a received data stream, generating a plurality of data substreams, each comprising a portion of the data sequence, identifying a formal concept defining a dependency between a first one of the data substreams and one or more further ones of the data sub streams that are dependent on the first data substream, removing those dependent data sub streams from the plurality of data sub streams, and transmitting the remaining data sub streams, and a method of reconstructing a data stream at a receiver, including: receiving a received data sequence representing a received data stream, identifying that a substream has been removed from the data stream prior to transmission, identifying a formal concept definition for regenerating the removed substream based on an identified substream of the received data sequence, regenerating a data substream using the formal concept definition and the identified sub

Abstract: The method for generating a secret key for encrypted wireless communications is a physical layer technique that exploits channel randomness between two nodes, the channel being characterized by reciprocity between the two nodes. Reference signals exchanged by the two nodes are used to faun a channel estimate, including gain location and phase location. The gain and phase locations are compared to threshold values, and locations exceeding the respective thresholds are stored in vectors. The moving differences between gain and phase locations at adjacent sampling times define secondary random processes. The moving difference values are quantized and converted to bit streams, which are concatenated to generate the secret key. Measures are provided to reduce parity errors, thereby reducing the bit mismatch rate (BMR).

Abstract: The non-coherent ultra-wideband receiver receives an ultra-wideband (UWB) signal, consisting of pulses (or “symbols”) and uses on-off keying (OOK) modulation so that when a binary “0” is transmitted, the receiver collects noise-only samples. The receiver collects samples during the symbol (pulse) duration and sorts the samples by magnitude of voltage or energy. The receiver uses the known transmission rate and the estimated signal-to-noise ratio to retrieve a sample index from a look-up table. The receiver then compares the signal sample at the index value with a predetermined threshold voltage (or energy). If the selected sample exceeds the threshold, then it is assumed that all succeeding samples also exceed the threshold (assuming the sort is in ascending magnitude) and the pulse is present and binary “1”. Otherwise, the pulse is absent in the sampling period, and binary “0”. The process is repeated for the signal duration.

Abstract: A method is proposed for scheduling, in a radio mobile network, serving cell/radio resource allocation pairs for transmission of data flows using Carrier Aggregation. Each serving cell/radio resource allocation pair includes a serving cell and a radio resource thereof allocated for transmission of data flows using Carrier Aggregation. At each scheduling period the method determines active data flows whose transmission is not yet completed at the current scheduling period, and performs a series of steps for each active data flow.

Abstract: The method for generating a secret key for encrypted wireless communications is a physical layer technique that exploits channel randomness between two nodes, the channel being characterized by reciprocity between the two nodes. Reference signals exchanged by the two nodes are used to faun a channel estimate, including gain location and phase location. The gain and phase locations are compared to threshold values, and locations exceeding the respective thresholds are stored in vectors. The moving differences between gain and phase locations at adjacent sampling times define secondary random processes. The moving difference values are quantized and converted to bit streams, which are concatenated to generate the secret key. Measures are provided to reduce parity errors, thereby reducing the bit mismatch rate (BMR).

Abstract: A method is proposed for scheduling, in a radio mobile network, serving cell/radio resource allocation pairs for transmission of data flows using Carrier Aggregation. Each serving cell/radio resource allocation pair includes a serving cell and a radio resource thereof allocated for transmission of data flows using Carrier Aggregation. At each scheduling period the method determines active data flows whose transmission is not yet completed at the current scheduling period, and performs a series of steps for each active data flow.

Abstract: The invention concerns a method for providing admission control for the admission of a mobile terminal (STA2) to a mobile network, whereby said admission control is based on at least one parameter (APP) that characterizes the radio channel that shall be used for a connection of the mobile terminal (STA2) to the mobile network and on at least one parameter (STAP) that characterizes the traffic flow of said connection, an admission controller (AC) and a communication system therewith.

Abstract: The present invention relates to a method for providing traffic differentiation in a wireless LAN, comprising the step of defining a plurality of access categories each associated with a priority value for the traffic it relates to. According to the present invention, said at least one access category relates to downlink traffic and at least one access category relates to uplink traffic.