• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.1
• /
• pp.51-54
• /
• 2003

The z-transform method is a basic mathematical tool in analyzing and designing digital signal processing systems for discrete input and output signals. There are may cases where the output signal is in the form of a discrete convolution sum of an input function and a designed digital processing algorithm function. It is well known that the z-transform of the convolution sum becomes the product of the two z-transforms of the input function and the digital processing function, whose proofs require the causality of the digital signal processing function in the almost all the available references. However, not all of the convolution sum functions are based on the causality. Many digital signal processing systems such as image processing system may depend not on the time information but on the spatial information, which has nothing to do with causality requirement. Thus, the application of the causality-based z-transform theorem on the convolution sum cannot be used without difficulty in this case. This paper proves the z-transform theorem on the discrete convolution sum without causality requirement, and make it possible for the theorem to be used in analysis and desing for any cases.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.211-222
• /
• 1997

In this paper we present a probabilistic approach for the estimation of realistic error bounds appearing in the execution of basic algebraic floating point operations. Experimental results are carried out for the extended product the extended sum the inner product of random normalised numbers the product of random normalised ma-trices and the solution of lower triangular systems The ordinary and probabilistic bounds are calculated for all the above processes and gen-erally in all the executed examples the probabilistic bounds are much more realistic.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.279-282
• /
• 2002

Here we introduce so called Reference code-weighted sum of all PN codes used in the system-. We do inner product operation between received PN code and Reference code rather than locally generated PN code in the receiver. Acquisition process can be accomplished by only one inner product during full period of PN code. It's essential innovation against present method which can be viewed successive hypothesis test by inner product for entire candidate PH codes set. Well -defined decision region makes it possible. We suggest the. criterion fur designing the decision region and find a condition for weight (coefficient) of Reference code.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.225-233
• /
• 1996

It is shown that for any space A, the cofibration X \to X \Join \sumA \to \sumA \wedge X$ decomposable when X is a co-T-space. It is also obtain necessary and sufficient conditions for the cofibration $X \to X \Join A \to A \wedge X$ is trivial, in the sense of cofibre homotopy type.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.359-380
• /
• 2021

The main purpose and motivation of this work is to investigate and provide some new results for coefficients derived from eta quotients related to 3. The result of this paper involve some restricted divisor numbers and their convolution sums. Also, our results give relation between the coefficients derived from infinite product, infinite sum and the convolution sum of restricted divisor functions.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.507-552
• /
• 2016

For a complex number q and a divisor function ${\sigma}_1(n)$ we define $$C(q):=q{\prod_{n=1}^{\infty}}(1-q^n)^{16}(1-q^{2n})^4,\\D(q):=q^2{\prod_{n=1}^{\infty}}(1-q^n)^8(1-q^{2n})^4(1-q^{4n})^8,\\L(q):=1-24{\sum_{n=1}^{\infty}}{\sigma}_1(n)q^n$$ moreover we obtain the number of representations of $n{\in}{\mathbb{N}}$ as sum of 24 squares, which are possible for us to deduce $L(q^4)C(q)$ and $L(q^4)D(q)$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.56-64
• /
• 1992

The sum-of-product type MVL (Multiple-valued logic) functions can be directly transformed into the exclusive-sum-of-literal-product(ESOLP) type MVL functions with a substitution of the OR operator with the exclusive-OR(XOR) operator. This paper presents an algorithm that can reduce the number of minterms for the purpose of minimizing the hardware size and the complexity of the circuit in the realization of ESOLP-type MVL functions. In Boolean algebra, the joinable true minterms can form the cube, and if some cubes form a cube-chain with adjacent cubes by the insertion of false cubes(or, false minterms), then the created cube-chain can become a large cube which includes previous cubes. As a result of the cube grouping, the number of minterms can be reduced artificially. Since ESOLP-type MVL functions take the MIN/XOR structure, a XOR circuit and a four-valued MIN/XOR dynamic-CMOS PLA circuit is designed for the realization of the minimized functions, and PSPICE simulation results have been also presented for the validation of the proposed algorithm.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.54-60
• /
• 2015

The use of serial concatenated codes is an effective technique for alleviating the error floor phenomenon of low-density parity-check (LDPC) codes. An enhanced sum-product algorithm (SPA) for LDPC codes, which is suitable for serial concatenated codes, is proposed in this paper. The proposed algorithm minimizes the number of errors by using the failed check nodes (FCNs) in LDPC decoding. Hence, the error-correcting capability of the serial concatenated code can be improved. The number of FCNs is simply obtained by the syndrome test, which is performed during the SPA. Hence, the decoding procedure of the proposed algorithm is similar to that of the conventional algorithm. The error performance of the proposed algorithm is analyzed and compared with that of the conventional algorithm. As a result, a gain of 1.4 dB can be obtained by the proposed algorithm at a bit error rate of $10^{-8}$. In addition, the error performance of the proposed algorithm with just 30 iterations is shown to be superior to that of the conventional algorithm with 100 iterations.

• The Pure and Applied Mathematics
• /
• v.26 no.4
• /
• pp.315-353
• /
• 2019

Orders and types of entire and meromorphic functions have been actively investigated by many authors. In the present paper, we aim at investigating some basic properties in connection with sum and product of relative (p, q)-𝜑 order, relative (p, q)-𝜑 type, and relative (p, q)-𝜑 weak type of meromorphic functions with respect to entire functions where p, q are any two positive integers and 𝜑 : [0, +∞) → (0, +∞) is a non-decreasing unbounded function.

• The Korean Journal of Applied Statistics
• /
• v.22 no.1
• /
• pp.171-179
• /
• 2009

In this paper we studied the effective approximations to the distribution of the sum of products of normal variables. Based on the saddlepoint approximations to the quadratic forms, the suggested approximations are very accurate and easy to use. Applications to the FSK (Frequency Shift Keying) communication are also considered.