Patents by Inventor Alan Barbieri

Alan Barbieri has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20100144334
    Abstract: Providing for record filtering in distributed dynamic clustering algorithms for coordinated multipoint (CoMP) wireless communication is described herein. By way of example, strategy selection records distributed as part of a belief propagation network are pruned at recipient nodes, thereby reducing processing overhead for dynamic clustering. As a result, cooperative policies can be determined with greater efficiency, and with greater relevance to local clusters of cooperating base stations. In some aspects, record pruning can comprise identifying and discarding redundant or incompatible sets of policy decisions. In at least one aspect, a number of evaluated records can be capped based on relevance, while preserving deployment-wide applicability of the belief propagation network. Accordingly, dynamic distributed CoMP decisions are optimized on a deployment-wide scale that more efficiently converges to maximum utility solutions.
    Type: Application
    Filed: December 8, 2009
    Publication date: June 10, 2010
    Applicant: QUALCOMM Incorporated
    Inventors: Alexei Y. Gorokhov, Alan Barbieri, Siddhartha Mallik, Mohammad J. Borran
  • Publication number: 20100085917
    Abstract: Systems and methodologies are described that facilitate cooperation strategy selection for a network multiple-in-multiple-out (N-MIMO) communication system. As described herein, one or more nodes in a communication system capable of N-MIMO communication can calculate marginal utilities, projected per-user rates, and/or other parameters corresponding to respective associated users. Based on these calculations, respective network nodes can perform user scheduling and selection, cell scheduling and selection, selection of a cooperation strategy (e.g., coordinated silencing, joint transmission, coordinated beamforming, etc.), and/or other operations to provide cooperative communication for respective users. As further described herein, projected rate calculation for a given user can be adjusted based on processing or channel implementation loss associated with the user, interference nulling capability of the user, or other factors.
    Type: Application
    Filed: September 28, 2009
    Publication date: April 8, 2010
    Applicant: QUALCOMM Incorporated
    Inventors: Alexei Y. Gorokhov, Siddhartha Mallik, Alan Barbieri, Jilei Hou
  • Publication number: 20100056215
    Abstract: Systems and methodologies are described that facilitate dynamically forming clusters in a wireless communication environment. A set of non-overlapping clusters can be formed dynamically over time and in a distributed manner. Each of the clusters can include a set of base stations and a set of mobile devices. The clusters can be yielded based upon a set of local strategies selected by base stations across the network converged upon through message passing. For example, each base station can select a particular local strategy as a function of time based upon network-wide utility estimates respectively conditioned upon implementation of the particular local strategy and disparate possible local strategies that can cover the corresponding base station. Moreover, operation within each of the clusters can be coordinated.
    Type: Application
    Filed: August 25, 2009
    Publication date: March 4, 2010
    Applicant: QUALCOMM Incorporated
    Inventors: Alexei Y. Gorokhov, Siddhartha Mallik, Naga Bhushan, Alan Barbieri