Telefonaktiebolaget Lm Ericsson (publ)

Stefan Hakansson

Stefan Bruhn

Hans Hannu

Karl Hellwig

Ingemar Johansson

Krister Svanbro

Johan Kristiansson

Lars-Erik Jonsson

Tomas Lundberg

Mikael Degermark

Juwel Rana

Josef Hallberg

Kare Synnes

Peter Blocher

Social networking services, such as Facebook, Twitter, MySpace and Orkut, are changing our communication habits by introducing new tools that simplify and increase on-line interaction. The exemplary embodiments present methods for measuring the social strength among contacts on the basis of users' on-line interactions, which may be significantly used in real-time collaborative task management (e.g., inviting contacts for collaboration, selecting suitable tools for communication, prioritizing information flow). Moreover, exemplary embodiments provide a framework for developing new mobile social networking applications (social search client, smart dialer or contact applications) by extending the use of social ranking of contacts. Exemplary embodiments aggregate contact information from different communication sources and then harness the interaction patterns together with social strength between contacts, for instance by using communication history (interaction logs) and process mining techniques, to build an aggregated social graph that describes a user's communication habit.

Social data ranking and processing

A method and arrangement for dynamically adapting thresholds used for selecting a codec mode to be used is presented. Thresholds are adapted in response to the current received signal quality. An estimate of actual prevailing received signal quality is obtained on which the adaptation is based. The present invention can be applied either on the mobile terminal side or on the network side, working on the uplink and/or the downlink. The thresholds can be modified on the receiving side, or, when operating in the network and working on the downlink, the threshold adaptation can be initiated in the terminal.

Methods and arrangements for adaptive thresholds in codec selection

Techniques for discontinuous transmission (DTX) and fast in-band signaling of configuration changes and protocol messages in speech communications systems provide cost efficiency in terms of radio transmission capacity, in terms of fixed line transmission, and in terms of implementation effort. An exemplary method for performing discontinuous transmission (DTX) in a communications system in which source data is interleaved for transmission from a first component in the system to a second component in the system includes the steps of detecting periods of source data inactivity, and transmitting silence descriptor (SID) frames from the first to the second component during the periods of source data inactivity, certain of the transmitted SID frames being interleaved using a different interleaving algorithm as compared to that used for source data. For example, the source data can be block diagonally interleaved, and certain of the SID frames can be block interleaved. An exemplary method for effecting configuration changes in a communications system includes the step of transmitting an escape frame in place of a speech data frame, the escape frame including a gross bit pattern to distinguish the escape frame from speech data frames and conveying a configuration change indication. The escape frame can further include a data field to indicate a particular configuration change to be made. For example, where the communications system is an AMR system, an escape frame can be used to change an active codec mode set. Alternatively, an escape frame can be used to change a phase of codec information.

Efficient in-band signaling for discontinuous transmission and configuration changes in adaptive multi-rate communications systems

In packet communications that employ header compression/decompression, the computational complexity of checksum generation can be reduced by re-using static checksum information associated with header bits that do not change from header to header. The static checksum information can be used together with information about header bits that do change from header to header, in order to generate a desired checksum. The checksum can then be used to verify a reconstructed header produced from a compressed header by a header decompressor.

Re-use of static checksum information in header compression/decompression applications

Growing community of inventors

Lule{dot over (a)}, Sweden

Stefan Hakansson