Abstract: Certain aspects of the present disclosure provide techniques for handling coordinated beamforming in wireless communications systems. An example method performed by a first access point (AP) generally includes outputting, for transmission to a second AP, at least one of a first indication that the first AP supports spatial reuse of transmission resources or a second indication that the first AP supports asymmetric coordinated beamforming (CBF); and outputting, for transmission, signaling to one or more stations (STAs) supported by the first AP without intent to form nulls directed toward other STAs supported by the second AP.

Abstract: This disclosure provides methods, devices and systems for communicating over a 60 GHz band and reusing legacy hardware for communication over sub-6 bands. Certain aspects are directed to outputting, for transmission to a second wireless device, a first packet, wherein the first packet is output via a radio frequency (RF) front end defined by a first clock accuracy requirement having an acceptable error rate that is lower than a legacy clock accuracy requirement, and wherein the first packet is output for transmission via a first band. Certain aspects are directed to obtaining, from the second wireless device, a second packet via the first band.

Abstract: This disclosure provides systems, methods and apparatuses for selectively using spatial reuse (SR) transmissions in the presence of an overlapping basic service set (OBSS) transmission. In some implementations, a wireless communication device may transmit data to another wireless communication device using SR packets in the presence of an OBSS transmission or interference only when the signal strength of SR packets received at the other wireless communication device is greater than an amount of signal degradation of the OBSS transmission caused by the SR transmission.

Abstract: Certain aspects of the present disclosure provide techniques for sending a retransmission of codewords of a data packet to a receiver node, that were not previously successfully received by the receiver node, in a manner compatible with a receive capability constraint of the receiver node.

Abstract: Certain aspects of the present disclosure provide techniques for sending a retransmission of codewords of a data packet to a receiver node, that were not previously successfully received by the receiver node, in a manner compatible with a receive capability constraint of the receiver node.

Abstract: When a UE does not completely decode a packet transmitted from a base station, the UE may send ACK/NACK to the base station, upon which the base station may retransmit the packet based on the ACK/NACK. However, the ACK/NACK fails to provide the base station with information needed by the UE for completely decoding the packet. Accordingly, a method, an apparatus, and a computer program product for wireless communication are provided. The apparatus receives a packet from a base station having a first MCS, determines information to provide to the base station, wherein the information comprises CQI relating to a channel condition and/or interference condition corresponding to time-frequency resources allocated for the received packet, and sends the information to the base station. Thereafter, the apparatus re-receives the packet from the base station, the re-received packet having a second MCS according to the information sent to the base station.

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract: An electronic device and method identify a block of text in a portion of an image of real world captured by a camera of a mobile device, slice sub-blocks from the block and identify characters in the sub-blocks that form a first sequence to a predetermined set of sequences to identify a second sequence therein. The second sequence may be identified as recognized (as a modifier-absent word) when not associated with additional information. When the second sequence is associated with additional information, a check is made on pixels in the image, based on a test specified in the additional information. When the test is satisfied, a copy of the second sequence in combination with the modifier is identified as recognized (as a modifier-present word). Storage and use of modifier information in addition to a set of sequences of characters enables recognition of words with or without modifiers.

Abstract: An image of real world is processed to identify blocks as candidates to be recognized. Each block is subdivided into sub-blocks, and each sub-block is traversed to obtain counts, in a group for each sub-block. Each count in the group is either of presence of transitions between intensity values of pixels or of absence of transition between intensity values of pixels. Hence, each pixel in a sub-block contributes to at least one of the counts in each group. The counts in a group for a sub-block are normalized, based at least on a total number of pixels in the sub-block. Vector(s) for each sub-block including such normalized counts may be compared with multiple predetermined vectors of corresponding symbols in a set, using any metric of divergence between probability density functions (e.g. Jensen-Shannon divergence metric). Whichever symbol has a predetermined vector that most closely matches the vector(s) is identified and stored.

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract: Systems, apparatus and methods for extracting lower modifiers from a word image, before performing optical character recognition (OCR), based on a plurality of tests comprising a first test, a second test and a third test are presented. The method obtains the word image and performing a plurality of tests (e.g., a first test, a second test and a third test). The first test determines whether a vertical line spanning the height of the word image exists. The second test determines whether a jump of a number of components in the lower portion of the word image exists. The third test determines sparseness in a lower portion of the word image. The plurality of tests may run sequentially and/or in parallel. Results from the plurality of tests are used to decide whether a lower modifier exists by comparing and accumulating test results from the plurality of tests.

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract: An electronic device and method receive a block sliced from a rectangular portion of an image of a scene of real world captured by a camera and use a property of the block to operate one of multiple optical character recognition (OCR) decoders. In an illustrative aspect, a first OCR decoder is configured to recognize characters whose property satisfies the test based on a first limit, the first limit being obtained by reducing a predetermined limit by an overlap amount. In this illustrative aspect, a second OCR decoder is configured to recognize characters whose property does not satisfy the test based on a second limit, the second limit being obtained by increasing the predetermined limit by the overlap amount. When the property of the block satisfies the test, the first OCR decoder is operated and alternatively the second OCR decoder is operated, resulting in candidates for a character being identified.

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract: An electronic device and method identify a block of text in a portion of an image of real world captured by a camera of a mobile device, slice sub-blocks from the block and identify characters in the sub-blocks that form a first sequence to a predetermined set of sequences to identify a second sequence therein. The second sequence may be identified as recognized (as a modifier-absent word) when not associated with additional information. When the second sequence is associated with additional information, a check is made on pixels in the image, based on a test specified in the additional information. When the test is satisfied, a copy of the second sequence in combination with the modifier is identified as recognized (as a modifier-present word). Storage and use of modifier information in addition to a set of sequences of characters enables recognition of words with or without modifiers.

Abstract: An image of real world is processed to identify blocks as candidates to be recognized. Each block is subdivided into sub-blocks, and each sub-block is traversed to obtain counts, in a group for each sub-block. Each count in the group is either of presence of transitions between intensity values of pixels or of absence of transition between intensity values of pixels. Hence, each pixel in a sub-block contributes to at least one of the counts in each group. The counts in a group for a sub-block are normalized, based at least on a total number of pixels in the sub-block. Vector(s) for each sub-block including such normalized counts may be compared with multiple predetermined vectors of corresponding symbols in a set, using any metric of divergence between probability density functions (e.g. Jensen-Shannon divergence metric). Whichever symbol has a predetermined vector that most closely matches the vector(s) is identified and stored.

Abstract: When a UE does not completely decode a packet transmitted from a base station, the UE may send ACK/NACK to the base station, upon which the base station may retransmit the packet based on the ACK/NACK. However, the ACK/NACK fails to provide the base station with information needed by the UE for completely decoding the packet. Accordingly, a method, an apparatus, and a computer program product for wireless communication are provided. The apparatus receives a packet from a base station having a first MCS, determines information to provide to the base station, wherein the information comprises CQI relating to a channel condition and/or interference condition corresponding to time-frequency resources allocated for the received packet, and sends the information to the base station. Thereafter, the apparatus re-receives the packet from the base station, the re-received packet having a second MCS according to the information sent to the base station.