Abstract: A time-interleaved analog to digital converter (TI-ADC) includes a first sub-ADC configured to sample and convert an input analog signal to generate a first digital signal and a second sub-ADC configured to sample and convert said input analog signal to generate a second digital signal. Sampling by the second sub-ADC occurs with a time skew mismatch. A multiplexor interleaves the first and second digital signals to generate a third digital signal. A time skew mismatch error determination circuit processes the first and second digital signals to generate a time error corresponding to the time skew mismatch. A slope value of said third digital signal is determined and multiplied by the time error to generate a signal error. The signal error is summed with the third digital signal to generate a digital output signal which eliminates the error due to the time skew mismatch. This correction is performed in real time.

Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may determine, during an active call on a first radio access technology (RAT), that a first condition for performing a handover from the first RAT to a second RAT is satisfied. The UE may determine that the second RAT would trigger a fallback to a third RAT after the handover from the first RAT to the second RAT and that a second condition for performing a handover from the third RAT to the first RAT is satisfied. The UE may refrain from performing the handover from the first RAT to the second RAT based at least in part on the determination that the second RAT would trigger the fallback and the determination that the second condition is satisfied. Numerous other aspects are provided.

Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive, while the UE is in an active session using a first radio access technology (RAT) associated with a first subscription of the UE, a call request via the first RAT, wherein the call request is associated with a second subscription of the UE. The UE may determine that the call request is received from a serving cell that is associated with fallback from the first RAT to a second RAT for calls. The UE may reject the call request or transition the second subscription to a third RAT based at least in part on the determination that the call request is received via the serving cell that is associated with fallback from the first RAT to the second RAT for calls. Numerous other aspects are described.

Abstract: A method may include determining, with a queue availability module, that an entry is available in a queue, asserting a bit in a register based on determining that an entry is available in the queue, determining, with a processor, that the bit is asserted, and processing, with the processor, the entry in the queue based on determining that the bit is asserted. The method may further include storing the register in a tightly coupled memory associated with the processor. The method may further include storing the queue in the tightly coupled memory. The method may further include determining, with the queue availability module, that an entry is available in a second queue, and asserting a second bit in the register based on determining that an entry is available in the second queue. The method may further include finding the first bit in the register using a find first instruction.

Abstract: A computing system includes: a command fetch block configured to determine a host profile for representing a requesting host corresponding to a processing request; and a credit checker block, coupled to the command fetch block, configured to calculate an instance budget at a communication endpoint from an overall resource of the communication endpoint for controlling the processing request at the communication endpoint.

Abstract: A memory is disclosed. The memory may include a first data structure and a second data structure. The first data structure may include a first field to store a first data relating to a command, and a related command field, the related command field to store a value. The second data structure may include a second field to store a second data relating to the command. A queue stored in the memory, may include the first data structure. A storage device may be configured to identify the first data structure and the second data structure (405, 705) as related based at least in part on the value.

Abstract: Various embodiments include methods performed by a processor of a computing device for managing Radio Access Technology (RAT) capability during a Wireless Local Area Network (WLAN)-only mode. Various embodiments may include determining whether the computing device is in a WLAN-only mode, and removing circuit-switched RATs from the RAT capability of the computing device in response to determining that the computing device is in the WLAN-only mode. This determination may be made during system bootup of the computing device, upon detecting the change in the WLAN settings and/or based on a notification message from a multimedia subsystem indicating that the computing device is in the WLAN-only mode. Some embodiments may further include transmitting a service request with only packet-switched (PS) RATs included in a RAT priority list to a Non-Access Stratum (NAS) layer of the computing device, in which the PS RATs include Long Term Evolution (LTE) and New Radio (NR).

Abstract: A method for real-time delivery of data based on additive bitrate fragmentation includes receiving a media sample by a server computing device and generating a key frame based on the media sample. The method also includes generating a differential frame based on the media sample and the key frame. The method also includes transmitting a first data packet including the key frame and a second data packet including the differential frame. The method also includes receiving the first data packet and the second data packet by a mobile computing device, generating the media sample based on the key frame and the differential frame, and initiating playback of the generated sample.

Abstract: This disclosure provides methods, devices, and systems for data compression and decompression. The present implementations more specifically relate to entropy encoding and decoding techniques for keeping a state variable within upper and lower bounds using a noniterative process. The entropy encoding uses a fixed state threshold to determine a number of bits to remove and removes the bits from a current state prior to encoding a symbol with the current state. The entropy decoding decodes encoded data in a bitstream based on a current state to obtain the symbol and a new state and determines a number of bits to read from the bitstream and to add to the new state to update the current state.

Abstract: Techniques are described for a hierarchical caching mechanism enabling efficient cross-region replications. In some embodiments, replication-related information (e.g., key-value pairs) is stored in a particular layout in a binary tree (B-tree) of a file system for replication processing. A hierarchy of caches storing a first type of information (e.g., crypto keys associated with iNodes) may be arranged to match the particular layout in the B-tree to enable efficient parallel processing of a second type of information (e.g., files, file data, or symbolic links), where the replication-related information in the B-tree is partitioned into multiple key ranges for parallel processing. In some embodiments, the caches in different hierarchies may be shared by different parallel-processing key ranges and replication jobs in a file system.

Abstract: Systems and methods for transmitting data partitioned into a sequence of frames may include transmitting a first packet that includes a primary frame and one or more preceding frames from the sequence of frames of data, wherein the one or more preceding frames of the first packet are separated from the primary frame of the first packet in the sequence of frames by respective multiples of a stride parameter; transmitting a second packet that includes a primary frame and one or more preceding frames from the sequence of frames of data, where the primary frame of the first packet is one of the one or more preceding frames of the second packet; and, prior to transmitting the first packet and the second packet, randomly determining an order of transmission for the first packet and the second packet.

Abstract: Techniques are described for snapshot key inter-dependency resolution during cross-region replications. Dependency between a first type of replication-related information (e.g., crypto keys associated with a parent directory iNode or a file iNode) and a second type of replication-related information (e.g., files, file data/FMAPs, or symbolic links) during a cross-region replication may be resolved to enable non-blocking delta application in a target file system. In some embodiments, temporary dummy entries for the first type of information may be created in the B-tree of the target file system for the out-of-order download (e.g., the second type being downloaded before the first type) of these two types of information. In some embodiments, a consolidation process may be performed between the dummy entries and the later-arriving first type of information.

Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may identify an indication of an occurrence of a handover. The UE may adjust a delay used by a buffer based at least in part on the indication of the occurrence of the handover. The UE may process one or more packets of the buffer based at least in part on the adjustment of the delay used by the buffer. Numerous other aspects are described.

Abstract: Techniques are described for enabling concurrent and non-blocking replication object deletion during cross-region replications. In some embodiments, in a target file system, a target replication pipeline as part of a cross-region replication, and a deletion pipeline operate in parallel. The deletion pipeline deletes processed objects reaching the last pipeline stage of the target replication pipeline after each checkpoint in the target replication pipeline. In some embodiments, after a non-recoverable failure during the cross-region replication, the cross-region replication can be restarted from the beginning (i.e., fresh restart) without waiting for its unused objects in the Object Store to be deleted by utilizing a generation number associated with each object to delete the unused objects in a background process while allowing deleting processed objects as normal for the freshly restarted cross-region replication.

Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may set a target delay value for a dejitter buffer of the UE based at least in part on jitter delays of silence descriptor (SID) packets that are received by the UE. The UE may receive, after the SID packets, media packets into the dejitter buffer. The UE may release the media packets from the dejitter buffer based at least in part on the target delay value. Numerous other aspects are described.

Abstract: The present invention relates to a method of positioning a target node (102-4) in a side-link communication system in a wireless communication network (100). The method comprises establishing, by a first node (102-6), a communication link with a second node (102-1 to 102-3) and a third node (102-4). The first node (102-6) measures a relative Angle of Arrival (AoA) and a relative Angle of Departure (AoD) of the third node (102-4) with respect to the second node. The target node is one of the first node, the second node and the third node. The first node (102-6) estimates a position of the third node (102-4) based on at least one of the relative AoA and the relative AoD.

Abstract: Techniques are described for enabling replication-aware resource management and task management in a cloud infrastructure for cross-region replication. In some embodiments, each replication job is associated with a set of replication-related information. In certain embodiments, the replication-aware resource management allocates resources, using a combination of various resource allocation schemes, to a fleet of replicators to allow the fleet to select replication jobs in a job queue, and perform resource scaling based on monitored performance metrics reported by the fleet. In some embodiments, the replication-aware task management enables replication job selection based on the set of replication-related information to optimize the performance of all cross-region replications in the region.

Abstract: In general, techniques are described for automatically and transparently providing service proxying to virtual machines using Network Interface Cards (NICs). In some examples, a service proxy implemented by a NIC of a computing device that hosts a virtual machine may mimic sidecar service proxy behavior. A NIC-based mesh agent may automatically detect the service offered by the virtual machine and interact with control plane components to dynamically incorporate the service into a service mesh.

Abstract: A covalent organic framework and a method of preparing the same are disclosed. The covalent organic framework is used to produce an electrode material and includes a repeating unit represented by the following chemical formula: In the formula, A1, A2, and A3 are the same or different, and are independently a monocyclic or polycyclic aromatic ring, and R1 and R2 are the same or different, and are independently selected from hydrogen, a functional group containing at least one nitrogen, phosphorus, or sulfur, an unsubstituted or substituted C1-C6 alkyl group, an unsubstituted or substituted C2-C6 alkenyl group, an unsubstituted or substituted C2-C6 alkynyl group, and an unsubstituted or substituted C1-C6 alkoxy group.

Abstract: The present disclosure provides a system and method for facilitating tracking area code (TAC) engine to prepare dynamic network polygons based on actual configuration, allocation of TAC to new cell sites, identification of various discrepancies and anomalies in existing planned network, capacity optimization through TAC Division, merge and network polygon edit, and auto work order generation and execution of changes in respective systems, MME Pool and eNB/SCs. Tracking Area Code is a vital parameter for new sites planning and rollout. The method complements network rollout speed with highest level of accuracy of planning and better network perform nave and accuracy. Auto planning engine makes TAC planning zero touch engine with manual review and action through manual edit, audit and work order creation features. Auto planning and configuration help faster rollout, speedy correction and implementation in live network to enhance network performance and user experience.