Abstract: In a radio using a plurality of channels defined in a radio frequency (RF) spectrum, a rate of false packet detections may be calculated for each of the plurality of channels using a plurality of respective correlation thresholds. The rate of false packet detections for each channel may be compared to a range of acceptable rates of false packet detections. The same or different ranges of acceptable rates of false packet detections may be used for each channel or each channel plan. Different correlation thresholds may be adjusted based at least in part on the comparisons. For example, if a rate of false packet detections exceeds a range of acceptable rates of false packet detections, the correlation threshold may be raised, or the reverse. A packet may be detected on different channels based on different adjusted correlation thresholds.

Abstract: In a radio using a plurality of channels defined in a radio frequency (RF) spectrum, a rate of false packet detections may be calculated for each of the plurality of channels using a plurality of respective correlation thresholds. The rate of false packet detections for each channel may be compared to a range of acceptable rates of false packet detections. The same or different ranges of acceptable rates of false packet detections may be used for each channel or each channel plan. Different correlation thresholds may be adjusted based at least in part on the comparisons. For example, if a rate of false packet detections exceeds a range of acceptable rates of false packet detections, the correlation threshold may be raised, or the reverse. A packet may be detected on different channels based on different adjusted correlation thresholds.

Abstract: An example method of receiving a data packet includes receiving a data packet at a channel receiver of at least one channel receiver each associated with a channel, providing the data packet to a data packet identification block that corresponds to the channel receiver, validating the data packet at the data packet identification block, and providing the validated data packet to an available decoder block of at least one decoder block capable of performing one or more decoding functions, where a quantity of the decoder blocks is less than a quantity of the data packet identification blocks and optimized according to one or more goals. If no decoder block is available and the validated data packet is a higher priority data packet, a decoder block processing a lower priority data packet may be forced to stop processing the lower priority data packet and process the higher priority data packet.

Abstract: An example method of receiving a data packet includes receiving a data packet at a channel receiver of at least one channel receiver each associated with a channel, providing the data packet to a data packet identification block that corresponds to the channel receiver, validating the data packet at the data packet identification block, and providing the validated data packet to an available decoder block of at least one decoder block capable of performing one or more decoding functions, where a quantity of the decoder blocks is less than a quantity of the data packet identification blocks and optimized according to one or more goals. If no decoder block is available and the validated data packet is a higher priority data packet, a decoder block processing a lower priority data packet may be forced to stop processing the lower priority data packet and process the higher priority data packet.

Abstract: A multichannel radio receiver may include a radio frequency (RF) subsystem and a digital subsystem. The digital subsystem may be configured to use an analog to digital converter (ADC) to sample input. A channelizer bank within the digital subsystem may include a plurality of channelizers. Each channelizer may receive and translate input into a plurality of channels, the channels having widths that are non-uniform and/or spacing (e.g., spacing center-to-center of adjacent channels) that is not regular. The translation may include re-sampling channels at a rate associated with a modulation scheme. A decoder bank may include a plurality of decoders operating in parallel, each to receive input from a channelizer and each associated with a particular modulation scheme. Thus, the multichannel radio may simultaneously receive on a plurality of channels of arbitrary location, arbitrary spacing and/or arbitrary bandwidth, wherein each channel is associated with one of a plurality of modulation schemes.

Abstract: A multichannel radio receiver may include a radio frequency (RF) subsystem and a digital subsystem. The digital subsystem may be configured to use an analog to digital converter (ADC) to sample input. A channelizer bank within the digital subsystem may include a plurality of channelizers. Each channelizer may receive and translate input into a plurality of channels, the channels having widths that are non-uniform and/or spacing (e.g., spacing center-to-center of adjacent channels) that is not regular. The translation may include re-sampling channels at a rate associated with a modulation scheme. A decoder bank may include a plurality of decoders operating in parallel, each to receive input from a channelizer and each associated with a particular modulation scheme. Thus, the multichannel radio may simultaneously receive on a plurality of channels of arbitrary location, arbitrary spacing and/or arbitrary bandwidth, wherein each channel is associated with one of a plurality of modulation schemes.

Abstract: Systems and methods for providing intelligent routing of customer inquiries via multi-channel communication tools. A dynamic router is provided that embraces interaction and manages resources of a back end system out to a portal. Such interaction can be via a chat session, a webpage, a telephone, or another manner of communication. When an individual (e.g., a customer or other individual) comes to a portal, the individual is dynamically routed to the preferred channel based on one or more of a variety of factors. A set of rules, customer information, and intelligent analysis combine to dynamically determine how to martial the resources to best service the individual. The routing provides a tailored experience specific to the particular individual rather than a static behavior that everyone would experience, and ensures that the communication takes place in a language that is desired by the individual.

Abstract: The invention provides dimensional weighing apparatus (5) that may e.g. be placed transparently between the weighing scales (3) and POS terminal (4) of e.g. a postal outlet so as to provide dimensional weighing of a parcel (2). The apparatus (5) senses the parcel height with a sensor (10), and senses the parcel cross-section with a sensor (11) that obtains data points as the parcel (2) rotates on a turntable (12). A control unit (6) determines the parcel volume from the height and cross-section data, and determines a dimensional weight based on the volume and on a minimum chargeable weight per unit volume. It compares the dimensional weight with the actual weight from the scales (3), and outputs the larger value to the POS terminal (4). Various sensor arrangements and profile analyses are described.

Abstract: An optimized approach for arriving at a shared secret key in a dynamically changing multicast or broadcast group environment is disclosed. In one aspect of the invention, a method is provided for communicating through a secure channel between members of a dynamically changing multicast group connected over an insecure network. The method provides that a first shared secret key for establishing a first multicast group is computed that includes a set of one or more first members. Based on the first shared secret key, a first multicast group exchange key is also generated. Upon receiving a first user exchange key from a first user requesting entry into the first multicast group, a second secret key, based on the first user exchange key and the first shared secret key is computed. The first multicast group exchange key is sent to the first user and used by the first user to generate the same second shared secret key.