Awartika C Pandey, Age 5118930 Sara Park Cir, Saratoga, CA 95070

7844930, Nov 30, 2010

Jun 12, 2007

11/762024

Awartika Pandey - Sunnyvale CA, US
Drazen Borkovic - Mountain View CA, US
Kenneth S. McElvain - Los Altos CA, US

Synopsys, Inc. - Mountain View CA

G06F 17/50

716 5, 716 7, 716 12

Methods and apparatuses to design a circuit. In one embodiment, the method includes determining a first multiplexing ratio by a computer. The method, in one embodiment, further includes determining, according to the first multiplexing ratio, a first partition solution of the circuit and a first trace assignment solution for nets crossing partition boundaries of the first partition solution of the circuit. In one embodiment, the first trace assignment solution time multiplexes signals for a first plurality of nets crossing partition boundaries of the first partition solution according to the first multiplexing ratio, the first trace assignment solution satisfying a trace constraint, the first partition solution satisfying an area constraint when circuitry for time multiplexing signals for the first plurality of nets is considered.

8176452, May 8, 2012

Nov 9, 2010

12/942961

Awartika Pandey - Sunnyvale CA, US
Drazen Borkovic - Mountain View CA, US
Kenneth S. McElvain - Los Altos CA, US

Synopsys, Inc. - Mountain View CA

G06F 17/50

716105, 716106, 716113, 716122, 716123, 716130, 716132, 703 16

Methods and apparatuses for incremental circuit partitioning and incremental trace assignment. In one embodiment of the present invention, a cost function based on both the partitioning solution and the trace assignment solution is used for the partitioning of a circuit; in reducing the cost function, blocks of circuits are moved among partitions and the trace assignment are updated accordingly to evaluate the cost function. In one embodiment, the traces and nets are grouped according to the partitions they connect for trace assignment. In one embodiment, a flow diagram is constructed for assigning nets to traces; and, maximum flow algorithms are used. In one embodiment, a flow diagram includes feedthrough solutions, in which flow conservation is not preserved at certain nodes. In one embodiment, integer linear programming techniques are used for assigning nets to traces. In one embodiment, a distribution of nets, which defines the numbers of blocks that each net has in each partition, is computed and maintained for efficient determination of the number of nets in net groups.

8458639, Jun 4, 2013

May 7, 2012

13/465930

Awartika Pandey - Sunnyvale CA, US
Drazen Borkovic - Mountain View CA, US
Kenneth S. McElvain - Los Altos CA, US

Synopsys, Inc. - Mountain View CA

G06F 17/50

716122, 716105, 716106, 716113, 716129, 716130, 716132, 703 16

Methods and apparatuses for designing at least one integrated circuit (IC). In one embodiment, the method comprises partitioning a circuit into portions that represent a partitioning solution and assigning traces to interconnect the portions to generate a trace assignment solution. The method further comprises optimizing the circuit through a modification of at least one of the partitioning solution and the trace assignment solution, the optimizing based on evaluating a design parameter which is based at least in part on the trace assignment solution.

7237214, Jun 26, 2007

Mar 3, 2004

10/792933

Awartika Pandey - Sunnyvale CA, US
Drazen Borkovic - Mountain View CA, US
Kenneth S. McElvain - Los Altos CA, US

Synplicity, Inc. - Sunnyvale CA

G06F 17/50

716 7, 716 13, 716 14

Methods and apparatuses for incremental circuit partitioning and incremental trace assignment. In one embodiment of the present invention, a cost function based on both the partitioning solution and the trace assignment solution is used for the partitioning of a circuit; in reducing the cost function, blocks of circuits are moved among partitions and the trace assignment are updated accordingly to evaluate the cost function. In one embodiment, the traces and nets are grouped according to the partitions they connect for trace assignment. In one embodiment, a flow diagram is constructed for assigning nets to traces; and, maximum flow algorithms are used. In one embodiment, a flow diagram includes feedthrough solutions, in which flow conservation is not preserved at certain nodes. In one embodiment, integer linear programming techniques are used for assigning nets to traces. In one embodiment, a distribution of nets, which defines the numbers of blocks that each net has in each partition, is computed and maintained for efficient determination of the number of nets in net groups.

2018033, Nov 22, 2018

Jul 30, 2018

16/048934

- Cupertino CA, US
Andrew R. Whalley - San Francisco CA, US
Awartika Pandey - Saratoga CA, US
Robert J. Walsh - Sunnyvale CA, US

Apple Inc. - Cupertino CA

H04L 29/06
H04W 48/16
H04W 12/08
H04W 12/02
H04W 12/04

A wireless device can obtain a network information record from another device operating as a credential source. The network information record can include network access information for a wireless network (e.g., SSID and password) and a usage policy specifying conditions under which the wireless device should search for the wireless network (e.g., temporal and/or spatial conditions). The wireless device can implement the usage policy by searching for the wireless network only when the conditions are satisfied. In some instances, the network access information can include instructions for dynamically generating time-varying network access information, and the wireless device can use the instructions to generate network access information during a search for wireless networks.

2017003, Feb 2, 2017

Nov 5, 2015

14/933709

- Cupertino CA, US
Andrew R. Whalley - San Francisco CA, US
Awartika Pandey - Saratoga CA, US
Robert J. Walsh - Sunnyvale CA, US

Apple Inc. - Cupertino CA

H04L 29/06
H04W 48/16
H04W 12/08
H04W 12/02

A wireless device can obtain a network information record from another device operating as a credential source. The network information record can include network access information for a wireless network (e.g., SSID and password) and a usage policy specifying conditions under which the wireless device should search for the wireless network (e.g., temporal and/or spatial conditions). The wireless device can implement the usage policy by searching for the wireless network only when the conditions are satisfied. In some instances, the network access information can include instructions for dynamically generating time-varying network access information, and the wireless device can use the instructions to generate network access information during a search for wireless networks.

2014036, Dec 11, 2014

Jun 4, 2014

14/296302

- Cupertino CA, US
Jason J. Yew - Palo Alto CA, US
Robert J. Walsh - Sunnyvale CA, US
Awartika Pandey - Saratoga CA, US

H04W 80/02

710106

An accessory can communicate wirelessly with a host device such as a portable electronic device. Existing accessory protocols developed for wired communication can be used without modification, and a wireless network connecting the two devices can provide a transport or channel connecting the two devices. Establishing a wireless channel can involve the active participation of both devices. For instance, the host device can create and identify virtual port to be used by the accessory, after which the accessory can initiate communication on that virtual port. A host device can be configured to automatically connect to certain accessories upon detection of that accessory on a wireless network under various specific conditions. Encryption of accessory-protocol communications between an accessory and a host device is also provided.