Patent application number | Description | Published |
20100304755 | LOCATION DETERMINATION WITH GEOGRAPHIC AND BIAS TUNING - A method for determining location of an observer device is disclosed. The method includes receiving basestation distance data for the observer device and applying a location algorithm to the basestation distance data to determine a computed location of the observer device. The method further includes determining whether the basestation distance data correlates to any of a plurality of observer device conditions. Upon determining the basestation data correlates with one of the observer device conditions, a location bias associated with that observer device condition is employed to correct the computed location of the observer device and produce a corrected location. | 12-02-2010 |
20110227790 | CUCKOO HASHING TO STORE BEACON REFERENCE DATA - Storing and retrieving beacon reference data in a truncated cuckoo hash table. Checksums of beacon identifiers associated with beacons are used to retrieve beacon reference data describing locations of the beacons in a hash table. The data is stored in one or more hash tables by cuckoo hashing to eliminate aliasing. The hash tables are provided to devices such as mobile devices. The devices retrieve the beacon reference data from the tables based using beacon identifiers of observed beacons. Location information for the devices is inferred using the retrieved beacon reference data. The cuckoo hash tables consume less memory storage space and obfuscate the beacon reference data. | 09-22-2011 |
20110227791 | SELECTING BEACONS FOR LOCATION INFERENCE - Location inference using selected beacons. Data is received representing a set of beacons observed by a computing device. The beacons are located within a first geographic area. A subset (e.g., a clique) of the beacons is selected based on a coverage area of each of the beacons, where each of the beacons in the selected subset has a coverage area that overlaps with the coverage area of each of the other beacons in the selected subset. Using known or estimated positions of the beacons, a second geographic area is defined based on the selected subset of beacons and the beacon reference data and the coverage areas associated therewith. The second geographic area, smaller than the first geographic area, represents an approximate location of the computing device. In some embodiments, the computing device is calculated to be within the second geographic area with 95% probability. | 09-22-2011 |
20130318197 | DYNAMIC SELECTION OF RESOURCES FOR COMPRESSION IN A CONTENT DELIVERY NETWORK - Embodiments provide a compression proxy service that dynamically selects resources or other content for compression and delivery to user devices. The resources are selected based on evaluation of compression characteristics relating to the resources. A manifest is defined to identify the selected resources, or to identify the resources not selected for processing by the compression proxy service. The user devices employ the manifest to determine whether to send requests for the resources to the compression proxy service or to another source (e.g., an origin web site). Some embodiments provide a reduction in network traffic while making efficient use of the compression proxy service. | 11-28-2013 |
20130318208 | DYNAMIC PACKAGE CREATION FOR PREDICTIVE PAGE LOAD OPTIMIZATION - Embodiments optimize web page downloads through a customized manifest to reduce latency and network data consumption. A proxy device creates or selects a pre-defined manifest identifying page resources associated with the web page. The manifest is customized by identifying the page resources already cached on a computing device. A single package of resources representing the web page is created. The single package of resources excludes the identified page resources already cached on the computing device. The computing device renders the web page using the single package and the page resources already cached. Some embodiments perform web crawling to create manifests for other web pages. | 11-28-2013 |
Patent application number | Description | Published |
20090024906 | Method and apparatus for data transmission using multiple transmit antenas - A method and apparatus for increasing the data rate and providing antenna diversity using multiple transmit antennas is disclosed. A set of bits of a digital signal are used to generate a codeword. Codewords are provided according to a channel code. Delay elements may be provided in antenna output channels, or with suitable code construction delay may be omitted. n signals represent n symbols of a codeword are transmitted with n different transmit antennas. At the receiver MLSE or other decoding is used to decode the noisy received sequence. The parallel transmission and channel coding enables an increase the data rate over previous techniques, and recovery even under fading conditions. The channel coding may be concatenated with error correction codes under appropriate conditions. | 01-22-2009 |
20090092209 | Combined channel coding and space-block coding in a multi-antenna arrangement - Enhanced performance is achieved by combining channel coding with the space-time coding principles. With K synchronized terminal units transmitting on N antennas to a base station having M≧K receive antennas, increased system capacity and improved performance are attained by using a concatenated coding scheme where the inner code is a space-time block code and the outer code is a conventional channel error correcting code. Information symbols are first encoded using a conventional channel code, and the resulting signals are encoded using a space-time block code. At the receiver, the inner space-time block code is used to suppress interference from the other co-channel terminals and soft decisions are made about the transmitted symbols. The channel decoding that follows makes the hard decisions about the transmitted symbols. Increased data rate is achieved by, effectively, splitting the incoming data rate into multiple channels, and each channel is transmitted over its own terminal. | 04-09-2009 |
20090112585 | TIMING OF SPEECH RECOGNITION OVER LOSSY TRANSMISSION SYSTEMS - Recognizing a stream of speech received as speech vectors over a lossy communications link includes constructing for a speech recognizer a series of speech vectors from packets received over a lossy packetized transmission link, wherein some of the packets associated with each speech vector are lost or corrupted during transmission. Each constructed speech vector is multi-dimensional and includes associated features. After waiting for a predetermined time, speech vectors are generated and potentially corrupted features within the speech vector are indicated to the speech recognizer when present. Speech recognition is attempted at the speech recognizer on the speech vectors when corrupted features are present. This recognition may be based only on certain or valid features within each speech vector. Retransmission of a missing or corrupted packet is requested when corrupted values are indicated by the indicating step and when the attempted recognition step fails. | 04-30-2009 |
20100014565 | Minimum Mean Squared Error Approach to Interference Cancellation and Maximum Likelihood Decoding of Space-Time Block Codes - Block-encoded transmissions of a multi-antenna terminal unit are effectively detected in the presence of co-channel interfering transmissions when the base station has a plurality of antennas, and interference cancellation is combined with maximum likelihood decoding. More specifically, the signals received at the base station antennas are combined in a linear combination that relates to the channel coefficients between the various transmitting terminal units and the base antennas. By selecting proper coefficients for the linear combination and choosing probable transmitted signals that minimize a minimum mean squared error function, the signals of the various terminal units are canceled when detecting the signal of a particular unit. In another embodiment of the invention, the basic approach is used to obtain an initial estimate of the signals transmitted by one terminal unit, and the contribution of those signals is removed from the received signals prior to detecting the signals of other terminal units. In still another embodiment, the decoding process is repeated at least twice by detecting the signals of the terminal units in a different order, and selecting the detections that produce the lowest uncertainty measure. The disclosed techniques are viable for any number K of terminal units transmitting concurrently over a given channel, where each terminal unit is using a space-time block code with N transmit antennas, and a base station has at least K receive antennas. | 01-21-2010 |
20100056092 | Combined Channel Coding and Space-Block Coding In a Multi-Antenna Arrangement - Enhanced performance is achieved by combining channel coding with the space-time coding principles. With K synchronized terminal units transmitting on N antennas to a base station having M≧K receive antennas, increased system capacity and improved performance are attained by using a concatenated coding scheme where the inner code is a space-time block code and the outer code is a conventional channel error correcting code. Information symbols are first encoded using a conventional channel code, and the resulting signals are encoded using a space-time block code. At the receiver, the inner space-time block code is used to suppress interference from the other co-channel terminals and soft decisions are made about the transmitted symbols. The channel decoding that follows makes the hard decisions about the transmitted symbols. Increased data rate is achieved by, effectively, splitting the incoming data rate into multiple channels, and each channel is transmitted over its own terminal. | 03-04-2010 |
20120134436 | Combined Channel Coding and Space-Time Block Coding in a Multi-Antenna Arrangement - Enhanced performance is achieved by combining channel coding with the space-time coding principles. With K synchronized terminal units transmitting on N antennas to a base station having M≧K receive antennas, increased system capacity and improved performance are attained by using a concatenated coding scheme where the inner code is a space-time block code and the outer code is a conventional channel error correcting code. Information symbols are first encoded using a conventional channel code, and the resulting signals are encoded using a space-time block code. At the receiver, the inner space-time block code is used to suppress interference from the other co-channel terminals and soft decisions are made about the transmitted symbols. The channel decoding that follows makes the hard decisions about the transmitted symbols. Increased data rate is achieved by, effectively, splitting the incoming data rate into multiple channels, and each channel is transmitted over its own terminal. | 05-31-2012 |
20120147987 | METHOD AND APPARATUS FOR DATA TRANSMISSION USING MULTIPLE TRANSMIT ANTENNAS - A method and apparatus for increasing the data rate and providing antenna diversity using multiple transmit antennas is disclosed. A set of bits of a digital signal are used to generate a codeword. Codewords are provided according to a channel code. Delay elements may be provided in antenna output channels, or with suitable code construction delay may be omitted. n signals represent n symbols of a codeword are transmitted with n different transmit antennas. At the receiver MSLE or other decoding is used to decode the noisy received sequence. The parallel transmission and channel coding enables an increase the data rate over previous techniques, and recovery even under fading conditions. The channel coding may be concatenated with error correction codes under appropriate conditions. | 06-14-2012 |
20130259168 | MINIMUM MEAN SQUARED ERROR APPROACH TO INTERFERENCE CANCELLATION AND MAXIMUM LIKELIHOOD DECODING OF SPACE-TIME BLOCK CODES - Block-encoded transmissions of a multi-antenna terminal unit are effectively detected in the presence of co-channel interfering transmissions when the base station has a plurality of antennas, and interference cancellation is combined with maximum likelihood decoding. More specifically, the signals received at the base station antennas are combined in a linear combination that relates to the channel coefficients between the various transmitting terminal units and the base antennas. By selecting proper coefficients for the linear combination and choosing probable transmitted signals that minimize a minimum mean squared error function, the signals of the various terminal units are canceled when detecting the signal of a particular unit. In another embodiment of the invention, the basic approach is used to obtain an initial estimate of the signals transmitted by one terminal unit, and the contribution of those signals is removed from the received signals prior to detecting the signals of other terminal units. | 10-03-2013 |
20150365196 | Minimum Mean Squared Error Approach to Interference Cancellation and Maximum Likelihood Decoding of Space-Time Block Codes - Block-encoded transmissions of a multi-antenna terminal unit are effectively detected in the presence of co-channel interfering transmissions when the base station has a plurality of antennas, and interference cancellation is combined with maximum likelihood decoding. More specifically, the signals received at the base station antennas are combined in a linear combination that relates to the channel coefficients between the various transmitting terminal units and the base antennas. By selecting proper coefficients for the linear combination and choosing probable transmitted signals that minimize a minimum mean squared error function, the signals of the various terminal units are canceled when detecting the signal of a particular unit. In another embodiment of the invention, the basic approach is used to obtain an initial estimate of the signals transmitted by one terminal unit, and the contribution of those signals is removed from the received signals prior to detecting the signals of other terminal units. | 12-17-2015 |
Patent application number | Description | Published |
20110274216 | CONTINUOUS PHASE MODULATION FOR SATELLITE COMMUNICATIONS - A new coded continuous phase modulation (CPM) scheme is proposed to enhance physical layer performance of the current DVB-RCS standard for a satellite communication system. The proposed CPM scheme uses a phase pulse design and combination of modulation parameters to shape the power spectrum of CPM signal in order to improve resilience to adjacent channel interference (ACI). Additionally, it improves error rate performance at both high and low frame error rates using low complexity binary convolutional codes and S-random bit interleaving. Phase response using the proposed CPM scheme is a weighted average of the conventional rectangular and raised-cosine responses and provides optimum response to minimize frame error rate for a given data rate. | 11-10-2011 |
20110275338 | PHASE PULSE SYSTEM AND METHOD FOR BANDWIDTH AND ENERGY EFFICIENT CONTINUOUS PHASE MODULATION - A new pulse shape for CPM is introduced which is obtained by a linear combination of well-known RC and REC pulse shapes. The new pulse shape addresses the tradeoff between the width of the PSD main lobe and the rate of decay of the side lobe to improve the coded performance of multi-carrier systems affected by ACI. Also, a methodology is proposed to design and evaluate the performance of the new pulse shape for multi-carrier, coded systems based on the modulation constrained capacity. Furthermore, a binary convolutional code and the CPM modulator are concatenated using an S-random bit interleaver to lower the error floor. Finally, Laurent representation of the new pulse shape is suggested such that by retaining only the principal pulses at the receiver, complexity of the receiver can be reduced. | 11-10-2011 |
20120124453 | METHOD AND APPARATUS FOR A PARAMETERIZED INTERLEAVER DESIGN PROCESS - A parameterized interleaver design process is provided, which optimizes the design for interleavers of any size, and can be completely specified using only a few design parameters. According to the parameterized interleaver design process an interleaver π(i) of a length N is generated. A number of subpermutation masks are defined, and a first intermediate interleaver permutation is partitioned into a number of subgroups, wherein the number of subgroups corresponds with the number of subpermutation masks. Each of the subgroups of the first intermediate interleaver permutation is partitioned into a number of further subgroups, and each of the subpermutation masks is applied to each of the further subgroups of a corresponding subgroup of the first intermediate interleaver permutation, resulting in a corresponding portion of a second intermediate interleaver permutation. The resulting interleaver π(i) is generated based at least in part on the first and second intermediate interleaver permutations. | 05-17-2012 |
Patent application number | Description | Published |
20100183106 | SYSTEM AND METHOD FOR COMPENSATING FOR NONLINEAR INTERFERENCE CANCELLATION IN MULTI-CARRIER TRANSMISSION - An aspect of the present invention is drawn to a receiver operable to receive a first signal transmitted on a first carrier and to receive a second signal transmitted on a second carrier. The receiver includes a first filter, a second filter and a nonlinear compensator. The first filter is arranged to receive the first signal and to generate a first filtered signal. The second filter is arranged to receive the second signal and to generate a second filtered signal. The nonlinear compensator is arranged to output a first compensating signal based on the first filtered signal and the second filtered signal and to output a second compensating signal based on the first filtered signal and the second filtered signal. Further, the nonlinear compensator can reduce one of nonlinear interference within the first filtered signal and nonlinear interference between the first filtered signal and the second filtered signal. | 07-22-2010 |
20130318421 | METHOD AND APPARATUS FOR A PARAMETERIZED INTERLEAVER DESIGN PROCESS - A parameterized interleaver design process is provided, which optimizes the design for interleavers of any size, and can be completely specified using only a few design parameters. According to the parameterized interleaver design process an interleaver π(i) of a length N is generated. A number of subpermutation masks are defined, and a first intermediate interleaver permutation is partitioned into a number of subgroups, wherein the number of subgroups corresponds with the number of subpermutation masks. Each of the subgroups of the first intermediate interleaver permutation is partitioned into a number of further subgroups, and each of the subpermutation masks is applied to each of the further subgroups of a corresponding subgroup of the first intermediate interleaver permutation, resulting in a corresponding portion of a second intermediate interleaver permutation. The resulting interleaver π(i) is generated based at least in part on the first and second intermediate interleaver permutations. | 11-28-2013 |
20140079160 | FORWARD ERROR CORRECTION DECODER INPUT COMPUTATION IN MULTI-CARRIER COMMUNICATIONS SYSTEM - A system and methods that accommodate for nonlinear interference in a multi-carrier communications system are provided. A first signal is received by a receiver. The first signal comprises a source signal transmitted on a carrier over a communications channel. The first signal reflects a source symbol mapped to one of a plurality of signal constellation points, and each signal constellation point is associated with a different one of a plurality of signal clusters. A received representation of the source signal with respect to the source symbol is acquired from the first signal. A plurality of likelihood metrics are determined, where each likelihood metric is based on the received representation of the source signal with respect to the source symbol and a different one of a plurality of core parameters, wherein each core parameter is based on a centroid estimate with respect to a different one of the signal clusters. | 03-20-2014 |
20150098521 | SYSTEM AND METHOD FOR PRE DISTORTION AND ITERATIVE COMPENSATION FOR NONLINEAR DISTORTION IN SYSTEM EMPLOYING FTN SYMBOL TRANSMISSION RATES - A signal transmission approach comprises encoding a source signal (comprising a plurality of source symbols) to generate a corresponding encoded signal. The encoded signal is modulated by mapping each source symbol to a respective signal constellation point of an applied signal constellation to generate a modulated signal. The modulated signal is pre-distorted based on a distortion estimate to generate a pre-distorted signal. The pre-distorted signal is filtered to generate a filtered signal. The filtered signal is frequency translated and amplified to generate a transmission signal for transmission via an uplink channel of a satellite communications system. To increase throughput, the source signal is processed through the apparatus and the resulting transmission signal is generated at a Faster-than-Nyquist (FTN) symbol rate and with a tight frequency roll-off. The modulated signal is pre-distorted based on a distortion estimate relating to the nonlinearity and the filters applied before and/or after the pre-distorter. | 04-09-2015 |
20150311927 | MULTICARRIER SUCCESSIVE PREDISTORTION FOR DIGITAL TRANSMISSION - An approach for improved compensation for nonlinear distortion in multicarrier satellite systems is provided. Source reflecting encoded and modulated sequences of source data symbols are received. Each source signal is predistorted, and a transmit filter is applied to each predistorted source signal. Each filtered signal is translated to a carrier frequency, and the translated signals are combined into a composite signal for transmission via a multicarrier transponder. The final predistorted version of each source signal is generated via an iterative process of a number of stages, wherein, for a given stage and for each source signal, the process comprises: receiving a prior predistorted version of each source signal from a preceding stage; processing each prior predistorted source signal based on all of the received prior predistorted source signals, wherein the processing is performed based on a characterization of one or more characteristics of the multicarrier satellite transponder. | 10-29-2015 |
Patent application number | Description | Published |
20120278668 | RUNTIME DYNAMIC PERFORMANCE SKEW ELIMINATION - For runtime dynamic performance skew elimination in a computer environment, an exemplary computer environment is configured for calculating a rank heats by utilizing a plurality of fine-grained statistics collected at an extent granularity, including considering bandwidth (BW) and input/outputs per second (IOPS) metrics. An adaptive data placement plan is generated to relocate the data. The data is placed among data storage ranks The data storage ranks are balanced according to the adaptive data placement plan. | 11-01-2012 |
20120278669 | RUNTIME DYNAMIC PERFORMANCE SKEW ELIMINATION - For runtime dynamic performance skew elimination in a computer environment, an exemplary computer environment is configured for calculating a rank heats by utilizing a plurality of fine-grained statistics collected at an extent granularity, including considering bandwidth (BW) and input/outputs per second (IOPS) metrics. An adaptive data placement plan is generated to relocate the data. The data is placed among data storage ranks The data storage ranks are balanced according to the adaptive data placement plan. | 11-01-2012 |
20120303917 | SYSTEMS, METHODS, AND PHYSICAL COMPUTER STORAGE MEDIA TO OPTIMIZE DATA PLACEMENT IN MULTI-TIERED STORAGE SYSTEMS - A system includes a data collector, a plurality of data placement optimizers, a data placement arbitrator, and a data mover. The data collector is configured to collect system configuration data and system performance data. The plurality of data placement optimizers are each configured to analyze the system configuration data and the system performance data for developing a corresponding data movement plan. The data placement arbitrator is configured to arbitrate conflicts between at least two data movement plans of generated by the plurality of data placement optimizers to form an execution plan. The data mover is configured to perform the data movement plans according to the execution plan. | 11-29-2012 |
20120303929 | SYSTEMS, METHODS, AND PHYSICAL COMPUTER STORAGE MEDIA TO OPTIMIZE DATA PLACEMENT IN MULTI-TIERED STORAGE SYSTEMS - For optimizing data placement in a multi-tiered storage system, system configuration data and system performance data is collected. A plurality of data movement plans are generated, based in part on the system configuration data and the system performance data. A conflict between the plurality of data movement plans are arbitrated to form an execution plan. The data movement plans are performed according to the execution plan. | 11-29-2012 |
20130185528 | RUNTIME DYNAMIC PERFORMANCE SKEW ELIMINATION - For runtime dynamic performance skew elimination in a computer environment, an exemplary computer environment is configured for calculating a rank heats by utilizing a plurality of fine-grained statistics collected at an extent granularity, including considering bandwidth (BW) and input/outputs per second (IOPS) metrics. An adaptive data placement plan is generated to relocate the data. | 07-18-2013 |
20130232270 | RUNTIME DYNAMIC PERFORMANCE SKEW ELIMINATION - For runtime dynamic performance skew elimination in a computer environment, an exemplary computer environment is configured for calculating a rank heats by utilizing a plurality of fine-grained statistics collected at an extent granularity, including considering bandwidth (BW) and input/outputs per second (IOPS) metrics. An adaptive data placement plan is generated to relocate the data. | 09-05-2013 |
20140351151 | PROVIDING A LEASE PERIOD DETERMINATION - An optimal lease period of data is determined for each client by a centralized entity by using a variety of factors. The variety of factors include at least access characteristics of the data, historical access patterns of the data, and system configurations and policies. | 11-27-2014 |
20140359380 | RUNTIME DYNAMIC PERFORMANCE SKEW ELIMINATION - For runtime dynamic performance skew elimination in a computer environment, an exemplary computer environment is configured for calculating a rank heats by utilizing a plurality of fine-grained statistics collected at an extent granularity, including considering bandwidth (BW) and input/outputs per second (IOPS) metrics. An adaptive data placement plan is generated to relocate the data. | 12-04-2014 |