The purpose of this study is to develop a cranial traction therapy program to help correct facial asymmetry of the hard tissues through the means of the treatment of soft tissues—a non-surgical therapeutic method for the correcting of facial asymmetry. We have formed a group of experts who have agreed to the study. In the primary survey, open questions were used. In the second survey, the results of the first survey were summarized and the degree of agreement was presented to the questions in each category. In the third survey, we conducted a statistical analysis of the degree of agreement on each item of question. All surveys also performed email. The distribution was calculated using the SPSS (ver.23.0) program, and the mean difference between the result and X² was calculated. The significance level was set to p<.05. Most of the questions attained a certain level of consensus by the experts (average of 4.0 or higher), it can be said that most are important and suitable questions. the results regarding the degree of importance for each of the points of evaluation made by the groups of experts in both the second and third stage of the cranial traction therapy program were verified using content validity ratio (CVR 77). The ratio for the cranial traction 13 points of evaluation was within the range of 0.40∼1.00, so the Delphi program for the cranial traction therapy verified that the content was valid.

This research highlights the importance of error-correcting codes in ensuring secure and efficient data transmission over noisy channels. It discusses the application of Convolutional codes and the Viterbi algorithm for error detecting and correcting in applications where the data rate is high and the error probability is relatively low. This research extends beyond previous studies by conducting a comparative analysis of Convolutional codes, the Viterbi algorithm, and alternative coding methods utilized in satellite communication systems, by evaluating their effectiveness and efficiency relative to other coding approaches like BCH, LDPC, and turbo codes. The evaluation encompasses key performance metrics including error correction capabilities, computational complexity, and robustness against various error types. Additionally, practical implementation factors such as power consumption, computational requirements, and compatibility with existing hardware are considered. The analysis sheds light on the advantages and disadvantages of each coding method, offering insights into why convolutional codes and the Viterbi algorithm are particularly suitable for GPS systems.

Tail-biting convolutional codes extend the classical zero-termination convolutional codes: Both encoding schemes force the equality of start and end states, but under the tail-biting each state is a valid termination. This paper proposes a machine-learning approach to improve the state-of-the-art decoding of tail-biting codes, focusing on the widely employed short length regime as in the LTE standard. This standard also includes a CRC code. First, we parameterize the circular Viterbi algorithm, a baseline decoder that exploits the circular nature of the underlying trellis. An ensemble combines multiple such weighted decoders, each decoder specializes in decoding words from a specific region of the channel words' distribution. A region corresponds to a subset of termination states; the ensemble covers the entire states space. A non-learnable gating satisfies two goals: it filters easily decoded words and mitigates the overhead of executing multiple weighted decoders. The CRC criterion is employed to choose only a subset of experts for decoding purpose. Our method achieves FER improvement of up to 0.75dB over the CVA in the waterfall region for multiple code lengths, adding negligible computational complexity compared to the circular Viterbi algorithm in high SNRs.

Iterative Stochastic decoding is an alternative to standard fixed-point decoding of Low-density parity check codes (LDPC) to reduce inter-node routing. In this paper, we propose a Flexible Field-Programmable Gate Array (FPGA)-Based Stochastic decoding (SD) hardware architecture for LDPC codes in the Fifth-Generation (5G) New Radio (NR) Standard that supports decoding of set of various code rates. This decoder’s runtime flexibility is desirable to switch a better performing code rate automatically based on the channel conditions without the extra time needed for reprogramming of FPGA. An offline design method is implemented to generate the hardware description language (HDL) code description of the decoder for the required code-rate set, which is further synthesized and integrated into the Xilinx Kintex-7 series FPGA board to determine the hardware resource utilisation and processing throughput. The Synopsys design tools were employed during both the simulation and synthesis stages, in combination with TSMC 65-nm CMOS standard cell technology, to facilitate comparative analysis. Compared with state-of-the-art designs, the proposed architecture reduces hardware utilization by up to 26% and achieved energy efficiency by 52%.

Managing sidelobe levels (SLLs) in metasurface-driven beam-steering antennas poses a significant challenge due to intrinsic factors leading to grating lobes. Our proposed method employs an equivalent model to optimize large periodic metasurfaces efficiently. This model predicts complete metasurface performance, accounting for mutual coupling between patches. We introduce an evolutionary optimization algorithm based on the Cross Entropy (CE) method to enhance PGM-based beam-steering antennas and suppress sidelobes. Two strategies were employed: first is to optimize the patch dimensions for a sidelobe-free pattern and the second is to maintain the PGM dimensions while optimizing feed array amplitudes. Both strategies effectively suppressed sidelobes, offering insights into the CE method's applicability and effectiveness for CPU-intensive electromagnetic optimization challenges. The proposed CE method variant retains its simplicity while improving monitoring capabilities, addressing this limitation. Smaller generations yield better improvements per evaluation