Patents by Inventor Tejas Bhatt

Tejas Bhatt 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).

  • Patent number: 8750160
    Abstract: A macro wireless communication system includes a base station and a femto access point for communicating with user equipment (UE), such as handset, whereby the UE receives information regarding the network relationships between the base station and the femto access point. A home profile setting may be stored in the UE. When the UE communicates with a femto access point that is identified in the home profile, the UE adapts a neighbor listing provided by the home femto access point. Alternatively, the base station stores a list of the UE and its corresponding home femto access point, along with the neighbor list of the femto access point. When a UE is connected to the base station and that base station is in neighbor list of the UE's home femto access point, a message is sent to the UE to forward an appropriate neighbor list to simplify handovers.
    Type: Grant
    Filed: October 29, 2007
    Date of Patent: June 10, 2014
    Assignee: Nokia Siemens Networks Oy
    Inventors: Tejas Bhatt, Shashikant Maheshwari
  • Patent number: 8724525
    Abstract: Methods and apparatus for synchronizing frames in wireless networks are disclosed. An example method includes delaying, at a wireless relay station, a start time of a frame. In the example method, the start time of the frame is delayed, such that the relay station receives one or more data symbols from a superordinate wireless station and one or more data symbols from a subordinate wireless station at substantially the same time during the frame.
    Type: Grant
    Filed: September 4, 2008
    Date of Patent: May 13, 2014
    Assignee: Nokia Siemens Networks Oy
    Inventors: Adrian Boariu, Shashikant Maheshwari, Tejas Bhatt
  • Patent number: 8165073
    Abstract: A prospective relay station sends a report indicative of radio resource sets/preamble sequences used by its neighbors. Where the reported radio resource sets comprise less than all available radio resource sets, a radio resource set that is not indicated in the report is assigned; else where the reported radio resource sets comprise all available radio resource sets, a resource set indicated in the report is assigned. A message is sent to the prospective relay station indicates the assigned radio resource set and an identifier for use as an enabled relay station. The message may include signal strength and IDs. Apparatus, methods and computer programs are detailed for both a base station and the relay node. Radio resource set re-assignment, managed mode relay operations (where the base station schedules traffic among relays using the same radio resource set), and power control of relays and associated mobile stations are also described.
    Type: Grant
    Filed: August 2, 2007
    Date of Patent: April 24, 2012
    Assignee: Nokia Corporation
    Inventors: Shu-Shaw Wang, Adrian Boariu, Shashikant Maheshwari, Tejas Bhatt, Anthony Reid
  • Publication number: 20100260068
    Abstract: A macro wireless communication system includes a base station and a femto access point for communicating with user equipment (UE), such as handset, whereby the UE receives information regarding the network relationships between the base station and the femto access point. A home profile setting may be stored in the UE. When the UE communicates with a femto access point that is identified in the home profile, the UE adapts a neighbor listing provided by the home femto access point. Alternatively, the base station stores a list of the UE and its corresponding home femto access point, along with the neighbor list of the femto access point. When a UE is connected to the base station and that base station is in neighbor list of the UE's home femto access point, a message is sent to the UE to forward an appropriate neighbor list to simplify handovers.
    Type: Application
    Filed: October 29, 2007
    Publication date: October 14, 2010
    Applicant: NOKIA SIEMENS NETWORKS OY
    Inventors: Tejas Bhatt, Shashikant Maheshwari
  • Publication number: 20100165921
    Abstract: According to one general aspect, a method of operating a indoor cellular access point (ICAP) may comprise constructing a neighbor list of neighboring indoor cellular access points (NICAPs). The method may also include detecting at least one overlay macro base stations (OMBSs). In one embodiment, the method may further comprise associating the overlay macro base stations with the indoor cellular access point. The method may also include transmitting a message to a mobile station (MS) wherein the message includes the neighbor list.
    Type: Application
    Filed: June 30, 2009
    Publication date: July 1, 2010
    Applicant: Nokia Siemens Networks Oy
    Inventors: Shashikant Maheshwari, Tejas Bhatt, Yousuf Saifullah, Haihong Zheng
  • Patent number: 7689892
    Abstract: A method of adaptive error correction coding includes processing data during a connection between a transmitting entity and a receiving entity, where the data is processed in accordance with a predetermined coding scheme. More particularly, processing data includes encoding one or more sequences received by an error correction encoder of the transmitting entity, or decoding one or more block codes received by an error correction decoder of the receiving entity. During the connection, then, the method includes selecting or receiving a selection of feedback code information. Thus, during at least a portion of the connection, the data processing is switched to processing data in accordance with a parity-check coding technique based upon the feedback code information.
    Type: Grant
    Filed: September 7, 2005
    Date of Patent: March 30, 2010
    Assignee: Nokia Corporation
    Inventors: Victor Stolpman, Tejas Bhatt, Nico van Waes, Jian Zhong Zhang, Amitabh Dixit
  • Publication number: 20100054202
    Abstract: According to one general aspect, a method, in one embodiment, comprising establishing an indoor cellular access point (ICAP) on a network. In various embodiments, the method may also include co-operatively selecting an ICAP identifier (ID) such that the ICAP ID is unique amongst the ICAP and the NICAPs. In some embodiments, the method may further include sharing a wireless communications resource by multiplexing the use of the wireless communications resource amongst the ICAP and the NICAPs.
    Type: Application
    Filed: August 5, 2009
    Publication date: March 4, 2010
    Applicant: NOKIA SIEMENS NETWORKS OY
    Inventors: Tejas Bhatt, Shashikant Maheshwari
  • Publication number: 20100054172
    Abstract: Various example embodiments are disclosed relating to synchronization of frames using bidirectional transmit and receive zones. An example method includes delaying, at a wireless relay station, a start time of a frame. In the example method, the start time of the frame is delayed, such that the relay station receives one or more data symbols from a superordinate wireless station and one or more data symbols from a subordinate wireless station at substantially the same time during the frame.
    Type: Application
    Filed: September 4, 2008
    Publication date: March 4, 2010
    Applicant: Nokia Siemens Networks Oy
    Inventors: Adrian Boariu, Shashikant Maheshwari, Tejas Bhatt
  • Patent number: 7613104
    Abstract: Disclosed is a method, a computer program product and a device that includes a receiver for receiving a downlink signal transmitted into a cell. The receiver is operable to obtain time, carrier frequency and cell-specific preamble synchronization to the received signal and includes a plurality of synchronization units that include a first detector to detect a frame boundary using preamble delay correlation; a second detector to detect the frame boundary with greater precision using a conjugate symmetry property over a region identified by the first detector; a cyclic prefix correlator to resolve symbol boundary repetition; an estimator, using the cyclic prefix, to estimate and correct a fractional carrier frequency offset; an operator to perform a Fast Fourier Transform of an identified preamble symbol and a frequency domain cross-correlator to identify cell-specific preamble sequences and an integer frequency offset in sub-carrier spacing.
    Type: Grant
    Filed: May 31, 2006
    Date of Patent: November 3, 2009
    Assignee: Nokia Corporation
    Inventors: Tejas Bhatt, Vishwas Sundaramurthy, Jianzhong Zhang, Dennis McCain
  • Publication number: 20090141676
    Abstract: An approach provides an error-control scheme within a multi-hop relay network. A determination is made of a first node that failed to transmit a packet generated according to an error-control scheme, wherein the first node is among a plurality of nodes configured to operate in a multi-hop network. Resources of the multi-hop network are reserved only for retransmission of the packet from the first node towards a destination node that is included in the plurality of nodes.
    Type: Application
    Filed: November 14, 2007
    Publication date: June 4, 2009
    Inventors: Shashikant Maheshwari, Tejas Bhatt
  • Patent number: 7502312
    Abstract: In the reception of a CDMA signal, the receiving unit performs a simplified process of linear equalization that eliminates the need for inverting the correlation matrix. For the single antenna reception case, the correlation matrix is approximated to a good degree by a circulation matrix that is diagonalized by FFT operations, thus substituting two FFTs and one IFFT having a complexity of O(3/2 LF log LF) for the direct matrix inversion having a complexity of O(LF3). The extension of this method uses a multiple antenna reception system with oversampling.
    Type: Grant
    Filed: January 5, 2005
    Date of Patent: March 10, 2009
    Assignee: Nokia Corporation
    Inventors: Jianzhong Zhang, Tejas Bhatt, Giridhar Mandyam
  • Publication number: 20080031197
    Abstract: A prospective relay station sends a report indicative of radio resource sets/preamble sequences used by its neighbors. Where the reported radio resource sets comprise less than all available radio resource sets, a radio resource set that is not indicated in the report is assigned; else where the reported radio resource sets comprise all available radio resource sets, a resource set indicated in the report is assigned. A message is sent to the prospective relay station indicates the assigned radio resource set and an identifier for use as an enabled relay station. The message may include signal strength and IDs. Apparatus, methods and computer programs are detailed for both a base station and the relay node. Radio resource set re-assignment, managed mode relay operations (where the base station schedules traffic among relays using the same radio resource set), and power control of relays and associated mobile stations are also described.
    Type: Application
    Filed: August 2, 2007
    Publication date: February 7, 2008
    Inventors: Shu-Shaw Wang, Adrian Boariu, Shashikant Maheswari, Tejas Bhatt, Anthony Reid
  • Publication number: 20080022191
    Abstract: A method of adaptive error correction coding includes processing data during a connection between a transmitting entity and a receiving entity, where the data is processed in accordance with a predetermined coding scheme. More particularly, processing data can include encoding one or more sequences received by an error correction encoder of the transmitting entity, or decoding one or more block codes received by an error correction decoder of the receiving entity. During the connection, then, the method can include selecting or receiving a selection of feedback code information. Thus, during at least a portion of the connection, the data processing can be switched to processing data in accordance with a parity-check coding technique based upon the feedback code information.
    Type: Application
    Filed: September 7, 2005
    Publication date: January 24, 2008
    Applicant: NOKIA CORPORATION
    Inventors: Victor Stolpman, Tejas Bhatt, Nico van Waes, Jian Zhong Zhang, Amitabh Dixit
  • Publication number: 20070280098
    Abstract: Disclosed is a method, a computer program product and a device that includes a receiver for receiving a downlink signal transmitted into a cell. The receiver is operable to obtain time, carrier frequency and cell-specific preamble synchronization to the received signal and includes a plurality of synchronization units that include a first detector to detect a frame boundary using preamble delay correlation; a second detector to detect the frame boundary with greater precision using a conjugate symmetry property over a region identified by the first detector; a cyclic prefix correlator to resolve symbol boundary repetition; an estimator, using the cyclic prefix, to estimate and correct a fractional carrier frequency offset; an operator to perform a Fast Fourier Transform of an identified preamble symbol and a frequency domain cross-correlator to identify cell-specific preamble sequences and an integer frequency offset in sub-carrier spacing.
    Type: Application
    Filed: May 31, 2006
    Publication date: December 6, 2007
    Inventors: Tejas Bhatt, Vishwas Sundaramurthy, Jianzhong Zhang, Dennis McCain
  • Publication number: 20070198905
    Abstract: A transmitter for a communications network, the transmitter comprising: receiving means for receiving data; accessing means for accessing a parity check code; generating means for generating encoded data including an error correction codeword using the data and the parity check code; and transmitting means for transmitting the encoded data and the error correction codeword, wherein the parity check code comprises a parity check matrix which, in expanded form, can be represented by the matrix H having the general structure ( A B T C D E ) ? ` wherein A, B, T, C, D and E represent sub-matrices, ET?1B being equal to the null matrix, the generating means comprising summing circuitry arranged to receive matrix elements ET?1A and C to generate a sum, and matrix multiplication circuitry for receiving the sum, a matrix element D?1 and a matrix sT comprising the data, the matrix multiplication circuitry being operable to generate a parity part p1T of the error correction codeword according
    Type: Application
    Filed: February 3, 2006
    Publication date: August 23, 2007
    Inventors: Tejas Bhatt, Amitabh Dixit, Victor Stolpman
  • Publication number: 20070089019
    Abstract: An error correction decoder for block serial pipelined layered decoding of block codes includes a plurality of elements capable of processing, for at least one of a plurality of iterations of an iterative decoding technique, at least one layer of a parity check matrix. The elements include an iterative decoder element capable of calculating, for one or more iterations or one or more layers of the parity-check matrix, a check-to-variable message. Calculating the check-to-variable message can include calculating a magnitude of the check-to-variable message based upon a first minimum magnitude, a second minimum magnitude and a third minimum magnitude of a plurality of variable-to-check messages for a previous iteration or layer.
    Type: Application
    Filed: November 14, 2005
    Publication date: April 19, 2007
    Applicant: Nokia Corporation
    Inventors: Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
  • Publication number: 20070089016
    Abstract: An error correction decoder for block serial pipelined layered decoding of block codes includes primary and mirror memories that are each capable of storing log-likelihood ratios (LLRs) for one or more iterations of an iterative decoding technique. The decoder also includes a plurality of elements capable of processing, for one or more iterations, one or more layers of a parity-check matrix. The elements include an iterative decoder element capable of calculating, for one or more iterations or layers, a LLR adjustment based upon the LLR for a previous iteration/layer, the LLR for the previous iteration/layer being read from the primary memory. The decoder further includes a summation element capable of reading the LLR for the previous iteration/layer from the mirror memory, and calculating the LLR for the iteration/layer based upon the LLR adjustment for the iteration/layer and the previous iteration/layer LLR for the previous iteration/layer.
    Type: Application
    Filed: October 18, 2005
    Publication date: April 19, 2007
    Applicant: Nokia Corporation
    Inventors: Tejas Bhatt, Vishwas Sundaramurthy, Victor Stolpman, Dennis McCain
  • Publication number: 20070089018
    Abstract: An error correction decoder for block serial pipelined layered decoding of block codes includes a plurality of elements capable of processing, for at least one of a plurality of iterations of an iterative decoding technique, at least one layer of a parity check matrix. The elements can include a permuter and/or de-permuter capable of permuting and/or depermuting, for at least one iteration or at least one layer of the parity-check matrix, at least one data array. The permuter/de-permuter can include a permuting Benes network and a sorting Benes network. In this regard, the permuting Benes network can include a plurality of switches for permuting the LLR for the previous iteration or layer, or de-permuting the portion of the LLR for the iteration or layer. Driving the permuting Benes network, then, the sorting Benes network can be capable of generating control logic for the switches of the permuting Benes network.
    Type: Application
    Filed: November 14, 2005
    Publication date: April 19, 2007
    Applicant: Nokia Corporation
    Inventors: Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
  • Publication number: 20070089017
    Abstract: An error correction decoder for block serial pipelined layered decoding of block codes includes a plurality of elements capable of processing, for at least one of a plurality of iterations of an iterative decoding technique, at least one layer of a parity check matrix. The elements include an iterative decoder element capable of calculating, for one or more iterations or one or more layers of the parity-check matrix processed during at least one iteration, a check-to-variable message based upon a first minimum magnitude and a second minimum magnitude of a plurality of variable-to-check messages for a previous iteration or layer, and a sign value associated with a plurality of variable-to-check messages for the previous iteration or layer. In this regard, the first and second minimum magnitudes and the sign value can be read from a check-to-variable message memory.
    Type: Application
    Filed: November 14, 2005
    Publication date: April 19, 2007
    Applicant: Nokia Corporation
    Inventors: Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
  • Publication number: 20070067696
    Abstract: A system, transmitter, receiver, method, and computer program product are provided in which a plurality of structured interleavers permute data bits arranged in a data bit matrix for Zigzag encoding. For each interleaver, the data bits in each column of the data bit matrix are cyclically shifted, with the amount of the shift being predefined and different for each column. In addition to the cycle shift, each column may be bit reverse ordered, and entire columns may be swapped. The interleaved data bit matrix may then be encoded using a Zigzag encoder to generate parity bits that may be transmitted, along with the data bits, from a transmitter to a receiver where the data may be iteratively decoded.
    Type: Application
    Filed: September 8, 2005
    Publication date: March 22, 2007
    Inventors: Tejas Bhatt, Victor Stolpman, Dennis McCain