Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update CRCAlgorithm.java

Browse Source
This commit is contained in:
Libin Yang 2019-02-17 20:56:47 +08:00 committed by GitHub
parent 31bf10f29f
commit d434e4a4f1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 67 additions and 68 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

83
Others/CRCAlgorithm.java
View File

@ -1,11 +1,10 @@
package crcalgorithm;
package Others;
import java.util.ArrayList;
import java.util.Random;
import java.util.concurrent.ThreadLocalRandom;
/**
*
* @author dimgrichr
*/
public class CRCAlgorithm {
@ -37,17 +36,18 @@ public class CRCAlgorithm {
* The algorithm's main constructor.
* The most significant variables, used in the algorithm,
* are set in their initial values.
*
* @param str The binary number P, in a string form, which is used by the CRC algorithm
* @param size The size of every transmitted message
* @param ber The Bit Error Rate
*/
public CRCAlgorithm(String str, int size, double ber){
messageChanged=false;
public CRCAlgorithm(String str, int size, double ber) {
messageChanged = false;
message = new ArrayList<>();
messSize = size;
dividedMessage = new ArrayList<>();
p = new ArrayList<>();
for(int i=0;i<str.length();i++){
for (int i = 0; i < str.length(); i++) {
p.add(Character.getNumericValue(str.charAt(i)));
}
randomGenerator = new Random();
@ -61,33 +61,37 @@ public class CRCAlgorithm {
/**
* Returns the counter wrongMess
*
* @return wrongMess, the number of Wrong Messages
*/
public int getWrongMess(){
public int getWrongMess() {
return wrongMess;
}
/**
* Returns the counter wrongMessCaught
*
* @return wrongMessCaught, the number of wrong messages, which are caught by the CRC algoriithm
*/
public int getWrongMessCaught(){
public int getWrongMessCaught() {
return wrongMessCaught;
}
/**
* Returns the counter wrongMessNotCaught
*
* @return wrongMessNotCaught, the number of wrong messages, which are not caught by the CRC algorithm
*/
public int getWrongMessNotCaught(){
public int getWrongMessNotCaught() {
return wrongMessNotCaught;
}
/**
* Returns the counter correctMess
*
* @return correctMess, the number of the Correct Messages
*/
public int getCorrectMess(){
public int getCorrectMess() {
return correctMess;
}
@ -96,7 +100,7 @@ public class CRCAlgorithm {
* so that it can be re-used, in order not to waste too much memory and time,
* by creating new objects.
*/
public void refactor(){
public void refactor() {
messageChanged = false;
message = new ArrayList<>();
dividedMessage = new ArrayList<>();
@ -106,9 +110,9 @@ public class CRCAlgorithm {
* Random messages, consisted of 0's and 1's,
* are generated, so that they can later be transmitted
*/
public void generateRandomMess(){
for(int i=0;i<messSize;i++){
int x = ThreadLocalRandom.current().nextInt(0,2);
public void generateRandomMess() {
for (int i = 0; i < messSize; i++) {
int x = ThreadLocalRandom.current().nextInt(0, 2);
message.add(x);
}
}
@ -120,51 +124,48 @@ public class CRCAlgorithm {
* If it does, the message is considered to be wrong by the receiver,so the variable wrongMessCaught changes.
* If it does not, it is accepted, so one of the variables correctMess, wrongMessNotCaught, changes.
* If check == false, the diviided Message is added at the end of the ArrayList<integer> message.
*
* @param check the variable used to determine, if the message is going to be checked from the receiver
* if true, it is checked
* otherwise, it is not
*/
public void divideMessageWithP(boolean check){
public void divideMessageWithP(boolean check) {
ArrayList<Integer> x = new ArrayList<>();
ArrayList<Integer> k = (ArrayList<Integer>) message.clone();
if(!check){
for(int i=0;i<p.size()-1;i++){
if (!check) {
for (int i = 0; i < p.size() - 1; i++) {
k.add(0);
}
}
while(!k.isEmpty()){
while(x.size()<p.size() && !k.isEmpty()){
while (!k.isEmpty()) {
while (x.size() < p.size() && !k.isEmpty()) {
x.add(k.get(0));
k.remove(0);
}
if(x.size()==p.size()){
for(int i=0;i<p.size();i++){
if(x.get(i)==p.get(i)){
if (x.size() == p.size()) {
for (int i = 0; i < p.size(); i++) {
if (x.get(i) == p.get(i)) {
x.set(i, 0);
}
else{
} else {
x.set(i, 1);
}
}
for(int i=0;i<x.size() && x.get(i)!=1;i++){
for (int i = 0; i < x.size() && x.get(i) != 1; i++) {
x.remove(0);
}
}
}
dividedMessage = (ArrayList<Integer>) x.clone();
if(!check){
for(int z:dividedMessage){
if (!check) {
for (int z : dividedMessage) {
message.add(z);
}
}
else{
if(dividedMessage.contains(1) && messageChanged){
} else {
if (dividedMessage.contains(1) && messageChanged) {
wrongMessCaught++;
}
else if(!dividedMessage.contains(1) && messageChanged){
} else if (!dividedMessage.contains(1) && messageChanged) {
wrongMessNotCaught++;
}
else if(!messageChanged){
} else if (!messageChanged) {
correctMess++;
}
}
@ -180,25 +181,23 @@ public class CRCAlgorithm {
* Based on these changes. the boolean variable messageChanged, gets the value:
* true, or false.
*/
public void changeMess(){
for(int y : message){
public void changeMess() {
for (int y : message) {
double x = randomGenerator.nextDouble();
while(x<0.0000 || x>1.00000){
while (x < 0.0000 || x > 1.00000) {
x = randomGenerator.nextDouble();
}
if(x<ber){
if (x < ber) {
messageChanged = true;
if(y == 1){
if (y == 1) {
message.set(message.indexOf(y), 0);
}
else{
} else {
message.set(message.indexOf(y), 1);
}
}
}
if(messageChanged){
if (messageChanged) {
wrongMess++;
}
}
}