Apparatus and Method for Solving an N-Queen Problem

    公开(公告)号:US20240169014A1

    公开(公告)日:2024-05-23

    申请号:US18502316

    申请日:2023-11-06

    Inventor: Jun HEO Jinyoung HA

    CPC classification number: G06F17/11

    Abstract: The method for solving an N-queen problem includes: an initialization step of generating a quantum substitution matrix state which is a superposition of qubit states satisfying a row condition and a column condition of the N-queen problem; an Oracle step of performing an operation of inverting a phase of at least one entire correct answer state that satisfies a diagonal condition of the N-queen problem in the quantum substitution matrix state; an amplification step of amplifying an amplitude of at least one entire correct answer state of which the phase is inverted; amplifying the amplitude of at least one entire correct answer state to correspond to a predetermined value by performing the Oracle step and the amplification step repeatedly at a predetermined number of times; and acquiring one first correct answer state among at least one entire correct answer state based on observation of a qubit state.

    APPARATUS AND METHOD FOR DECODING LDPC CODE
    3.
    发明申请

    公开(公告)号:US20180041227A1

    公开(公告)日:2018-02-08

    申请号:US15667465

    申请日:2017-08-02

    Abstract: The present disclosure relates to a pre-5th-Generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4th-Generation (4G) communication system such as Long Term Evolution (LTE). Disclosed is an apparatus for performing an iteration decoding scheme for a Low Density Parity Check (LDPC) code. The apparatus includes a receiver configured to receive an encoded signal based on a parity matrix set for a plurality of variable nodes including a first variable node with a first degree and a second variable node with a second degree. The apparatus further includes a processor configured to determine at least one variable node based on a first threshold determined according to the first degree and a second threshold determined according to the second degree among the plurality of variable nodes and to generate decoded data from the signal based on the at least one determined variable node.

    METHOD AND APPARATUS FOR GENERATING QUANTUM ERROR CORRECTION CODE USING GRAPH STATE

    公开(公告)号:US20190199373A1

    公开(公告)日:2019-06-27

    申请号:US16309281

    申请日:2016-06-24

    Abstract: Provided is a quantum error correction code generating method using a graph state. According to the exemplary embodiment of the present invention, a quantum error correction code generating method using a graph state: includes: generating a graph state representing an adjacency relationship between a plurality of qubits including at least one entangled qubit (ebit); generating a first stabilizer generator which corresponds to the graph state and is configured by a plurality of stabilizers for detecting errors of the plurality of qubits; and generating at least one logical Z operator used for a phase flip operation of a codeword, at least one logical X operator used for a bit flip operation of a codeword, and a second stabilizer generator which is a sub set of the first stabilizer generator, based on the first stabilizer generator and the at least one entangled qubit.

    METHOD AND APPARATUS FOR DECIDING DECODING ORDER FOR SHUFFLED DECODING OF LDPC CODES

    公开(公告)号:US20190165812A1

    公开(公告)日:2019-05-30

    申请号:US16122020

    申请日:2018-09-05

    Abstract: The method for shuffled decoding of LDPC codes includes calculating check-variable mutual information which is mutual information of a message propagating from a plurality of check nodes to a plurality of variable nodes by a check-variable mutual information calculating unit, calculating variable-check mutual information which is mutual information of a message propagating from the plurality of variable nodes to the plurality of check nodes connected to the plurality of variable nodes based on the check-variable mutual information by a variable-check mutual information calculating unit, and Calculating the entire mutual information which is a sum of variable-check mutual information for each of the plurality of variable nodes and determines an operation order of a variable node having the largest entire mutual information among the plurality of variable nodes to be next, by an operation order determining unit.

    RELAY-BASED COMMUNICATION SYSTEM AND METHOD FOR SELECTING COMMUNICATION PATH
    10.
    发明申请
    RELAY-BASED COMMUNICATION SYSTEM AND METHOD FOR SELECTING COMMUNICATION PATH 审中-公开
    基于继电器的通信系统和选择通信路径的方法

    公开(公告)号:US20140087651A1

    公开(公告)日:2014-03-27

    申请号:US14092190

    申请日:2013-11-27

    Abstract: The present invention relates to a system and method for determining the optimal number of hops when transmitting information over a relay network. To this end, the present invention provides a method for determining a communication path through which at least one of a source node, a destination node, and at least one relay node between the source node and the destination node transmits information between the source node and the destination node in a relay network, the method comprising determining the optimal number of hops taking into account an interference signal and a noise signal in each relay node existing on a plurality of communication paths connectable between the source node and the destination node; and determining one communication path satisfying the determined optimal number of hops from among the plurality of communication paths.

    Abstract translation: 本发明涉及一种用于在通过中继网络传输信息时确定最佳跳数的系统和方法。 为此,本发明提供了一种用于确定通信路径的方法,通过该通信路径,源节点,目的地节点和源节点与目的地节点之间的至少一个中继节点中的至少一个在源节点和目的节点之间传送信息, 中继网络中的目的地节点,所述方法包括:在存在于可在源节点和目的地节点之间连接的多个通信路径上的每个中继节点中,考虑干扰信号和噪声信号,确定最优跳数; 以及从所述多个通信路径中确定满足确定的最佳跳数的一个通信路径。

Patent Agency Ranking