Abstract: A virtual beacon system that provides proximity alerts is described. The proximity alerts are based on the location of a mobile device (100) and a location of interest. The method may include the steps of providing sensor readings for signals, calculating a mobile device location, determining the distance between a mobile device and a product location (202) and generating a proximity trigger (208). A described virtual beacon system includes a monitoring access point (104) for providing sensor readings and transmitting proximity triggers, a location cloud service (106) for calculating a mobile device (100) location and proximity alert service (108) for generating proximity triggers based on the mobile device location.

Abstract: A virtual beacon system that provides proximity alerts is described. The proximity alerts are based on the location of a mobile device (100) and a location of interest. The method may include the steps of providing sensor readings for signals, calculating a mobile device location, determining the distance between a mobile device and a product location (202) and generating a proximity trigger (208). A described virtual beacon system includes a monitoring access point (104) for providing sensor readings and transmitting proximity triggers, a location cloud service (106) for calculating a mobile device (100) location and proximity alert service (108) for generating proximity triggers based on the mobile device location.

Abstract: Methods and apparatus for generating and performing digital communications using a randomized generatable interleaver. In accordance with one exemplary embodiment of the invention, a pseudo random interleaver of size n*m with excellent randomness and spread properties may be generated from a set of seed values. The interleaver of size N=n*m is defined by dividing the N possible address in the interleaver (0?N?1) into n subsets. The subsets are preferably generatable from a single value within the subset either using an algorithm or a memory based lookup table. The set of n seeds comprises one value selected from each subset. An improved communication system incorporating the aforementioned interleaver and using turbo codes or other concatenated coding systems is also disclosed.

Abstract: Methods and apparatus are described for improving receiver performance in a multicarrier communication network in which an encoded symbol (250) is transmitted over a transmission channel (20) in the communications system. A model of the transmission channel (20) is estimated (718, 760), said model characterising an effect of intercarrier interference on at least one carrier in the multicarrier system. The received symbol (250) is decoded (720, 762) using the estimated model to remove a predicted effect of intercarrier interference. A pre-processor (40) is also described for operation in conjunction with a communications receiver (30) in the network. The pre-processor (40) includes a channel estimator (42) operable to estimate at least one feature of the communication channel based on a received signal. The pre-processor (40) modifies the received signal dependent on the at least one estimated feature and provides the modified signal to the communications receiver (30).

Abstract: Methods and apparatus for generating and performing digital communications using a randomized generatable interleaver. In accordance with one exemplary embodiment of the invention, a pseudo random interleaver of size n*m with excellent randomness and spread properties may be generated from a set of seed values. The interleaver of size N=n*m is defined by dividing the N possible address in the interleaver (0−N−1) into n subsets. The subsets are preferably generatable from a single value with in the subset either using an algorithm or a memory based lookup table. The set of n seeds comprises one value selected from each subset. An improved communication system incorporating the aforementioned interleaver and using turbo codes or other concatenated coding systems is also disclosed.

Abstract: A system and method for high efficiency, high performance processing of turbo codes is described. In accordance with one embodiment of the invention, an interleaver for interleaving code symbols is providing, the interleaver having a plurality of subsections, each subsection having a set of addresses and each address having an index, wherein a substantially constant relationship exists from any one subsection to any other subsection between the index of each address at a particular location.

Abstract: A turbo code providing very low error rate performance and which can be practically implemented on an integrated circuit is described. In accordance with one embodiment of the invention a turbo code is comprised of three constituent codes and two interleavers placed in parallel concatenated configuration. In a first exemplary embodiment of the invention, the constituent codes are configured with at least one higher rate code and at least one lower rate code. In a second embodiment of the invention, the code is configured with one higher rate code and two lower rate codes. In a third embodiment of the invention, the code is comprised of at least one higher depth constituent code and at least one lower depth constituent code. In a fourth embodiment of the invention, the code is comprised of at least one higher rate and higher depth constituent code.

Abstract: A system and method for high efficiency high performance processing of turbo codes is described. In accordance with one embodiment of the invention, an interleaver for interleaving code symbols is providing, the interleaver having a plurality of subsections, each subsection having a set of addresses and each address having an index, wherein a substantially constant relationship exists from any one subsection to any other subsection between the index of each address at a particular location.

Abstract: A method and apparatus for improving the performance of decoder that uses a sliding window decoder is described. In accordance with one embodiment of the invention, receive samples are decoded by first processing continuously in a first direction and using overlapping windows in a second direction, and then by decoded continuously in the second direction and using overlapping windows in the first direction. Typically, the decoding steps correspond to subiterations in a decoding iteration of a turbo code or other iterative code. The entire decoding process typically involves multiple decoding iterations and therefore has particular application to turbo codes and as well as other codes designed for iterative decoding.