Patents by Inventor Aaron Callard
Aaron Callard 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: 20140362688Abstract: A system and method for agile wireless access network is provided. A method embodiment for agile radio access network management includes determining, by a network controller, capabilities and neighborhood relations of radio nodes in the radio access network. The network controller then configures a backhaul network infrastructure for the radio access network in accordance with the capabilities and the neighborhood relations of the radio nodes.Type: ApplicationFiled: November 1, 2013Publication date: December 11, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Hang Zhang, Gamini Senarath, Aaron Callard, Hamidreza Farmanbar, Ngoc-Dung Dao, Alex Stephenne, Petar Djukic, Xu Li, Kaveh Shafiee, Philippe Leroux
-
Publication number: 20140362730Abstract: An embodiment method includes receiving service parameters for a service and locating logical network nodes for a service-specific data plane logical topology at respective physical network nodes among a plurality of physical network nodes according to the service parameters, a service-level topology, and a physical infrastructure of the plurality of physical network nodes. The method also includes defining connections among the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure, and defining respective connections for a plurality of UEs to at least one of the logical network nodes according to the service parameters, the service-level topology, and the physical infrastructure. The method further includes defining respective functionalities for the logical network nodes.Type: ApplicationFiled: June 5, 2014Publication date: December 11, 2014Inventors: Hang Zhang, Aaron Callard, Gamini Senarath, Petar Djukic, Alex Stephenne, Ngoc-Dung Dao, Hamidreza Farmanbar, Xu Li, Kaveh Shafiee, Philippe Leroux
-
Patent number: 8862185Abstract: A method for configuring a first base station within a cluster in a communications system having a plurality of cluster includes optimizing an operating parameter of the first base station in accordance with first utility function results from a first utility function associated with the first base station and second utility function results from a second utility function associated with a second base station within the cluster, the first utility function results and the second utility function results according to multiple settings for the operating parameter of the first base station, a first initialized setting of the operating parameter for the second base station, and a second initialized setting of the operating parameter for an external base station outside the cluster. The method also includes sharing the optimized operating parameter with the external base station.Type: GrantFiled: February 3, 2012Date of Patent: October 14, 2014Assignee: Futurewei Technologies, Inc.Inventors: Aaron Callard, Ngoc-Dung Dao, Hang Zhang, Ho Ting Cheng, Gamini Senarath, Mark Andrew Hawryluck
-
Patent number: 8849216Abstract: In accordance with an embodiment, a method of operating a controller in a wireless communication system includes receiving channel feedback information from a communications node, adjusting the channel feedback information based on a measurement of interference from neighboring controllers, adjusting transmit parameters of the controller using the adjusted channel feedback information, and transmitting to the communications node using the adjusted transmit parameters.Type: GrantFiled: July 6, 2010Date of Patent: September 30, 2014Assignee: Futurewei Technologies, Inc.Inventors: Mohammadhadi Baligh, Aaron Callard, Jianglei Ma
-
Publication number: 20140269332Abstract: Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load characteristics (e.g., current load, load variation, etc.) of links in the candidate paths. Path costs can represent any quantifiable cost or liability associated with transporting a service flow over the corresponding path. For example, path costs can correspond to a probability that at least one link in the path will experience an outage when transporting the service flow, a price charged by a network operator (NTO) for transporting the traffic flow over the candidate path, or a total network cost for transporting the flow over a candidate path. The candidate path having the lowest path cost is selected to transport a service flow.Type: ApplicationFiled: March 10, 2014Publication date: September 18, 2014Applicant: FutureWei Technologies, Inc.Inventors: Gamini Senarath, Aaron Callard, Ho Ting Cheng
-
Publication number: 20140269774Abstract: A method for decompressing data includes receiving, by a network element, a first plurality of packets. Also, the method includes receiving, by the network element, a second plurality of packets. Additionally, the method includes decompressing the first plurality of packets by a first decompressor using a first compression scheme and decompressing the second plurality of packets by a second decompressor using a second compression scheme.Type: ApplicationFiled: March 14, 2013Publication date: September 18, 2014Applicant: FUTUREWEI TECHNOLOGEISInventors: Aaron Callard, Alex Stephenne, Hang Zhang
-
Publication number: 20140281034Abstract: System and method embodiments are provided for compressing data associated with a buffer while keeping delay in data forwarding beyond within about the buffer time. AN embodiment method includes receiving, at a data compression node, data packets from a previous node on a forwarding path for the data packets, compressing the data packets using a compression scheme according to a feedback from buffering the data packets at a buffering node subsequent to the compression node on the forwarding path, and sending the compressed data packets to the buffering node. Another method includes sending, from a buffering node, feedback of buffered data at the buffering node, receiving, from a data compression node, data packets compressed using a compression scheme according to a feedback from buffering the data packets at the buffering node, and transmitting the data packets from the buffering node after a delay time according to the feedback.Type: ApplicationFiled: March 13, 2013Publication date: September 18, 2014Inventor: Aaron Callard
-
Publication number: 20140254495Abstract: The computational complexity of MCS adaptation for linear and non-linear MU-MIMO can be reduced by avoiding QR decomposition during subsequent stages of MCS adaptation. For instance, QR decomposition can be avoided in later stages of MCS adaptation by computing an instant upper right triangular matrix (R1) directly from an earlier upper right triangular matrix (R) and an earlier unitary matrix (U), which were obtained during a previous stage of MCS adaptation. As such, the instant upper right triangular matrix (R1) is obtained without performing QR decomposition on an instant Hermitian matrix (H1H), thereby allowing MCS adaptation to be performed for the new user group with less complexity. Additionally, computational complexity of MCS adaptation for linear MU-MIMO can be further reduced by avoiding matrix inversion during subsequent stages of MCS adaptation.Type: ApplicationFiled: March 6, 2013Publication date: September 11, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Hamidreza Farmanbar, Aaron Callard
-
Publication number: 20140258803Abstract: Forward Error Correction (FEC) techniques that generate independently decodable resource blocks are beneficial for Successive Interference Cancellation (SIC) demodulation. One FEC technique for generating independently decodable resource blocks includes mapping locally decodable FEC codeblocks into unique resource blocks such that substantially all of the bits of the FEC codeblock are carried within a single resource block. The locally decodable FEC codeblocks can be generated from different FEC encoding modules or from a common FEC encoding module. Another technique for generating independently decodable resource blocks includes encoding a stream of information bits into low-density parity-check (LDPC) codeblocks having high ratios of inward peering parity bits. These high ratios of inward peering parity bits allow substantial portions of each LDPC codeblock to be decoded independently from information carried by other LDPC codeblocks.Type: ApplicationFiled: March 6, 2013Publication date: September 11, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Aaron Callard, Mohammadhadi Baligh
-
Patent number: 8817624Abstract: Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.Type: GrantFiled: July 25, 2012Date of Patent: August 26, 2014Assignee: Futurewei Technologies, Inc.Inventors: Aaron Callard, Peiying Zhu, Hang Zhang, Petar Djukic, Vipul Desai, Peter Ashwood-Smith
-
Publication number: 20140233540Abstract: Method and apparatus for decoding a transmitted signal by a receiver in a MIMO system into a first estimate component for estimating a first signal, a first interference component indicating interference resulting from a correlation relationship among a set of signals to be transmitted, and a first noise component. A base station generates the transmitted signal from the set of signals through a coding process, the coding process defining a correlation relationship amongst the set of signals. The correlation information about the correlation relationship is transmitted to the receiver directly or by a dedicated reference symbol. The decoding is performed by determining a linear receiver filter for the first signal in accordance with the correlation information, and de-correlating the first signal and interferences.Type: ApplicationFiled: April 25, 2014Publication date: August 21, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Hamidreza Farmanbar, Aaron Callard, Mohammadhadi Baligh
-
Patent number: 8811306Abstract: In accordance with an embodiment, a method of operating a base station configured to communicate with a relay station includes allocating resources to the relay station. Allocating resources includes receiving feedback data from the relay station and scheduling resources to the relay station based on feedback data. Feedback data includes a total buffer size of the relay station and a number of user devices.Type: GrantFiled: June 22, 2010Date of Patent: August 19, 2014Assignee: Futurewei Technologies, Inc.Inventors: Aaron Callard, Gamini Senarath, Israfil Bahceci
-
Patent number: 8797959Abstract: A method for operating a controller of a multiple input, multiple output communications system includes formulating an objective function according to a resource allocation for a user equipment (UE) and a mean square error expression, and updating the objective function to generate an updated resource allocation for the UE, a transmit beamforming vector to precode a transmission to the UE, and a receive beamforming vector to adjust a receiver to receive the precoded transmission. The method also includes transmitting allocation information about the resource allocation for the UE and the transmit beamforming vector to a communications controller serving the UE.Type: GrantFiled: January 3, 2012Date of Patent: August 5, 2014Assignee: Futurewei Technologies, Inc.Inventors: Meisam Razaviyayn, Mohammadhadi Baligh, Aaron Callard, Zhi-Quan Luo
-
Publication number: 20140169797Abstract: Embodiments are provided for transmitting channel information, such as control channel information, using lower resources at the transmitter combined with using apriori information associated with channel information in the decoder of the receiver. The apriori information represent predictable information that can be predicted by the receiver and is not transmitted with the channel information by the transmitter. The transmitter determines the apriori information for the channel and codes the channel information into bits and fields excluding the apriori information. Upon receiving the channel information, the receiver determines the apriori information associated in accordance with previously received information. The apriori information is then provided as probability information for input to the decoder. The decoder then decodes the received information in accordance with the apriori information.Type: ApplicationFiled: December 18, 2013Publication date: June 19, 2014Inventors: Aaron Callard, Mohammadhadi Baligh, Kelvin Kar Kin Au
-
Publication number: 20140140336Abstract: Historical decoding can be performed in accordance with pilot signal retransmission or control information retransmission to reduce the amount network resources consumed during data recovery. In one example, historical decoding is achieved through retransmitting a sub-set of coded bits carried by an earlier transmission, which are compared with a corresponding portion of the original signal (stored in memory) to obtain improved channel state information (CSI) relating to that earlier transmission. In another example, historical decoding is achieved through communicating parity information related to a sub-set of the coded bits carried by an earlier transmission, which are used in accordance with a data aided CSI technique to obtain the improved CSI relating to that earlier transmission. In yet another example, historical decoding is achieved by re-transmitting control information carried by an earlier transmission.Type: ApplicationFiled: November 16, 2012Publication date: May 22, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Aaron Callard, Hamidreza Farmanbar
-
Publication number: 20140140451Abstract: Historical decoding in accordance with signal interference cancellation (SIC) or joint processing may reduce the amount of data that is re-transported across a network following an unsuccessful attempt to decode a data transmission. In one example, historical decoding is performed in accordance with interference cancellation by communicating information related to interfering data (rather than information related to serving data) following a served receiver's unsuccessful attempt to decode an interference signal. The information related to the interfering data may be the information bits carried by the earlier interfering data transmission or parity information (e.g., forward error correction (FEC) bits, etc.) related to the earlier interfering data transmission.Type: ApplicationFiled: November 19, 2012Publication date: May 22, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Aaron Callard, Hamidreza Farmanbar, Alex Stephenne, Ngoc-Dung Dao
-
Patent number: 8731028Abstract: Method and apparatus for decoding a transmitted signal by a receiver in a MIMO system into a first estimate component for estimating a first signal, a first interference component indicating interference resulting from a correlation relationship among a set of signals to be transmitted, and a first noise component. A base station generates the transmitted signal from the set of signals through a coding process, the coding process defining a correlation relationship amongst the set of signals. The correlation information about the correlation relationship is transmitted to the receiver directly or by a dedicated reference symbol. The decoding is performed by determining a linear receiver filter for the first signal in accordance with the correlation information, and de-correlating the first signal and interferences.Type: GrantFiled: December 2, 2011Date of Patent: May 20, 2014Assignee: Futurewei Technologies, Inc.Inventors: Hamidreza Farmanbar, Aaron Callard, Mohammadhadi Baligh
-
Publication number: 20140133391Abstract: A communication system and a method for transferring data are provided. The method is implemented in a communication system having first and second network devices. The first network device configured to transmit a coded version of a frame and a first state variable to the second network device in a media access control (MAC) layer. The second network device is configured to receive the coded version of the frame and the first state variable and transmit a second state variable to the first network device. The first network device and the second network device use a state machine based on the first and second state variables and implement a hybrid automatic repeat request (HARQ) protocol.Type: ApplicationFiled: November 12, 2012Publication date: May 15, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: PETAR DJUKIC, AARON CALLARD
-
Publication number: 20140115094Abstract: Systems and methods are provided to improve data transmission efficiency over a network. The improvements are achieved by reducing the redundancy in the data representation. The data is divided into a plurality of data portions. The data portions are used to encode a plurality of compressed data portions, wherein the compressed data portions correspond to a subset of the data portions and comprise less redundant data than the subset of the data portions. The compressed data portions are also encoded in accordance with data in the remaining data portions. The compressed data portions are transmitted instead of the subset of the data portions with the remaining data portions according to a sequence of data portions. Each of the compressed data portions is transmitted upon receiving an acknowledgment (ACK) message that indicates successful transmission of a previous data portion or compressed data portion in the sequence of data portions.Type: ApplicationFiled: October 22, 2012Publication date: April 24, 2014Applicant: FutureWei Technologies, Inc.Inventors: Ngoc-Dung Dao, Aaron Callard, Hang Zhang, Ho-Ting Cheng
-
Publication number: 20140106802Abstract: An embodiment method for performing joint scheduling in a cluster of base stations (BSs) of a wireless network includes receiving coarse scheduling information pertaining to external BSs and performing joint scheduling for the instant cluster of BSs such that a sum utility is maximized. The sum utility includes an out-of-cluster utility component representing interference observed by the external BSs as a result of the joint scheduling. The out-of-cluster utility component is computed in accordance with the coarse scheduling information.Type: ApplicationFiled: October 12, 2012Publication date: April 17, 2014Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Ho-Ting Cheng, Hang Zhang, Ngoc-Dung Dao, Aaron Callard