• Title/Summary/Keyword: Multiple Solution

Search Result 1,458, Processing Time 0.025 seconds

Extended-list SQRD-based Decoder for Improving BER Performance in V-BLAST Systems (V-BLAST 시스템에서의 BER 성능 향상을 위한 Extended-list SQRD-based Decoder)

  • PHAM Van-Su;LE Minh-Tuan;YOON Giwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1452-1457
    • /
    • 2005
  • In the QR Decomposition-based (QRD) decoding class, the system performance is sensitive to the error propagation. Thus, it is critical to correctly decode the previous layers. One apprach to desensitize the error propagation is to propose the optimal decoding order of layers. In this wort we propose a new extended-list Soled QRD-based (SQRD) decoding approach. In the proposed decoding scheme, the solution of the few first layers is extended as the list of promising possible solutions. By doing so, the diversity of the lowest layer is increased. As a result, the system performance is less sensitive to the error propagation than its counterparts. The proposed approach is verified by the computer simulation results.

Feedback Semi-Definite Relaxation for near-Maximum Likelihood Detection in MIMO Systems (MIMO 시스템에서 최적 검출 기법을 위한 궤환 Semi-Definite Relaxation 검출기)

  • Park, Su-Bin;Lee, Dong-Jin;Byun, Youn-Shik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1082-1087
    • /
    • 2008
  • Maximum Likelihood (ML) detection is well known to exhibit better bit-error-rate (BER) than many other detectors for multiple-input multiple-output (MIMO) channel. However, ML detection has been shown a difficult problem due to its NP-hard problem. It means that there is no known algorithm which can find the optimal solution in polynomial-time. In this paper, Semi-Definite relaxation (SDR) is iteratively applied to ML detection problem. The probability distribution can be obtained by survival eigenvector out of the dominant eigenvalue term of the optimal solution. The probability distribution which is yielded by SDR is recurred to the received signal. Our approach can reach to nearly ML performance.

Experimental and Numerical Study on Flow Characteristics of a Common Exhaust System for Multiple SOFCs (SOFC용 복합 배기 시스템 유동 특성에 관한 실험 및 수치해석적 연구)

  • DAEWOONG JUNG;JONGHYUK YOON;HYOUNGWOON SONG
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.34 no.6
    • /
    • pp.657-666
    • /
    • 2023
  • In this study, experiments and numerical analysis were conducted to investigate the exhaust gas flow in a common exhaust system of multiple solid oxide fuel cells. The system was fabricated based on KGS code and operated within a pressure range of 0.12 kPa, with flow rates ranging from 79.1 to 103.4 L/min. Numerical modeling was validated with a mean absolute error of 3.8% for pressure results. The study assessed the impact of changes in area ratio and emergency stops on pressure distribution, velocity vectors, and wall shear stress. The findings revealed no significant factors causing high differential pressure or backflow.

Energy-efficient semi-supervised learning framework for subchannel allocation in non-orthogonal multiple access systems

  • S. Devipriya;J. Martin Leo Manickam;B. Victoria Jancee
    • ETRI Journal
    • /
    • v.45 no.6
    • /
    • pp.963-973
    • /
    • 2023
  • Non-orthogonal multiple access (NOMA) is considered a key candidate technology for next-generation wireless communication systems due to its high spectral efficiency and massive connectivity. Incorporating the concepts of multiple-input-multiple-output (MIMO) into NOMA can further improve the system efficiency, but the hardware complexity increases. This study develops an energy-efficient (EE) subchannel assignment framework for MIMO-NOMA systems under the quality-of-service and interference constraints. This framework handles an energy-efficient co-training-based semi-supervised learning (EE-CSL) algorithm, which utilizes a small portion of existing labeled data generated by numerical iterative algorithms for training. To improve the learning performance of the proposed EE-CSL, initial assignment is performed by a many-to-one matching (MOM) algorithm. The MOM algorithm helps achieve a low complex solution. Simulation results illustrate that a lower computational complexity of the EE-CSL algorithm helps significantly minimize the energy consumption in a network. Furthermore, the sum rate of NOMA outperforms conventional orthogonal multiple access.

A study about the Leikin's method of measuring mathematical creativity (Leikin의 수학적 창의성 측정 방법에 대한 고찰)

  • Ha, Su Hyun;Lee, Kwangho
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.18 no.1
    • /
    • pp.83-103
    • /
    • 2014
  • The purpose of this paper is to find a method of measuring mathematical creativity reasonably. In the pursuit of this purpose, we designed four multiple solution tasks that consist of two kinds of open tasks; 'tasks with open solutions' and 'tasks with open answers'. We collected data by conducting an interview with a gifted fifth grade student using the four multiple solution tasks we designed and analyzed mathematical creativity of the student using Leikin's model(2009). Research results show that the mathematical creativity scores of two students who suggest the same solutions in a different order may vary. The more solutions a student suggests, the better score he/she gets. And fluency has a stronger influence on mathematical creativity than flexibility or originality of an idea. Leikin's model does not consider the usefulness nor the elaboration of an idea. Leikin's model is very dependent on the tasks and the mathematical creativity score also varies with each marker.

  • PDF

PERIODIC SOLUTIONS FOR DUFFING TYPE p-LAPLACIAN EQUATION WITH MULTIPLE DEVIATING ARGUMENTS

  • Jiang, Ani
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.1_2
    • /
    • pp.27-34
    • /
    • 2013
  • In this paper, we consider the Duffing type p-Laplacian equation with multiple deviating arguments of the form $$({\varphi}_p(x^{\prime}(t)))^{\prime}+Cx^{\prime}(t)+go(t,x(t))+\sum_{k=1}^ngk(t,x(t-{\tau}_k(t)))=e(t)$$. By using the coincidence degree theory, we establish new results on the existence and uniqueness of periodic solutions for the above equation. Moreover, an example is given to illustrate the effectiveness of our results.

Free vibration of primary-secondary structures with multiple connections (다중 지지된 주-부 구조물의 자유진동)

  • 민경원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1991.10a
    • /
    • pp.63-68
    • /
    • 1991
  • The frequency window method has been extended to include strong coupling and multiple connections between the primary structure and the secondary structures. The rational polynomial expansion of the eigenvalue problem and the analytical methods for its solution are novel and distinguish this work from other eigenvalue analysis methods. The key results are the identification of parameters which quantify the resonance and coupling characteristics; the derivation of analytical dosed-form expressions describing the fundamental modal properties of the frequency windows; and the development of an iterative procedure which yields accurate convergent results for strongly-coupled primary-secondary structures.

  • PDF

MULTIPLE SOLUTIONS FOR A SUSPENDING BEAM EQUATION AND THE GEOMETRY OF THE MAPPING

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.17 no.2
    • /
    • pp.211-218
    • /
    • 2009
  • We investigate the multiple solutions for a suspending beam equation with jumping nonlinearity crossing three eigenvalues, with Dirichlet boundary condition and periodic condition. We show the existence of at least six nontrivial periodic solutions for the equation by using the finite dimensional reduction method and the geometry of the mapping.

  • PDF

Frequency Reassignment Problem in Code Division Multiple Access Networks

  • Han Jung-Hee
    • Management Science and Financial Engineering
    • /
    • v.12 no.1
    • /
    • pp.127-142
    • /
    • 2006
  • In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.