Patents by Inventor Johan Axnas
Johan Axnas 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: 20170257139Abstract: A method of synchronizing transmission of signals from a network node to a receiver includes generating a synchronization signal transmission pattern in which transmission resources used for transmission of the synchronization signals in regularly spaced time intervals are changed in successive ones of the time intervals, and transmitting synchronization signals from the network node in accordance with the synchronization signal transmission pattern. Related network nodes and user equipment nodes are disclosed.Type: ApplicationFiled: October 24, 2014Publication date: September 7, 2017Inventors: Johan AXNÄS, Kumar BALACHANDRAN, Dennis HUI
-
Publication number: 20170251441Abstract: In one aspect of the teachings herein, a radio network node advantageously adapts the transmission duration of a synchronization signal with respect to transmission of the synchronization signal in different directions. For example, the radio network node uses a shorter transmission duration in beam directions that are associated with better reception conditions and a longer transmission duration in beam directions that are associated with poorer reception conditions. As a consequence of varying the transmission duration according to received-signal qualities known or expected for the different directions, the radio network node can shorten the overall time needed to complete one synchronization-signal transmission cycle and use less energy, as compared to using a more conservative, longer transmission time in all beam directions.Type: ApplicationFiled: February 26, 2016Publication date: August 31, 2017Inventors: Johan Axnäs, Robert Baldemair, Igor Moaco Guerreiro, Dennis Hui, Eleftherios Karipidis
-
Publication number: 20170250739Abstract: Techniques for determining beam-sweeping patterns for synchronization signals transmitted in a region by several access nodes in a network, where each access node is connected to a corresponding array of antenna elements. An example method includes modeling a total power function for the power transmitted in the synchronization signals, as a factor graph having a plurality of check nodes and variable nodes, each check node corresponding to a virtual wireless device in the region and each variable node corresponding to an available beam for an access node. The virtual wireless devices are emulated so as to implement quality-of-service constraints on synchronization signals received by the virtual wireless devices. An iterative message-passing algorithm, such as a min-sum algorithm, is applied to the modeled total power function, to determine a sequence of power levels, for each access node, for sweeping synchronization signal beams, so as to minimize the total power function.Type: ApplicationFiled: February 26, 2016Publication date: August 31, 2017Inventors: Igor Moaco Guerreiro, Johan Axnäs, Robert Baldemair, Dennis Hui, Eleftherios Karipidis
-
Patent number: 9730136Abstract: Systems and methods related to distributed route determination through a multi-hop wireless network based on multiple route metrics or properties are disclosed. In some embodiments, a method of operation of a network node comprises identifying a subset of neighbors of the network node in a wireless network based on: (a) link weight(s) for links from the network node to at least some of the neighbors of the network node with respect to route metric(s) and (b) defined limit(s) for the route metric(s). The method further comprises obtaining second link weights for the links from the network node to at least the subset of the neighbors with respect to a second route metric, and identifying from the subset of the neighbors, an optimal next hop neighbor for the network node. In this manner, multiple route metrics are taken into consideration in manner that is computationally efficient.Type: GrantFiled: November 26, 2014Date of Patent: August 8, 2017Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Dennis Hui, Johan Axnäs, Kumar Balachandran, Robert Baldemair, Hugo Tullberg
-
Patent number: 9713144Abstract: Methods and network nodes (700-720) route communications between pairs of source and destination nodes through network nodes (700-720) of a wireless communication system. One resource slot of a wireless communication link is selected (1200) between each of a sequence of the network nodes (700-720) along a communication route between one pair of the source and destination nodes. Another resource slot of the wireless communication link is selected (1202) between at least some of the sequence of the network nodes (700-720) along the communication route between the one pair of the source and destination nodes. Selection of the other resource slot between each of the sequence of the network nodes along the communication route can be constrained to selection among resource slots that are available from only the sequence of the network nodes along the communication route between the one pair of the source and destination nodes.Type: GrantFiled: December 10, 2012Date of Patent: July 18, 2017Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Johan Axnäs, Kumar Balachandran, Robert Baldemair, Dennis Hui, Hugo Tullberg
-
Patent number: 9647930Abstract: The proposed technology provides a computationally efficient way to find suitable routes under consideration of multiple metrics. The considered multi-hop network is represented by a connected graph having nodes and links interconnecting the nodes. The method comprises the step (S1) of obtaining a value of a reference route between a source node and a destination node in the connected graph according a first routing metric. The method further comprises the step (S2) of modifying, based on the value of the reference route according to the first routing metric, the connected graph by modifying link cost, with respect to a second routing metric, of at least one link in the connected graph. The method also comprises the step (S3) of determining at least part of a route between the source node and the destination node in the modified connected graph, based on the modified link cost, according to the second routing metric.Type: GrantFiled: November 26, 2012Date of Patent: May 9, 2017Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Johan Axnäs, Kumar Balachandran, Robert Baldemair, Dennis Hui, Hugo Tullberg
-
Publication number: 20170127367Abstract: The present disclosure relates to transmitting synchronization signals and in particular to so called beam sweep. In particular the disclosure relates to methods for providing synchronization using synchronization sequences that are transmitted at different points in time. The disclosure also relates to corresponding devices and computer programs. A method in a network node, for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices, comprises determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device and transmitting the synchronization sequences to the one or more wireless devices, at different points in time.Type: ApplicationFiled: October 28, 2015Publication date: May 4, 2017Inventors: Johan Axnäs, Kumar Balachandran, Icaro L. J. da Silva, Dennis Hui, Andres Reial, Johan Rune, Henrik Sahlin
-
Publication number: 20170094624Abstract: An access node, AN, may be configured to communicate wirelessly with a wireless device (WD). The AN can transmit a first synchronization signal block having a first format. The AN can also transmit a second synchronization signal block of a second format, the first synchronization signal block including a first format different from the format of the second synchronization signal block. The first synchronization signal block can include an extended primary synchronization signal block that can be used to synchronize disadvantaged user equipment (e.g., user equipment experiencing low signal-to-noise ratio).Type: ApplicationFiled: June 3, 2016Publication date: March 30, 2017Inventors: Kumar Balachandran, Johan Axnäs, Dennis Hui
-
Publication number: 20160381619Abstract: Methods, apparatuses, and computer program products provide for routing information between nodes of a radio network. A quality metric is received at a network node that indicates a quality of at least one channel of a plurality of channels in the network. A virtual network is generated that includes one or more routes between a source node and a destination node. A modified virtual network is generated based at least in part on the quality metric and the virtual network, and is then used to determine an optimized route between the source node and destination node. The determination includes a joint selection of one or more of a plurality of network nodes and the plurality of the channels.Type: ApplicationFiled: January 20, 2014Publication date: December 29, 2016Inventors: Johan Axnäs, Kumar Balachandran, Dennis Hui, Tim Irnich, Jonas Kronander, Miurel Isabel Tercero Vargas
-
Publication number: 20160337938Abstract: Methods, apparatuses, and computer program products for communicating channel assessment, channel information, and routing information between a spectrum controller (210) and radio resource manager (220). A spectrum controller obtains channel information and classifies a number of radio channels of a network as available, partially available, or unavailable. The availability information is sent to a radio resource manager, which can use the information to determine a routing solution. The radio resource manager can request that the spectrum controller perform an access negotiation for a partially available channel. Based on the result of the negotiation, the radio resource manager may re-route information in the network.Type: ApplicationFiled: January 20, 2014Publication date: November 17, 2016Inventors: Miurel Isabel Tercero Vargas, Johan Axnäs, Kumar Balachandran, Tim Irnich, Jonas Kronander
-
Publication number: 20160338051Abstract: The present disclosure generally relates to the field of resource allocation. More specifically, the present disclosure relates to a technique of allocating communication resources in a wireless communication network. The wireless communication network comprises a plurality of access nodes, each of the plurality of access nodes being connected to one or more of the plurality of access nodes via one or more links to provide a plurality of routes for routing data through the wireless communication network. A method embodiment comprises the step of receiving, for one or more links (180, 182) of at least one access node (100) of the plurality of access nodes, allocation information. The allocation information indicates how available communication resources are to be allocated.Type: ApplicationFiled: January 21, 2014Publication date: November 17, 2016Applicant: Telefonaktiebolaget L M Ericsson (PUBL)Inventors: Jonas Kronander, Johan Axnäs, Robert Baldemair, Dennis Hui, Zhan Zhang
-
Patent number: 9419730Abstract: The effects of interference between a communication system operating in a frequency area and another system sending out pulses affecting the frequency area can be handled by means of a communication unit (RBS1, MT1) for use in a first cellular communications system, in which at least one type of system sensitive data is transmitted at pre-determined points in time, said communications unit comprising transmitting means (14, 24) arranged to transmit said system sensitive data and processing means (11, 21) arranged to control the transmitting means to transmit the system sensitive data at new points in time different from the predetermined points in time, instead of at said predetermined points in time, to reduce the risk of interference from a second system operating in the same frequency range as the first cellular communications system.Type: GrantFiled: April 14, 2008Date of Patent: August 16, 2016Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Markus Ringstrom, Johan Axnas, Robert Baldemair
-
Patent number: 9351228Abstract: Systems and methods for computing and/or utilizing mutual information based link metrics for a link in a wireless mesh network are disclosed. In one embodiment, one or more mutual information values are computed for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network. Each of the one or more mutual information values is computed for a different hypothesized transmission mode for the link. One or more link metrics for the link are computed as a function of the mutual information values, where each link metric is computed based on a different one of the one or more mutual information values. In this manner, a link metric is computed for each of the one or more hypothesized transmission modes for the link. At least one of the link metrics are then provided to a routing update module.Type: GrantFiled: September 24, 2013Date of Patent: May 24, 2016Assignee: Optis Cellular Technology, LLCInventors: Dennis Hui, Johan Axnäs, Kumar Balachandran, Robert Baldemair, Hugo Tullberg
-
Publication number: 20160127919Abstract: Systems and methods relating to non-adaptive beam scanning in a wireless network are disclosed. In some embodiments, a method of operation of a transmit node to perform non-adaptive beam scanning for transmit beam patterns of the transmit node that partition a service coverage area of the transmit node into transmit partition cells is provided. The method transmitting a known signal using each of multiple scanning beam patterns for each of multiple beam scanning stages over non-overlapping radio resource slots. The scanning beam patterns for the beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the beam scanning stages corresponds to a different transmit beam pattern of the transmit node. This multi-stage beam scanning approach provides an exponentially more efficient process for beam scanning than the conventional Sequential Beam Sweeping (SBS) approach.Type: ApplicationFiled: November 3, 2014Publication date: May 5, 2016Inventors: Dennis Hui, Johan Axnäs, Robert Baldemair
-
Publication number: 20160050612Abstract: A route determination method is provided in a multi-hop network having a number of nodes, where at least two nodes are target nodes. The multi-hop network includes a fictitious node having fictitious links to at least two of the target nodes. The method includes determining, at least part of one or more extended routes for connecting one or more of the nodes included in the multi-hop network, to the fictitious node and determining, at least a part of a route in the multi-hop network, using the at least part of one or more extended routes. Other methods and devices are disclosed for route determination in a multi-hop network have several gateways or aggregation nodes for connecting to a communication network, and for routing in a multi-hop network.Type: ApplicationFiled: March 27, 2013Publication date: February 18, 2016Inventors: Johan AXNÄS, Kumar BALACHANDRAN, Dennis HUI
-
Publication number: 20150312906Abstract: Methods and network nodes (700-720) route communications between pairs of source and destination nodes through network nodes (700-720) of a wireless communication system. One resource slot of a wireless communication link is selected (1200) between each of a sequence of the network nodes (700-720) along a communication route between one pair of the source and destination nodes. Another resource slot of the wireless communication link is selected (1202) between at least some of the sequence of the network nodes (700-720) along the communication route between the one pair of the source and destination nodes. Selection of the other resource slot between each of the sequence of the network nodes along the communication route can be constrained to selection among resource slots that are available from only the sequence of the network nodes along the communication route between the one pair of the source and destination nodes.Type: ApplicationFiled: December 10, 2012Publication date: October 29, 2015Applicant: Telefonaktiebolaget L M Erricsson (publ)Inventors: Johan Axnäs, Kumar Balachandran, Robert Baldemair, Dennis Hui, Hugo Tullberg
-
Publication number: 20150304207Abstract: The proposed technology provides a computationally efficient way to find suitable routes under consideration of multiple metrics. The considered multi-hop network is represented by a connected graph having nodes and links interconnecting the nodes. The method comprises the step (S1) of obtaining a value of a reference route between a source node and a destination node in the connected graph according a first routing metric. The method further comprises the step (S2) of modifying, based on the value of the reference route according to the first routing metric, the connected graph by modifying link cost, with respect to a second routing metric, of at least one link in the connected graph. The method also comprises the step (S3) of determining at least part of a route between the source node and the destination node in the modified connected graph, based on the modified link cost, according to the second routing metric.Type: ApplicationFiled: November 26, 2012Publication date: October 22, 2015Inventors: Johan AXNAS, Kumar BALACHANDRAN, Robert BALDEMAIR, Dennis HUI, Hugo TULLBERG
-
Publication number: 20150146655Abstract: Systems and methods related to distributed route determination through a multi-hop wireless network based on multiple route metrics or properties are disclosed. In some embodiments, a method of operation of a network node comprises identifying a subset of neighbors of the network node in a wireless network based on: (a) link weight(s) for links from the network node to at least some of the neighbors of the network node with respect to route metric(s) and (b) defined limit(s) for the route metric(s). The method further comprises obtaining second link weights for the links from the network node to at least the subset of the neighbors with respect to a second route metric, and identifying from the subset of the neighbors, an optimal next hop neighbor for the network node. In this manner, multiple route metrics are taken into consideration in manner that is computationally efficient.Type: ApplicationFiled: November 26, 2014Publication date: May 28, 2015Inventors: Dennis Hui, Johan Axnäs, Kumar Balachandran, Robert Baldemair, Hugo Tullberg
-
Patent number: 8737402Abstract: The invention provides a scheduling of data blocks on multiple data carriers and a selection of data carrier to listen to. A transmitting unit simultaneously transmits, during a communication session with at least one participating receiving unit, at least a first data block on a first data carrier and a second data block on a second data carrier. The receiving unit selects which of these data carriers to listen to, i.e. whether to receive the first or second data block, based on a reception quality of a previously received data block. Furthermore, at least one of the first and second data block is based on information common to the data block and the previous data block, e.g. the first or second data block could be re-transmitted version of the previous block.Type: GrantFiled: May 11, 2005Date of Patent: May 27, 2014Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Johan Axnäs, Tobias Tynderfeldt
-
Publication number: 20140086080Abstract: Systems and methods for computing and/or utilizing mutual information based link metrics for a link in a wireless mesh network are disclosed. In one embodiment, one or more mutual information values are computed for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network. Each of the one or more mutual information values is computed for a different hypothesized transmission mode for the link. One or more link metrics for the link are computed as a function of the mutual information values, where each link metric is computed based on a different one of the one or more mutual information values. In this manner, a link metric is computed for each of the one or more hypothesized transmission modes for the link. At least one of the link metrics are then provided to a routing update module.Type: ApplicationFiled: September 24, 2013Publication date: March 27, 2014Applicant: Telefonaktiebolaget L M Ericsson (publ)Inventors: Dennis Hui, Johan Axnäs, Kumar Balachandran, Robert Baldemair, Hugo Tullberg