• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.304-308
• /
• 2009

This paper proposes a new concept of a signal constellation of the recently introduced half-symbol-rate-carrier phase-shift keying (HSRC-PSK) modulations for bandwidth-efficient high speed data communications. Since the HSRC-PSK modulations contain different symbol energies representing the same bit sequences due to the loss of orthogonality of their HSRC signals, it is very hard to represent the symbol using the conventional signal constellation. To resolve the problem, two different energies are assigned to represent one symbol for the HSRC offset quadrature phase shift keying (OQPSK) modulation. Similarly, the different energies exist to display the different symbol for HSRC minimum shift keying (MSK) modulation. With the proposed signal space representation, HSRC-PSK symbol can easily be shown with a two-dimensional scatter plot which provides helpful information of evaluating HSRC-PSK signal's quality.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.161-170
• /
• 2010

ELF, an abbreviation for Executable and Linkable Format, is the basic file format for shared libraries and executable files used in the Linux system, whereas 'Linker' copies the symbol information of static shared libraries into the symbol table in the target file generated by way of static linking. At this time, the symbol table keeps various pieces of debugging-related information including function names provided by the shared libraries, and it can be deleted to avoid debugging for security reasons by utilizing the fact that it does not directly affect the program execution. This paper proposes a method for restoring the symbol information of static shared libraries from the ELF object file in which the symbol table is deleted, and confirms that the symbol information is restored by conducting practical experiments.

• Journal of Information Technology Applications and Management
• /
• v.17 no.3
• /
• pp.83-97
• /
• 2010

The purpose of this study is to examine the impacts of media symbol variety on group performance in virtual teams. Symbol variety is defined as the number of ways in which information can be communicated and includes Daft and Lengel [1986]'s multiplicity of cues and language variety. According to media richness theory and media synchronicity theory, the use of media with high symbol variety is assumed to facilitate and promote communications among virtual team members. Therefore, it is expected that the media symbol variety is positively associated with group performance in virtual teams. Furthermore, online relationship building is expected to mediate the impacts of symbol variety on the performance. To confirm the suppositions, a controlled lab experiment was conducted with 60 undergraduate students as subjects. In the experimental virtual teams, subjects were allowed to communicate with other members using text-based messenger with emoticons. Subjects in the control virtual teams were allowed to communicate using only text-based messenger. The direct impact of symbol variety on group performance in virtual teams was found insignificant. However, the online relationship was found to completely mediate the positive impact of symbol variety on group performance. The implications and limitations of this study are also discussed for future research.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.213-218
• /
• 2007

Methods for symbol-by-symbol channel feedback and adaptation of symbol durations have been recently proposed. In this paper, we quantitatively analyze the gain in error-constrained data throughput due to such an extremely rapid adaptation of symbol durations to fast-time-varying channels. The results show that a symbol-by-symbol adaptation can achieve a throughput gain by orders of magnitude over a frame-by-frame adaptation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2660-2669
• /
• 1996

In this paper, it is called nonlinear-symbol CPFSK(NCPFSK) which is modulated by the nonlinear function of information carrying phase function within all symbol interval produce time invariant trellis structure. In general, the bit error probability performance of CPFSK modultion scheme within given signal constellation is determined from the number of memory elementsof continuous phase encoder, i.e. number of state. In this paper the number of state of analyticall designed NCPFSK is time invariant. And the nonlinear symbol mapping function of the proposed moudlation produces the nonlinear symbol andthe phase state of the modulation for updating the phase function of NCPFSK. It si shown in this paper nonlinear symbol CPFSK with multiple TCM to make further improvements in d$^{2}$, and analyzed BER performance in AWGN channel envioronments.hannel envioronments.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.29-35
• /
• 2014

The formula contains up between the text and the structural information, as well as their mathematical symbols. Research on-line or off-line recognition formula is underway actively used in various fields, and various forms of the equation are implemented recognition system. Although many documents are included in the various formulas, it is not easy to enter a formula into the computer. Recognition of the expression is divided into two processes of symbol recognition and structural analysis. After analyzing the location information of each character is specified to recognize the effective area after each symbol, and to the structure analysis based on the proximity between the characters is recognized as an independent single formula. Furthermore, analyzing the relationship between the front and back each time a combination of the position relationship between each symbol, and then to add the symbol which was able to easily update the structure of the entire formula. In this paper, by using a scanner to scan the book formula was used to interpret the meaning of the recognized symbol has a relative size and location information of the expression symbol. An algorithm to remove the formulas for calculation of the number of formula is present at the same time is proposed. Using the proposed algorithms to scan the books in the formula in order to evaluate the performance verification as 100% separation and showed the recognition rate equation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.755-757
• /
• 2009

Since the research of advanced terrestrial digital multimedia broadcasting system is still in progress, and in our previous paper, in which we introduced how to combine one conventional transmitted symbol with two additional bits to form a new symbol transmission, the bit error performance of LP bits is not realizable, because even we implemented the turbo code to protect the LP bits transmission, to obtain a certain good bit error probability, the value of $E_b/N_0$ cost highly. In this paper, we modified the composition of low-priority symbol and high-priority symbol, and through the system presented in previous paper we get a better simulation result of the LP symbol transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1554-1566
• /
• 1996

In this paper, a new symbol timing algorithm for a magnetic recording system as HDD, is proposed. Above all, the Lorentzian channel model applied, the distortion and the attenuation problems of playback signals at high speed and storage density were considered. The structure and the operation of popular data detectors for HDD were understood, and the adopted symbol timing algorithm were profoundly analyzed. On the basis of these understanding and analysis, a new symbol timing algorithm for high density HDD was proposed, and the performance evaluation of this proposed algorithm was done.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.6-11
• /
• 2008

From a periodic sequence, we can obtain new sequences with a longer period by r-symbol insertion to each period. In this paper we review previous results on the linear complexity of periodic sequences obtained by r-symbol insertion. We derive the distribution of the linear complexity of 1-symbol insertion sequences obtained from m-sequences over GF(p), and prove some relationship between their linear complexity and the insertion position. Then, we analyze the k-error linear complexity of the 1-symbol insertion sequences from binary m-sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.66-78
• /
• 2002

In this paper, we propose a new symbol offset estimation technique for an orthogonal frequency-division multiplexing (OFDM)-based wireless LAN. When both inter-symbol interference (ISI) and inter-channel interference (ICI) do not exist in an OFDM symbol, symbol offsets cause circular shifts in the estimated channel impulse response (CIR) by the amount of symbol offset. Also, the power delay profile of a typical multipath wireless channel can be modeled by exponentially decaying function, and most energy of multipath channel is concentrated at the beginning part of the CIR. Based on these properties, the proposed symbol offset estimation technique estimates the CIR, which is circularly shifted by the amount of symbol offset, and then calculates the partial mean power from the estimated impulse response by using a moving window with a finite length. And, symbol offset can be estimated from the index of a moving window having the maximal partial mean power. The proposed technique can reduce noise effect in the process of the CIR estimation, and remove ISI and ICI using repetitive training symbol structure in time-domain for minimum training overhead. The performances of the proposed symbol offset estimation technique in typical indoor channels are demonstrated by computer simulation.