Abstract: A key with a very large number of code combinations. The key includes a longitudinally extending key blade with a wave-like side code pattern forming a wave-like surface including a ramp portion at a free end portion of the key blade with the wave-like guide being formed on the key blade at a side surface. A key contacting portion engages the wave-like side code pattern and is positioned by way of a specific pivotal position of the finger. A specific asymmetric displacement of the key contacting portion is formed in an asymmetric free end of the finger so that the specific pivotal displacement of the key contacting portion is available relative to the specific pivotal displacement relative to the wave-like side code pattern. The number of possible code combinations is consequently further increased.
Abstract: A lock and key system with a very large number of code combinations. The lock (200) includes side locking tumblers (206) having pivoting fingers (208) with asymmetric key contacting portions (220r), which engage with a wave-like code pattern (105) formed at the side of the key (100).
Abstract: A lock and key system with a very large number of code combinations. The lock (200) includes side locking tumblers (206) having pivoting fingers (208) with asymmetric key contacting portions (220r), which engage with a wave-like code pattern (105) formed at the side of the key (100).
Abstract: Devices, systems, and methods for improving performance of an iterative decoder in a non-volatile memory are described. An example method includes receiving a noisy codeword that is based on a transmitted codeword generated from a low-density parity-check (LDPC) code, performing, on the noisy codeword for a first number of iterations, a message passing algorithm between a plurality of variable nodes and a plurality of check nodes that represent a parity matrix of the LDPC code, assigning, based on comparing an asymmetric ratio to a threshold, a set of asymmetric LLRs to a set of LLRs (that were initialized using symmetric LLRs) used in the message passing algorithm, and determining, subsequent to performing the message passing algorithm on the noisy codeword for a second number of iterations, a candidate version of the transmitted codeword.
Abstract: A method and a system for issuing an electronic signature. The method involves sending, by a first server, information including a plain text, a hash code an identification number and a phone number of the signer of an electronic document to a second server and to a plurality of autonomous computing nodes; generating, by each node, an asymmetric key using its private key; selecting one of the nodes as a main node; creating, by each node different to the main node, a file by extracting the information; creating a code sequence having a series of characters by digitally signing the plain text with the private key; and extracting at least one character of the created code sequence, providing a modified code sequence; generating, by the main node, a signature code by combining the modified code sequences provided by the other nodes; and transmitting the signature code to the second server.
Abstract: A method and a system for issuing an electronic signature. The method involves sending, by a first server, information including a plain text, a hash code an identification number and a phone number of the signer of an electronic document to a second server and to a plurality of autonomous computing nodes; generating, by each node, an asymmetric key using its private key; selecting one of the nodes as a main node; creating, by each node different to the main node, a file by extracting the information; creating a code sequence having a series of characters by digitally signing the plain text with the private key; and extracting at least one character of the created code sequence, providing a modified code sequence; generating, by the main node, a signature code by combining the modified code sequences provided by the other nodes; and transmitting the signature code to the second server.
Abstract: System and method for reducing power consumption and noise in a transmission system with an asymmetrically terminated transmission line. A preferred embodiment comprises encoding data words to reduce the number of times a given state appears in a code word. The preferred embodiment comprises counting the number of times a given state appears in a data word. If the count is greater than half of the total number of bits in the data word, then the data word is inverted and a weight bit can be set to the given state. If the count is less than (or equal to) half of the total number of bits, then the data word may be unchanged and the weight bit can be set to the inverse of the given state. The code word can be generated by appending the weight bit to the data word.
Abstract: An asymmetric hashing system that hashes query and class labels onto the same space where queries can be hashed to the same binary codes as their labels. The assignment of the class labels to the hash space can be alternately optimized with the query hash function, resulting in an accurate system whose inference complexity that is sublinear to the number of classes. Queries such as image queries can be processed quickly and correctly.
Abstract: System and method for reducing power consumption and noise in a transmission system with an asymmetrically terminated transmission line. A preferred embodiment comprises encoding data words to reduce the number of times a given state appears in a code word. The preferred embodiment comprises counting the number of times a given state appears in a data word. If the count is greater than half of the total number of bits in the data word, then the data word is inverted and a weight bit can be set to the given state. If the count is less than (or equal to) half of the total number of bits, then the data word may be unchanged and the weight bit can be set to the inverse of the given state. The code word can be generated by appending the weight bit to the data word.
Abstract: The present invention relates to a method, a system and a computer-readable medium storing computer-executable components in connection with transfer of information data to a recipient. The invention is based on the idea that generation of random number data and the calculation of digital signatures are performed before information data is accessible to a digital pen. Since asymmetric encryption of data is a demanding operation for said digital pen to perform in terms of processing power, a lot of time can be saved if the generation of random number data and asymmetric encryption of said random number data is performed in advance, when the pen is in an idle, non-communicating mode, for example during battery loading of the pen or when the pen is lifted from the position-coded paper. This alleviates delay times when the pen is in its communicating mode.
Type:
Grant
Filed:
July 11, 2002
Date of Patent:
July 24, 2007
Assignee:
Anoto AB
Inventors:
Mads Dore Hansen, Joakim Sernbrant, Lars Romedahl, Mikael Thuvesholmen
Abstract: The present invention relates to a method, a system and a computer-readable medium storing computer-executable components in connection with transfer of information data to a recipient. The invention is based on the idea that generation of random number data and the calculation of digital signatures are performed before information data is accessible to a digital pen. Since asymmetric encryption of data is a demanding operation for said digital pen to perform in terms of processing power, a lot of time can be saved if the generation of random number data and asymmetric encryption of said random number data is performed in advance, when the pen is in an idle, non-communicating mode, for example during battery loading of the pen or when the pen is lifted from the position-coded paper. This alleviates delay times when the pen is in its communicating mode.
Type:
Application
Filed:
July 11, 2002
Publication date:
January 30, 2003
Inventors:
Mads Dore Hansen, Joakim Sernbrant, Lars Romedahl, Mikael Thuvesholmen
Abstract: In an arrangement of the disclosed systems, devices, and methods, a codeword encoded with a first number of check symbols is received and asymmetrically processed according to a second number of check symbols, where the second number of check symbols is less than the first number of check symbols, to produce an error locator polynomial and an error evaluator polynomial. A derivative of the error locator polynomial is produced by outputting a first polynomial term and a second polynomial term, wherein the second polynomial term is a constant. The derivative of the error locator polynomial is produced using a variable finite-field multiplier and without use of a divider.
Abstract: A downlink channel estimation method based on a co-prime array in asymmetric massive MIMO architecture is provided. First, an uplink and downlink asymmetric receiving and transmitting system model based on a co-prime array is established, and a deviation of the frequency domain direction caused by array broadband signals is observed; then, uplink receiving is performed to estimate an uplink channel, and channel parameters such as the number of paths, the angle of arrival and the path gain are recovered; and finally, a downlink channel is reconstructed based on the channel parameters recovered according to the uplink channel. By means of the high angular resolution of the co-prime array, the problem that a recovered uplink channel cannot be directly used for pre-coding of a downlink channel is solved.
Type:
Grant
Filed:
August 16, 2022
Date of Patent:
March 25, 2025
Assignee:
NANJING UNIVERSITY OF POSTS AND
TELECOMMUNICATIONS
Inventors:
Jun Zhang, Jiacheng Lu, Shu Cai, Hairong Wang, Wenjun Lv, Hongbo Zhu
Abstract: A downlink channel estimation method based on a co-prime array in asymmetric massive MIMO architecture is provided. First, an uplink and downlink asymmetric receiving and transmitting system model based on a co-prime array is established, and a deviation of the frequency domain direction caused by array broadband signals is observed; then, uplink receiving is performed to estimate an uplink channel, and channel parameters such as the number of paths, the angle of arrival and the path gain are recovered; and finally, a downlink channel is reconstructed based on the channel parameters recovered according to the uplink channel. By means of the high angular resolution of the co-prime array, the problem that a recovered uplink channel cannot be directly used for pre-coding of a downlink channel is solved.
Type:
Application
Filed:
August 16, 2022
Publication date:
October 31, 2024
Applicant:
NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS
Inventors:
Jun ZHANG, Jiacheng LU, Shu CAI, Hairong WANG, Wenjun LV, Hongbo ZHU
Abstract: A sub-band adaptive differential pulse code modulation/encoding apparatus includes means (102, 103, 104, 105) having a predetermined asymmetric impulse response for receiving an audio signal and band-dividing the received audio signal into a predetermined number of sub-bands, so as to obtain a plurality of band-divided sub-band audio signals, a plurality of quantization means (110, 111, 112, 113) for quantizing the band-divided sub-band audio signals with the predetermined number of sub-bands, and encoding means (115) for performing adaptive differential pulse code modulation/encoding of the quantized sub-band audio signals.
Abstract: Devices, systems, and methods for performance of an iterative decoder in a non-volatile memory are described. An example method includes receiving a noisy codeword that is based on a transmitted codeword generated from a low-density parity-check (LDPC) code, partitioning a maximum number of iterations of the iterative decoder into a plurality of stages, initializing a set of log likelihood ratios (LLRs) with symmetric LLRs, for each stage of the plurality of stages: performing a message passing algorithm, determining, at a last iteration of the current stage, a hard decision corresponding to a candidate version of the transmitted codeword, determining, based on the hard decision, a set of asymmetric LLRs, and assigning the set of asymmetric LLRs to the set of LLRs, and determining the candidate version of the transmitted codeword using the set of LLRs.
Type:
Grant
Filed:
September 30, 2022
Date of Patent:
January 23, 2024
Assignee:
SK HYNIX INC.
Inventors:
Meysam Asadi, Fan Zhang, Seyhan Karakulak
Abstract: A system and method for authenticating a user of a portable electronic device having a removable memory using asymmetric cryptography, the asymmetric cryptography requiring the use of a user'private key and public key. The method and system include storing the user'private key and public key on the portable electronic device. Thereafter, information including the user'personal identification number (PIN) is encrypted using the user'private key and public key, respectively, to create encrypted authentication information. The encrypted authentication information is then stored on a standard removable memory, such as a flash card. When the removable memory is subsequently inserted into the portable electronic device, the portable electronic device automatically decrypts the authentication information and prompts the user for a PIN code.
Abstract: A system and method for identifying the origin of photographic images and selecting photographic images according to the identified origin for inclusion in a set of photographic images employs a high contrast identifiable label disposable at one or more points in one or more sizes within the camera field of view for images of the label to be included in any photographic image. The label can be one of a plurality of different styles of each label. Each different label bears a unique identification code in the form of a decoder bull binary number. Each label also comprises an asymmetrical element. Photographic images are scanned to identify any labels. If labels are found, label images are adapted for size, flatness of face presentation and rotational orientation. The unique identification code is read as a sequence of binary digits provided by presence or absence of code elements.
Abstract: Multi-carrier point-to-multi-point CDMA system implementation reduces hardware changes in legacy single-carrier systems. The number of common downlink channels, such as timing/synchronization and paging channels, is reduced by designating an anchor carrier for transmitting these channels. Procedures for adding carriers and carrier acquisition are simplified through common carrier timing, signaling by the network to the user equipment (UE) of timing offsets and scrambling code selection, and other measures. Channel reuse is employed to minimize changes in asymmetric systems with different numbers of uplink and downlink carriers. Channel Quality Indicator (CQI) field is divided into multiple subfields to enable transmission of multiple CQIs and ACK/NACK indicators on one uplink carrier. Joint and separate scheduling schemes are shown for concurrent scheduling of a data stream transmission to a UE via multiple downlink carriers.
Type:
Grant
Filed:
April 5, 2006
Date of Patent:
June 14, 2011
Assignee:
QUALCOMM Incorporated
Inventors:
Durga Prasad Malladi, Serge D. Willenegger, Juan Montojo
Abstract: Multi-carrier point-to-multi-point CDMA system implementation reduces hardware changes in legacy single-carrier systems. The number of common downlink channels, such as timing/synchronization and paging channels, is reduced by designating an anchor carrier for transmitting these channels. Procedures for adding carriers and carrier acquisition are simplified through common carrier timing, signaling by the network to the user equipment (UE) of timing offsets and scrambling code selection, and other measures. Channel reuse is employed to minimize changes in asymmetric systems with different numbers of uplink and downlink carriers. Channel Quality Indicator (CQI) field is divided into multiple subfields to enable transmission of multiple CQIs and ACK/NACK indicators on one uplink carrier. Joint and separate scheduling schemes are shown for concurrent scheduling of a data stream transmission to a UE via multiple downlink carriers.
Type:
Application
Filed:
April 5, 2006
Publication date:
December 7, 2006
Inventors:
Durga Malladi, Serge Willenegger, Juan Montojo