• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.2
• /
• pp.182-191
• /
• 2001

The paper describes the improvement on concurrent subspace optimization(CSSO) via automatic differentiation. CSSO is an efficient strategy to coupled multidisciplinary design optimization(MDO), wherein the original design problem is non-hierarchically decomposed into a set of smaller, more tractable subspaces. Key elements in CSSO are consisted of global sensitivity equation, subspace optimization, optimum sensitivity analysis, and coordination optimization problem that require frequent use of 1st order derivatives to obtain design sensitivity information. The current version of CSSO adopts automatic differentiation scheme to provide a robust sensitivity solution. Automatic differentiation has numerical effectiveness over finite difference schemes tat require the perturbed finite step size in design variable. ADIFOR(Automatic Differentiation In FORtran) is employed to evaluate sensitivities in the present work. The use of exact function derivatives facilitates to enhance the numerical accuracy during the iterative design process. The paper discusses how much the automatic differentiation based approach contributes design performance, compared with traditional all-in-one(non-decomposed) and finite difference based approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1966-1973
• /
• 1999

In this paper, we introduce the concept of a HAPS(High Altitude Platform Station) system which is expected to be a next generation communication system and suggest several error correcting codes to provide high quality services. Since a HAPS system encounters serious signal attenuation due to rain and scattering in the air, concatenated codes which have a high coding gain is considered to be a proper error correcting method. In this paper, we provide performance analyses result of two candidate coding schemes for a HAPS. The first one is a conventional concatenated coding scheme, and the second one is a iterative decoding method known as Turbo Codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.10
• /
• pp.585-592
• /
• 2014

It is well known that serial belief propagation (BP) decoding for low-density parity-check (LDPC) codes achieves faster convergence without any increase of decoding complexity per iteration and bit error rate (BER) performance loss than standard parallel BP (PBP) decoding. Serial BP (SBP) decoding, such as horizontal SBP (H-SBP) decoding or vertical SBP (V-SBP) decoding, updates check nodes or variable nodes faster than standard PBP decoding within a single iteration. In this paper, we propose combined horizontal-vertical SBP (CHV-SBP) decoding. By the same reasoning, CHV-SBP decoding updates check nodes or variable nodes faster than SBP decoding within a serialized step in an iteration. CHV-SBP decoding achieves faster convergence than H-SBP or V-SBP decoding. We compare these decoding schemes in details. We also show in simulations that the convergence rate, in iterations, for CHV-SBP decoding is about $\frac{1}{6}$ of that for standard PBP decoding, while the convergence rate for SBP decoding is about $\frac{1}{2}$ of that for standard PBP decoding. In simulations, we use recently proposed generalized LDPC (GLDPC) codes with binary cyclic codes (BCC).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.12
• /
• pp.1283-1291
• /
• 2003

Nonuniform transmission lines(NTLs) with the desired frequency response can be realized by synthesizing the potential from the coupled mode Zakharov-Shabat(ZS) equation in the one-dimensional inverse scattering problem. In this study, an efficient synthesis method using the ZS equations is presented for NTLs with arbitrarily specified reflection coefficients which take the restricted potential. This method lessens the line length which plague conventional design schemes using specific windows for reflection coefficients. Furthermore solving the ZS inverse transform problem is simplified by adopting the successive approach instead of the conventional iterative method. The proposed method is compared with the conventional method using specific windows by applying to design of dispersive NTL filters, and verified by two-port analysis through the chain matrix.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.478-481
• /
• 2000

In this paper, we propose a joint coding system for still images using source coding and powerful error correcting code schemes. Our system comprises an LVQ (lattice vector quantization) source coding for wavelet transformed images and turbo coding for channel coding. The parameters of the image encoder and channel encoder have been optimized for an n-D (dimension) cubic lattice (D$_{n}$, Z$_{n}$), parallel concatenation fur two simple RSC (recursive systematic convolutional code) and an interleaver. For decoding the received image in the case of the AWGN (additive white gaussian noise) channel, we used an iterative joint source-channel decoding algorithm for a SISO (soft-input soft-output) MAP (maximum a posteriori) module. The performance of transmission system has been evaluated in the PSNR, BER and iteration times. A very small degradation of the PSNR and an improvement in BER were compared to a system without joint source-channel decoding at the input of the receiver.ver.

• Nuclear Engineering and Technology
• /
• v.28 no.3
• /
• pp.311-319
• /
• 1996

We reconstruct the assembly pinwise flux using several types of boundary conditions and confirm that the reconstructed fluxes are the same with the reference flux if the boundary condition is exact. We test EPRI-9R benchmark problem with four boundary conditions, such as Dirichlet boundary condition, Neumann boundary condition, homogeneous mixed boundary condition (albedo type), and inhomogeneous mixed boundary condition. We also test reconstruction of the pinwise flux from nodal values, specifically from the AFEN [1, 2] results. From the nodal flux distribution we obtain surface flux and surface current distributions, which can be used to construct various types of boundary conditions. The result show that the Neumann boundary condition cannot be used for iterative schemes because of its ill-conditioning problem and that the other three boundary conditions give similar accuracy. The Dirichlet boundary condition requires the shortest computing time. The inhomogeneous mixed boundary condition requires only slightly longer computing time than the Dirichlet boundary condition, so that it could also be an alternative. In contrast to the fixed-source type problem resulting from the Dirichlet, Neumann, inhomogeneous mixed boundary conditions, the homogeneous mixed boundary condition constitutes an eigenvalue problem and requires longest computing time among the three (Dirichlet, inhomogeneous mixed, homogeneous mixed) boundary condition problems.

• ETRI Journal
• /
• v.41 no.5
• /
• pp.626-636
• /
• 2019

A novel algorithm for joint user selection and optimal power allocation for Stackelberg game-based revenue maximization in a downlink non-orthogonal multiple access (NOMA) network is proposed in this study. The condition for the existence of optimal solution is derived by assuming perfect channel state information (CSI) at the transmitter. The Lagrange multiplier method is used to convert the revenue maximization problem into a set of quadratic equations that are reduced to a regular chain of expressions. The optimal solution is obtained via a univariate iterative procedure. A simple algorithm for joint optimal user selection and power calculation is presented and exhibits extremely low complexity. Furthermore, an outage analysis is presented to evaluate the performance degradation when perfect CSI is not available. The simulation results indicate that at 5-dB signal-to-noise ratio (SNR), revenue of the base station improves by at least 15.2% for the proposed algorithm when compared to suboptimal schemes. Other performance metrics of NOMA, such as individual user-rates, fairness index, and outage probability, approach near-optimal values at moderate to high SNRs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2204-2224
• /
• 2021

This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel. To enhance security of communication link, the artificial noise (AN) is generated at transmitter. We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers. The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs). The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly. To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP). Additionally, the secrecy rate maximization is explored for fixed total transmit power. To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA). The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

• Journal of Advanced Navigation Technology
• /
• v.16 no.6
• /
• pp.988-996
• /
• 2012

Assuming perfect channel state information (CSI), the conventional interference alignment (IA) algorithm in the uplink cellular system suppresses inter-cell interference (ICI) by aligning ICI to a randomly selected reference vector. However, IA in practice relies on limited feedback between base stations and users, resulting in residual ICI. In this paper, we propose the optimization of the reference vector that minimizes the upper-bound of residual ICI power. Secondly, the iterative IA that designs the direction of transmit and receive filter is proposed to minimize the residual ICI as well as maximize the desired signals. Moreover, we propose the user scheduling method combined with proposed IA schemes which provides the multiuser diversity gain in multi-cell environments. Finally, the performance gain of the proposed IA algorithms compared with the existing IA are analyzed and demonstrated by simulation results.